50 search results - page 10 / 10 » Best-First Search for Treewidth |
ICML
2005
IEEE
14 years 7 months ago
2005
IEEE
Online feature selection (OFS) provides an efficient way to sort through a large space of features, particularly in a scenario where the feature space is large and features take a...
WIDM
2004
ACM
13 years 11 months ago
2004
ACM
A Focused crawler must use information gleaned from previously crawled page sequences to estimate the relevance of a newly seen URL. Therefore, good performance depends on powerfu...
JAIR
2011
13 years 1 months ago
2011
Current evaluation functions for heuristic planning are expensive to compute. In numerous planning problems these functions provide good guidance to the solution, so they are wort...
EDBT
2004
ACM
14 years 6 months ago
2004
ACM
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
FOCS
1998
IEEE
13 years 10 months ago
1998
IEEE
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...