151 search results - page 8 / 31 » Computable Shell Decomposition Bounds |
116
click to vote
ACL
2011
14 years 3 months ago
2011
Via an oracle experiment, we show that the upper bound on accuracy of a CCG parser is significantly lowered when its search space is pruned using a supertagger, though the supert...
103
click to vote
ASAP
2009
IEEE
15 years 8 months ago
2009
IEEE
—Molecular dynamics simulation based on discrete event simulation (DMD) is emerging as an alternative to time-step driven molecular dynamics (MD). DMD uses simplified discretize...
102
click to vote
JOCN
2010
14 years 10 months ago
2010
■ We employ a single-trial correlational MEG analysis technique to investigate early processing in the visual recognition of morphologically complex words. Three classes of affi...
SOFSEM
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Treewidth is a graph parameter with several interesting theoretical and practical applications. This survey reviews algorithmic results on determining the treewidth of a ...
96
Voted
DAC
1999
ACM
16 years 20 days ago
1999
ACM
Finding the minimum column multiplicity for a bound set of variables is an important problem in Curtis decomposition. To investigate this problem, we compared two graphcoloring pr...