4536 search results - page 560 / 908 » Contention-Sensitive Data Structures and Algorithms |
183
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
173
click to vote
MM
2005
ACM
16 years 10 days ago
2005
ACM
We consider the problem of image representation and clustering. Traditionally, an n1 × n2 image is represented by a vector in the Euclidean space Rn1×n2 . Some learning algorith...
293
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...
205
click to vote
ISCI
2008
15 years 6 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...
283
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...