244 search results - page 46 / 49 » Balanced Cayley graphs and balanced planar graphs |
FSTTCS
2009
Springer
14 years 3 months ago
2009
Springer
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
ICCV
2003
IEEE
14 years 11 months ago
2003
IEEE
We propose a principled account on multiclass spectral clustering. Given a discrete clustering formulation, we first solve a relaxed continuous optimization problem by eigendecomp...
ICDCS
2009
IEEE
14 years 6 months ago
2009
IEEE
Users and administrators of large distributed systems are frequently in need of monitoring and management of its various components, data items and resources. Though there exist s...
EWSN
2010
Springer
14 years 6 months ago
2010
Springer
The simplicity and low-overhead of random walks have made them a popular querying mechanism for Wireless Sensor Networks. However, most of the related work is of theoretical nature...
FOCS
2009
IEEE
14 years 3 months ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...