11808 search results - page 308 / 2362 » Isometries and Computability Structures |
133
click to vote
SIGMOD
2001
ACM
16 years 6 months ago
2001
ACM
An -appro ximate quantile summary of a sequence of N elements is a data structure that can answer quantile queries about the sequence to within a precision of N. We presen t a new...
170
click to vote
GBRPR
2009
Springer
16 years 25 days ago
2009
Springer
Modeling and understanding complex non-manifold shapes is a key issue in shape analysis and retrieval. The topological structure of a non-manifold shape can be analyzed through its...
203
click to vote
ICAPR
2009
Springer
16 years 25 days ago
2009
Springer
In this paper, we propose a novel method for fast nearest neighbors retrieval in non-Euclidean and non-metric spaces. We organize the data into a hierarchical fashion that preserv...
152
click to vote
SEMWEB
2009
Springer
16 years 24 days ago
2009
Springer
The usage of parallelization and distribution techniques in the field of ontology matching is of high interest for the semantic web community. This work presents an approach for ma...
170
click to vote
HYBRID
2007
Springer
16 years 13 days ago
2007
Springer
This work investigates some of the computational issues involved in the solution of probabilistic reachability problems for discretetime, controlled stochastic hybrid systems. It i...