Sciweavers

2168 search results - page 195 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
125
Voted
STOC
2007
ACM
101views Algorithms» more  STOC 2007»
16 years 4 months ago
The price of privacy and the limits of LP decoding
This work is at the intersection of two lines of research. One line, initiated by Dinur and Nissim, investigates the price, in accuracy, of protecting privacy in a statistical dat...
Cynthia Dwork, Frank McSherry, Kunal Talwar
103
Voted
VTC
2006
IEEE
129views Communications» more  VTC 2006»
15 years 9 months ago
Practicable MIMO Capacity in Ideal Channels
— The impact of communications signal processing such as QAM modulations (instead of gaussian signals), finite block lengths (instead of infinitely long codes), and using simpl...
S. Amir Mirtaheri, Rodney G. Vaughan
149
Voted
OPODIS
2007
15 years 5 months ago
Small-World Networks: From Theoretical Bounds to Practical Systems
Abstract. In small-world networks, each peer is connected to its closest neighbors in the network topology, as well as to additional long-range contact(s), also called shortcut(s)....
François Bonnet, Anne-Marie Kermarrec, Mich...
98
Voted
MM
2005
ACM
103views Multimedia» more  MM 2005»
15 years 9 months ago
Diorama table
“diorama table “ is an interactive table installation. People place physical objects on the table and projected elements such as trains, cars, houses, and trees appear and are...
Keiko Takahashi, Shinji Sasada
123
Voted
ISSAC
2005
Springer
105views Mathematics» more  ISSAC 2005»
15 years 9 months ago
Lifting techniques for triangular decompositions
We present lifting techniques for triangular decompositions of zero-dimensional varieties, that extend the range of the previous methods. We discuss complexity aspects, and report...
Xavier Dahan, Marc Moreno Maza, Éric Schost...