287 search results - page 11 / 58 » Data-Driven Constructive Induction |
124
Voted
LPAR
2010
Springer
15 years 2 months ago
2010
Springer
Termination of recursive functions is an important property in proof assistants based on dependent type theories; it implies consistency and decidability of type checking. Type-bas...
125
click to vote
TLCA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
134
Voted
ASPDAC
2005
ACM
15 years 5 months ago
2005
ACM
Abstract— The sparsification of the reluctance matrix L−1 (where L denotes the usual inductance matrix L) has been widely used in several recent investigations to make the pro...
103
Voted
ICCAD
2002
IEEE
16 years 13 days ago
2002
IEEE
In this paper, we present a novel wire duplication-based interconnect modeling technique. The proposed modeling technique exploits the sparsity of the L 1 matrix, where L is the ...
118
Voted
ACL
2009
15 years 1 months ago
2009
Identifying whether a multi-word expression (MWE) is compositional or not is important for numerous NLP applications. Sense induction can partition the context of MWEs into semant...