4 search results - page 1 / 1 » Rounds vs. Queries Tradeoff in Noisy Computation |
TOC
2010
12 years 11 months ago
2010
: We show that a noisy parallel decision tree making O(n) queries needs (log n) rounds to compute OR of n bits. This answers a question of Newman [IEEE Conference on Computational ...
ICDE
2005
IEEE
13 years 10 months ago
2005
IEEE
In recent years, content-based image retrieval has become more and more important in many application areas. Similarity retrieval is inherently a very demanding process, in partic...
IPPS
2005
IEEE
13 years 10 months ago
2005
IEEE
Sigma, the first single-round group membership (GM) algorithm, was recently introduced and demonstrated to operate consistently with theoretical expectations in a simulated WAN en...
CHI
2003
ACM
14 years 5 months ago
2003
ACM
Dynamic queries facilitate exploration of information through real-time visual display of both query formulation and results. Dynamic query sliders are linked to the main visualiz...