25041 search results - page 4290 / 5009 » Algorithms for Clustering Data |
216
Voted
CVPR
2012
IEEE
13 years 9 months ago
2012
IEEE
Watershed cuts are among the fastest segmentation algorithms and therefore well suited for interactive segmentation of very large 3D data sets. To minimize the number of user inte...
263
Voted
CVPR
2012
IEEE
13 years 9 months ago
2012
IEEE
In this paper we address multi-view reconstruction of urban environments using 3D shape grammars. Our formulation expresses the solution to the problem as a shape grammar parse tr...
221
click to vote
CVPR
2012
IEEE
13 years 9 months ago
2012
IEEE
Matching patches between two images, also known as computing nearest-neighbor fields, has been proven a useful technique in various computer vision/graphics algorithms. But this ...
204
Voted
TVCG
2012
13 years 9 months ago
2012
—This paper describes a fully automated framework to generate realistic head motion, eye gaze, and eyelid motion simultaneously based on live (or recorded) speech input. Its cent...
249
Voted
SIGMETRICS
2012
ACM
13 years 9 months ago
2012
ACM
Latency has become an important metric for network monitoring since the emergence of new latency-sensitive applications (e.g., algorithmic trading and high-performance computing)....