Sciweavers

1220 search results - page 46 / 244
» Minimal Interval Completions
Sort
View
CIAC
2010
Springer
263views Algorithms» more  CIAC 2010»
15 years 9 months ago
The Complexity of Computing Minimal Unidirectional Covering Sets
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...
Dorothea Baumeister, Felix Brandt, Felix Fischer, ...
CVPR
2010
IEEE
15 years 8 months ago
Ink-Bleed Reduction using Functional Minimization
Ink-bleed interference is undesirable as it reduces the legibility and aesthetics of affected documents. We present a novel approach to reduce ink-bleed interference using functio...
Grani Adiwena Hanasusanto, Michael Brown, Zheng Wu
CDC
2008
IEEE
125views Control Systems» more  CDC 2008»
15 years 6 months ago
Dynamical structure analysis of sparsity and minimality heuristics for reconstruction of biochemical networks
— Network reconstruction, i.e. obtaining network structure from input-output information, is a central theme in systems biology. A variety of approaches aim to obtaining structur...
Russell Howes, Lee John Eccleston, Jorge M. Goncal...
CORR
2010
Springer
116views Education» more  CORR 2010»
14 years 12 months ago
Interference Alignment as a Rank Constrained Rank Minimization
Abstract--We show that the maximization of the sum degreesof-freedom for the static flat-fading multiple-input multipleoutput (MIMO) interference channel is equivalent to a rank co...
Dimitris S. Papailiopoulos, Alexandros G. Dimakis
AAAI
2008
15 years 2 months ago
Computing Minimal Diagnoses by Greedy Stochastic Search
Most algorithms for computing diagnoses within a modelbased diagnosis framework are deterministic. Such algorithms guarantee soundness and completeness, but are P 2 hard. To overc...
Alexander Feldman, Gregory M. Provan, Arjan J. C. ...