Sciweavers

12 search results - page 2 / 3
» Incremental and on-demand random walk for iterative power di...
Sort
View
WWW
2005
ACM
14 years 5 months ago
A uniform approach to accelerated PageRank computation
In this note we consider a simple reformulation of the traditional power iteration algorithm for computing the stationary distribution of a Markov chain. Rather than communicate t...
Frank McSherry
VLSID
2006
IEEE
148views VLSI» more  VLSID 2006»
14 years 5 months ago
Efficient Design and Analysis of Robust Power Distribution Meshes
With increasing design complexity, as well as continued scaling of supplies, the design and analysis of power/ground distribution networks poses a difficult problem in modern IC d...
Puneet Gupta, Andrew B. Kahng
IJCNN
2007
IEEE
13 years 11 months ago
Random Feature Subset Selection for Analysis of Data with Missing Features
Abstract - We discuss an ensemble-of-classifiers based algorithm for the missing feature problem. The proposed approach is inspired in part by the random subspace method, and in pa...
Joseph DePasquale, Robi Polikar
SDM
2008
SIAM
139views Data Mining» more  SDM 2008»
13 years 6 months ago
Proximity Tracking on Time-Evolving Bipartite Graphs
Given an author-conference network that evolves over time, which are the conferences that a given author is most closely related with, and how do they change over time? Large time...
Hanghang Tong, Spiros Papadimitriou, Philip S. Yu,...
ICASSP
2008
IEEE
13 years 11 months ago
Energy efficient change detection over a MAC using physical layer fusion
We propose a simple and energy efficient distributed Change Detection scheme for sensor networks based on Page’s parametric CUSUM algorithm. The sensor observations are IID ove...
Taposh Banerjee, Veeraruna Kavitha, Vinod Sharma