Sciweavers

534 search results - page 38 / 107
» One more bit is enough
Sort
View
SODA
2008
ACM
112views Algorithms» more  SODA 2008»
13 years 9 months ago
The effect of induced subgraphs on quasi-randomness
One of the main questions that arise when studying random and quasi-random structures is which properties P are such that any object that satisfies P "behaves" like a tr...
Asaf Shapira, Raphael Yuster
SOUPS
2005
ACM
14 years 1 months ago
Stopping spyware at the gate: a user study of privacy, notice and spyware
Spyware is a significant problem for most computer users. The term “spyware” loosely describes a new class of computer software. This type of software may track user activitie...
Nathaniel Good, Rachna Dhamija, Jens Grossklags, D...
MKWI
2008
190views Business» more  MKWI 2008»
13 years 9 months ago
Partial Matchmaking for complex Product and Service Descriptions
: Matchmaking between offers and requests is an essential mechanism in electronic market places. Description Logics have been proposed as a appropriate framework for representing o...
Heiner Stuckenschmidt, Martin Kolb
STOC
2001
ACM
129views Algorithms» more  STOC 2001»
14 years 8 months ago
Interaction in quantum communication and the complexity of set disjointness
One of the most intriguing facts about communication using quantum states is that these states cannot be used to transmit more classical bits than the number of qubits used, yet i...
Hartmut Klauck, Ashwin Nayak, Amnon Ta-Shma, David...
ICASSP
2008
IEEE
14 years 2 months ago
Distributed stereo image coding with improved disparity and noise estimation
Distributed coding of correlated grayscale stereo images is effectively addressed by a recently proposed codec that learns block-wise disparity at the decoder. Based on the Slepia...
David M. Chen, David P. Varodayan, Markus Flierl, ...