2270 search results - page 250 / 454 » On the distribution of eigenvalues of graphs |
165
click to vote
ICS
2010
Tsinghua U.
16 years 3 months ago
2010
Tsinghua U.
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
163
click to vote
JSSPP
2009
Springer
16 years 1 months ago
2009
Springer
The number of applications with many parallel cooperating processes is steadily increasing, and developing efficient runtimes for their execution is an important task. Several fram...
141
click to vote
JSSPP
2009
Springer
16 years 1 months ago
2009
Springer
Scheduling a task graph onto several processors is a trade-off between maximising concurrency and minimising interprocessor communication. A technique to reduce or avoid interproc...
223
click to vote
GLOBECOM
2007
IEEE
16 years 27 days ago
2007
IEEE
—Distributed denial-of-service attacks (DDoS) pose an immense threat to the Internet. The most studied solution is to let routers probabilistically mark packets with partial path...
166
click to vote
IPPS
2007
IEEE
16 years 25 days ago
2007
IEEE
We present a study of multithreaded implementations of Thorup’s algorithm for solving the Single Source Shortest Path (SSSP) problem for undirected graphs. Our implementations l...