1041 search results - page 104 / 209 » Randomizing Reductions of Search Problems |
150
click to vote
ICCV
2007
IEEE
16 years 4 months ago
2007
IEEE
Traditional image retrieval methods require a "query image" to initiate a search for members of an image category. However, when the image database is unstructured, and ...
146
click to vote
CIAC
1994
Springer
15 years 6 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...
125
click to vote
SARA
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. This article presents two new algorithms whose purpose is to maintain the Max-RPC domain filtering consistency during search with a minimal memory footprint and implemen...
100
Voted
WSC
1997
15 years 3 months ago
1997
The problem of searching for important factors in a simulation model is considered when the simulation output is subject to stochastic variation. Bettonvil and Kleijnen (1996) giv...
103
click to vote
IPMI
2005
Springer
16 years 3 months ago
2005
Springer
This paper presents a general graph-theoretic technique for simultaneously segmenting multiple closed surfaces in volumetric images, which employs a novel graph-construction scheme...