Algorithms | Sciweavers

15

click to vote

SODA
2000
ACM

90views Algorithms» more SODA 2000»

Evaluating the cylindricity of a nominally cylindrical point set

13 years 11 months ago

Download hal.archives-ouvertes.fr

Olivier Devillers, Franco P. Preparata

claim paper

Read More »

29

click to vote

SODA
2000
ACM

106views Algorithms» more SODA 2000»

Algorithms for optimizing production DNA sequencing

13 years 11 months ago

Download www.c3.lanl.gov

We discuss the problem of optimally "finishing" a partially sequenced, reconstructed DNA segment. At first sight, this appears to be computationally hard. We construct a...

Éva Czabarka, Goran Konjevod, Madhav V. Mar...

claim paper

Read More »

32

click to vote

SODA
2000
ACM

123views Algorithms» more SODA 2000»

Communication complexity of document exchange

13 years 11 months ago

Download www.research.att.com

We address the problem of minimizing the communication involved in the exchange of similar documents. We consider two users, A and B, who hold documents x and y respectively. Neit...

Graham Cormode, Mike Paterson, Süleyman Cenk ...

claim paper

Read More »

15

click to vote

SODA
2000
ACM

82views Algorithms» more SODA 2000»

On the temporal HZY compression scheme

13 years 11 months ago

Download theory.stanford.edu

Z. Cohen, Yossi Matias, S. Muthukrishnan, Sül...

claim paper

Read More »

18

click to vote

SODA
2000
ACM

111views Algorithms» more SODA 2000»

A dynamic programming approach to de novo peptide sequencing via tandem mass spectrometry

13 years 11 months ago

Download www.cmb.usc.edu

Ting Chen, Ming-Yang Kao, Matthew Tepel, John Rush...

claim paper

Read More »

26

click to vote

SODA
2000
ACM

102views Algorithms» more SODA 2000»

Escaping a grid by edge-disjoint paths

13 years 11 months ago

Download www.dcs.kcl.ac.uk

We study the edge-disjoint escape problem in grids. Given a set of n sources in a two-dimensional grid, the problem is to connect all sources to the grid boundary using a set of n...

Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting

claim paper

Read More »

22

click to vote

SODA
2000
ACM

148views Algorithms» more SODA 2000»

Computing contour trees in all dimensions

13 years 11 months ago

Download www.comp.leeds.ac.uk

We show that contour trees can be computed in all dimensions by a simple algorithm that merges two trees. Our algorithm extends, simplifies, and improves work of Tarasov and Vyaly...

Hamish Carr, Jack Snoeyink, Ulrike Axen

claim paper

Read More »

17

click to vote

SODA
2000
ACM

78views Algorithms» more SODA 2000»

Strengthening integrality gaps for capacitated network design and covering problems

13 years 11 months ago

Download www.aladdin.cs.cmu.edu

Robert D. Carr, Lisa Fleischer, Vitus J. Leung, Cy...

claim paper

Read More »

32

click to vote

SODA
2000
ACM

95views Algorithms» more SODA 2000»

On external memory graph traversal

13 years 11 months ago

Download www.cs.utah.edu

We describe a new external memory data structure, the buffered repository tree, and use it to provide the first non-trivial external memory algorithm for directed breadth-first se...

Adam L. Buchsbaum, Michael H. Goldwasser, Suresh V...

claim paper

Read More »

15

click to vote

SODA
2000
ACM

58views Algorithms» more SODA 2000»

Engineering the compression of massive tables: an experimental approach

13 years 11 months ago