Sciweavers

Share
AAIM
2009
Springer
143views Algorithms» more  AAIM 2009»
8 years 3 months ago
Discrete online TSP
In this paper we introduce a discrete version of the online traveling salesman problem (DOLTSP). We represent the metric space using a weighted graph, where the server is allowed t...
Mauro Aprea, Esteban Feuerstein, Gustavo Sadovoy, ...
JANCL
2002
77views more  JANCL 2002»
8 years 5 months ago
Axiomatizing Distance Logics
In [8, 6] we introduced a family of `modal' languages intended for talking about distances. These languages are interpreted in `distance spaces' which satisfy some (or a...
Oliver Kutz, Holger Sturm, Nobu-Yuki Suzuki, Frank...
JSYML
2008
56views more  JSYML 2008»
8 years 5 months ago
On metric types that are definable in an o-minimal structure
Abstract. In this paper we study the metric spaces that are definable in a polynomially bounded ominimal structure. We prove that the family of metric spaces definable in a given p...
Guillaume Valette
ISM
2006
IEEE
138views Multimedia» more  ISM 2006»
8 years 5 months ago
Similarity Search Using Sparse Pivots for Efficient Multimedia Information Retrieval
Similarity search is a fundamental operation for applications that deal with unstructured data sources. In this paper we propose a new pivot-based method for similarity search, ca...
Nieves R. Brisaboa, Antonio Fariña, Oscar P...
JEA
2008
112views more  JEA 2008»
8 years 5 months ago
Dynamic spatial approximation trees
The Spatial Approximation Tree (sa-tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alternative data...
Gonzalo Navarro, Nora Reyes
CORR
2010
Springer
249views Education» more  CORR 2010»
8 years 5 months ago
Lower Bounds on Near Neighbor Search via Metric Expansion
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
Rina Panigrahy, Kunal Talwar, Udi Wieder
APAL
2010
97views more  APAL 2010»
8 years 5 months ago
A modal logic framework for reasoning about comparative distances and topology
We propose and investigate a uniform modal logic framework for reasoning about topology and relative distance in metric and more general distance spaces, thus enabling the compari...
Mikhail Sheremet, Frank Wolter, Michael Zakharyasc...
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
8 years 6 months ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe
SIROCCO
2004
8 years 6 months ago
The Range Assignment Problem in Static Ad-Hoc Networks on Metric Spaces
In this paper we study the range assignment problem in static ad-hoc networks on metric spaces. We consider the h-strong connectivity and h-broadcast problems on trees, high dimens...
Deshi Ye, Hu Zhang
AIML
2006
8 years 6 months ago
From topology to metric: modal logic and quantification in metric spaces
We propose a framework for comparing the expressive power and computational behaviour of modal logics designed for reasoning about qualitative aspects of metric spaces. Within this...
Mikhail Sheremet, Dmitry Tishkovsky, Frank Wolter,...
books