Sciweavers

4114 search results - page 45 / 823
» Efficient Algorithms for the 2-Center Problems
Sort
View
TPDS
2008
68views more  TPDS 2008»
15 years 4 months ago
Continuous Delivery Message Dissemination Problems under the Multicasting Communication Mode
We consider the Continuous Delivery Message Dissemination (CDMD) problem over the n-processor single-port complete (all links are present and are bidirectional) static network with...
Teofilo F. Gonzalez
SADM
2008
178views more  SADM 2008»
15 years 3 months ago
Fast Projection-Based Methods for the Least Squares Nonnegative Matrix Approximation Problem
: Nonnegative matrix approximation (NNMA) is a popular matrix decomposition technique that has proven to be useful across a diverse variety of fields with applications ranging from...
Dongmin Kim, Suvrit Sra, Inderjit S. Dhillon
BMCBI
2010
189views more  BMCBI 2010»
15 years 4 months ago
Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh,...
112
Voted
TCAD
2008
75views more  TCAD 2008»
15 years 4 months ago
An Efficient Graph-Based Algorithm for ESD Current Path Analysis
Abstract--The electrostatic discharge (ESD) problem has become a challenging reliability issue in nanometer-circuit design. High voltages that resulted from ESD might cause high cu...
Chih-Hung Liu, Hung-Yi Liu, Chung-Wei Lin, Szu-Jui...
ICCV
2009
IEEE
1069views Computer Vision» more  ICCV 2009»
16 years 9 months ago
An efficient algorithm for Co-segmentation
This paper is focused on the Co-segmentation problem [1] – where the objective is to segment a similar object from a pair of images. The background in the two images may be ar...
Dorit S. Hochbaum, Vikas Singh