Sciweavers

406 search results - page 29 / 82
» Kernelization and Complexity Results for Connectivity Augmen...
Sort
View
CIE
2007
Springer
15 years 10 months ago
Computational Complexity of Constraint Satisfaction
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
Heribert Vollmer
BMCBI
2010
161views more  BMCBI 2010»
15 years 1 months ago
LTC: a novel algorithm to improve the efficiency of contig assembly for physical mapping in complex genomes
Background: Physical maps are the substrate of genome sequencing and map-based cloning and their construction relies on the accurate assembly of BAC clones into large contigs that...
Zeev Frenkel, Etienne Paux, David I. Mester, Cathe...
IJON
2006
87views more  IJON 2006»
15 years 4 months ago
Translation-invariant classification of non-stationary signals
Non-stationary signal classification is a complex problem. This problem becomes even more difficult if we add the following hypothesis: each signal includes a discriminant wavefor...
Vincent Guigue, Alain Rakotomamonjy, Stépha...
CDC
2009
IEEE
151views Control Systems» more  CDC 2009»
15 years 8 months ago
A poset framework to model decentralized control problems
— In this paper we use partially ordered sets (posets) to study decentralized control problems arising in different settings. We show that time delayed systems with certain dela...
Parikshit Shah, Pablo A. Parrilo
COCO
2003
Springer
162views Algorithms» more  COCO 2003»
15 years 9 months ago
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
Amit Chakrabarti, Subhash Khot, Xiaodong Sun