Sciweavers

1573 search results - page 103 / 315
» A Data Structure for Sponsored Search
Sort
View
ICML
2007
IEEE
16 years 5 months ago
Neighbor search with global geometry: a minimax message passing algorithm
Neighbor search is a fundamental task in machine learning, especially in classification and retrieval. Efficient nearest neighbor search methods have been widely studied, with the...
Kye-Hyeon Kim, Seungjin Choi
STOC
2004
ACM
129views Algorithms» more  STOC 2004»
16 years 4 months ago
Sorting and searching in the presence of memory faults (without redundancy)
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
Irene Finocchi, Giuseppe F. Italiano
CAMP
2005
IEEE
15 years 10 months ago
Reinforcement Learning for P2P Searching
— For a peer-to-peer (P2P) system holding massive amount of data, an efficient and scalable search for resource sharing is a key determinant to its practical usage. Unstructured...
Luca Gatani, Giuseppe Lo Re, Alfonso Urso, Salvato...
CVPR
2010
IEEE
15 years 6 months ago
Compact Projection: Simple and Efficient Near Neighbor Search with Practical Memory Requirements
Image similarity search is a fundamental problem in computer vision. Efficient similarity search across large image databases depends critically on the availability of compact ima...
Kerui Min, Linjun Yang, John Wright, Lei Wu, Xian-...
IJCAI
2007
15 years 5 months ago
Arc Consistency during Search
Enforcing arc consistency (AC) during search has proven to be a very effective method in solving Constraint Satisfaction Problems and it has been widely-used in many Constraint Pr...
Chavalit Likitvivatanavong, Yuanlin Zhang, Scott S...