Sciweavers

4315 search results - page 86 / 863

» Sorting in linear time

24

ALGORITHMICA
2005

95views more ALGORITHMICA 2005»

Near-Linear Time Approximation Algorithms for Curve Simplification

13 years 7 months ago

Near-Linear Time Approximation Algorithms for Curve Simplification

Download biogeometry.duke.edu

Abstract. We consider the problem of approximating a polygonal curve

Pankaj K. Agarwal, Sariel Har-Peled, Nabil H. Must...

claim paper

Read More »

20

TIFS
2008

70views more TIFS 2008»

Quantization-Based Data Hiding Robust to Linear-Time-Invariant Filtering

13 years 7 months ago

Quantization-Based Data Hiding Robust to Linear-Time-Invariant Filtering

Download www.gts.tsc.uvigo.es

Fernando Pérez-González, Carlos Mosq...

claim paper

Read More »

14

JGAA
2007

45views more JGAA 2007»

Finding a Nonempty Algebraic Subset of an Edge Set in Linear Time

13 years 7 months ago

Finding a Nonempty Algebraic Subset of an Edge Set in Linear Time

Download jgaa.info

Mauro Mezzini

claim paper

Read More »

20

ALGORITHMICA
2000

75views more ALGORITHMICA 2000»

A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs

13 years 7 months ago

A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs

Download www.ub.uni-konstanz.de

Ulrik Brandes, Dorothea Wagner

claim paper

Read More »

18

CORR
2002
Springer

78views Education» more CORR 2002»

Linear-Time Algorithms for Computing Maximum-Density Sequence Segments with Bioinformatics Applications

13 years 7 months ago

Linear-Time Algorithms for Computing Maximum-Density Sequence Segments with Bioinformatics Applications

Download www.csie.ntu.edu.tw

an abstract optimization problem arising from biomolecular sequence analysis. For a sequence A of pairs (ai, wi) for i = 1, . . . , n and wi > 0, a segment A(i, j) is a consecu...

Michael H. Goldwasser, Ming-Yang Kao, Hsueh-I Lu

claim paper

Read More »

« Prev « First page 86 / 863 Last » Next »