Sciweavers

2069 search results - page 88 / 414
» Linear time algorithms for Clobber
Sort
View
STOC
2007
ACM
146views Algorithms» more  STOC 2007»
16 years 6 months ago
Playing games with approximation algorithms
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...
Sham M. Kakade, Adam Tauman Kalai, Katrina Ligett
JDA
2006
87views more  JDA 2006»
15 years 6 months ago
A 3-approximation for the pathwidth of Halin graphs
We prove that the pathwidth of Halin graphs can be 3-approximated in linear time. Our approximation algorithms is based on a combinatorial result about respectful edge orderings o...
Fedor V. Fomin, Dimitrios M. Thilikos
ADVIS
2004
Springer
15 years 10 months ago
On Families of New Adaptive Compression Algorithms Suitable for Time-Varying Source Data
In this paper, we introduce a new approach to adaptive coding which utilizes Stochastic Learning-based Weak Estimation (SLWE) techniques to adaptively update the probabilities of t...
Luís G. Rueda, B. John Oommen
COMPGEOM
2005
ACM
15 years 8 months ago
Fast construction of nets in low dimensional metrics, and their applications
We present a near linear time algorithm for constructing hierarchical nets in finite metric spaces with constant doubling dimension. This data-structure is then applied to obtain...
Sariel Har-Peled, Manor Mendel
ASAP
2003
IEEE
153views Hardware» more  ASAP 2003»
15 years 11 months ago
Hardware Synthesis for Multi-Dimensional Time
This paper introduces basic principles for extending the classical systolic synthesis methodology to multi-dimensional time. Multi-dimensional scheduling enables complex algorithm...
Anne-Claire Guillou, Patrice Quinton, Tanguy Risse...