Sciweavers

1272 search results - page 82 / 255
» The Set Cover with Pairs Problem
Sort
View
COCOON
2007
Springer
15 years 7 months ago
The Informational Content of Canonical Disjoint NP-Pairs
We investigate the connection between propositional proof systems and their canonical pairs. It is known that simulations between proof systems translate to reductions between the...
Christian Glaßer, Alan L. Selman, Liyu Zhang
104
Voted
PODC
2009
ACM
16 years 1 months ago
Oblivious interference scheduling
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
Alexander Fanghänel, Berthold Vöcking, H...
96
Voted
RECOMB
2004
Springer
16 years 1 months ago
Perfect phylogeny and haplotype assignment
This paper is concerned with the reconstruction of perfect phylogenies from binary character data with missing values, and related problems of inferring complete haplotypes from h...
Eran Halperin, Richard M. Karp
DCC
2006
IEEE
16 years 12 days ago
Optimal Prefix Codes for Some Families of Two-Dimensional Geometric Distributions
Lossless compression is studied for pairs of independent integer-valued symbols emitted by a source with a geometric probability distribution of parameter q (0, 1). Optimal prefix...
Alfredo Viola, Frédérique Bassino, G...
126
Voted
CORR
2011
Springer
179views Education» more  CORR 2011»
14 years 7 months ago
Recovery of Sparsely Corrupted Signals
We investigate the recovery of signals exhibiting a sparse representation in a general (i.e., possibly redundant or incomplete) dictionary that are corrupted by additive noise adm...
Christoph Studer, Patrick Kuppinger, Graeme Pope, ...