Sciweavers

7 search results - page 1 / 2

» cpm 2003

25

CPM
2003
Springer

95views Combinatorics» more CPM 2003»

A Simpler 1.5-Approximation Algorithm for Sorting by Transpositions

14 years 1 months ago

A Simpler 1.5-Approximation Algorithm for Sorting by Transpositions

Download theorie.informatik.uni-ulm.de

Tzvika Hartman

claim paper

Read More »

24

CPM
2003
Springer

138views Combinatorics» more CPM 2003»

Complexities of the Centre and Median String Problems

14 years 1 months ago

Complexities of the Centre and Median String Problems

Download www.cs.ucr.edu

François Nicolas, Eric Rivals

claim paper

Read More »

18

CPM
2003
Springer

86views Combinatorics» more CPM 2003»

Extracting Approximate Patterns

14 years 1 months ago

Extracting Approximate Patterns

Download www.cs.ucr.edu

Johann Pelfrêne, Saïd Abdeddaïm, J...

claim paper

Read More »

17

CPM
2003
Springer

82views Combinatorics» more CPM 2003»

Sparse LCS Common Substring Alignment

14 years 1 months ago

Sparse LCS Common Substring Alignment

Download www-igm.univ-mlv.fr

Gad M. Landau, Baruch Schieber, Michal Ziv-Ukelson

claim paper

Read More »

27

DAWAK
2003
Springer

183views Information Technology» more DAWAK 2003»

CPM: A Cube Presentation Model for OLAP

14 years 1 months ago

CPM: A Cube Presentation Model for OLAP

Download www.dbnet.ece.ntua.gr

On-Line Analytical Processing (OLAP) is a trend in database technology, based on the multidimensional view of data. In this paper we introduce the Cube Presentation Model (CPM), a ...

Andreas S. Maniatis, Panos Vassiliadis, Spiros Ski...

claim paper

Read More »

« Prev « First page 1 / 2 Last » Next »