2004 search results - page 196 / 401 » Sampling from large graphs |
130
Voted
SDM
2010
SIAM
15 years 5 months ago
2010
SIAM
We introduce a novel Bayesian framework for hybrid community discovery in graphs. Our framework, HCDF (short for Hybrid Community Discovery Framework), can effectively incorporate...
143
Voted
PAMI
2010
15 years 1 months ago
2010
—In this paper we present a compositional and dynamic model for face aging. The compositional model represents faces in each age group by a hierarchical And-Or graph, in which An...
124
Voted
DAC
2006
ACM
16 years 4 months ago
2006
ACM
SAT sweeping is a method for simplifying an AND/INVERTER graph (AIG) by systematically merging graph vertices from the inputs towards the outputs using a combination of structural...
138
Voted
ICSE
2008
IEEE-ACM
16 years 3 months ago
2008
IEEE-ACM
Understanding the structure of large existing (and evolving) software systems is a major challenge for software engineers. In reverse engineering, we aim to compute, for a given s...
153
Voted
EMMCVPR
2007
Springer
15 years 9 months ago
2007
Springer
Most of the traditional methods for shape classification are based on contour. They often encounter difficulties when dealing with classes that have large nonlinear variability, es...