Sciweavers

535 search results - page 12 / 107
» Generalized Version Space Trees
Sort
View
SIROCCO
2004
15 years 1 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
IPPS
2007
IEEE
15 years 6 months ago
A Landmark-based Index Architecture for General Similarity Search in Peer-to-Peer Networks
The indexing of complex data and similarity search plays an important role in many application areas. Traditional centralized index structure can not scale with the rapid prolifer...
Xiaoyu Yang, Yiming Hu
82
Voted
STOC
2005
ACM
130views Algorithms» more  STOC 2005»
15 years 12 months ago
Low-distortion embeddings of general metrics into the line
A low-distortion embedding between two metric spaces is a mapping which preserves the distances between each pair of points, up to a small factor called distortion. Low-distortion...
Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasi...
DLT
2004
15 years 1 months ago
Relating Tree Series Transducers and Weighted Tree Automata
Bottom-up tree series transducers (tst) over the semiring A are implemented with the help of bottom-up weighted tree automata (wta) over an extension of A. Therefore bottom-up D-w...
Andreas Maletti
MIR
2006
ACM
162views Multimedia» more  MIR 2006»
15 years 5 months ago
Dynamic similarity search in multi-metric spaces
An important research issue in multimedia databases is the retrieval of similar objects. For most applications in multimedia databases, an exact search is not meaningful. Thus, mu...
Benjamin Bustos, Tomás Skopal