58 search results - page 3 / 12 » From Implicit via Inductive to Explicit Definitions |
ICML
2002
IEEE
14 years 8 months ago
2002
IEEE
Kernel-based learning algorithms work by embedding the data into a Euclidean space, and then searching for linear relations among the embedded data points. The embedding is perfor...
CSCW
2011
ACM
13 years 2 months ago
2011
ACM
Long-distance couples face considerable communication challenges in their relationships. Unlike collocated couples, long-distance couples lack awareness cues associated with physi...
CAD
2004
Springer
13 years 7 months ago
2004
Springer
Solid modeling based on partial differential equations (PDEs) can potentially unify both geometric constraints and functional requirements within a single design framework to mode...
POPL
2010
ACM
14 years 5 months ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
TPHOL
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract. FinFuns are total functions that are constant except for a finite set of points, i.e. a generalisation of finite maps. We formalise them in Isabelle/HOL and present how...