Sciweavers

13603 search results - page 269 / 2721
» On the Computational Complexity of Cut-Reduction
Sort
View
CSL
2010
Springer
15 years 8 months ago
On the Computability of Region-Based Euclidean Logics
By a Euclidean logic, we understand a formal language whose variables range over subsets of Euclidean space, of some fixed dimension, and whose non-logical primitives have fixed me...
Yavor Nenov, Ian Pratt-Hartmann
ECAI
2010
Springer
15 years 8 months ago
Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods
We study the problem of fairly dividing a set of goods amongst a group of agents, when those agents have preferences that are ordinal relations over alternative bundles of goods (r...
Sylvain Bouveret, Ulle Endriss, Jérôm...
BMCBI
2010
123views more  BMCBI 2010»
15 years 7 months ago
Computationally efficient flux variability analysis
Background: Flux variability analysis is often used to determine robustness of metabolic models in various simulation conditions. However, its use has been somehow limited by the ...
Steinn Gudmundsson, Ines Thiele
IJCV
2006
227views more  IJCV 2006»
15 years 6 months ago
A Multigrid Platform for Real-Time Motion Computation with Discontinuity-Preserving Variational Methods
Variational methods are among the most accurate techniques for estimating the optic flow. They yield dense flow fields and can be designed such that they preserve discontinuities, ...
Andrés Bruhn, Joachim Weickert, Timo Kohlbe...
CORR
1999
Springer
65views Education» more  CORR 1999»
15 years 6 months ago
Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets
It is known that for any class C closed under union and intersection, the Boolean closure of C, the Boolean hierarchy over C, and the symmetric difference hierarchy over C all are ...
Lane A. Hemaspaandra, Jörg Rothe