Sciweavers

564 search results - page 74 / 113
» Linear Time Algorithms for Exact Distance Transform
Sort
View
DGCI
2009
Springer
14 years 1 months ago
Optimal Partial Tiling of Manhattan Polyominoes
Finding an efficient optimal partial tiling algorithm is still an open problem. We have worked on a special case, the tiling of Manhattan polyominoes with dominoes, for which we gi...
Olivier Bodini, Jérémie Lumbroso
DCC
2006
IEEE
14 years 9 months ago
Optimal Index Assignment for Multiple Description Lattice Vector Quantization
Optimal index assignment of multiple description lattice vector quantizer (MDLVQ) can be posed as a large-scale linear assignment problem. But is this expensive algorithmic approa...
Xiang Huang, Xiaolin Wu
COCOA
2007
Springer
14 years 4 months ago
A Lagrangian Relaxation Approach for the Multiple Sequence Alignment Problem
Abstract. We present a branch-and-bound (bb) algorithm for the multiple sequence alignment problem (MSA), one of the most important problems in computational biology. The upper bou...
Ernst Althaus, Stefan Canzar
ICMCS
2009
IEEE
205views Multimedia» more  ICMCS 2009»
13 years 8 months ago
Bregman vantage point trees for efficient nearest Neighbor Queries
Nearest Neighbor (NN) retrieval is a crucial tool of many computer vision tasks. Since the brute-force naive search is too time consuming for most applications, several tailored d...
Frank Nielsen, Paolo Piro, Michel Barlaud
ICDCS
1995
IEEE
14 years 1 months ago
A Competitive Analysis for Retransmission Timeout
Protocols that provide reliable communicationon top of a network that can lose packets rely on periodically retransmitting packets. The choice of retransmission timeout critically...
Shlomi Dolev, Michael Kate, Jennifer L. Welch