Sciweavers

1117 search results - page 89 / 224
» Equivalent Representations of Set Functions
Sort
View
LPNMR
2009
Springer
15 years 4 months ago
The Complexity of Circumscriptive Inference in Post's Lattice
Circumscription is one of the most important formalisms for reasoning with incomplete information. It is equivalent to reasoning under the extended closed world assumption, which a...
Michael Thomas
MICCAI
2003
Springer
15 years 10 months ago
Statistical Shape Modeling of Unfolded Retinotopic Maps for a Visual Areas Probabilistic Atlas
Abstract. This paper proposes a statistical model of functional landmarks delimiting low level visual areas which are highly variable across individuals. Low level visual areas are...
Isabelle Corouge, Michel Dojat, Christian Barillot
VLSID
2003
IEEE
126views VLSI» more  VLSID 2003»
15 years 10 months ago
Comparison of Heuristic Algorithms for Variable Partitioning in Circuit Implementation
Functional decomposition is a process of splitting a complex circuit into smaller sub-circuits. This paper deals with the problem of determining the set of best free and bound var...
Muthukumar Venkatesan, Henry Selvaraj
ICPR
2008
IEEE
15 years 4 months ago
Non-Abelian invariant feature detection
We present a novel formulation of non-Abelian invariant feature detection. By choosing suitable measuring functions, we show that the measuring space and the corresponding feature...
Yaniv Gur, Nir A. Sochen
EACL
1993
ACL Anthology
14 years 11 months ago
Type-Driven Semantic Interpretation of f-Structures
The formal architecture of Lexical Functional Grammar offers a particular formal device, the structural correspondence, for modularizing the mapping between the surface forms of a...
Jürgen Wedekind, Ronald M. Kaplan