Sciweavers

58 search results - page 6 / 12
» Inclusion Constraints over Non-empty Sets of Trees
Sort
View
AI
2010
Springer
13 years 7 months ago
Implementing logical connectives in constraint programming
Combining constraints using logical connectives such as disjunction is ubiquitous in constraint programming, because it adds considerable expressive power to a constraint language...
Christopher Jefferson, Neil C. A. Moore, Peter Nig...
IJCAI
2003
13 years 9 months ago
Inductive Learning in Less Than One Sequential Data Scan
Most recent research of scalable inductive learning on very large dataset, decision tree construction in particular, focuses on eliminating memory constraints and reducing the num...
Wei Fan, Haixun Wang, Philip S. Yu, Shaw-hwa Lo
EMNLP
2010
13 years 5 months ago
Top-Down Nearly-Context-Sensitive Parsing
We present a new syntactic parser that works left-to-right and top down, thus maintaining a fully-connected parse tree for a few alternative parse hypotheses. All of the commonly ...
Eugene Charniak
MICCAI
2008
Springer
14 years 8 months ago
Markov Dependence Tree-Based Segmentation of Deep Brain Structures
We propose a new framework for multi-object segmentation of deep brain structures, which have significant shape variations and relatively small sizes in medical brain images. In th...
Jue Wu, Albert C. S. Chung
ICDT
2009
ACM
135views Database» more  ICDT 2009»
14 years 2 months ago
Repair checking in inconsistent databases: algorithms and complexity
Managing inconsistency in databases has long been recognized as an important problem. One of the most promising approaches to coping with inconsistency in databases is the framewo...
Foto N. Afrati, Phokion G. Kolaitis