Sciweavers

232 search results - page 20 / 47
» Dynamic Graph Clustering Using Minimum-Cut Trees
Sort
View
JCP
2008
162views more  JCP 2008»
13 years 7 months ago
Shape Recognition by Clustering and Matching of Skeletons
We perform the task of shape recognition using a skeleton based method. Skeleton of the shape is considered as a free tree and is represented by a connectivity graph. Geometric fea...
Hamidreza Zaboli, Mohammad Rahmati, Abdolreza Mirz...
CLEIEJ
2008
72views more  CLEIEJ 2008»
13 years 7 months ago
Measuring Contribution of HTML Features in Web Document Clustering
Documents in HTML format have many features to analyze, from the terms in special sections to the phrases that appear in the whole document. However, it is important to decide whi...
Esteban Meneses, Oldemar Rodríguez-Rojas
PPOPP
2010
ACM
14 years 4 months ago
A distributed placement service for graph-structured and tree-structured data
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
Gregory Buehrer, Srinivasan Parthasarathy, Shirish...
ICCV
2009
IEEE
15 years 9 days ago
Recognizing Actions by Shape-Motion Prototype Trees
A prototype-based approach is introduced for action recognition. The approach represents an action as a se- quence of prototypes for efficient and flexible action match- ing in ...
Zhe Lin, Zhuolin Jiang, Larry S. Davis
CVPR
2010
IEEE
14 years 3 months ago
Fast Globally Optimal 2D Human Detection with Loopy Graph Models
This paper presents an algorithm for recovering the globally optimal 2D human figure detection using a loopy graph model. This is computationally challenging because the time comp...
Tai-Peng Tian, Stan Sclaroff