Sciweavers

1347 search results - page 134 / 270
» On the Structure of the Minimum Time Function
Sort
View
MA
2010
Springer
107views Communications» more  MA 2010»
15 years 2 months ago
The multiple hybrid bootstrap - Resampling multivariate linear processes
The paper reconsiders the autoregressive aided periodogram bootstrap (AAPB) which has been suggested in Kreiß and Paparoditis (2003). Their idea was to combine a time domain param...
Carsten Jentsch, Jens-Peter Kreiss
ICDE
2009
IEEE
177views Database» more  ICDE 2009»
16 years 5 months ago
Light-Weight, Runtime Verification of Query Sources
Modern database systems increasingly make use of networked storage. This storage can be in the form of SAN's or in the form of shared-nothing nodes in a cluster. One type of a...
Tingjian Ge, Stanley B. Zdonik
FOCS
2005
IEEE
15 years 9 months ago
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Sing...
TCS
2010
15 years 2 months ago
Cops and Robbers from a distance
Cops and Robbers is a pursuit and evasion game played on graphs that has received much attention. We consider an extension of Cops and Robbers, distance k Cops and Robbers, where t...
Anthony Bonato, Ehsan Chiniforooshan, Pawel Pralat
ISAAC
2007
Springer
70views Algorithms» more  ISAAC 2007»
15 years 10 months ago
Kinetic Maintenance of Mobile k-Centres on Trees
Let C denote a set of n mobile clients, each of which follows a continuous trajectory on a weighted tree T. We establish tight bounds on the maximum relative velocity of the 1-cent...
Stephane Durocher, Christophe Paul