Sciweavers

3898 search results - page 187 / 780
» On the Bit Extraction Problem
Sort
View
ICGI
2004
Springer
15 years 8 months ago
Learning Node Selecting Tree Transducer from Completely Annotated Examples
Abstract. A base problem in Web information extraction is to find appropriate queries for informative nodes in trees. We propose to learn queries for nodes in trees automatically ...
Julien Carme, Aurélien Lemay, Joachim Niehr...
GECCO
2006
Springer
165views Optimization» more  GECCO 2006»
15 years 6 months ago
Multiobjective genetic rule selection as a data mining postprocessing procedure
In this paper, we show the usefulness of multiobjective genetic rule selection as a postprocessing procedure in data mining for pattern classification problems. First we extract a...
Hisao Ishibuchi, Yusuke Nojima, Isao Kuwajima
CLA
2004
15 years 4 months ago
A new Informative Generic Base of Association Rules
The problem of the relevance and the usefulness of extracted association rules is becoming of primary importance, since an overwhelming number of association rules may be derived f...
Ghada Gasmi, Sadok Ben Yahia, Engelbert Mephu Ngui...
EUROCRYPT
2004
Springer
15 years 8 months ago
Finding Small Roots of Bivariate Integer Polynomial Equations Revisited
At Eurocrypt ’96, Coppersmith proposed an algorithm for finding small roots of bivariate integer polynomial equations, based on lattice reduction techniques. But the approach is...
Jean-Sébastien Coron
SODA
2004
ACM
58views Algorithms» more  SODA 2004»
15 years 4 months ago
Point containment in the integer hull of a polyhedron
We show that the point containment problem in the integer hull of a polyhedron, which is defined by m inequalities, with coefficients of at most bits can be solved in time O(m + ...
Ernst Althaus, Friedrich Eisenbrand, Stefan Funke,...