Sciweavers

155 search results - page 20 / 31
» Constructing search spaces for materialized view selection
Sort
View
PAKDD
2007
ACM
110views Data Mining» more  PAKDD 2007»
14 years 1 months ago
Combining Convolution Kernels Defined on Heterogeneous Sub-structures
Convolution kernels, constructed by convolution of sub-kernels defined on sub-structures of composite objects, are widely used in classification, where one important issue is to ch...
Minlie Huang, Xiaoyan Zhu
VLDB
2007
ACM
155views Database» more  VLDB 2007»
14 years 7 months ago
Towards Graph Containment Search and Indexing
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
Chen Chen, Xifeng Yan, Philip S. Yu, Jiawei Han, D...
EVOW
2005
Springer
14 years 27 days ago
Choosing the Fittest Subset of Low Level Heuristics in a Hyperheuristic Framework
A hyperheuristic is a high level procedure which searches over a space of low level heuristics rather than directly over the space of problem solutions. The sequence of low level h...
Konstantin Chakhlevitch, Peter I. Cowling
UAI
2003
13 years 8 months ago
Systematic vs. Non-systematic Algorithms for Solving the MPE Task
The paper explores the power of two systematic Branch and Bound search algorithms that exploit partition-based heuristics, BBBT (a new algorithm for which the heuristic informatio...
Radu Marinescu 0002, Kalev Kask, Rina Dechter
SOFSEM
2004
Springer
14 years 22 days ago
Measures of Intrinsic Hardness for Constraint Satisfaction Problem Instances
Our aim is to investigate the factors which determine the intrinsic hardness of constructing a solution to any particular constraint satisfaction problem instance, regardless of th...
George Boukeas, Constantinos Halatsis, Vassilis Zi...