196 search results - page 20 / 40 » New Algorithms for Optimal Online Checkpointing |
CPM
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We present a deterministic black box solution for online approximate matching. Given a pattern of length m and a streaming text of length n that arrives one character at ...
BMVC
2010
13 years 5 months ago
2010
We present a novel off-line algorithm for target segmentation and tracking in video. In our approach, video data is represented by a multi-label Markov Random Field model, and seg...
SODA
1996
ACM
13 years 8 months ago
1996
ACM
We consider the problem faced by a mobile robot that has to reach a given target by traveling through an unmapped region in the plane containing oriented rectangular obstacles. We...
ICALP
2004
Springer
14 years 24 days ago
2004
Springer
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
STACS
2004
Springer
14 years 23 days ago
2004
Springer
OrthogonalVariableSpreadingFactor(OVSF)codesareusedinUMTStosharetheradiospectrum among several connections of possibly different bandwidth requirements. The combinatorial core of t...