Sciweavers

306 search results - page 35 / 62
» Parallel approximation algorithms for facility-location prob...
Sort
View
CISS
2008
IEEE
15 years 10 months ago
Distributed processing in frames for sparse approximation
—Beyond signal processing applications, frames are also powerful tools for modeling the sensing and information processing of many biological and man-made systems that exhibit in...
Christopher J. Rozell
156
Voted
BMCBI
2006
138views more  BMCBI 2006»
15 years 3 months ago
Approximation properties of haplotype tagging
Background: Single nucleotide polymorphisms (SNPs) are locations at which the genomic sequences of population members differ. Since these differences are known to follow patterns,...
Staal A. Vinterbo, Stephan Dreiseitl, Lucila Ohno-...
138
Voted
CIAC
2000
Springer
210views Algorithms» more  CIAC 2000»
15 years 8 months ago
Computing a Diameter-Constrained Minimum Spanning Tree in Parallel
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
Narsingh Deo, Ayman Abdalla
DCOSS
2011
Springer
14 years 3 months ago
Distributed local broadcasting algorithms in the physical interference model
—Given a set of sensor nodes V where each node wants to broadcast a message to all its neighbors that are within a certain broadcasting range, the local broadcasting problem is t...
Dongxiao Yu, Yuexuan Wang, Qiang-Sheng Hua, Franci...
SIAMCO
2010
128views more  SIAMCO 2010»
15 years 2 months ago
A Parallel Splitting Method for Coupled Monotone Inclusions
A parallel splitting method is proposed for solving systems of coupled monotone inclusions in Hilbert spaces, and its convergence is established under the assumption that solutions...
Hedy Attouch, Luis M. Briceño-Arias, Patric...