Sciweavers

114 search results - page 18 / 23
» The Tree Inclusion Problem: In Linear Space and Faster
Sort
View
COMPGEOM
2004
ACM
15 years 2 months ago
Locality-sensitive hashing scheme based on p-stable distributions
We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under ÐÔ norm, based on Ôstable distributions. Our scheme improves the running...
Mayur Datar, Nicole Immorlica, Piotr Indyk, Vahab ...
EP
1998
Springer
15 years 1 months ago
Memory Scalability in Constraint-Based Multimedia Style Sheet Systems
Abstract. Multimedia style sheet systems uniformly use a constraintbased model of layout. Constraints provide a uniform mechanism for all aspects of style management and layout and...
Terry Cumaranatunge, Ethan V. Munson
94
Voted
SIGIR
2004
ACM
15 years 2 months ago
Learning effective ranking functions for newsgroup search
Web communities are web virtual broadcasting spaces where people can freely discuss anything. While such communities function as discussion boards, they have even greater value as...
Wensi Xi, Jesper Lind, Eric Brill
BMCBI
2011
14 years 1 months ago
Structator: fast index-based search for RNA sequence-structure patterns
Background: The secondary structure of RNA molecules is intimately related to their function and often more conserved than the sequence. Hence, the important task of searching dat...
Fernando Meyer, Stefan Kurtz, Rolf Backofen, Sebas...
STOC
2005
ACM
130views Algorithms» more  STOC 2005»
15 years 9 months ago
Low-distortion embeddings of general metrics into the line
A low-distortion embedding between two metric spaces is a mapping which preserves the distances between each pair of points, up to a small factor called distortion. Low-distortion...
Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasi...