Sciweavers

960 search results - page 44 / 192
» CURE: An Efficient Clustering Algorithm for Large Databases
Sort
View
166
Voted
DEXA
2010
Springer
319views Database» more  DEXA 2010»
15 years 3 months ago
An Efficient Similarity Join Algorithm with Cosine Similarity Predicate
Given a large collection of objects, finding all pairs of similar objects, namely similarity join, is widely used to solve various problems in many application domains.Computation ...
Dongjoo Lee, Jaehui Park, Junho Shim, Sang-goo Lee
163
Voted
KDD
2012
ACM
196views Data Mining» more  KDD 2012»
13 years 6 months ago
Chromatic correlation clustering
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
Francesco Bonchi, Aristides Gionis, Francesco Gull...
147
Voted
ECRTS
2007
IEEE
15 years 7 months ago
Statistical QoS Guarantee and Energy-Efficiency in Web Server Clusters
In this paper we study the soft real-time web cluster architecture needed to support e-commerce and related applications. Our testbed is based on an industry standard, which defin...
Luciano Bertini, Julius C. B. Leite, Daniel Moss&e...
151
Voted
ICICS
2007
Springer
15 years 7 months ago
Time and Space Efficient Algorithms for Two-Party Authenticated Data Structures
Authentication is increasingly relevant to data management. Data is being outsourced to untrusted servers and clients want to securely update and query their data. For example, in ...
Charalampos Papamanthou, Roberto Tamassia
140
Voted
SIAMSC
2008
182views more  SIAMSC 2008»
15 years 3 months ago
A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation
We propose a distributed algorithm for solving Euclidean metric realization problems arising from large 3D graphs, using only noisy distance information, and without any prior kno...
Pratik Biswas, Kim-Chuan Toh, Yinyu Ye