Sciweavers

136 search results - page 4 / 28
» Probabilistic Tracking in a Metric Space
Sort
View
PODS
1998
ACM
152views Database» more  PODS 1998»
13 years 12 months ago
A Cost Model for Similarity Queries in Metric Spaces
We consider the problem of estimating CPU (distance computations) and I/O costs for processing range and k-nearest neighbors queries over metric spaces. Unlike the specific case ...
Paolo Ciaccia, Marco Patella, Pavel Zezula
ALENEX
2001
105views Algorithms» more  ALENEX 2001»
13 years 9 months ago
A Probabilistic Spell for the Curse of Dimensionality
Range searches in metric spaces can be very di cult if the space is \high dimensional", i.e. when the histogram of distances has a large mean and a small variance. The so-cal...
Edgar Chávez, Gonzalo Navarro
IJCAI
2007
13 years 9 months ago
Metric Properties of Structured Data Visualizations through Generative Probabilistic Modeling
Recently, generative probabilistic modeling principles were extended to visualization of structured data types, such as sequences. The models are formulated as constrained mixture...
Peter Tino, Nikolaos Gianniotis
ICIAP
2007
ACM
14 years 1 months ago
Object Tracking at Multiple Levels of Spatial Resolutions
Tracking is usually performed at a single level of data resolution. This paper describes a multi-resolution tracking framework developed with efficiency and robustness in mind. E...
Son Dinh Tran, Larry S. Davis
DEXA
2009
Springer
222views Database» more  DEXA 2009»
14 years 2 months ago
On Index-Free Similarity Search in Metric Spaces
Metric access methods (MAMs) serve as a tool for speeding similarity queries. However, all MAMs developed so far are index-based; they need to build an index on a given database. T...
Tomás Skopal, Benjamin Bustos