Sciweavers

279 search results - page 28 / 56
» Approximating Average Parameters of Graphs
Sort
View
KDD
2007
ACM
244views Data Mining» more  KDD 2007»
14 years 8 months ago
A Recommender System Based on Local Random Walks and Spectral Methods
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
Zeinab Abbassi, Vahab S. Mirrokni
CDC
2009
IEEE
115views Control Systems» more  CDC 2009»
14 years 11 days ago
Quantized consensus via adaptive stochastic gossip algorithm
Abstract— This paper is concerned with the distributed averaging problem over a given undirected graph. To enable every vertex to compute the average of the initial numbers sitti...
Javad Lavaei, Richard M. Murray
SSD
2005
Springer
98views Database» more  SSD 2005»
14 years 1 months ago
Medoid Queries in Large Spatial Databases
Assume that a franchise plans to open k branches in a city, so that the average distance from each residential block to the closest branch is minimized. This is an instance of the ...
Kyriakos Mouratidis, Dimitris Papadias, Spiros Pap...
JMIV
2010
131views more  JMIV 2010»
13 years 6 months ago
An SL(2) Invariant Shape Median
Median averaging is a powerful averaging concept on sets of vector data in finite dimensions. A generalization of the median for shapes in the plane is introduced. The underlying ...
Benjamin Berkels, Gina Linkmann, Martin Rumpf
SI3D
2003
ACM
14 years 27 days ago
Large haptic topographic maps: marsview and the proxy graph algorithm
In this paper we develop an interactive 3D browser for large topographic maps using a visual display augmented by a haptic, or force feedback, display. The extreme size of our dat...
Sean P. Walker, John Kenneth Salisbury Jr.