6251 search results - page 177 / 1251 » Randomness, Computability, and Density |
138
click to vote
STOC
2005
ACM
15 years 9 months ago
2005
ACM
We study the round complexity of two-party protocols for generating a random nbit string such that the output is guaranteed to have bounded bias (according to some measure) even i...
137
click to vote
IPPS
2006
IEEE
15 years 10 months ago
2006
IEEE
In many distributed computing systems that are prone to either induced or spontaneous node failures, the number of available computing resources is dynamically changing in a rando...
224
click to vote
BMCBI
2007
15 years 4 months ago
2007
Background: In recent years, an extensive characterization of network structures has been made in an effort to elucidate design principles of metabolic networks, providing valuabl...
124
click to vote
ICCSA
2004
Springer
15 years 9 months ago
2004
Springer
Finding the fastest algorithm to solve a problem is one of the main issues in Computational Geometry. Focusing only on worst case analysis or asymptotic computations leads to the d...
131
click to vote
CVPR
2010
IEEE
15 years 11 months ago
2010
IEEE
Conditional Random Field models have proved effective for several low-level computer vision problems. Inference in these models involves solving a combinatorial optimization probl...