Sciweavers

65 search results - page 13 / 13
» Ctree: a compact tree for indexing XML data
Sort
View
EGH
2011
Springer
12 years 4 months ago
Simpler and Faster HLBVH with Work Queues
A recently developed algorithm called Hierachical Linear Bounding Volume Hierarchies (HLBVH) has demonstrated the feasibility of reconstructing the spatial index needed for ray tr...
Kirill Garanzha, Jacopo Pantaleoni, David K. McAll...
CIKM
2006
Springer
13 years 8 months ago
TRIPS and TIDES: new algorithms for tree mining
Recent research in data mining has progressed from mining frequent itemsets to more general and structured patterns like trees and graphs. In this paper, we address the problem of...
Shirish Tatikonda, Srinivasan Parthasarathy, Tahsi...
ICDM
2009
IEEE
167views Data Mining» more  ICDM 2009»
13 years 2 months ago
Self-Adaptive Anytime Stream Clustering
Clustering streaming data requires algorithms which are capable of updating clustering results for the incoming data. As data is constantly arriving, time for processing is limited...
Philipp Kranen, Ira Assent, Corinna Baldauf, Thoma...
SIGDOC
2004
ACM
13 years 10 months ago
Semantic thumbnails: a novel method for summarizing document collections
The concept of thumbnails is common in image representation. A thumbnail is a highly compressed version of an image that provides a small, yet complete visual representation to th...
Arijit Sengupta, Mehmet M. Dalkilic, James C. Cost...
EDBT
2009
ACM
277views Database» more  EDBT 2009»
13 years 9 months ago
G-hash: towards fast kernel-based similarity search in large graph databases
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
Xiaohong Wang, Aaron M. Smalter, Jun Huan, Gerald ...