Sciweavers

COMBINATORICA
2011
12 years 4 months ago
On planarity of compact, locally connected, metric spaces
Thomassen [Combinatorica 24 (2004), 699–718] proved that a 2–connected, compact, locally connected metric space is homeomorphic to a subset of the sphere if and only if it doe...
R. Bruce Richter, Brendan Rooney, Carsten Thomasse...
ICASSP
2011
IEEE
12 years 8 months ago
A metric approach toward point process divergence
Estimating divergence between two point processes, i.e. probability laws on the space of spike trains, is an essential tool in many computational neuroscience applications, such a...
Sohan Seth, Austin J. Brockmeier, José Carl...
JUCS
2010
113views more  JUCS 2010»
12 years 11 months ago
Isometries and Computability Structures
: We investigate the relationship between computable metric spaces (X, d, ) and (X, d, ), where (X, d) is a given metric space. In the case of Euclidean space, and are equivalent ...
Zvonko Iljazovic
ISAAC
2010
Springer
266views Algorithms» more  ISAAC 2010»
13 years 2 months ago
Structural and Complexity Aspects of Line Systems of Graphs
We study line systems in metric spaces induced by graphs. A line is a subset of vertices defined by a relation of betweeness. We show that the class of all graphs having exactly k ...
Jozef Jirásek, Pavel Klavík
JSYML
2000
76views more  JSYML 2000»
13 years 4 months ago
Located Sets and Reverse Mathematics
Let X be a compact metric space. A closed set K X is located if the distance function d(x, K) exists as a continuous realvalued function on X; weakly located if the predicate d(x,...
Mariagnese Giusto, Stephen G. Simpson
ACS
2004
13 years 4 months ago
One Setting for All: Metric, Topology, Uniformity, Approach Structure
For a complete lattice V which, as a category, is monoidal closed, and for a suitable Setmonad T we consider (T, V)-algebras and introduce (T, V)-proalgebras, in generalization of...
Maria Manuel Clementino, Dirk Hofmann, Walter Thol...
JCSS
2006
89views more  JCSS 2006»
13 years 4 months ago
Ramsey-type theorems for metric spaces with applications to online problems
A nearly logarithmic lower bound on the randomized competitive ratio for the metrical task systems problem is presented. This implies a similar lower bound for the extensively stu...
Yair Bartal, Béla Bollobás, Manor Me...
JACM
2006
92views more  JACM 2006»
13 years 4 months ago
The generalized two-server problem
We consider the generalized on-line two-server problem in which at each step each server receives a request, which is a point in a metric space. One of the servers has to be moved ...
René A. Sitters, Leen Stougie
CORR
2007
Springer
122views Education» more  CORR 2007»
13 years 4 months ago
How to Complete a Doubling Metric
In recent years, considerable advances have been made in the study of properties of metric spaces in terms of their doubling dimension. This line of research has not only enhanced...
Anupam Gupta, Kunal Talwar