985 search results - page 113 / 197 » Piercing Convex Sets |
153
click to vote
JMLR
2010
14 years 11 months ago
2010
In recent years, a fundamental problem structure has emerged as very useful in a variety of machine learning applications: Submodularity is an intuitive diminishing returns proper...
157
click to vote
SODA
1993
ACM
15 years 5 months ago
1993
ACM
We introduce a new method for nding several types of optimal k-point sets, minimizing perimeter, diameter, circumradius, and related measures, by testing sets of the O(k) nearest ...
124
click to vote
COMPGEOM
1996
ACM
15 years 8 months ago
1996
ACM
A triangulation of a point set Pn is a partitioning of the convex hull Conv(Pn) into a set of triangles with disjoint interiors such that the vertices of these triangles are in Pn...
139
click to vote
CVPR
2006
IEEE
16 years 6 months ago
2006
IEEE
Given a dense set of imperfect normals obtained by photometric stereo or shape from shading, this paper presents an optimization algorithm which alternately optimizes until conver...
142
click to vote
CVPR
2008
IEEE
16 years 6 months ago
2008
IEEE
Coronary Heart Disease can be diagnosed by assessing the regional motion of the heart walls in ultrasound images of the left ventricle. Even for experts, ultrasound images are dif...