555 search results - page 44 / 111 » Decompositions of Grammar Constraints |
116
Voted
DATE
2005
IEEE
15 years 6 months ago
2005
IEEE
In this paper, we present a methodology for customized communication architecture synthesis that matches the communication requirements of the target application. This is an impor...
86
Voted
AIPS
2008
15 years 3 months ago
2008
We consider a generalization of the PDB homomorphism abstractions to what is called "structural patterns". The bais in abstracting the problem in hand into provably trac...
104
Voted
COLING
1996
15 years 2 months ago
1996
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
116
click to vote
CERA
2002
15 years 15 days ago
2002
: Many industries are shifting from mass production to mass customization, which demands quick response to the needs of individual customers with high quality and low costs. The de...
127
Voted
ASPDAC
2010
ACM
14 years 10 months ago
2010
ACM
As Double Patterning Lithography(DPL) becomes the leading candidate for sub-30nm lithography process, we need a fast and lithography friendly decomposition framework. In this pape...