3946 search results - page 533 / 790 » The computational complexity of choice sets |
146
click to vote
ICRA
2003
IEEE
15 years 12 months ago
2003
IEEE
We present an online algorithm for planning sequences of footstep locations that encode goal-directed navigation strategies for humanoid robots. Planning footsteps is more general...
196
click to vote
PODS
2010
ACM
15 years 11 months ago
2010
ACM
Both semantic and type-based query optimization rely on the idea that queries often exhibit non-trivial rewritings if the state space of the database is restricted. Despite their ...
172
Voted
CHI
2009
ACM
15 years 11 months ago
2009
ACM
We build on our prior work with computer-supported teams performing a complex decision-making task on maps, where the distinction between content and process common ground is prop...
197
click to vote
COMPGEOM
2009
ACM
15 years 11 months ago
2009
ACM
We present a new (1 + ε)-spanner for sets of n points in Rd . Our spanner has size O(n/εd−1 ) and maximum degree O(logd n). The main advantage of our spanner is that it can be...
182
click to vote
INFOVIS
2000
IEEE
15 years 11 months ago
2000
IEEE
In the last several years, large multi-dimensional databases have become common in a variety of applications such as data warehousing and scientific computing. Analysis and explor...