Sciweavers

332 search results - page 3 / 67
» Space Complexity vs. Query Complexity
Sort
View
AAMAS
1999
Springer
13 years 9 months ago
Making Complex Articulated Agents Dance
We discuss the tradeo s involved in control of complex articulated agents, and present three implemented controllers for a complex task: a physically-based humanoid torso dancing ...
Maja J. Mataric, Victor B. Zordan, Matthew M. Will...
SSDBM
2009
IEEE
174views Database» more  SSDBM 2009»
14 years 4 months ago
Optimization and Execution of Complex Scientific Queries over Uncorrelated Experimental Data
Scientific experiments produce large volumes of data represented as complex objects that describe independent events such as particle collisions. Scientific analyses can be express...
Ruslan Fomkin, Tore Risch
TOC
2010
123views Management» more  TOC 2010»
13 years 4 months ago
Rounds vs. Queries Tradeoff in Noisy Computation
: 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 ...
Navin Goyal, Michael Saks
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
13 years 11 months ago
Expected-case complexity of approximate nearest neighbor searching
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
Sunil Arya, Ho-Yam Addy Fu
CHI
2003
ACM
14 years 10 months ago
Dynamic query sliders vs. brushing histograms
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...
Qing Li, Xiaofeng Bao, Chen Song, Jinfei Zhang, Ch...