Sciweavers

350 search results - page 67 / 70
» Branching Programs for Tree Evaluation
Sort
View
FOCS
1998
IEEE
13 years 10 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello
ESWA
2007
176views more  ESWA 2007»
13 years 6 months ago
Credit scoring with a data mining approach based on support vector machines
The credit card industry has been growing rapidly recently, and thus huge numbers of consumers’ credit data are collected by the credit department of the bank. The credit scorin...
Cheng-Lung Huang, Mu-Chen Chen, Chieh-Jen Wang
CVPR
2007
IEEE
14 years 8 months ago
Efficient MRF Deformation Model for Non-Rigid Image Matching
We propose a novel MRF-based model for deformable image matching (also known as registration). The deformation is described by a field of discrete variables, representing displace...
Alexander Shekhovtsov, Ivan Kovtun, Václav ...
KBSE
2009
IEEE
14 years 29 days ago
Static Validation of C Preprocessor Macros
—The widely used C preprocessor (CPP) is generally considered a source of difficulty for understanding and maintaining C/C++ programs. The main reason for this difficulty is CP...
Andreas Saebjoernsen, Lingxiao Jiang, Daniel J. Qu...
CPAIOR
2009
Springer
14 years 24 days ago
Modelling Search Strategies in Rules2CP
In this abstract, we present a rule-based modelling language for constraint programming, called Rules2CP [1], and a library PKML for modelling packing problems. Unlike other modell...
François Fages, Julien Martin