Sciweavers

327 search results - page 14 / 66
» Version Management and Recoverability for Large Object Data
Sort
View
IDEAS
2006
IEEE
218views Database» more  IDEAS 2006»
15 years 10 months ago
PBIRCH: A Scalable Parallel Clustering algorithm for Incremental Data
We present a parallel version of BIRCH with the objective of enhancing the scalability without compromising on the quality of clustering. The incoming data is distributed in a cyc...
Ashwani Garg, Ashish Mangla, Neelima Gupta, Vasudh...
143
Voted
WWW
2010
ACM
15 years 11 months ago
Empirical comparison of algorithms for network community detection
Detecting clusters or communities in large real-world graphs such as large social or information networks is a problem of considerable interest. In practice, one typically chooses...
Jure Leskovec, Kevin J. Lang, Michael W. Mahoney
151
Voted
EDBT
2009
ACM
277views Database» more  EDBT 2009»
15 years 8 months ago
G-hash: towards fast kernel-based similarity search in large graph databases
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
Xiaohong Wang, Aaron M. Smalter, Jun Huan, Gerald ...
MSWIM
2003
ACM
15 years 9 months ago
Simulation of large ad hoc networks
An ad hoc network is formed by wireless mobile nodes (hosts) that operate as terminals as well as routers in the network, without any centralized administration. Research in ad ho...
Valeriy Naoumov, Thomas R. Gross
131
Voted
IEEECIT
2006
IEEE
15 years 10 months ago
One Update for all Moving Objects at a Timestamp
Concurrently with fast development of location aware technologies, many applications have been developing to exploit location data for serving people. However, a main challenge in...
Hoang Do Thanh Tung, Keun Ho Ryu