Sciweavers

1100 search results - page 32 / 220
» Approximate distance oracles
Sort
View
FUZZIEEE
2007
IEEE
14 years 2 months ago
Distance Measure Assisted Rough Set Feature Selection
Abstract— Feature Selection (FS) is a technique for dimensionality reduction. Its aims are to select a subset of the original features of a dataset which are rich in the most use...
Neil MacParthalain, Qiang Shen, Richard Jensen
SI3D
2006
ACM
14 years 2 months ago
Jump flooding in GPU with applications to Voronoi diagram and distance transform
This paper studies jump flooding as an algorithmic paradigm in the general purpose computation with GPU. As an example application of jump flooding, the paper discusses a constant...
Guodong Rong, Tiow Seng Tan
VLDB
2002
ACM
113views Database» more  VLDB 2002»
14 years 8 months ago
Searching in metric spaces by spatial approximation
We propose a new data structure to search in metric spaces. A metric space is formed by a collection of objects and a distance function de ned among them, which satis es the trian...
Gonzalo Navarro
SODA
1998
ACM
157views Algorithms» more  SODA 1998»
13 years 9 months ago
Approximate String Matching: A Simpler Faster Algorithm
We give two algorithms for finding all approximate matches of a pattern in a text, where the edit distance between the pattern and the matching text substring is at most k. The fir...
Richard Cole, Ramesh Hariharan
MICS
2007
90views more  MICS 2007»
13 years 8 months ago
Approximation by Conic Splines
Abstract. We show that the complexity of a parabolic or conic spline approximating a sufficiently smooth curve with non-vanishing curvature to within Hausdorff distance ε is c1ε...
Sunayana Ghosh, Sylvain Petitjean, Gert Vegter