158 search results - page 23 / 32 » The Cover Time, the Blanket Time, and the Matthews Bound |
COCOA
2008
Springer
13 years 11 months ago
2008
Springer
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
RTAS
2009
IEEE
14 years 4 months ago
2009
IEEE
Over the last few years, Real-Time Calculus has been used extensively to model and analyze embedded systems processing continuous data/event streams. Towards this, bounds on the a...
NDSS
2002
IEEE
14 years 2 months ago
2002
IEEE
There have been a number of protocols proposed for anonymous network communication. In this paper we investigate attacks by corrupt group members that degrade the anonymity of eac...
ESA
2000
Springer
14 years 1 months ago
2000
Springer
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...
FSTTCS
2010
Springer
13 years 7 months ago
2010
Springer
We study (collapsible) higher-order pushdown systems -- theoretically robust and well-studied models of higher-order programs -- along with their natural subclass called (collapsi...