5115 search results - page 465 / 1023 » On Randomized Lanczos Algorithms |
220
click to vote
SIGMETRICS
2002
ACM
15 years 7 months ago
2002
ACM
Decentralized and unstructured peer-to-peer networks such as Gnutella are attractive for certain applications because they require no centralized directories and no precise contro...
203
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
253
click to vote
HIPEAC
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Stream programming is a promising way to expose concurrency to the compiler. A stream program is built from kernels that communicate only via point-to-point streams. The ...
211
click to vote
CVPR
2008
IEEE
16 years 9 months ago
2008
IEEE
We present a random field based model for stereo vision with explicit occlusion labeling in a probabilistic framework. The model employs non-parametric cost functions that can be ...
209
click to vote
ECCV
2006
Springer
16 years 9 months ago
2006
Springer
Abstract. The presence of noise renders the classical factorization method almost impractical for real-world multi-body motion tracking problems. The main problem stems from the ef...