1629 search results - page 119 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
KDD
2008
ACM
15 years 10 months ago
2008
ACM
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
COCO
2009
Springer
15 years 4 months ago
2009
Springer
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
102
click to vote
DCOSS
2008
Springer
14 years 11 months ago
2008
Springer
Energy is one of the most crucial aspects in real deployments of mobile sensor networks. As a result of scarce resources, the duration of most real deployments can be limited to ju...
SIPS
2007
IEEE
15 years 4 months ago
2007
IEEE
Stochastic decoding is a new alternative method for low complexity decoding of error-correcting codes. This paper presents the first hardware architecture for stochastic decoding...
KDD
2004
ACM
15 years 10 months ago
2004
ACM
Mining frequent structural patterns from graph databases is an interesting problem with broad applications. Most of the previous studies focus on pruning unfruitful search subspac...