Sciweavers

1067 search results - page 140 / 214
» Probabilistic regular graphs
Sort
View
CVPR
2005
IEEE
16 years 2 months ago
Hybrid Models for Human Motion Recognition
Probabilistic models have been previously shown to be efficient and effective for modeling and recognition of human motion. In particular we focus on methods which represent the h...
Claudio Fanti, Lihi Zelnik-Manor, Pietro Perona
94
Voted
ESA
2006
Springer
137views Algorithms» more  ESA 2006»
15 years 4 months ago
Deciding Relaxed Two-Colorability - A Hardness Jump
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
Robert Berke, Tibor Szabó
89
Voted
ICTAI
2002
IEEE
15 years 5 months ago
Distributed Graphplan
(Appears as a regular paper in the Proceedings of IEEE International Conference on Tools with Artificial Intelligence (ICTAI), Washington D.C, IEEE Computer Society, Nov. 2002, p...
Mark Iwen, Amol Dattatraya Mali
123
Voted
CIKM
2011
Springer
14 years 16 days ago
Semi-supervised multi-task learning of structured prediction models for web information extraction
Extracting information from web pages is an important problem; it has several applications such as providing improved search results and construction of databases to serve user qu...
Paramveer S. Dhillon, Sundararajan Sellamanickam, ...
105
Voted
SAC
2009
ACM
15 years 7 months ago
Applying latent dirichlet allocation to group discovery in large graphs
This paper introduces LDA-G, a scalable Bayesian approach to finding latent group structures in large real-world graph data. Existing Bayesian approaches for group discovery (suc...
Keith Henderson, Tina Eliassi-Rad