Sciweavers

2632 search results - page 351 / 527
» Alternating Timed Automata
Sort
View
TKDE
2008
218views more  TKDE 2008»
15 years 6 months ago
A General Model for Sequential Pattern Mining with a Progressive Database
Although there have been many recent studies on the mining of sequential patterns in a static database and in a database with increasing data, these works, in general, do not fully...
Jen-Wei Huang, Chi-Yao Tseng, Jian Chih Ou, Ming-S...
JSA
2000
115views more  JSA 2000»
15 years 6 months ago
Scheduling optimization through iterative refinement
Scheduling DAGs with communication times is the theoretical basis for achieving efficient parallelism on distributed memory systems. We generalize Graham's task-level in a ma...
Mayez A. Al-Mouhamed, Adel Al-Massarani
PVLDB
2008
126views more  PVLDB 2008»
15 years 5 months ago
Parallelizing query optimization
Many commercial RDBMSs employ cost-based query optimization exploiting dynamic programming (DP) to efficiently generate the optimal query execution plan. However, optimization tim...
Wook-Shin Han, Wooseong Kwak, Jinsoo Lee, Guy M. L...
ICDM
2010
IEEE
273views Data Mining» more  ICDM 2010»
15 years 4 months ago
Learning Maximum Lag for Grouped Graphical Granger Models
Temporal causal modeling has been a highly active research area in the last few decades. Temporal or time series data arises in a wide array of application domains ranging from med...
Amit Dhurandhar
CORR
2012
Springer
249views Education» more  CORR 2012»
14 years 2 months ago
Computing Cartograms with Optimal Complexity
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...
Md. Jawaherul Alam, Therese C. Biedl, Stefan Felsn...