Sciweavers

209 search results - page 15 / 42
» Randomized consensus algorithms over large scale networks
Sort
View
ICDT
1999
ACM
72views Database» more  ICDT 1999»
14 years 26 days ago
On the Generation of 2-Dimensional Index Workloads
A large number of database index structures have been proposed over the last two decades, and little consensus has emerged regarding their relative e ectiveness. In order to empir...
Joseph M. Hellerstein, Lisa Hellerstein, George Ko...
DCOSS
2006
Springer
14 years 8 days ago
Efficient In-Network Processing Through Local Ad-Hoc Information Coalescence
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
Onur Savas, Murat Alanyali, Venkatesh Saligrama
ASPDAC
2007
ACM
132views Hardware» more  ASPDAC 2007»
14 years 18 days ago
Fast Decoupling Capacitor Budgeting for Power/Ground Network Using Random Walk Approach
- This paper proposes a fast and practical decoupling capacitor (decap) budgeting algorithm to optimize the power ground (P/G) network design. The new method adopts a modified rand...
Le Kang, Yici Cai, Yi Zou, Jin Shi, Xianlong Hong,...
KDD
2003
ACM
122views Data Mining» more  KDD 2003»
14 years 9 months ago
Natural communities in large linked networks
We are interested in finding natural communities in largescale linked networks. Our ultimate goal is to track changes over time in such communities. For such temporal tracking, we...
John E. Hopcroft, Omar Khan, Brian Kulis, Bart Sel...
ICDM
2010
IEEE
230views Data Mining» more  ICDM 2010»
13 years 6 months ago
Clustering Large Attributed Graphs: An Efficient Incremental Approach
In recent years, many networks have become available for analysis, including social networks, sensor networks, biological networks, etc. Graph clustering has shown its effectivenes...
Yang Zhou, Hong Cheng, Jeffrey Xu Yu