Sciweavers

661 search results - page 4 / 133
» Combining Information using Hard Constraints
Sort
View
ACL
2008
13 years 11 months ago
Joint Word Segmentation and POS Tagging Using a Single Perceptron
For Chinese POS tagging, word segmentation is a preliminary step. To avoid error propagation and improve segmentation by utilizing POS information, segmentation and tagging can be...
Yue Zhang 0004, Stephen Clark
CPAIOR
2010
Springer
13 years 7 months ago
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
Peter J. Stuckey
SPEECH
2011
13 years 4 months ago
Combining localization cues and source model constraints for binaural source separation
We describe a system for separating multiple sources from a two-channel recording based on interaural cues and prior knowledge of the statistics of the underlying source signals. ...
Ron J. Weiss, Michael I. Mandel, Daniel P. W. Elli...
TIT
2008
102views more  TIT 2008»
13 years 9 months ago
Extremal Problems of Information Combining
Abstract--In this paper, we study moments of soft bits of binary-input symmetric-output channels and solve some extremal problems of the moments. We use these results to solve the ...
Yibo Jiang, Alexei E. Ashikhmin, Ralf Koetter, And...
EMNLP
2008
13 years 11 months ago
Jointly Combining Implicit Constraints Improves Temporal Ordering
Previous work on ordering events in text has typically focused on local pairwise decisions, ignoring globally inconsistent labels. However, temporal ordering is the type of domain...
Nathanael Chambers, Daniel Jurafsky