Sciweavers

998 search results - page 12 / 200
» From Feasible Proofs to Feasible Computations
Sort
View
CORR
2011
Springer
155views Education» more  CORR 2011»
12 years 11 months ago
On the Generation of Positivstellensatz Witnesses in Degenerate Cases
One can reduce the problem of proving that a polynomial is nonnegative, or more generally of proving that a system of polynomial inequalities has no solutions, to finding polynomi...
David Monniaux, Pierre Corbineau
HUMO
2007
Springer
14 years 1 months ago
3D Hand Tracking in a Stochastic Approximation Setting
Abstract. This paper introduces a hand tracking system with a theoretical proof of convergence. The tracking system follows a model-based approach and uses image-based cues, namely...
Desmond Chik, Jochen Trumpf, Nicol N. Schraudolph
ILP
2007
Springer
14 years 1 months ago
Structural Statistical Software Testing with Active Learning in a Graph
Structural Statistical Software Testing (SSST) exploits the control flow graph of the program being tested to construct test cases. Specifically, SSST exploits the feasible paths...
Nicolas Baskiotis, Michèle Sebag
LICS
2008
IEEE
14 years 1 months ago
On the Computational Complexity of Cut-Reduction
Using appropriate notation systems for proofs, cutreduction can often be rendered feasible on these notations. Explicit bounds can be given. Developing a suitable notation system ...
Klaus Aehlig, Arnold Beckmann
STOC
2012
ACM
225views Algorithms» more  STOC 2012»
11 years 10 months ago
An algorithmic characterization of multi-dimensional mechanisms
We obtain a characterization of feasible, Bayesian, multi-item multi-bidder mechanisms with independent, additive bidders as distributions over hierarchical mechanisms. Combined w...
Yang Cai, Constantinos Daskalakis, S. Matthew Wein...