Sciweavers

2498 search results - page 301 / 500
» Data Structures with Unpredictable Timing
Sort
View
ICSE
2001
IEEE-ACM
15 years 11 months ago
Encoding Program Executions
Dynamic analysis is based on collecting data as the program runs. However, raw traces tend to be too voluminous and too unstructured to be used directly for visualization and unde...
Steven P. Reiss, Manos Renieris
ISCI
2008
166views more  ISCI 2008»
15 years 6 months ago
Incremental and interactive mining of web traversal patterns
Web mining involves the application of data mining techniques to large amounts of web-related data in order to improve web services. Web traversal pattern mining involves discover...
Yue-Shi Lee, Show-Jane Yen
ICDE
2004
IEEE
115views Database» more  ICDE 2004»
16 years 7 months ago
Unordered Tree Mining with Applications to Phylogeny
Frequent structure mining (FSM) aims to discover and extract patterns frequently occurring in structural data, such as trees and graphs. FSM finds many applications in bioinformat...
Dennis Shasha, Jason Tsong-Li Wang, Sen Zhang
DAC
2007
ACM
16 years 7 months ago
Designer-Controlled Generation of Parallel and Flexible Heterogeneous MPSoC Specification
Programming multi-processor systems-on-chip (MPSoC) involves partitioning and mapping of sequential reference code onto multiple parallel processing elements. The immense potentia...
Pramod Chandraiah, Rainer Dömer
SDM
2009
SIAM
161views Data Mining» more  SDM 2009»
16 years 3 months ago
Polynomial-Delay and Polynomial-Space Algorithms for Mining Closed Sequences, Graphs, and Pictures in Accessible Set Systems.
In this paper, we study efficient closed pattern mining in a general framework of set systems, which are families of subsets ordered by set-inclusion with a certain structure, pro...
Hiroki Arimura, Takeaki Uno