848 search results - page 129 / 170 » Randomness and the linear degrees of computability |
117
click to vote
PODC
2004
ACM
15 years 5 months ago
2004
ACM
We analyze the properties of Small-World networks, where links are much more likely to connect “neighbor nodes” than distant nodes. In particular, our analysis provides new re...
103
click to vote
ICASSP
2009
IEEE
15 years 6 months ago
2009
IEEE
In this paper, a new approach for Confocal Microscopy (CM) based on the framework of compressive sensing is developed. In the proposed approach, a point illumination and a random ...
105
click to vote
ACMICEC
2003
ACM
15 years 5 months ago
2003
ACM
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism ...
FOCS
2008
IEEE
15 years 6 months ago
2008
IEEE
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
126
click to vote
STACS
2010
Springer
15 years 6 months ago
2010
Springer
We construct efficient data structures that are resilient against a constant fraction of adversarial noise. Our model requires that the decoder answers most queries correctly with...