Sciweavers

1566 search results - page 132 / 314
» On a Cone Covering Problem
Sort
View
166
Voted
MFCS
2004
Springer
15 years 10 months ago
The Bidimensional Theory of Bounded-Genus Graphs
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitr...
170
Voted
FOCS
2004
IEEE
15 years 8 months ago
Stochastic Optimization is (Almost) as easy as Deterministic Optimization
Stochastic optimization problems attempt to model uncertainty in the data by assuming that (part of) the input is specified in terms of a probability distribution. We consider the...
David B. Shmoys, Chaitanya Swamy
JCO
2008
85views more  JCO 2008»
15 years 4 months ago
Locating and detecting arrays for interaction faults
The identification of interaction faults in component-based systems has focussed on indicating the presence of faults, rather than their location and magnitude. While this is a va...
Charles J. Colbourn, Daniel W. McClary
TOC
2008
122views more  TOC 2008»
15 years 4 months ago
Derandomizing the Ahlswede-Winter matrix-valued Chernoff bound using pessimistic estimators, and applications
: Ahlswede and Winter [IEEE Trans. Inf. Th. 2002] introduced a Chernoff bound for matrix-valued random variables, which is a non-trivial generalization of the usual Chernoff bound ...
Avi Wigderson, David Xiao
VRST
2009
ACM
15 years 11 months ago
The virtual magic lantern: an interaction metaphor for enhanced medical data inspection
In Volume Rendering, it is difficult to simultaneously visualize interior and exterior structures. Several approaches have been developed to solve this problem, such as cut-away ...
Eva Monclús, José Díaz, Isabe...