Sciweavers

985 search results - page 23 / 197
» Piercing Convex Sets
Sort
View
COMPGEOM
2007
ACM
13 years 11 months ago
An optimal generalization of the centerpoint theorem, and its extensions
We prove an optimal generalization of the centerpoint theorem: given a set P of n points in the plane, there exist two points (not necessarily among input points) that hit all con...
Saurabh Ray, Nabil H. Mustafa
PICS
2003
13 years 9 months ago
Color Gamut Characterization Via Ray Tracing for Device Profile Generation
Color gamut characterization is an essential step in the ICC profile generation for imaging devices. It is also needed as part of evaluation and comparison of image quality achiev...
Dmitri A. Gusev
SIAMDM
2010
130views more  SIAMDM 2010»
13 years 6 months ago
On the Hull Number of Triangle-Free Graphs
A set of vertices C in a graph is convex if it contains all vertices which lie on shortest paths between vertices in C. The convex hull of a set of vertices S is the smallest conve...
Mitre Costa Dourado, Fábio Protti, Dieter R...
ICML
2008
IEEE
14 years 8 months ago
A decoupled approach to exemplar-based unsupervised learning
A recent trend in exemplar based unsupervised learning is to formulate the learning problem as a convex optimization problem. Convexity is achieved by restricting the set of possi...
Gökhan H. Bakir, Sebastian Nowozin
TSMC
2008
122views more  TSMC 2008»
13 years 7 months ago
A Geometric Approach to the Theory of Evidence
In this paper, we propose a geometric approach to the theory of evidence based on convex geometric interpretations of its two key notions of belief function (b.f.) and Dempster...
Fabio Cuzzolin