5153 search results - page 933 / 1031 » Introduction to Randomized Algorithms |
119
Voted
STOC
2005
ACM
16 years 2 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...
122
Voted
STOC
2004
ACM
16 years 2 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...
219
Voted
SIGMOD
2008
ACM
16 years 2 months ago
2008
ACM
Computing statistical information on probabilistic data has attracted a lot of attention recently, as the data generated from a wide range of data sources are inherently fuzzy or ...
107
click to vote
MOBIHOC
2008
ACM
16 years 2 months ago
2008
ACM
In this paper, we identify a new problem in wireless sensor networks, distance sensitive service discovery, where nearby or closest service selection guarantee is expected. We pro...
129
Voted
MOBIHOC
2005
ACM
16 years 2 months ago
2005
ACM
Tiny, low-cost sensor devices are expected to be failure-prone and hence in many realistic deployment scenarios for sensor networks these nodes are deployed in higher than necessa...