5019 search results - page 65 / 1004 » On the Reflexivity of Point Sets |
213
click to vote
COLT
2010
Springer
15 years 4 months ago
2010
Springer
Bandit convex optimization is a special case of online convex optimization with partial information. In this setting, a player attempts to minimize a sequence of adversarially gen...
152
click to vote
CW
2004
IEEE
15 years 10 months ago
2004
IEEE
Non-photo realistic rendering (NPR) methods have been proposed for more than ten years in the Computer Graphic field. Separately, within past few years, several algorithms for ren...
158
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
We propose a novel technique for the registration of 3D point clouds which makes very few assumptions: we avoid any manual rough alignment or the use of landmarks, displacement ca...
152
click to vote
COMPGEOM
2004
ACM
15 years 11 months ago
2004
ACM
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
183
click to vote
EMMCVPR
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. In this paper we propose a new variational framework for image segmentation that incorporates the information of expected shape and a few points on the boundary into geod...