Sciweavers

2925 search results - page 85 / 585
» Information Complexity of Online Problems
Sort
View
CIKM
2008
Springer
15 years 8 months ago
Fast mining of complex time-stamped events
Given a collection of complex, time-stamped events, how do we find patterns and anomalies? Events could be meetings with one or more persons with one or more agenda items at zero ...
Hanghang Tong, Yasushi Sakurai, Tina Eliassi-Rad, ...
IJCNN
2008
IEEE
16 years 17 days ago
Building meta-learning algorithms basing on search controlled by machine complexity
Abstract— Meta-learning helps us find solutions to computational intelligence (CI) challenges in automated way. Metalearning algorithm presented in this paper is universal and m...
Norbert Jankowski, Krzysztof Grabczewski
ICDM
2005
IEEE
148views Data Mining» more  ICDM 2005»
15 years 11 months ago
Hot Item Mining and Summarization from Multiple Auction Web Sites
Online auction Web sites are fast changing, highly dynamic, and complex as they involve tremendous sellers and potential buyers, as well as a huge amount of items listed for biddi...
Tak-Lam Wong, Wai Lam
DOLAP
2005
ACM
15 years 8 months ago
Parallel querying of ROLAP cubes in the presence of hierarchies
Online Analytical Processing is a powerful framework for the analysis of organizational data. OLAP is often supported by a logical structure known as a data cube, a multidimension...
Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chapl...
166
Voted
DEDS
2000
104views more  DEDS 2000»
15 years 6 months ago
Coordinated Decentralized Protocols for Failure Diagnosis of Discrete Event Systems
We address the problem of failure diagnosis in discrete event systems with decentralized information. We propose a coordinated decentralized architecture consisting of local sites ...
Rami Debouk, Stéphane Lafortune, Demostheni...