Sciweavers

5090 search results - page 465 / 1018
» Constructing Strategies for Programming
Sort
View
APAL
2005
107views more  APAL 2005»
15 years 6 months ago
Uniform Heyting arithmetic
We present an extension of Heyting Arithmetic in finite types called Uniform Heyting Arithmetic (HAu) that allows for the extraction of optimized programs from constructive and cla...
Ulrich Berger
165
Voted
IJCV
2002
156views more  IJCV 2002»
15 years 6 months ago
Trinocular Stereo Using Shortest Paths and the Ordering Constraint
This paper describes a new algorithm for disparity estimation using trinocular stereo. The three cameras are placed in a right angled configuration. A graph is then constructed wh...
Motilal Agrawal
MP
1998
105views more  MP 1998»
15 years 6 months ago
Balinski-Tucker simplex tableaus: Dimensions, degeneracy degrees, and interior points of optimal faces
This paper shows the relationship between degeneracy degrees and multiplicities in linear programming models. The usual definition of degeneracy is restricted to vertices of a po...
Gert A. Tijssen, Gerard Sierksma
ML
2010
ACM
159views Machine Learning» more  ML 2010»
15 years 5 months ago
Algorithms for optimal dyadic decision trees
Abstract A dynamic programming algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data ...
Don R. Hush, Reid B. Porter
PPDP
2010
Springer
15 years 5 months ago
Functional derivation of a virtual machine for delimited continuations
This paper connects the definitional interpreter for the λ-calculus extended with delimited continuation constructs, shift and reset, with a compiler and a low-level virtual mac...
Kenichi Asai, Arisa Kitani