Sciweavers

80 search results - page 13 / 16
» Cube Pruning as Heuristic Search
Sort
View
ICDE
2008
IEEE
158views Database» more  ICDE 2008»
14 years 9 months ago
CARE: Finding Local Linear Correlations in High Dimensional Data
Finding latent patterns in high dimensional data is an important research problem with numerous applications. Existing approaches can be summarized into 3 categories: feature selec...
Xiang Zhang, Feng Pan, Wei Wang
DASFAA
2008
IEEE
94views Database» more  DASFAA 2008»
13 years 9 months ago
Efficient Algorithms for Node Disjoint Subgraph Homeomorphism Determination
Recently, great efforts have been dedicated to researches on the management of large-scale graph-based data, where node disjoint subgraph homeomorphism relation between graphs has ...
Yanghua Xiao, Wentao Wu, Wei Wang 0009, Zhenying H...
DKE
1999
118views more  DKE 1999»
13 years 7 months ago
Designing Data Warehouses
A Data Warehouse DW is a database that collects and stores data from multiple remote and heterogeneous information sources. When a query is posed, it is evaluated locally, without...
Dimitri Theodoratos, Timos K. Sellis
EUMAS
2006
13 years 9 months ago
Near-Optimal Anytime Coalition Structure Generation
Forming effective coalitions is a major research challenge in the field of multi-agent systems. Central to this endeavour is the problem of determining the best set of agents that...
Talal Rahwan, Sarvapali D. Ramchurn, Viet Dung Dan...
JAIR
2008
107views more  JAIR 2008»
13 years 7 months ago
Planning with Durative Actions in Stochastic Domains
Probabilistic planning problems are typically modeled as a Markov Decision Process (MDP). MDPs, while an otherwise expressive model, allow only for sequential, non-durative action...
Mausam, Daniel S. Weld