Sciweavers

730 search results - page 84 / 146
» Combinatorics of Monotone Computations
Sort
View
TAPSOFT
1991
Springer
13 years 11 months ago
Type Inference with Inequalities
Type inference can be phrased as constraint-solving over types. We consider an implicitly typed language equipped with recursive types, multiple inheritance, 1st order parametric ...
Michael I. Schwartzbach
SODA
2008
ACM
71views Algorithms» more  SODA 2008»
13 years 9 months ago
Two-phase greedy algorithms for some classes of combinatorial linear programs
We present greedy algorithms for some classes of combinatorial packing and cover problems within the general formal framework of Hoffman and Schwartz' lattice polyhedra. Our ...
Ulrich Faigle, Britta Peis
DICTA
2003
13 years 9 months ago
Embedded Voxel Colouring
Abstract. The reconstruction of a complex scene from multiple images is a fundamental problem in the field of computer vision. Volumetric methods have proven to be a strong altern...
Carlos Leung, Ben Appleton, Changming Sun
UAI
1998
13 years 9 months ago
Large Deviation Methods for Approximate Probabilistic Inference
We study two-layer belief networks of binary random variables in which the conditional probabilities Pr childjparents depend monotonically on weighted sums of the parents. In larg...
Michael J. Kearns, Lawrence K. Saul
CORR
2007
Springer
169views Education» more  CORR 2007»
13 years 7 months ago
Algorithmic Complexity Bounds on Future Prediction Errors
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true d...
Alexey V. Chernov, Marcus Hutter, Jürgen Schm...