Search Sciweavers | Sciweavers

32

SWAT
2004
Springer

78views Algorithms» more SWAT 2004»

Online Maintenance of k-Medians and k-Covers on a Line

14 years 4 months ago

The standard dynamic programming solution to ﬁnding k-medians on a line with n nodes requires O(kn2 ) time. Dynamic programming speedup techniques, e.g., use of the quadrangle i...

Rudolf Fleischer, Mordecai J. Golin, Yan Zhang

claim paper

Read More »

51

click to vote

WAOA
2004
Springer

146views Algorithms» more WAOA 2004»

Approximation Algorithms for Mixed Fractional Packing and Covering Problems

14 years 4 months ago

Download www.ceid.upatras.gr

Klaus Jansen

claim paper

Read More »

25

click to vote

WIA
2004
Springer

99views Artificial Intelligence» more WIA 2004»

Brute Force Determinization of NFAs by Means of State Covers

14 years 4 months ago

Download jmc.feydakins.org

Finite automata determinization is a critical operation for numerous practical applications such as regular expression search. Algorithms have to deal with the possible blow up of ...

Jean-Marc Champarnaud, Fabien Coulon, Thomas Paran...

claim paper

Read More »

16

click to vote

ICIP
2003
IEEE

88views Image Processing» more ICIP 2003»

CART-based feature selection of hyperspectral images for crop cover classification

14 years 4 months ago