181 search results - page 21 / 37 » Fast Approximate Graph Partitioning Algorithms |
PAMI
2007
13 years 7 months ago
2007
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....
SIGMETRICS
2000
ACM
14 years 2 days ago
2000
ACM
We present a new approximation algorithm based on an exact representation of the state space S, using decision diagrams, and of the transition rate matrix R, using Kronecker algeb...
SIGMOD
2011
ACM
12 years 10 months ago
2011
ACM
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
DASFAA
2009
IEEE
13 years 11 months ago
2009
IEEE
Graph-structured databases and related problems such as reachability query processing have been increasingly relevant to many applications such as XML databases, biological databas...
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
Distributed Constraint Optimization (DCOP) is a popular framework for cooperative multi-agent decision making. DCOP is NPhard, so an important line of work focuses on developing f...