Sciweavers

201 search results - page 26 / 41
» Computing nearest neighbors in real time
Sort
View
SDM
2009
SIAM
144views Data Mining» more  SDM 2009»
14 years 5 months ago
On Segment-Based Stream Modeling and Its Applications.
The primary constraint in the effective mining of data streams is the large volume of data which must be processed in real time. In many cases, it is desirable to store a summary...
Charu C. Aggarwal
ICDM
2007
IEEE
147views Data Mining» more  ICDM 2007»
14 years 2 months ago
Scalable Collaborative Filtering with Jointly Derived Neighborhood Interpolation Weights
Recommender systems based on collaborative filtering predict user preferences for products or services by learning past user-item relationships. A predominant approach to collabo...
Robert M. Bell, Yehuda Koren
CVPR
2012
IEEE
11 years 11 months ago
The inverted multi-index
A new data structure for efficient similarity search in very large datasets of high-dimensional vectors is introduced. This structure called the inverted multi-index generalizes ...
Artem Babenko, Victor S. Lempitsky
ECCV
2006
Springer
14 years 10 months ago
Balanced Exploration and Exploitation Model Search for Efficient Epipolar Geometry Estimation
Abstract. The estimation of the epipolar geometry is especially difficult where the putative correspondences include a low percentage of inlier correspondences and/or a large subse...
Liran Goshen, Ilan Shimshoni
STOC
1997
ACM
122views Algorithms» more  STOC 1997»
14 years 19 days ago
Fault-Tolerant Quantum Computation With Constant Error
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
Dorit Aharonov, Michael Ben-Or