4886 search results - page 899 / 978 » Approximate Data Exchange |
PODC
2009
ACM
14 years 9 months ago
2009
ACM
A method is given for constructing a max register, a linearizable, wait-free concurrent data structure that supports a write operation and a read operation that returns the larges...
KDD
2008
ACM
14 years 9 months ago
2008
ACM
Information diffusion, viral marketing, and collective classification all attempt to model and exploit the relationships in a network to make inferences about the labels of nodes....
KDD
2006
ACM
14 years 9 months ago
2006
ACM
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
KDD
2006
ACM
14 years 9 months ago
2006
ACM
Observed in many applications, there is a potential need of extracting a small set of frequent patterns having not only high significance but also low redundancy. The significance...
VLDB
2006
ACM
14 years 9 months ago
2006
ACM
Abstract Traditional nearest-neighbor (NN) search is based on two basic indexing approaches: object-based indexing and solution-based indexing. The former is constructed based on t...