4850 search results - page 121 / 970 » Approximate Data Structures with Applications |
100
click to vote
AIMSA
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. Ontology based data access (OBDA) is concerned with providing access to typically very large data sources through a mediating conceptual layer that allows one to improve ...
WWW
2009
ACM
15 years 10 months ago
2009
ACM
Web forums have become an important data resource for many web applications, but extracting structured data from unstructured web forum pages is still a challenging task due to bo...
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
In this work we present a model that uses a Dirichlet Process (DP) with a dynamic spatial constraints to approximate a non-homogeneous hidden Markov model (NHMM). The coefficient ...
116
click to vote
ICAPR
2009
Springer
15 years 4 months 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...
ACCV
2006
Springer
15 years 4 months ago
2006
Springer
We propose a considerably faster approximation of the well known SIFT method. The main idea is to use efficient data structures for both, the detector and the descriptor. The detec...