Sciweavers

839 search results - page 74 / 168
» Three-Clustering of Points in the Plane
Sort
View
BIRTHDAY
2010
Springer
13 years 10 months ago
Transposition and Time-Scale Invariant Geometric Music Retrieval
Abstract. This paper considers how to adapt geometric algorithms, developed for content-based music retrieval of symbolically encoded music, to be robust against time deformations ...
Kjell Lemström
COMGEO
2010
ACM
13 years 10 months ago
Centerpoints and Tverberg's technique
Using a technique that Tverberg and Vrecica [TV93] discovered to give a surprisingly simple proof of Tverberg's theorem, we show the following extension of the centerpoint th...
Abdul Basit, Nabil H. Mustafa, Saurabh Ray, Sarfra...
DCG
2008
86views more  DCG 2008»
13 years 10 months ago
Efficient Algorithms for Maximum Regression Depth
We investigate algorithmic questions that arise in the statistical problem of computing lines or hyperplanes of maximum regression depth among a set of n points. We work primarily...
Marc J. van Kreveld, Joseph S. B. Mitchell, Peter ...
COMGEO
2000
ACM
13 years 10 months ago
Computing simple paths among obstacles
Given a set X of points in the plane, two distinguished points s,t X, and a set of obstacles represented by line segments, we wish to compute a simple polygonal path from s to t...
Qi Cheng, Marek Chrobak, Gopalakrishnan Sundaram
ACCV
2010
Springer
13 years 5 months ago
Minimal Representations for Uncertainty and Estimation in Projective Spaces
Abstract. Estimation using homogeneous entities has to cope with obstacles such as singularities of covariance matrices and redundant parametrizations which do not allow an immedia...
Wolfgang Förstner