Sciweavers

3778 search results - page 310 / 756
» Erdos-Ko-Rado for three sets
Sort
View
TSD
2007
Springer
16 years 4 days ago
On the Relative Hardness of Clustering Corpora
Abstract. Clustering is often considered the most important unsupervised learning problem and several clustering algorithms have been proposed over the years. Many of these algorit...
David Pinto, Paolo Rosso
VLDB
2007
ACM
105views Database» more  VLDB 2007»
16 years 4 days ago
Extending Q-Grams to Estimate Selectivity of String Matching with Low Edit Distance
There are many emerging database applications that require accurate selectivity estimation of approximate string matching queries. Edit distance is one of the most commonly used s...
Hongrae Lee, Raymond T. Ng, Kyuseok Shim
VLDB
2007
ACM
135views Database» more  VLDB 2007»
16 years 4 days ago
Self-Organizing Schema Mappings in the GridVine Peer Data Management System
GridVine is a Peer Data Management System based on a decentralized access structure. Built following the principle of data independence, it separates a logical layer – where dat...
Philippe Cudré-Mauroux, Suchit Agarwal, Adr...
WADS
2007
Springer
145views Algorithms» more  WADS 2007»
16 years 4 days ago
Approximate Shortest Paths Guided by a Small Index
Distance oracles and graph spanners are excerpts of a graph that allow to compute approximate shortest paths. Here, we consider the situation where it is possible to access the ori...
Jörg Derungs, Riko Jacob, Peter Widmayer
WADS
2007
Springer
155views Algorithms» more  WADS 2007»
16 years 4 days ago
Constant Factor Approximations for the Hotlink Assignment Problem
An approach for reducing the navigation effort for the users of a web site is to enhance its hyperlink structure with additional hotlinks. We address the task of adding at most on...
Tobias Jacobs