4009 search results - page 379 / 802 » Clustering on Complex Graphs |
183
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
A celebrated theorem of Savitch [Sav70] states that NSPACE(S) ⊆ DSPACE(S2 ). In particular, Savitch gave a deterministic algorithm to solve ST-CONNECTIVITY (an NL-complete probl...
188
click to vote
ICCV
2007
IEEE
16 years 1 months ago
2007
IEEE
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...
173
click to vote
KIVS
2005
Springer
16 years 9 days ago
2005
Springer
: The usage of SuperPeers has been proposed to improve the performance of both Structured and Unstructured Peer-to-Peer (P2P) networks. In this paper we explore a network-aware cla...
188
click to vote
ASUNAM
2009
IEEE
15 years 12 months ago
2009
IEEE
Community detection in social networks varying with time is a common yet challenging problem whereby efficient visualization of evolving relationships and implicit hierarchical s...
196
click to vote
RTCSA
2000
IEEE
15 years 11 months ago
2000
IEEE
As a starting point for static program analysis a control flow graph (CFG) is needed. If only the binary executable is available, this CFG has to be reconstructed from sequences ...