Sciweavers

151 search results - page 8 / 31
» Computable Shell Decomposition Bounds
Sort
View
ACL
2011
13 years 1 days ago
A Comparison of Loopy Belief Propagation and Dual Decomposition for Integrated CCG Supertagging and Parsing
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...
Michael Auli, Adam Lopez
ASAP
2009
IEEE
142views Hardware» more  ASAP 2009»
14 years 5 months ago
Parallel Discrete Event Simulation of Molecular Dynamics Through Event-Based Decomposition
—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...
Martin C. Herbordt, Md. Ashfaquzzaman Khan, Tony D...
JOCN
2010
126views more  JOCN 2010»
13 years 6 months ago
Evidence for Early Morphological Decomposition in Visual Word Recognition
■ 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...
Olla Solomyak, Alec Marantz
SOFSEM
2005
Springer
14 years 1 months ago
Discovering Treewidth
Abstract. Treewidth is a graph parameter with several interesting theoretical and practical applications. This survey reviews algorithmic results on determining the treewidth of a ...
Hans L. Bodlaender
DAC
1999
ACM
14 years 9 months ago
Graph Coloring Algorithms for Fast Evaluation of Curtis Decompositions
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...
Marek A. Perkowski, Rahul Malvi, Stan Grygiel, Mic...