Sciweavers

1082 search results - page 67 / 217
» Approximation Algorithms for Spreading Points
Sort
View
FUIN
2006
98views more  FUIN 2006»
13 years 7 months ago
On-line Approximate String Matching in Natural Language
We consider approximate pattern matching in natural language text. We use the words of the text as the alphabet, instead of the characters as in traditional string matching approac...
Kimmo Fredriksson
STOC
2002
ACM
119views Algorithms» more  STOC 2002»
14 years 8 months ago
Space-efficient approximate Voronoi diagrams
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
Sunil Arya, Theocharis Malamatos, David M. Mount
3DIM
2003
IEEE
13 years 11 months ago
Approximate K-D Tree Search for Efficient ICP
A method is presented that uses an Approximate Nearest Neighbor method for determining correspondences within the Iterative Closest Point Algorithm. The method is based upon the k...
Michael A. Greenspan, Mike Yurick
AAECC
1995
Springer
92views Algorithms» more  AAECC 1995»
13 years 11 months ago
Division of Entire Functions by Polynomial Ideals
In [ASTW] it was given a Grobner reduction based division formula for entire functions by polynomial ideals. Here we give degree bounds where the input function can be truncated i...
Joachim Apel
ALGORITHMICA
2006
161views more  ALGORITHMICA 2006»
13 years 7 months ago
The Expected Size of the Rule k Dominating Set
Dai, Li, and Wu proposed Rule k, a localized approximation algorithm that attempts to find a small connected dominating set in a graph. In this paper we consider the "average...
Jennie C. Hansen, Eric Schmutz, Li Sheng