6251 search results - page 337 / 1251 » Randomness, Computability, and Density |
203
click to vote
CORR
2011
Springer
15 years 2 months ago
2011
Springer
We consider the task of topology discovery of sparse random graphs using end-to-end random measurements (e.g., delay) between a subset of nodes, referred to as the participants. T...
249
click to vote
SIAMJO
2010
15 years 2 months ago
2010
Abstract. We propose a randomized method for general convex optimization problems; namely, the minimization of a linear function over a convex body. The idea is to generate N rando...
180
Voted
ESA
2001
Springer
15 years 12 months ago
2001
Springer
Computing the Delaunay triangulation of n points requires usually a minimum of (n log n) operations, but in some special cases where some additional knowledge is provided, faster a...
151
Voted
INFOCOM
2008
IEEE
16 years 1 months ago
2008
IEEE
—The operation of widely-deployed random access to wireless networks is based on limited information on the result of each access attempt. When making a random access attempt, us...
215
click to vote
BMCBI
2007
15 years 7 months ago
2007
Background: Large-scale sequencing of entire genomes has ushered in a new age in biology. One of the next grand challenges is to dissect the cellular networks consisting of many i...