Sciweavers

307 search results - page 56 / 62
» The convex hull of ellipsoids
Sort
View
MP
1998
108views more  MP 1998»
13 years 7 months ago
Base polytopes of series-parallel posets: Linear description and optimization
We define the base polytope B(P, g) of a partially ordered set P and a supermodular function g on the ideals ofP as the convex hull of the incidence vectors of all linear extensio...
Rainer Schrader, Andreas S. Schulz, Georg Wambach
TIP
1998
114views more  TIP 1998»
13 years 7 months ago
An optimal polygonal boundary encoding scheme in the rate distortion sense
—In this paper, we present fast and efficient methods for the lossy encoding of object boundaries that are given as eight-connect chain codes. We approximate the boundary by a p...
Guido M. Schuster, Aggelos K. Katsaggelos
PAMI
2007
253views more  PAMI 2007»
13 years 7 months ago
Gaussian Mean-Shift Is an EM Algorithm
The mean-shift algorithm, based on ideas proposed by Fukunaga and Hostetler (1975), is a hill-climbing algorithm on the density defined by a finite mixture or a kernel density e...
Miguel Á. Carreira-Perpiñán
SENSYS
2010
ACM
13 years 5 months ago
Practical 3D geographic routing for wireless sensor networks
Geographic routing is of interest for sensor networks because a point-to-point primitive is an important building block for data-centric applications. While there is a significant...
Jiangwei Zhou, Yu Chen, Ben Leong, Pratibha Sundar...
IJCGA
2010
91views more  IJCGA 2010»
13 years 4 months ago
Pareto Envelopes in Simple Polygons
For a set T of n points in a metric space (X, d), a point y X is dominated by a point x X if d(x, t) d(y, t) for all t T and there exists t T such that d(x, t ) < d(y, t )....
Victor Chepoi, Karim Nouioua, Edouard Thiel, Yann ...