5316 search results - page 36 / 1064 » Which Search Problems Are Random |
134
click to vote
ACII
2005
Springer
15 years 2 months ago
2005
Springer
Hand tracking is a challenging problem due to the complexity of searching in a 20+ degrees of freedom (DOF) space for an optimal estimation of hand configuration. This paper repres...
111
click to vote
KBSE
2007
IEEE
15 years 7 months ago
2007
IEEE
Randomized testing has been shown to be an effective method for testing software units. However, the thoroughness of randomized unit testing varies widely according to the settin...
77
Voted
SISAP
2008
IEEE
15 years 7 months ago
2008
IEEE
All pivot-based algorithms for similarity search use a set of reference points called pivots. The pivot-based search algorithm precomputes some distances to these reference points...
ISCA
2008
IEEE
15 years 21 days ago
2008
IEEE
First Come First Served is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems [28, 11], scheduling web ...
132
click to vote
CIAC
1994
Springer
15 years 4 months ago
1994
Springer
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...