3771 search results - page 174 / 755 » Subobject Transformation Systems |
146
Voted
ICPR
2008
IEEE
16 years 4 months ago
2008
IEEE
A framework for mapping a polar-like coordinate system to a non-rigid shape is presented. Using a graph pyramid, a binary shape is decomposed into connected parts, based on its st...
122
Voted
IANDC
2000
15 years 3 months ago
2000
Abstract. We present a uniform algorithm for transforming machine-found matrix proofs in classical, constructive, and modal logics into sequent proofs. It is based on unified repre...
124
Voted
NAACL
2010
15 years 1 months ago
2010
This paper contributes a formalization of frame-semantic parsing as a structure prediction problem and describes an implemented parser that transforms an English sentence into a f...
152
Voted
ESSLLI
2009
Springer
15 years 1 months ago
2009
Springer
The polynomial path order (POP for short) is a termination method that induces polynomial bounds on the innermost runtime complexity of term rewrite systems (TRSs for short). Seman...
109
Voted
SIGSOFT
1996
ACM
15 years 7 months ago
1996
ACM
Abstractions in Large Systems William G. Griswold, Member, IEEE, Morison I. Chen, Robert W. Bowdidge, Jenny L. Cabaniss, Van B. Nguyen, and J. David Morgenthaler Restructuring soft...