5138 search results - page 489 / 1028 » Randomized Algorithms for 3-SAT |
176
click to vote
CORR
2010
Springer
15 years 5 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...
220
click to vote
HIPEAC
2010
Springer
15 years 4 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 ...
189
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 ...
190
click to vote
ECCV
2006
Springer
16 years 8 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...
175
click to vote
ICIP
2006
IEEE
16 years 8 months ago
2006
IEEE
The ability to automatically detect visually interesting regions in images has practical applications in the design of active machine vision systems. Analysis of the statistics of...