Sciweavers

17 search results - page 4 / 4
» Alternation and redundancy analysis of the intersection prob...
Sort
View
SODA
2012
ACM
196views Algorithms» more  SODA 2012»
11 years 7 months ago
Polytope approximation and the Mahler volume
The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...
Sunil Arya, Guilherme Dias da Fonseca, David M. Mo...
ALMOB
2008
131views more  ALMOB 2008»
13 years 5 months ago
Fast algorithms for computing sequence distances by exhaustive substring composition
The increasing throughput of sequencing raises growing needs for methods of sequence analysis and comparison on a genomic scale, notably, in connection with phylogenetic tree reco...
Alberto Apostolico, Olgert Denas