Sciweavers

621 search results - page 12 / 125
» Global partial orders from sequential data
Sort
View
93
Voted
ICDM
2007
IEEE
169views Data Mining» more  ICDM 2007»
15 years 1 months ago
Efficient Discovery of Frequent Approximate Sequential Patterns
We propose an efficient algorithm for mining frequent approximate sequential patterns under the Hamming distance model. Our algorithm gains its efficiency by adopting a "brea...
Feida Zhu, Xifeng Yan, Jiawei Han, Philip S. Yu
87
Voted
ICS
2001
Tsinghua U.
15 years 2 months ago
Global optimization techniques for automatic parallelization of hybrid applications
This paper presents a novel technique to perform global optimization of communication and preprocessing calls in the presence of array accesses with arbitrary subscripts. Our sche...
Dhruva R. Chakrabarti, Prithviraj Banerjee
WSC
2008
14 years 12 months ago
Nonlinear process modeling and optimization based on Multiway Kernel Partial Least Squares model
MKPLS (Multiway Kernel Partial Least Squares) methods are used to model the batch processes from process operational data. To improve the optimization performance, a batch-to-batc...
Liqing Di, Zhihua Xiong, XianHui Yang
DAGSTUHL
2006
14 years 11 months ago
Enriched categories and models for spaces of dipaths
Partially ordered sets, causets, partially ordered spaces and their local counterparts are now often used to model systems in computer science and theoretical physics. The order mo...
Timothy Porter
SODA
2004
ACM
124views Algorithms» more  SODA 2004»
14 years 11 months ago
Family trees: an ordered dictionary with optimal congestion, locality, degree, and search time
We consider the problem of storing an ordered dictionary data structure over a distributed set of nodes. In contrast to traditional sequential data structures, distributed data st...
Kevin C. Zatloukal, Nicholas J. A. Harvey