Sciweavers

990 search results - page 159 / 198
» Sub-Graphs of Complete Graph
Sort
View
CORR
2010
Springer
70views Education» more  CORR 2010»
13 years 7 months ago
Simultaneous communication in noisy channels
A sender wishes to broadcast a message of length n over an alphabet of size k to r users, where each user i, 1 i r should be able to receive one of possible mi messages. The cha...
Amit Weinstein
SOCINFO
2010
13 years 6 months ago
Social Email: A Framework and Application for More Socially-Aware Communications
As online social networks (OSN) attempt to mimic real life social networks, we have made progress towards using OSNs to provide us with data to allow for richer and more robust onl...
Thomas Tran, Jeff Rowe, Shyhtsun Felix Wu
TVCG
2010
188views more  TVCG 2010»
13 years 6 months ago
Analyzing and Tracking Burning Structures in Lean Premixed Hydrogen Flames
— This paper presents topology-based methods to robustly extract, analyze, and track features defined as subsets of isosurfaces. First, we demonstrate how features identified b...
Peer-Timo Bremer, Gunther H. Weber, Valerio Pascuc...
VIROLOGY
2010
179views more  VIROLOGY 2010»
13 years 6 months ago
Automatic binary deobfuscation
Abstract. This paper gives an overview of our research in the automation of the process of software protection analysis. We will focus more particularly on the problem of obfuscati...
Yoann Guillot, Alexandre Gazet
CORR
2011
Springer
159views Education» more  CORR 2011»
13 years 2 months ago
How to Play Unique Games against a Semi-Random Adversary
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...
Alexandra Kolla, Konstantin Makarychev, Yury Makar...