Sciweavers

306 search results - page 7 / 62
» Underspecified computation of normal forms
Sort
View
ACL
2012
11 years 10 months ago
Strong Lexicalization of Tree Adjoining Grammars
Recently, it was shown (KUHLMANN, SATTA: Tree-adjoining grammars are not closed under strong lexicalization. Comput. Linguist., 2012) that finitely ambiguous tree adjoining gramm...
Andreas Maletti, Joost Engelfriet
SIBGRAPI
2003
IEEE
14 years 23 days ago
An Approximation for Normal Vectors of Deformable Models
A physically-based deformable model proposed by Terzopoulous et al. is governed by the Lagrange’s form, that establishes the relation between the dynamics of deformable models un...
Shin-Ting Wu, Vanio Fragoso de Melo
AIPS
2009
13 years 8 months ago
A Conformant Planner with Explicit Disjunctive Representation of Belief States
This paper describes a novel and competitive complete conformant planner. Key to the enhanced performance is an efficient encoding of belief states as disjunctive normal form form...
Son Thanh To, Enrico Pontelli, Tran Cao Son
GCC
2005
Springer
14 years 1 months ago
RSM and SLN: Transformation, Normalization and Cooperation
The Resource Space Model RSM and Semantic Link Network SLN are models of future interconnection environment, and the combination of them forms a rich semantic layer for the next-ge...
Erlin Yao, Yunpeng Xing, Jie Liu, Xiaoping Sun
WAN
1998
Springer
13 years 11 months ago
Some Performance Studies in Exact Linear Algebra
We consider parallel algorithms for computing the Hermite normal form of matrices over Euclidean rings. We use standard types of reduction methods which are the basis of many algor...
George Havas, Clemens Wagner 0002