Sciweavers

73 search results - page 5 / 15
» Hashing Tree-Structured Data: Methods and Applications
Sort
View
SPDP
1993
IEEE
15 years 1 months ago
Fast Rehashing in PRAM Emulations
In PRAM emulations, universal hashing is a well-known method for distributing the address space among memory modules. However, if the memory access patterns of an application ofte...
J. Keller
WWW
2006
ACM
15 years 10 months ago
Online mining of frequent query trees over XML data streams
In this paper, we proposed an online algorithm, called FQT-Stream (Frequent Query Trees of Streams), to mine the set of all frequent tree patterns over a continuous XML data strea...
Hua-Fu Li, Man-Kwan Shan, Suh-Yin Lee
ICWE
2004
Springer
15 years 3 months ago
Behaviour Recovery and Complicated Pattern Definition in Web Usage Mining
Data mining includes four steps: data preparation, pattern mining, and pattern analysis and pattern application. But in web environment, the user activities become much more comple...
Long Wang 0002, Christoph Meinel
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
15 years 2 months ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...
COCOON
2009
Springer
15 years 4 months ago
Determination of Glycan Structure from Tandem Mass Spectra
Glycans are molecules made from simple sugars that form complex tree structures. Glycans constitute one of the most important protein modifications, and identification of glycans...
Sebastian Böcker, Birte Kehr, Florian Rasche