5115 search results - page 960 / 1023 » On Randomized Lanczos Algorithms |
148
click to vote
DAGSTUHL
2007
15 years 4 months ago
2007
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...
112
Voted
MASCOTS
2007
15 years 4 months ago
2007
— The transmission energy required for a wireless communication increases superlinearly with the communication distance. In a mobile wireless network, nodal movement can be explo...
131
Voted
SODA
2008
ACM
15 years 4 months ago
2008
ACM
We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...
139
Voted
ESANN
2006
15 years 4 months ago
2006
In this article, we extend a local prototype-based learning model by active learning, which gives the learner the capability to select training samples during the model adaptation...
156
click to vote
NIPS
2004
15 years 3 months ago
2004
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...