Sciweavers

129 search results - page 26 / 26
» Compiling Possibilistic Knowledge Bases
Sort
View
EACL
2003
ACL Anthology
13 years 6 months ago
Topological Parsing
We present a new grammar formalism for parsing with freer word-order languages, motivated by recent linguistic research in German and the Slavic languages. Unlike CFGs, these gram...
Gerald Penn, Mohammad Haji-Abdolhosseini
NIPS
1994
13 years 6 months ago
Using a neural net to instantiate a deformable model
Deformable models are an attractive approach to recognizing nonrigid objects which have considerable within class variability. However, there are severe search problems associated...
Christopher K. I. Williams, Michael Revow, Geoffre...
SMR
1998
89views more  SMR 1998»
13 years 4 months ago
Little languages: little maintenance?
So-called little, or domain-specific languages (DSLs), have the potential to make software maintenance simpler: domain-experts can directly use the DSL to make required routine m...
Arie van Deursen, Paul Klint
SIGPLAN
2002
13 years 4 months ago
Write barrier removal by static analysis
We present a new analysis for removing unnecessary write barriers in programs that use generational garbage collection. To our knowledge, this is the first static program analysis...
Karen Zee, Martin C. Rinard