Sciweavers

235 search results - page 30 / 47
» On joint triangulations of two sets of points in the plane
Sort
View
DCG
2008
86views more  DCG 2008»
13 years 6 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 ...
ICASSP
2011
IEEE
12 years 10 months ago
Adaptive appearance learning for visual object tracking
This paper addresses online learning of reference object distribution in the context of two hybrid tracking schemes that combine the mean shift with local point feature correspond...
Zulfiqar Hassan Khan, Irene Yu-Hua Gu
ENDM
2008
142views more  ENDM 2008»
13 years 6 months ago
Augmenting the Connectivity of Planar and Geometric Graphs
In this paper we study some connectivity augmentation problems. Given a connected graph G with some desirable property, we want to make G 2-vertex connected (or 2-edge connected) ...
Ignaz Rutter, Alexander Wolff
SODA
1992
ACM
109views Algorithms» more  SODA 1992»
13 years 8 months ago
New Algorithms for Minimum Area k-gons
Given a set P of n points in the plane, we wish to find a set Q P of k points for which the convex hull conv(Q) has the minimum area. We solve this, and the related problem of fi...
David Eppstein
COCOON
2008
Springer
13 years 8 months ago
Optimal Insertion of a Segment Highway in a City Metric
Given two sets of points in the plane, we are interested in locating a highway h such that an objective function on the city distance between points of the two sets is minimized (w...
Matias Korman, Takeshi Tokuyama