39 search results - page 6 / 8 » Bounded Size Graph Clustering with Applications to Stream Pr... |
SIGMOD
2010
ACM
14 years 1 months ago
2010
ACM
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
COMPGEOM
2006
ACM
14 years 8 days ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
ICC
2007
IEEE
14 years 2 months ago
2007
IEEE
— Recent advances in communication and mobile computing have made it possible for cellular networks and digital broadcasting systems to converge on the basis of their common mult...
ICCV
2003
IEEE
14 years 10 months ago
2003
IEEE
Dominant sets are a new graph-theoretic concept that has proven to be relevant in partitional (flat) clustering as well as image segmentation problems. However, in many computer v...
SPAA
2005
ACM
14 years 2 months ago
2005
ACM
We describe a new class of utility-maximization scheduling problem with precedence constraints, the disconnected staged scheduling problem (DSSP). DSSP is a nonpreemptive multipro...