Sciweavers

25 search results - page 4 / 5
» A Constraint Satisfaction Approach to Dependency Parsing
Sort
View
AI
2003
Springer
13 years 10 months ago
A Graph Based Backtracking Algorithm for Solving General CSPs
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...
Wanlin Pang, Scott D. Goodwin
ANLP
1997
106views more  ANLP 1997»
13 years 6 months ago
Incremental Finite-State Parsing
This paper describes a new finite-state shallow parser. It merges constructive and reductionist approaches within a highly modular architecture. Syntactic information is added at ...
Salah Ait-Mokhtar, Jean-Pierre Chanod
HUMO
2007
Springer
13 years 11 months ago
Boosted Multiple Deformable Trees for Parsing Human Poses
Tree-structured models have been widely used for human pose estimation, in either 2D or 3D. While such models allow efficient learning and inference, they fail to capture additiona...
Yang Wang 0003, Greg Mori
ACL
2010
13 years 3 months ago
Automatic Generation of Story Highlights
In this paper we present a joint content selection and compression model for single-document summarization. The model operates over a phrase-based representation of the source doc...
Kristian Woodsend, Mirella Lapata
ICDE
2010
IEEE
212views Database» more  ICDE 2010»
13 years 5 months ago
Cleansing uncertain databases leveraging aggregate constraints
— Emerging uncertain database applications often involve the cleansing (conditioning) of uncertain databases using additional information as new evidence for reducing the uncerta...
Haiquan Chen, Wei-Shinn Ku, Haixun Wang