Sciweavers

6251 search results - page 172 / 1251
» Randomness, Computability, and Density
Sort
View
ICCV
2007
IEEE
16 years 6 months ago
LogCut - Efficient Graph Cut Optimization for Markov Random Fields
Markov Random Fields (MRFs) are ubiquitous in lowlevel computer vision. In this paper, we propose a new approach to the optimization of multi-labeled MRFs. Similarly to -expansion...
Victor S. Lempitsky, Carsten Rother, Andrew Blake
JCM
2008
76views more  JCM 2008»
15 years 4 months ago
Waterfilling Estimation for AWGN MIMO Channel Modeled as a Random Matrix
Waterfilling solutions provide optimal power distribution in multiple-input multiple-output (MIMO) system design. However, the optimal distribution is usually obtained through cost...
Victor M. Vergara, Silvio E. Barbin, Ramiro Jordan
FOCS
2007
IEEE
15 years 10 months ago
Reconstruction for Models on Random Graphs
Consider a collection of random variables attached to the vertices of a graph. The reconstruction problem requires to estimate one of them given ‘far away’ observations. Sever...
Antoine Gerschenfeld, Andrea Montanari
PDCAT
2007
Springer
15 years 10 months ago
High Throughput Multi-port MT19937 Uniform Random Number Generator
ct There have been many previous attempts to accelerate MT19937 using FPGAs but we believe that we can substantially improve the previous implementations to develop a higher throug...
Vinay Sriram, David Kearney
IPPS
1998
IEEE
15 years 8 months ago
Sharing Random Bits with No Process Coordination
We present a method by which any polynomial-time randomized distributed algorithm is transformed in such way that each participating process needs only polylog local random bits a...
Marius Zimand