Sciweavers

163 search results - page 31 / 33
» K-Nearest Neighbor Search using the Pyramid Technique
Sort
View
AAAI
1998
13 years 8 months ago
Fast Probabilistic Modeling for Combinatorial Optimization
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...
Shumeet Baluja, Scott Davies
ICDE
2006
IEEE
191views Database» more  ICDE 2006»
14 years 8 months ago
Query Decomposition: A Multiple Neighborhood Approach to Relevance Feedback Processing in Content-based Image Retrieval
Today's Content-Based Image Retrieval (CBIR) techniques are based on the "k-nearest neighbors" (kNN) model. They retrieve images from a single neighborhood using lo...
Kien A. Hua, Ning Yu, Danzhou Liu
CVPR
2012
IEEE
11 years 9 months ago
Spherical hashing
Many binary code encoding schemes based on hashing have been actively studied recently, since they can provide efficient similarity search, especially nearest neighbor search, an...
Jae-Pil Heo, Youngwoon Lee, Junfeng He, Shih-Fu Ch...
RECSYS
2009
ACM
14 years 1 months ago
Context-based splitting of item ratings in collaborative filtering
Collaborative Filtering (CF) recommendations are computed by leveraging a historical data set of users’ ratings for items. It assumes that the users’ previously recorded ratin...
Linas Baltrunas, Francesco Ricci
VLDB
2005
ACM
140views Database» more  VLDB 2005»
14 years 26 days ago
Complex Spatio-Temporal Pattern Queries
This paper introduces a novel type of query, what we name Spatio-temporal Pattern Queries (STP). Such a query specifies a spatiotemporal pattern as a sequence of distinct spatial...
Marios Hadjieleftheriou, George Kollios, Petko Bak...