Sciweavers

446 search results - page 19 / 90
» A fast algorithm for computing steiner edge connectivity
Sort
View
ALMOB
2008
131views more  ALMOB 2008»
14 years 9 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
ICCSA
2004
Springer
15 years 3 months ago
The Employment of Regular Triangulation for Constrained Delaunay Triangulation
Abstract. We demonstrate a connection between a regular triangulation and a constrained Delaunay triangulation in 2D. We propose an algorithm for edge enforcement in the constraine...
Pavel Maur, Ivana Kolingerová
CCCG
2004
14 years 11 months ago
Computing the set of all distant horizons of a terrain
We study the problem of computing the set of all distant horizons of a terrain, represented as either: the set of all edges that appear in the set of all distant horizons; the con...
William S. Evans, Daniel Archambault, David G. Kir...
ICDE
2009
IEEE
139views Database» more  ICDE 2009»
15 years 11 months ago
Minimizing Communication Cost in Distributed Multi-query Processing
Increasing prevalence of large-scale distributed monitoring and computing environments such as sensor networks, scientific federations, Grids etc., has led to a renewed interest in...
Jian Li, Amol Deshpande, Samir Khuller
ICIP
2004
IEEE
15 years 11 months ago
Fast alignment of digital images using a lower bound on an entropy metric
We propose a registration algorithm based on successively refined quantization and an alignment metric derived from a minimal spanning tree entropy estimate. The metric favors edg...
Mert R. Sabuncu, Peter J. Ramadge