Sciweavers

846 search results - page 135 / 170
» Transforming structures by set interpretations
Sort
View
POPL
1994
ACM
14 years 24 days ago
Formally Optimal Boxing
An important implementation decision in polymorphically typed functional programming languages is whether to represent data in boxed or unboxed form and when to transform them fro...
Fritz Henglein, Jesper Jørgensen
MPC
2010
Springer
174views Mathematics» more  MPC 2010»
14 years 21 days ago
Matrices as Arrows!
cting programs and point-free abstraction [2]. In order to automatically generate the fast running code there was the need to use matrix product as the basic matrix composition ope...
Hugo Daniel Macedo, José Nuno Oliveira
NIPS
2001
13 years 10 months ago
K-Local Hyperplane and Convex Distance Nearest Neighbor Algorithms
Guided by an initial idea of building a complex (non linear) decision surface with maximal local margin in input space, we give a possible geometrical intuition as to why K-Neares...
Pascal Vincent, Yoshua Bengio
EDBT
2008
ACM
137views Database» more  EDBT 2008»
14 years 8 months ago
Data exchange in the presence of arithmetic comparisons
Data exchange is the problem of transforming data structured under a schema (called source) into data structured under a different schema (called target). The emphasis of data exc...
Foto N. Afrati, Chen Li, Vassia Pavlaki
JMIV
2006
128views more  JMIV 2006»
13 years 8 months ago
General Adaptive Neighborhood Image Processing:
The so-called General Adaptive Neighborhood Image Processing (GANIP) approach is presented in a two parts paper dealing respectively with its theoretical and practical aspects. The...
Johan Debayle, Jean-Charles Pinoli