Sciweavers

ACSC
2010
IEEE
12 years 11 months ago
Average distance as a predictor of synchronisability in networks of coupled oscillators
The importance of networks of coupled oscillators is widely recognized. Such networks occur in biological systems like the heart, in chemical systems, in computational problems, a...
Anthony H. Dekker
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 2 months ago
Delay-Constrained Multicast Routing Algorithm Based on Average Distance Heuristic
Multicast is the ability of a communication network to accept a single message from an application and to deliver copies of the message to multiple recipients at different locatio...
Ling Zhou, Wei-xiong Ding, Yu-xi Zhu
EJC
2006
13 years 4 months ago
On the canonical metric representation, average distance, and partial Hamming graphs
Average distance of a graph is expressed in terms of its canonical metric representation. The equality can be modified to an inequality in such a way that it characterizes isometr...
Sandi Klavzar
ANOR
2006
64views more  ANOR 2006»
13 years 4 months ago
A note on asymptotic formulae for one-dimensional network flow problems
This note develops asymptotic formulae for single-commodity network flow problems with random inputs. The transportation linear programming problem (TLP) where N points lie in a r...
Carlos F. Daganzo, Karen R. Smilowitz
CCCG
2008
13 years 6 months ago
Improved Bounds on the Average Distance to the Fermat-Weber Center of a Convex Object
We show that for any convex object Q in the plane, the average distance between the Fermat-Weber center of Q and the points in Q is at least 4(Q)/25, and at most 2(Q)/(3 3), wher...
A. Karim Abu-Affash, Matthew J. Katz
PG
2002
IEEE
13 years 9 months ago
Shape-Similarity Search of Three-Dimensional Models Using Parameterized Statistics
In this paper, we propose a method for shape-similarity search of 3D polygonal-mesh models. The system accepts triangular meshes, but tolerates degenerated polygons, disconnected ...
Ryutarou Ohbuchi, Tomo Otagiri, Masatoshi Ibato, T...
SSD
2005
Springer
98views Database» more  SSD 2005»
13 years 10 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...
SSD
2007
Springer
243views Database» more  SSD 2007»
13 years 10 months ago
Continuous Medoid Queries over Moving Objects
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Stavros Papadopoulos, Dimitris Sacharidis, Kyriako...
APPROX
2007
Springer
112views Algorithms» more  APPROX 2007»
13 years 10 months ago
On Approximating the Average Distance Between Points
Abstract. We consider the problem of approximating the average distance between pairs of points in a high-dimensional Euclidean space, and more generally in any metric space. We co...
Kfir Barhum, Oded Goldreich, Adi Shraibman
ISAAC
2009
Springer
98views Algorithms» more  ISAAC 2009»
13 years 11 months ago
New Bounds on the Average Distance from the Fermat-Weber Center of a Planar Convex Body
The Fermat-Weber center of a planar body Q is a point in the plane from which the average distance to the points in Q is minimal. We first show that for any convex body Q in the ...
Adrian Dumitrescu, Csaba D. Tóth