Sciweavers

2635 search results - page 247 / 527
» Algorithms for the Database Layout Problem
Sort
View
MICAI
2005
Springer
16 years 3 days ago
Proximity Searching in High Dimensional Spaces with a Proximity Preserving Order
Abstract. Kernel based methods (such as k-nearest neighbors classifiers) for AI tasks translate the classification problem into a proximity search problem, in a space that is usu...
Edgar Chávez, Karina Figueroa, Gonzalo Nava...
ICCV
2003
IEEE
16 years 8 months ago
Fast Pose Estimation with Parameter-Sensitive Hashing
Example-based methods are effective for parameter estimation problems when the underlying system is simple or the dimensionality of the input is low. For complex and high-dimensio...
Gregory Shakhnarovich, Paul A. Viola, Trevor Darre...
ICDE
2009
IEEE
214views Database» more  ICDE 2009»
16 years 8 months ago
Ranking with Uncertain Scores
Large databases with uncertain information are becoming more common in many applications including data integration, location tracking, and Web search. In these applications, ranki...
Mohamed A. Soliman, Ihab F. Ilyas
ICDE
2009
IEEE
115views Database» more  ICDE 2009»
16 years 8 months ago
Efficient Evaluation of Multiple Preference Queries
Consider multiple users searching for a hotel room, based on size, cost, distance to the beach, etc. Users may have variable preferences expressed by different weights on the attri...
Leong Hou U, Nikos Mamoulis, Kyriakos Mouratidis
ICDE
2008
IEEE
103views Database» more  ICDE 2008»
16 years 8 months ago
Processing Diagnosis Queries: A Principled and Scalable Approach
Abstract-- Many popular Web sites suffer occasional uservisible problems such as slow responses, blank pages or error messages being displayed, items not being added to shopping ca...
Shivnath Babu, Songyun Duan, Kamesh Munagala