Sciweavers

169 search results - page 21 / 34
» Decentralized Search with Random Costs
Sort
View
CVPR
2010
IEEE
14 years 11 days ago
ARISTA - Image Search to Annotation on Billions of Web Photos
Though it has cost great research efforts for decades, object recognition is still a challenging problem. Traditional methods based on machine learning or computer vision are stil...
Xin-Jing Wang, Ming Liu, Lei Zhang, Yi Li, Wei-Yin...
ICDE
2006
IEEE
135views Database» more  ICDE 2006»
14 years 8 months ago
Reverse Nearest Neighbors Search in Ad-hoc Subspaces
Given an object q, modeled by a multidimensional point, a reverse nearest neighbors (RNN) query returns the set of objects in the database that have q as their nearest neighbor. I...
Man Lung Yiu, Nikos Mamoulis
JCO
2007
123views more  JCO 2007»
13 years 6 months ago
On the number of local minima for the multidimensional assignment problem
The Multidimensional Assignment Problem (MAP) is an NP-hard combinatorial optimization problem occurring in many applications, such as data association, target tracking, and resou...
Don A. Grundel, Pavlo A. Krokhmal, Carlos A. S. Ol...
ICASSP
2008
IEEE
14 years 1 months ago
Query adaptative locality sensitive hashing
It is well known that high-dimensional nearest-neighbor retrieval is very expensive. Many signal processing methods suffer from this computing cost. Dramatic performance gains can...
Herve Jegou, Laurent Amsaleg, Cordelia Schmid, Pat...
INFOCOM
2005
IEEE
14 years 10 days ago
BARD: Bayesian-assisted resource discovery in sensor networks
Data dissemination in sensor networks requires four components: resource discovery, route establishment, packet forwarding, and route maintenance. Resource discovery can be the mos...
Fred Stann, John S. Heidemann