5115 search results - page 719 / 1023 » On Randomized Lanczos Algorithms |
195
click to vote
WAW
2007
Springer
16 years 19 days ago
2007
Springer
A random graph model based on Kronecker products of probability matrices has been recently proposed as a generative model for large-scale real-world networks such as the web. This...
184
click to vote
WEA
2007
Springer
16 years 19 days ago
2007
Springer
Many speed-up techniques for route planning in static graphs exist, only few of them are proven to work in a dynamic scenario. Most of them use preprocessed information, which has ...
174
click to vote
GLOBECOM
2006
IEEE
16 years 17 days ago
2006
IEEE
– Clustering is a standard approach for achieving efficient and scalable performance in wireless sensor networks. Most of the published clustering algorithms strive to generate t...
166
click to vote
INFOCOM
2006
IEEE
16 years 17 days ago
2006
IEEE
— We consider the fundamental delay tradeoffs for minimizing energy expenditure in a multi-user wireless downlink with randomly varying channels. First, we extend the BerryGallag...
154
click to vote
ACG
2006
Springer
16 years 15 days ago
2006
Springer
Most game programs have a large number of parameters that are crucial for their performance. Tuning these parameters by hand is rather difficult. Therefore automatic optimization a...