Sciweavers

5153 search results - page 787 / 1031
» Introduction to Randomized Algorithms
Sort
View
127
Voted
PG
2000
IEEE
15 years 8 months ago
Interactive Manipulation Planning for Animated Characters
We present a brief overview of an algorithm for interactively animating object grasping and manipulation tasks for human figures. The technique is designed to efficiently genera...
James J. Kuffner Jr., Jean-Claude Latombe
148
Voted
SIGMOD
2000
ACM
141views Database» more  SIGMOD 2000»
15 years 8 months ago
Counting, Enumerating, and Sampling of Execution Plans in a Cost-Based Query Optimizer
Testing an SQL database system by running large sets of deterministic or stochastic SQL statements is common practice in commercial database development. However, code defects oft...
Florian Waas, César A. Galindo-Legaria
134
Voted
ICCVW
1999
Springer
15 years 8 months ago
A General Method for Feature Matching and Model Extraction
Abstract. Popular algorithms for feature matching and model extraction fall into two broad categories, generate-and-test and Hough transform variations. However, both methods su er...
Clark F. Olson
159
Voted
FOCS
1998
IEEE
15 years 8 months ago
Quantum Lower Bounds by Polynomials
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...
Robert Beals, Harry Buhrman, Richard Cleve, Michel...
109
Voted
COCO
1998
Springer
98views Algorithms» more  COCO 1998»
15 years 8 months ago
Probabilistic Martingales and BPTIME Classes
We define probabilistic martingales based on randomized approximation schemes, and show that the resulting notion of probabilistic measure has several desirable robustness propert...
Kenneth W. Regan, D. Sivakumar