Sciweavers

484 search results - page 66 / 97
» Large graph processing in the cloud
Sort
View
GRAPHITE
2005
ACM
15 years 3 months ago
Uniting cartoon textures with computer assisted animation
We present a novel method to create perpetual animations from a small set of given keyframes. Existing approaches either are limited to re-sequencing large amounts of existing ima...
William Van Haevre, Fabian Di Fiore, Frank Van Ree...
NIPS
2004
14 years 11 months ago
Efficient Out-of-Sample Extension of Dominant-Set Clusters
Dominant sets are a new graph-theoretic concept that has proven to be relevant in pairwise data clustering problems, such as image segmentation. They generalize the notion of a ma...
Massimiliano Pavan, Marcello Pelillo
ICRA
2008
IEEE
205views Robotics» more  ICRA 2008»
15 years 4 months ago
Minimum time point assignment for coverage by two constrained robots
— This paper focuses on the assignment of discrete points to two robots, in the presence of geometric and kinematic constraints between the robots. The individual points have dif...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
70
Voted
ICIP
2001
IEEE
15 years 11 months ago
Video similarity detection with video signature clustering
The proliferation of video content on the web makes similarity detection an indispensable tool in web data management, searching, and navigation. We have previously proposed a com...
Sen-Ching S. Cheung, Avideh Zakhor
85
Voted
ICPR
2006
IEEE
15 years 10 months ago
Finding Text in Natural Scenes by Figure-Ground Segmentation
Much past research on finding text in natural scenes uses bottom-up grouping processes to detect candidate text features as a first processing step. While such grouping procedures...
Huiying Shen, James Coughlan