331 search results - page 56 / 67 » Fast Matching for All Pairs Similarity Search |
STOC
2010
ACM
15 years 2 months ago
2010
ACM
Revisiting the “small-world” experiments of the ’60s, Kleinberg observed that individuals are very effective at constructing short chains of acquaintances between any two p...
CIKM
2009
Springer
15 years 4 months ago
2009
Springer
Modern search engines have to be fast to satisfy users, so there are hard back-end latency requirements. The set of features useful for search ranking functions, though, continues...
SDM
2009
SIAM
15 years 6 months ago
2009
SIAM
Time series motifs are pairs of individual time series, or subsequences of a longer time series, which are very similar to each other. As with their discrete analogues in computat...
62
Voted
WWW
2006
ACM
15 years 10 months ago
2006
ACM
We present GoGetIt!, a tool for generating structure-driven crawlers that requires a minimum effort from the users. The tool takes as input a sample page and an entry point to a W...
DASFAA
2005
IEEE
15 years 3 months ago
2005
IEEE
A novel approach for similarity search on the protein structure databases is proposed. PADS (Protein Alignment by Directional shape Signatures) incorporates the three dimensional ...