Sciweavers

1217 search results - page 91 / 244
» On compressing frequent patterns
Sort
View
ICSE
2000
IEEE-ACM
15 years 7 months ago
Automated refactoring to introduce design patterns
Software systems have to be flexible in order to cope with evolving requirements. However, since it is impossible to predict with certainty what future requirements will emerge, i...
Mel Ó Cinnéide
IBPRIA
2003
Springer
15 years 9 months ago
Hash-Like Fractal Image Compression with Linear Execution Time
The main computational cost in Fractal Image Analysis (FIC) comes from the required range-domain full block comparisons. In this work we propose a new algorithm for this comparison...
Kostadin Koroutchev, José R. Dorronsoro
ICSM
2002
IEEE
15 years 9 months ago
A Software Transformation Framework for Quality-Driven Object-Oriented Re-engineering
In re-engineering object-oriented legacy code, it is frequently useful to introduce a design pattern in order to improve specific non-functional requirements (e.g., maintainabili...
Ladan Tahvildari, Kostas Kontogiannis
SP
2008
IEEE
159views Security Privacy» more  SP 2008»
15 years 3 months ago
Inferring neuronal network connectivity from spike data: A temporal data mining approach
Abstract. Understanding the functioning of a neural system in terms of its underlying circuitry is an important problem in neuroscience. Recent developments in electrophysiology an...
Debprakash Patnaik, P. S. Sastry, K. P. Unnikrishn...
ACSC
2002
IEEE
15 years 9 months ago
Using Finite State Automata for Sequence Mining
We show how frequently occurring sequential patterns may be found from large datasets by first inducing a finite state automaton model describing the data, and then querying the m...
Philip Hingston