Sciweavers

870 search results - page 49 / 174
» Theoretical and experimental results on the goal-plan tree p...
Sort
View
DKE
2006
139views more  DKE 2006»
14 years 9 months ago
Information extraction from structured documents using k-testable tree automaton inference
Information extraction (IE) addresses the problem of extracting specific information from a collection of documents. Much of the previous work on IE from structured documents, suc...
Raymond Kosala, Hendrik Blockeel, Maurice Bruynoog...
AUSAI
2003
Springer
15 years 3 months ago
Combining Multiple Host-Based Detectors Using Decision Tree
Abstract. As the information technology grows interests in the intrusion detection system (IDS), which detects unauthorized usage, misuse by a local user and modification of impor...
Sang-Jun Han, Sung-Bae Cho
ICDE
2001
IEEE
128views Database» more  ICDE 2001»
15 years 11 months ago
Counting Twig Matches in a Tree
We describe efficient algorithms for accurately estimating the number of matches of a small node-labeled tree, i.e., a twig, in a large node-labeled tree, using a summary data str...
Zhiyuan Chen, H. V. Jagadish, Flip Korn, Nick Koud...
ICTAI
2003
IEEE
15 years 3 months ago
Eliminating Redundancies in SAT Search Trees
Conflict analysis is a powerful paradigm of backtrack search algorithms, in particular for solving satisfiability problems arising from practical applications. Accordingly, most...
Richard Ostrowski, Bertrand Mazure, Lakhdar Sais, ...
VMV
2008
107views Visualization» more  VMV 2008»
14 years 11 months ago
Learning with Few Examples using a Constrained Gaussian Prior on Randomized Trees
Machine learning with few training examples always leads to over-fitting problems, whereas human individuals are often able to recognize difficult object categories from only one ...
Erik Rodner, Joachim Denzler