Sciweavers

2569 search results - page 109 / 514
» Approximate Objects and Approximate Theories
Sort
View
JCB
2007
168views more  JCB 2007»
15 years 6 months ago
Fast Molecular Shape Matching Using Contact Maps
In this paper, we study the problem of computing the similarity of two protein structures ring their contact-map overlap. Contact-map overlap abstracts the problem of computing th...
Pankaj K. Agarwal, Nabil H. Mustafa, Yusu Wang
COMGEO
1999
ACM
15 years 6 months ago
Point labeling with sliding labels
This paper discusses algorithms for labeling sets of points in the plane, where labels are not restricted to some finite number of positions. We show that continuously sliding lab...
Marc J. van Kreveld, Tycho Strijk, Alexander Wolff
STOC
2003
ACM
141views Algorithms» more  STOC 2003»
16 years 6 months ago
Better streaming algorithms for clustering problems
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...
Moses Charikar, Liadan O'Callaghan, Rina Panigrahy
COMPGEOM
2004
ACM
15 years 11 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 ...
RSCTC
2004
Springer
110views Fuzzy Logic» more  RSCTC 2004»
15 years 11 months ago
A Graded Applicability of Rules
We address the problem of rough applicability of rules within the framework of approximation spaces. The graded applicability of a rule for an object of an approximation space, int...
Anna Gomolinska