Sciweavers

338 search results - page 39 / 68
» Fast distributed random walks
Sort
View
CIKM
2008
Springer
14 years 11 months ago
Efficient and effective link analysis with precomputed salsa maps
SALSA is a link-based ranking algorithm that takes the result set of a query as input, extends the set to include additional neighboring documents in the web graph, and performs a...
Marc Najork, Nick Craswell
TMC
2008
125views more  TMC 2008»
14 years 9 months ago
Distributed Algorithm for Efficient Construction and Maintenance of Connected k-Hop Dominating Sets in Mobile Ad Hoc Networks
A k-hop dominating set is a subset of nodes such that each node not in the set can be reached within k hops from at least one node in the set. A connected k-hop dominating set can ...
Hong-Yen Yang, Chia-Hung Lin, Ming-Jer Tsai
CLUSTER
2011
IEEE
13 years 9 months ago
Incorporating Network RAM and Flash into Fast Backing Store for Clusters
—We present Nswap2L, a fast backing storage system for general purpose clusters. Nswap2L implements a single device interface on top of multiple heterogeneous physical storage de...
Tia Newhall, Douglas Woos
CVPR
2009
IEEE
16 years 3 months ago
Tracking of Cell Populations to Understand their Spatio-Temporal Behavior in Response to Physical Stimuli
We have developed methods for segmentation and tracking of cells in time-lapse phase-contrast microscopy images. Our multi-object Bayesian algorithm detects and tracks large num...
David House, Matthew Walker, Zheng Wu, Joyce Wong,...
SDM
2007
SIAM
171views Data Mining» more  SDM 2007»
14 years 11 months ago
A Better Alternative to Piecewise Linear Time Series Segmentation
Time series are difficult to monitor, summarize and predict. Segmentation organizes time series into few intervals having uniform characteristics (flatness, linearity, modality,...
Daniel Lemire