1038 search results - page 143 / 208 » Boundary Points and Resolution |
115
Voted
TCS
2008
15 years 22 days ago
2008
We consider "swept regions" and "swept hypersurfaces"B in Rn+1 (and especially R3) which are a disjoint union of subspaces t = t or Bt = Bt obtained from a va...
115
Voted
TKDE
2008
15 years 22 days ago
2008
Given a dataset P, a k-means query returns k points in space (called centers), such that the average squared distance between each point in P and its nearest center is minimized. S...
149
click to vote
ICCV
2011
IEEE
14 years 26 days ago
2011
IEEE
This paper addresses scene understanding in the context of a moving camera, integrating semantic reasoning ideas from monocular vision with 3D information available through struct...
152
click to vote
CEC
2011
IEEE
14 years 24 days ago
2011
IEEE
— The principle of artificial curiosity directs active exploration towards the most informative or most interesting data. We show its usefulness for global black box optimizatio...
99
Voted
COMPGEOM
1996
ACM
15 years 5 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...