Filters








17,382 Hits in 3.1 sec

Adversarial contention resolution for simple channels

Michael A. Bender, Martin Farach-Colton, Simai He, Bradley C. Kuszmaul, Charles E. Leiserson
2005 Proceedings of the 17th annual ACM symposium on Parallelism in algorithms and architectures - SPAA'05  
This paper analyzes the worst-case performance of randomized backoff on simple multiple-access channels. Most previous analysis of backoff has assumed a statistical arrival model.  ...  In the adversarial-queuing model, we present the following stability and instability results for exponential backoff and loglogiterated backoff.  ...  Simple multipleaccess channels are useful not only for understanding the shared properties of many conflict resolution systems, but also for exactly modeling some of these situations.  ... 
doi:10.1145/1073970.1074023 dblp:conf/spaa/BenderFHKL05 fatcat:2eclzzmuyvhubo5g7hx5cexiw4

Robust and Optimal Contention Resolution without Collision Detection

Yonggang Jiang, Chaodong Zheng
2022 Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures  
Contention resolution on a multiple-access communication channel is a classical problem in distributed and parallel computing.  ...  The separation on time complexity suggests, for robust contention resolution without collision detection, "batch" instances (that is,  ...  In this paper, we only consider "sending complexity" and assume channel feedback is provided for free. This assumption is used in many works studying contention resolution.  ... 
doi:10.1145/3490148.3538592 fatcat:cgyafspomrabfm5ulo6zebs6tq

Simple Contention Resolution via Multiplicative Weight Updates

Yi-Jun Chang, Wenyu Jin, Seth Pettie, Michael Wagner
2018 ACM-SIAM Symposium on Discrete Algorithms  
We prove that a simple strategy suffices to achieve a channel utilization rate of 1/e − O( ), for any > 0.  ...  We consider the classic contention resolution problem, in which devices conspire to share some common resource, for which they each need temporary and exclusive access.  ...  S O S A 2 0 1 9 16:12 Simple Contention Resolution via Multiplicative Weight Updates In other words, for infinitely many time slots, the channel utilization is optimal (up to an additive −3 ).  ... 
doi:10.4230/oasics.sosa.2019.16 dblp:conf/soda/ChangJP19 fatcat:u5jhxxxxxvcsfa2r3w5lg3clm4

Robust and Optimal Contention Resolution without Collision Detection [article]

Yonggang Jiang, Chaodong Zheng
2021 arXiv   pre-print
Specifically, we develop a new randomized algorithm for robust contention resolution without collision detection. Lower bounds show that it has both optimal time and energy complexity.  ...  The separation on time complexity suggests for robust contention resolution without collision detection, "batch" instances (nodes start simultaneously) are inherently easier than "scattered" ones (nodes  ...  We design two new randomized algorithms for robust contention resolution, when collision detection is not available.  ... 
arXiv:2111.06650v1 fatcat:cdx4p4qt3vaubd6vqoayungwky

TextureGAN: Controlling Deep Image Synthesis with Texture Patches [article]

Wenqi Xian, Patsorn Sangkloy, Varun Agrawal, Amit Raj, Jingwan Lu, Chen Fang, Fisher Yu, James Hays
2018 arXiv   pre-print
To achieve this, we develop a local texture loss in addition to adversarial and content loss to train the generative network.  ...  We convert the groundtruth images to Lab, enforce the content, texture and adversarial losses only on the L channel, and enforce a separate color loss on the ab channels.  ...  The five channels include one channel for the binary sketch, two channels for the texture (intensities and binary location masks), and two channels for the color controls.  ... 
arXiv:1706.02823v3 fatcat:yzwuihw2r5he5hss3jnyos3kma

Super-Resolved Image Perceptual Quality Improvement via Multi-Feature Discriminators [article]

Xuan Zhu, Yue Cheng, Jinye Peng, Rongzhi Wang, Mingnan Le, Xin Liu
2019 arXiv   pre-print
Generative adversarial network (GAN) for image super-resolution (SR) has attracted enormous interests in recent years.  ...  GAN-IMC is further optimized by weighted content loss (GAN-IMCW), which effectively restores and enhances salient regions in SR images.  ...  Fig. 3 3 Effect of weighted content loss and SR result. 1 . 1 Obtain the accumulated feature responses , by summing the feature maps χ per channel for each location.  ... 
arXiv:1904.10654v2 fatcat:4i76kplho5cvnezfyscuucxi6m

TextureGAN: Controlling Deep Image Synthesis with Texture Patches

Wenqi Xian, Patsorn Sangkloy, Varun Agrawal, Amit Raj, Jingwan Lu, Chen Fang, Fisher Yu, James Hays
2018 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition  
To achieve this, we develop a local texture loss in addition to adversarial and content loss to train the generative network.  ...  With TextureGAN, one can generate novel instances of common items from hand drawn sketches and simple texture patches. You can now be your own fashion guru!  ...  We convert the groundtruth images to Lab, enforce the content, texture and adversarial losses only on the L channel, and enforce a separate color loss on the ab channels.  ... 
doi:10.1109/cvpr.2018.00882 dblp:conf/cvpr/XianSARLFYH18 fatcat:rdlfbz6a3rcs3m2ijm2a2dmvjm

One-to-many Approach for Improving Super-Resolution [article]

Sieun Park, Eunho Lee
2021 arXiv   pre-print
Recently, there has been discussions on the ill-posed nature of super-resolution that multiple possible reconstructions exist for a given low-resolution image.  ...  We improve the content loss that hampers the perceptual training objectives. We also propose additional training techniques to further enhance the perceptual quality of generated images.  ...  Cycle consistency loss Most works on perceptual super-resolution [1, 6, 7] combine the content loss, adversarial loss (GAN loss), and perceptual loss for the training objective as in Equation 1.  ... 
arXiv:2106.10437v4 fatcat:ezbeaptaqjbtjh32wdrkqlxgze

On Privacy Risks of Watching YouTube over Cellular Networks with Carrier Aggregation

Nitya Lakshmanan, Abdelhak Bentaleb, Byoungjun Choi, Roger Zimmermann, Jun Han, Min Suk Kang
2022 Proceedings of the ACM on Interactive Mobile Wearable and Ubiquitous Technologies  
Our attack utilizes a side channel in modern cellular networks that leaks the number of actively transmitting cells for each user.  ...  To design effective video-inference attacks, we augment the coarse-grained side-channel measurements with precise timing information and estimate the traffic bursts of encrypted video contents.  ...  Thus, a simple countermeasure would be to pad the CA side channel. Figure 9(a) shows an example of the padding of the CA side channel for each VBR burst.  ... 
doi:10.1145/3517261 fatcat:3yrqfciforcp5p2hybwhaphfnq

DCAN: Dual Channel-Wise Alignment Networks for Unsupervised Scene Adaptation [chapter]

Zuxuan Wu, Xintong Han, Yen-Liang Lin, Mustafa Gökhan Uzunbas, Tom Goldstein, Ser Nam Lim, Larry S. Davis
2018 Lecture Notes in Computer Science  
We present Dual Channel-wise Alignment Networks (DCAN), a simple yet effective approach to reduce domain shift at both pixel-level and feature-level.  ...  Unlike much recent and concurrent work relying on adversarial training, our framework is lightweight and easy to train.  ...  Dual Channel-wise Alignment Networks for Unsupervised Scene Adaptation  ... 
doi:10.1007/978-3-030-01228-1_32 fatcat:gdesitnfhjh7jatknwpypwav3m

DCAN: Dual Channel-wise Alignment Networks for Unsupervised Scene Adaptation [article]

Zuxuan Wu, Xintong Han, Yen-Liang Lin, Mustafa Gkhan Uzunbas, Tom Goldstein, Ser Nam Lim, Larry S. Davis
2018 arXiv   pre-print
We present Dual Channel-wise Alignment Networks (DCAN), a simple yet effective approach to reduce domain shift at both pixel-level and feature-level.  ...  Unlike much recent and concurrent work relying on adversarial training, our framework is lightweight and easy to train.  ...  This simple operation normalizes features of a source image to have similar statistics with those of a target image for each channel, which is appealing for segmentation tasks, since it is spatially invariant  ... 
arXiv:1804.05827v1 fatcat:jtjhx5levreb5e53wkt47yz2xm

Generative Adversarial Networks for Synthesizing InSAR Patches [article]

Philipp Sibler, Yuanyuan Wang, Stefan Auer, Mohsin Ali, Xiao Xiang Zhu
2020 arXiv   pre-print
Generative Adversarial Networks (GANs) have been employed with certain success for image translation tasks between optical and real-valued SAR intensity imagery.  ...  The synthesis of artificial complex-valued InSAR image stacks asks for, besides good perceptual quality, more stringent quality metrics like phase noise and phase coherence.  ...  spatial resolution 1 × 1 pixel and 512 filter channels.  ... 
arXiv:2008.01184v1 fatcat:jojukmp7bfg6lcdvpjk2dxxsvq

TSIT: A Simple and Versatile Framework for Image-to-Image Translation [article]

Liming Jiang, Changxu Zhang, Mingyang Huang, Chunxiao Liu, Jianping Shi, Chen Change Loy
2020 arXiv   pre-print
We introduce a simple and versatile framework for image-to-image translation.  ...  No additional constraints (e.g., cycle consistency) are needed, contributing to a very clean and simple method. Multi-modal image synthesis with arbitrary style control is made possible.  ...  We introduce a simple and versatile framework for image-toimage translation.  ... 
arXiv:2007.12072v2 fatcat:6nbpv5az2jbf3j2uyzv43aercq

Image Super Resolution using Enhanced Super Resolution Generative Adversarial Network

Raj Sarode, Samiksha Varpe, Omkar Kolte, Leena Ragha, M.D. Patil, V.A. Vyawahare
2022 ITM Web of Conferences  
Controversial Loss has our solution for many uncooked pictures utilizing a discriminatory network which is taught to distinguish between high resolution images and realistic images.  ...  To achieve this, we propose a function of loss of vision that combines the loss of content with the loss of content (Mean Squared Error Loss).  ...  Introduction For generating realistic textures during single picture super-resolution, super-Resolution Generative Adversarial Network (SRGAN) is the best pioneering study.  ... 
doi:10.1051/itmconf/20224403054 fatcat:fna2firmi5cbbd2fiov6o4ioja

Security vulnerabilities in IEEE 802.22

Kaigui Bian, Jung-Min "Jerry" Park
2008 Proceedings of the 4th International ICST Conference on Wireless Internet  
The 802.22 draft standard prescribes several mechanisms for addressing incumbent-and self-coexistence issues.  ...  In this paper, we describe how adversaries can exploit or undermine such mechanisms to degrade the performance of 802.22 WRANs and increase the likelihood of those networks interfering with incumbent networks  ...  According to this contention resolution rule, the contention source's probability of winning a pair-wise contention is 1/2.  ... 
doi:10.4108/icst.wicon2008.4976 dblp:conf/wicon/BianP08 fatcat:t4ueyawmp5fhhbbmob2g556qrm
« Previous Showing results 1 — 15 out of 17,382 results