337 search results - page 16 / 68 » Efficient algorithms for ranking with SVMs |
213
click to vote
ICDE
2009
IEEE
16 years 1 months ago
2009
IEEE
Large databases with uncertain information are becoming more common in many applications including data integration, location tracking, and Web search. In these applications, ranki...
106
Voted
SIGMOD
2000
ACM
15 years 3 months ago
2000
ACM
In this paper, we propose a novel formulation for distance-based outliers that is based on the distance of a point from its kth nearest neighbor. We rank each point on the basis o...
IPPS
1998
IEEE
15 years 4 months ago
1998
IEEE
The main contribution of this work is to present elegant broadcast-efficientalgorithms for permutation routing, ranking, and sorting n items on the Broadcast Communication Model (...
194
click to vote
SIGMOD
2009
ACM
15 years 12 months ago
2009
ACM
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...
BTW
2007
Springer
2007
Springer
TopX - Efficient and Versatile Top-k Query Process-ing for Text, Semistructured, and Structured Data
15 years 3 months ago
: This paper presents a comprehensive overview of the TopX search engine, an extensive framework for unified indexing and querying large collections of unstructured, semistructured...