Sciweavers

3223 search results - page 148 / 645
» The Scaling of Search Cost
Sort
View
CVPR
2008
IEEE
16 years 8 months ago
Manifold learning using robust Graph Laplacian for interactive image search
Interactive image search or relevance feedback is the process which helps a user refining his query and finding difficult target categories. This consists in partially labeling a ...
Hichem Sahbi, Patrick Etyngier, Jean-Yves Audibert...
ICCV
2007
IEEE
16 years 8 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
SC
2005
ACM
16 years 22 hour ago
A Scalable Distributed Parallel Breadth-First Search Algorithm on BlueGene/L
Many emerging large-scale data science applications require searching large graphs distributed across multiple memories and processors. This paper presents a distributed breadthï¬...
Andy Yoo, Edmond Chow, Keith W. Henderson, Will Mc...
WISE
2002
Springer
15 years 11 months ago
Log Mining to Improve the Performance of Site Search
Despite of the popularity of global search engines, people still suffer from low accuracy of site search. The primary reason lies in the difference of link structures and data sca...
Gui-Rong Xue, Hua-Jun Zeng, Zheng Chen, Wei-Ying M...
CP
2006
Springer
15 years 10 months ago
Distributed Constraint-Based Local Search
Distributed computing is increasingly important at a time when the doubling of the number of transistors on a processor every 18 months no longer translates in a doubling of speed ...
Laurent Michel, Andrew See, Pascal Van Hentenryck