4480 search results - page 351 / 896 » Prototyping Completion with Constraints Using Computational ... |
180
click to vote
COLING
2010
15 years 1 months ago
2010
Lexicalized Well-Founded Grammar (LWFG) is a recently developed syntacticsemantic grammar formalism for deep language understanding, which balances expressiveness with provable le...
165
click to vote
GRAPHICSINTERFACE
2007
15 years 8 months ago
2007
Material limitations and fabrication costs generally run at odds with the creativity of architectural design, producing a wealth of challenging computational geometry problems. We...
135
click to vote
MST
2008
15 years 6 months ago
2008
The Turing and many-one completeness notions for NP have been previously separated under measure, genericity, and bi-immunity hypotheses on NP. The proofs of all these results rel...
165
click to vote
DEBS
2009
ACM
16 years 1 months ago
2009
ACM
Complex middleware frameworks are made out of interacting components which may include bugs. These frameworks are often extended to provide additional features by thirdparty exten...
160
click to vote
CGI
1999
IEEE
15 years 11 months ago
1999
IEEE
One of the assumptions of current software for visualizing architecture is that the underlying geometry is a correct, objective, and complete representation of the objects in ques...