4541 search results - page 333 / 909 » Cache-Oblivious Algorithms and Data Structures |
148
click to vote
CIKM
2005
Springer
15 years 6 months ago
2005
Springer
A critical issue in moving object databases is to develop appropriate indexing structures for continuously moving object locations so that queries can still be performed efficien...
160
click to vote
PAKDD
2007
ACM
15 years 10 months ago
2007
ACM
In this study, we propose a novel evolutionary algorithm-based clustering method, named density-sensitive evolutionary clustering (DSEC). In DSEC, each individual is a sequence of ...
185
click to vote
WIA
2004
Springer
15 years 9 months ago
2004
Springer
In this paper we propose a new data structure, called shared automata, for representing deterministic finite automata (DFA). Shared automata admit a strong canonical form for DFA ...
116
click to vote
AI
2003
Springer
15 years 9 months ago
2003
Springer
Discovering association rules is one of the important tasks in data mining. While most of the existing algorithms are developed for efficient mining of frequent patterns, it has be...
159
click to vote
SIGMOD
2004
ACM
16 years 4 months ago
2004
ACM
Mining informative patterns from very large, dynamically changing databases poses numerous interesting challenges. Data summarizations (e.g., data bubbles) have been proposed to c...