Sciweavers

37 search results - page 3 / 8

» soda 2000

9

SODA
2000
ACM

58views Algorithms» more SODA 2000»

Engineering the compression of massive tables: an experimental approach

13 years 6 months ago

Engineering the compression of massive tables: an experimental approach

Download www.cs.princeton.edu

Adam L. Buchsbaum, Donald F. Caldwell, Kenneth War...

claim paper

Read More »

17

SODA
2000
ACM

125views Algorithms» more SODA 2000»

Approximation algorithms for projective clustering

13 years 6 months ago

Approximation algorithms for projective clustering

Download biogeometry.duke.edu

We consider the following two instances of the projective clustering problem: Given a set

Pankaj K. Agarwal, Cecilia Magdalena Procopiuc

claim paper

Read More »

11

SODA
2000
ACM

111views Algorithms» more SODA 2000»

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

13 years 6 months ago

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

Download www.cmb.usc.edu

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

claim paper

Read More »

7

KES
2000
Springer

102views Information Technology» more KES 2000»

Learning incremental syntactic structures with recursive neural networks

13 years 8 months ago

Learning incremental syntactic structures with recursive neural networks

Download www.dsi.unifi.it

Fabrizio Costa, Paolo Frasconi, Vincenzo Lombardo,...

claim paper

Read More »

13

SODA
2000
ACM

148views Algorithms» more SODA 2000»

Computing contour trees in all dimensions

13 years 6 months ago

Computing contour trees in all dimensions

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 »

« Prev « First page 3 / 8 Last » Next »