Sciweavers

4541 search results - page 754 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
DOCENG
2004
ACM
15 years 12 months ago
Querying XML documents by dynamic shredding
With the wide adoption of XML as a standard data representation and exchange format, querying XML documents becomes increasingly important. However, relational database systems co...
Hui Zhang 0003, Frank Wm. Tompa
ICDM
2003
IEEE
92views Data Mining» more  ICDM 2003»
15 years 11 months ago
Validating and Refining Clusters via Visual Rendering
Clustering is an important technique for understanding and analysis of large multi-dimensional datasets in many scientific applications. Most of clustering research to date has be...
Keke Chen, Ling Liu
ESA
2003
Springer
116views Algorithms» more  ESA 2003»
15 years 11 months ago
Smoothed Motion Complexity
We propose a new complexity measure for movement of objects, the smoothed motion complexity. Many applications are based on algorithms dealing with moving objects, but usually data...
Valentina Damerow, Friedhelm Meyer auf der Heide, ...
KDD
1998
ACM
147views Data Mining» more  KDD 1998»
15 years 10 months ago
ADtrees for Fast Counting and for Fast Learning of Association Rules
Abstract: The problem of discovering association rules in large databases has received considerable research attention. Much research has examined the exhaustive discovery of all a...
Brigham S. Anderson, Andrew W. Moore
MOBISYS
2010
ACM
15 years 8 months ago
Growing an organic indoor location system
Most current methods for 802.11-based indoor localization depend on surveys conducted by experts or skilled technicians. Some recent systems have incorporated surveying by users. ...
Jun-geun Park, Ben Charrow, Dorothy Curtis, Jonath...