851 search results - page 58 / 171 » Random constructions and density results |
83
Voted
BMCBI
2007
14 years 10 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...
MST
2010
14 years 9 months ago
2010
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...
ECCC
2011
14 years 5 months ago
2011
We consider the problem of extracting randomness from sources that are efficiently samplable, in the sense that each output bit of the sampler only depends on some small number d ...
81
Voted
APPROX
2008
Springer
15 years 15 days ago
2008
Springer
Abstract. We are interested in efficient algorithms for generating random samples from geometric objects such as Riemannian manifolds. As a step in this direction, we consider the ...
SPAA
2009
ACM
15 years 7 months ago
2009
ACM
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...