Sciweavers

4716 search results - page 438 / 944
» Tangible functional programming
Sort
View
ALT
2001
Springer
16 years 3 months ago
Learning How to Separate
The main question addressed in the present work is how to find effectively a recursive function separating two sets drawn arbitrarily from a given collection of disjoint sets. I...
Sanjay Jain, Frank Stephan
ICDT
1995
ACM
96views Database» more  ICDT 1995»
15 years 10 months ago
On Two Forms of Structural Recursion
We investigate and compare two forms of recursion on sets for querying nested collections. The rst one is called sri and it corresponds to sequential processing of data. The second...
Dan Suciu, Limsoon Wong
ICPR
2004
IEEE
16 years 8 months ago
An Energy Minimisation Approach to Stereo-Temporal Dense Reconstruction
We propose a novel energy minimisation framework for the dense reconstruction of stereo image sequences that incorporates data fidelity as well as spatial and temporal regularity....
Ben Appleton, Brian C. Lovell, Carlos Leung, Chang...
155
Voted
ICML
2006
IEEE
16 years 7 months ago
Robust Euclidean embedding
We derive a robust Euclidean embedding procedure based on semidefinite programming that may be used in place of the popular classical multidimensional scaling (cMDS) algorithm. We...
Lawrence Cayton, Sanjoy Dasgupta
298
Voted
POPL
2009
ACM
16 years 7 months ago
Flexible types: robust type inference for first-class polymorphism
We present HML, a type inference system that supports full firstclass polymorphism where few annotations are needed: only function parameters with a polymorphic type need to be an...
Daan Leijen