268 search results - page 23 / 54 » Growing Protean Graphs |
115
click to vote
SODA
2003
ACM
15 years 5 months ago
2003
ACM
We introduce a model for directed scale-free graphs that grow with preferential attachment depending in a natural way on the in- and out-degrees. We show that the resulting in- an...
144
Voted
CSR
2009
Springer
15 years 10 months ago
2009
Springer
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σp 2 . In the case of linear matroids, which are represented over poly...
134
Voted
ICDE
2008
IEEE
15 years 10 months ago
2008
IEEE
Personalized PageRank, related to random walks with restarts and conductance in resistive networks, is a frequent search paradigm for graph-structured databases. While efficient ba...
120
click to vote
MICRO
2003
IEEE
15 years 9 months ago
2003
IEEE
Application-specific extensions to the computational capabilities of a processor provide an efficient mechanism to meet the growing performance and power demands of embedded appl...
149
click to vote
SI3D
2003
ACM
15 years 9 months ago
2003
ACM
We present a novel approach for interactive navigation in complex 3D synthetic environments using path planning. Our algorithm precomputes a global roadmap of the environment by u...