4541 search results - page 539 / 909 » Cache-Oblivious Algorithms and Data Structures |
309
click to vote
SIGMOD
2008
ACM
16 years 7 months ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
202
click to vote
RCIS
2010
15 years 5 months ago
2010
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
218
click to vote
ISCI
2008
15 years 7 months ago
2008
Web mining involves the application of data mining techniques to large amounts of web-related data in order to improve web services. Web traversal pattern mining involves discover...
302
click to vote
ICDE
2004
IEEE
16 years 8 months ago
2004
IEEE
Frequent structure mining (FSM) aims to discover and extract patterns frequently occurring in structural data, such as trees and graphs. FSM finds many applications in bioinformat...
208
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
This paper describes an unsupervised learning technique for modeling human locomotion styles, such as distinct related activities (e.g. running and striding) or variations of the ...