5115 search results - page 153 / 1023 » On Randomized Lanczos Algorithms |
140
click to vote
IPL
2008
15 years 6 months ago
2008
The Chernoff-Hoeffding bounds are fundamental probabilistic tools. An elementary approach is presented to obtain a Chernoff-type upper-tail bound for the number of prime factors o...
154
click to vote
INFORMATICALT
2006
15 years 6 months ago
2006
The two major Markov Random Fields (MRF) based algorithms for image segmentation are the Simulated Annealing (SA) and Iterated Conditional Modes (ICM). In practice, compared to the...
142
click to vote
ISAAC
1994
Springer
15 years 10 months ago
1994
Springer
In this paper we present efficient deterministic and randomized algorithms for selection on any interconnection network when the number of input keys (n) is the number of processo...
165
click to vote
LATIN
2004
Springer
15 years 11 months ago
2004
Springer
Consider a game in which edges of a graph are provided a pair at a time, and the player selects one edge from each pair, attempting to construct a graph with a component as large ...
145
click to vote
ALT
2006
Springer
16 years 3 months ago
2006
Springer
The present paper mainly studies the expected teaching time of memoryless randomized learners without feedback. First, a characterization of optimal randomized learners is provided...