6028 search results - page 1087 / 1206 » Randomness as a resource for design |
188
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
The design of algorithms on complex networks, such as routing, ranking or recommendation algorithms, requires a detailed understanding of the growth characteristics of the network...
165
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
Understanding the graph structure of the Internet is a crucial step for building accurate network models and designing efficient algorithms for Internet applications. Yet, obtaini...
171
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
183
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
The design of new quantum algorithms has proven to be an extremely difficult task. This paper considers a different approach to the problem, by studying the problem of 'quant...
305
click to vote
VLDB
2005
ACM
16 years 6 months ago
2005
ACM
Estimating the selectivity of multidimensional range queries over real valued attributes has significant applications in data exploration and database query optimization. In this p...