3341 search results - page 195 / 669 » On Bounded Queries and Approximation |
142
click to vote
INFOCOM
2007
IEEE
15 years 11 months ago
2007
IEEE
Abstract— This paper investigates the near-memoryless behavior of the service time for IEEE 802.11 saturated single-hop ad hoc networks. We show that the number of packets succes...
154
click to vote
SSDBM
2007
IEEE
15 years 11 months ago
2007
IEEE
We present a fast algorithm for computing approximate quantiles in high speed data streams with deterministic error bounds. For data streams of size N where N is unknown in advanc...
140
Voted
FORMATS
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. Quantitative model checking computes the probability values of a given property quantifying over all possible schedulers. It turns out that maximum and minimum probabilit...
128
click to vote
ZUM
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We describe a method for combining formal program development with a disciplined and documented way of introducing realistic compromises, for example necessitated by reso...
120
click to vote
COCOON
2006
Springer
15 years 8 months ago
2006
Springer
We consider the problem of placing a set of disks in a region containing obstacles such that no two disks intersect. We are given a bounding polygon P and a set R of possibly inte...