Sciweavers

3670 search results - page 90 / 734
» Linear Recursive Functions
Sort
View
ENTCS
2007
102views more  ENTCS 2007»
15 years 2 months ago
Functional Programming With Higher-order Abstract Syntax and Explicit Substitutions
syntax and explicit substitutions Brigitte Pientka1 School of Computer Science McGill University Montreal, Canada This paper sketches a foundation for programming with higher-orde...
Brigitte Pientka
131
Voted
PPDP
2004
Springer
15 years 8 months ago
Semi-naive evaluation in linear tabling
Semi-naive evaluation is an effective technique employed in bottom-up evaluation of logic programs to avoid redundant joins of answers. The impact of this technique on top-down e...
Neng-Fa Zhou, Yi-Dong Shen, Taisuke Sato
JMLR
2006
105views more  JMLR 2006»
15 years 2 months ago
Expectation Correction for Smoothed Inference in Switching Linear Dynamical Systems
We introduce a method for approximate smoothed inference in a class of switching linear dynamical systems, based on a novel form of Gaussian Sum smoother. This class includes the ...
David Barber
ACCV
2010
Springer
14 years 9 months ago
Linear Solvability in the Viewing Graph
The Viewing Graph [1] represents several views linked by the corresponding fundamental matrices, estimated pairwise. Given a Viewing Graph, the tuples of consistent camera matrices...
Alessandro Rudi, Matia Pizzoli, Fiora Pirri
ACISICIS
2005
IEEE
15 years 4 months ago
Equivalence of Transforming Non-Linear DACG to Linear Concept Tree
This paper introduces a strategy and its theory proof to transform non-linear concept graph: Directed Acyclic Concept Graph (DACG) into a linear concept tree. The transformation i...
Wenyi Bi, Junping Sun