Sciweavers

807 search results - page 88 / 162
» Space Efficient Algorithms for Ordered Tree Comparison
Sort
View
KDD
2007
ACM
182views Data Mining» more  KDD 2007»
16 years 4 months ago
A fast algorithm for finding frequent episodes in event streams
Frequent episode discovery is a popular framework for mining data available as a long sequence of events. An episode is essentially a short ordered sequence of event types and the...
Srivatsan Laxman, P. S. Sastry, K. P. Unnikrishnan
ECAI
2008
Springer
15 years 5 months ago
Focused Ensemble Selection: A Diversity-Based Method for Greedy Ensemble Selection
Abstract. Ensemble selection deals with the reduction of an ensemble of predictive models in order to improve its efficiency and predictive performance. A number of ensemble select...
Ioannis Partalas, Grigorios Tsoumakas, Ioannis P. ...
CORR
2007
Springer
88views Education» more  CORR 2007»
15 years 3 months ago
Augmented Tree-based Routing Protocol for Scalable Ad Hoc Networks
—In ad hoc networks scalability is a critical requirement if these technologies have to reach their full potential. Most of the proposed routing protocols do not operate efficien...
Marcello Caleffi, Giancarlo Ferraiuolo, Luigi Paur...
VISSYM
2007
15 years 6 months ago
A Tri-Space Visualization Interface for Analyzing Time-Varying Multivariate Volume Data
The dataset generated by a large-scale numerical simulation may include thousands of timesteps and hundreds of variables describing different aspects of the modeled physical pheno...
Hiroshi Akiba, Kwan-Liu Ma
BMCBI
2006
100views more  BMCBI 2006»
15 years 3 months ago
Towards a better solution to the shortest common supersequence problem: the deposition and reduction algorithm
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...
Kang Ning, Hon Wai Leong