Sciweavers

1041 search results - page 104 / 209
» Randomizing Reductions of Search Problems
Sort
View
ICCV
2007
IEEE
14 years 10 months ago
Interactive Search for Image Categories by Mental Matching
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 ...
Marin Ferecatu, Donald Geman
CIAC
1994
Springer
148views Algorithms» more  CIAC 1994»
14 years 1 days ago
Efficient Reorganization of Binary Search Trees
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...
Micha Hofri, Hadas Shachnai
SARA
2009
Springer
14 years 14 days ago
Light Algorithms for Maintaining Max-RPC During Search
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...
Julien Vion, Romuald Debruyne
WSC
1997
13 years 9 months ago
Searching for Important Factors: Sequential Bifurcation under Uncertainty
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...
Russell C. H. Cheng
IPMI
2005
Springer
14 years 8 months ago
Simultaneous Segmentation of Multiple Closed Surfaces Using Optimal Graph Searching
This paper presents a general graph-theoretic technique for simultaneously segmenting multiple closed surfaces in volumetric images, which employs a novel graph-construction scheme...
Kang Li, Steven Millington, Xiaodong Wu, Danny Z. ...