Sciweavers

4536 search results - page 347 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
ICDM
2003
IEEE
136views Data Mining» more  ICDM 2003»
16 years 2 days ago
Statistical Relational Learning for Document Mining
A major obstacle to fully integrated deployment of many data mining algorithms is the assumption that data sits in a single table, even though most real-world databases have compl...
Alexandrin Popescul, Lyle H. Ungar, Steve Lawrence...
ICDE
2002
IEEE
140views Database» more  ICDE 2002»
16 years 8 months ago
Efficient Filtering of XML Documents with XPath Expressions
We propose a novel index structure, termed XTrie, that supports the efficient filtering of XML documents based on XPath expressions. Our XTrie index structure offers several novel...
Chee Yong Chan, Pascal Felber, Minos N. Garofalaki...
CIKM
2005
Springer
15 years 8 months ago
Handling frequent updates of moving objects
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...
Bin Lin, Jianwen Su
PAKDD
2007
ACM
158views Data Mining» more  PAKDD 2007»
16 years 27 days ago
Density-Sensitive Evolutionary Clustering
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 ...
Maoguo Gong, Licheng Jiao, Ling Wang, Liefeng Bo
WIA
2004
Springer
16 years 3 days ago
A BDD-Like Implementation of an Automata Package
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 ...
Jean-Michel Couvreur