Sciweavers

2698 search results - page 56 / 540
» Approximation Algorithms for the Weighted Independent Set Pr...
Sort
View
BMCBI
2010
153views more  BMCBI 2010»
13 years 7 months ago
Metamotifs - a generative model for building families of nucleotide position weight matrices
Background: Development of high-throughput methods for measuring DNA interactions of transcription factors together with computational advances in short motif inference algorithms...
Matias Piipari, Thomas A. Down, Tim J. P. Hubbard
KR
2010
Springer
14 years 14 days ago
Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough
Cardinality constraints or, more generally, weight constraints are well recognized as an important extension of answer-set programming. Clearly, all common algorithmic tasks relat...
Reinhard Pichler, Stefan Rümmele, Stefan Szei...
ADHOCNOW
2008
Springer
14 years 2 months ago
Novel Algorithms for the Network Lifetime Problem in Wireless Settings
Abstract. A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited, nonreplenishable battery charge. The batte...
Michael Elkin, Yuval Lando, Zeev Nutov, Michael Se...
PDCAT
2005
Springer
14 years 1 months ago
Approximating Spanning Trees with Inner Nodes Cost
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
Rudolf Fleischer, Qi Ge, Jian Li, Shijun Tian, Hai...
ALGORITHMICA
2004
130views more  ALGORITHMICA 2004»
13 years 7 months ago
The Power of Priority Algorithms for Facility Location and Set Cover
We apply and extend the priority algorithm framework introduced by Borodin, Nielsen, and Rackoff to define "greedy-like" algorithms for the (uncapacitated) facility locat...
Spyros Angelopoulos, Allan Borodin