Sciweavers

7 search results - page 1 / 2
» On the parameterized complexity of d-dimensional point set p...
Sort
View
IPL
2008
72views more  IPL 2008»
13 years 5 months ago
On the parameterized complexity of d-dimensional point set pattern matching
Sergio Cabello, Panos Giannopoulos, Christian Knau...
COMPGEOM
2008
ACM
13 years 6 months ago
Embedding and similarity search for point sets under translation
Pattern matching in point sets is a well studied problem with numerous applications. We assume that the point sets may contain outliers (missing or spurious points) and are subjec...
Minkyoung Cho, David M. Mount
RC
2002
103views more  RC 2002»
13 years 4 months ago
Exact Minkowski Products of N Complex Disks
An exact parameterization for the boundary of the Minkowski product of N circular disks in the complex plane is derived. When N > 2, this boundary curve may be regarded as a gen...
Rida T. Farouki, Helmut Pottmann
CCCG
2008
13 years 6 months ago
Competitive Search for Longest Empty Intervals
A problem arising in statistical data analysis and pattern recognition is to find a longest interval free of data points, given a set of data points in the unit interval. We use t...
Peter Damaschke
AMDO
2000
Springer
13 years 8 months ago
Matching a Human Walking Sequence with a VRML Synthetic Model
- In this paper we present a specific matching technique based on basic motor patterns between two image sequences taken from different view points and a VRML synthetic human model...
Jose Maria Buades Rubio, Ramon Mas, Francisco J. P...