Sciweavers

4095 search results - page 259 / 819
» How to test a tree
Sort
View
117
Voted
CP
2005
Springer
15 years 2 months ago
Using Boolean Constraint Propagation for Sub-clauses Deduction
Boolean Constraint Propagation (BCP) is recognized as one of the most useful technique for efficient satisfiability checking. In this paper a new extension of the scope of boole...
Sylvain Darras, Gilles Dequen, Laure Devendeville,...
SBBD
2007
149views Database» more  SBBD 2007»
15 years 2 months ago
Embedding Similarity Joins into Native XML Databases
Similarity joins in databases can be used for several important tasks such as data cleaning and instance-based data integration. In this paper, we explore ways how to support such ...
Leonardo Ribeiro, Theo Härder
UAI
2004
15 years 2 months ago
MOB-ESP and other Improvements in Probability Estimation
A key prerequisite to optimal reasoning under uncertainty in intelligent systems is to start with good class probability estimates. This paper improves on the current best probabi...
Rodney Nielsen
ACL
1992
15 years 1 months ago
A Functional Approach to Generation with TAG
It has been hypothesized that Tree Adjoining Grammar (TAG) is particularly well suited for sentence generation. It is unclear, however, how a sentence generation system based on T...
Kathleen F. McCoy, K. Vijay-Shanker, Gijoo Yang
110
Voted
DKE
2007
136views more  DKE 2007»
15 years 18 days ago
Deciding XPath containment with MSO
XPath is the standard language for addressing parts of an XML document. We present a sound and complete decision procedure for containment of XPath queries. The considered XPath f...
Pierre Genevès, Nabil Layaïda