Sciweavers

356 search results - page 17 / 72
» Robust and efficient algorithms for rank join evaluation
Sort
View
SIGIR
2002
ACM
14 years 9 months ago
A new family of online algorithms for category ranking
We describe a new family of topic-ranking algorithms for multi-labeled documents. The motivation for the algorithms stems from recent advances in online learning algorithms. The a...
Koby Crammer, Yoram Singer
54
Voted
WWW
2007
ACM
15 years 10 months ago
Comparing apples and oranges: normalized pagerank for evolving graphs
PageRank is the best known technique for link-based importance ranking. The computed importance scores, however, are not directly comparable across different snapshots of an evolv...
Klaus Berberich, Srikanta J. Bedathur, Gerhard Wei...
ICIP
2009
IEEE
14 years 7 months ago
Selecting representative and distinctive descriptors for efficient landmark recognition
To have a robust and informative image content representation for image categorization, we often need to extract as many as possible visual features at various locations, scales a...
Sheng Gao, Joo-Hwee Lim
SSDBM
2010
IEEE
220views Database» more  SSDBM 2010»
15 years 2 months ago
Prefix Tree Indexing for Similarity Search and Similarity Joins on Genomic Data
Similarity search and similarity join on strings are important for applications such as duplicate detection, error detection, data cleansing, or comparison of biological sequences....
Astrid Rheinländer, Martin Knobloch, Nicky Ho...
SIGMOD
2009
ACM
155views Database» more  SIGMOD 2009»
15 years 10 months ago
Efficient top-k algorithms for fuzzy search in string collections
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...
Rares Vernica, Chen Li