Sciweavers

4110 search results - page 481 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
ACL
2010
15 years 4 months ago
Dynamic Programming for Linear-Time Incremental Parsing
Incremental parsing techniques such as shift-reduce have gained popularity thanks to their efficiency, but there remains a major problem: the search is greedy and only explores a ...
Liang Huang, Kenji Sagae
DLOG
2010
15 years 4 months ago
Correcting Access Restrictions to a Consequence
Recent research has shown that annotations are useful for representing access restrictions to the axioms of an ontology and their implicit consequences. Previous work focused on co...
Martin Knechtel, Rafael Peñaloza
ICCAD
2010
IEEE
140views Hardware» more  ICCAD 2010»
15 years 4 months ago
Reduction of interpolants for logic synthesis
Craig Interpolation is a state-of-the-art technique for logic synthesis and verification, based on Boolean Satisfiability (SAT). Leveraging the efficacy of SAT algorithms, Craig In...
John D. Backes, Marc D. Riedel
ICIP
2010
IEEE
15 years 4 months ago
Bayesian regularization of diffusion tensor images using hierarchical MCMC and loopy belief propagation
Based on the theory of Markov Random Fields, a Bayesian regularization model for diffusion tensor images (DTI) is proposed in this paper. The low-degree parameterization of diffus...
Siming Wei, Jing Hua, Jiajun Bu, Chun Chen, Yizhou...
ICIP
2010
IEEE
15 years 4 months ago
Monocular Extraction of 2.1D Sketch
The 2.1D sketch is a layered representation of occluding and occluded surfaces of the scene. Extracting the 2.1D sketch from a single image is a difficult and important problem ar...
Mohamed Amer, Raviv Raich, Sinisa Todorovic