Sciweavers

1599 search results - page 270 / 320
» Algorithms for Parity Games
Sort
View
STOC
2006
ACM
121views Algorithms» more  STOC 2006»
15 years 10 months ago
Narrow proofs may be spacious: separating space and width in resolution
The width of a resolution proof is the maximal number of literals in any clause of the proof. The space of a proof is the maximal number of clauses kept in memory simultaneously if...
Jakob Nordström
ICALP
2009
Springer
15 years 10 months ago
Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Philip ...
SODA
2010
ACM
208views Algorithms» more  SODA 2010»
15 years 7 months ago
Correlation Robust Stochastic Optimization
We consider a robust model proposed by Scarf, 1958, for stochastic optimization when only the marginal probabilities of (binary) random variables are given, and the correlation be...
Shipra Agrawal, Yichuan Ding, Amin Saberi, Yinyu Y...
CIAC
2010
Springer
263views Algorithms» more  CIAC 2010»
15 years 7 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, ...
SI3D
2009
ACM
15 years 4 months ago
Perceptually consistent example-based human motion retrieval
Large amount of human motion capture data have been increasingly recorded and used in animation and gaming applications. Efficient retrieval of logically similar motions from a l...
Zhigang Deng, Qin Gu, Qing Li