Sciweavers

2834 search results - page 101 / 567
» Representing Trees with Constraints
Sort
View
ISMIS
2000
Springer
14 years 1 months ago
Top-Down Query Processing in First Order Deductive Databases under the DWFS
A top-down query processing method for first order deductive databases under the disjunctive well-founded semantics (DWFS) is presented. The method is based upon a characterisation...
C. A. Johnson
EMNLP
2007
13 years 11 months ago
Phrase Reordering Model Integrating Syntactic Knowledge for SMT
Reordering model is important for the statistical machine translation (SMT). Current phrase-based SMT technologies are good at capturing local reordering but not global reordering...
Dongdong Zhang, Mu Li, Chi-Ho Li, Ming Zhou
COCOA
2010
Springer
13 years 8 months ago
Feasibility-Based Bounds Tightening via Fixed Points
Abstract. The search tree size of the spatial Branch-and-Bound algorithm for Mixed-Integer Nonlinear Programming depends on many factors, one of which is the width of the variable ...
Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Libert...
FSKD
2005
Springer
128views Fuzzy Logic» more  FSKD 2005»
14 years 3 months ago
Automatic Creation of Links: An Approach Based on Decision Tree
With the dramatic development of web technologies, tremendous amount of information become available to users. The great advantages of the web are the ease with which information c...
Peng Li, Seiji Yamada
CIAC
2010
Springer
232views Algorithms» more  CIAC 2010»
14 years 1 months ago
Multicut Algorithms via Tree Decompositions
Various forms of multicut problems are of great importance in the area of network design. In general, these problems are intractable. However, several parameters have been identifi...
Reinhard Pichler, Stefan Rümmele, Stefan Woltran