Sciweavers

3932 search results - page 199 / 787
» Adaptive Index Structures
Sort
View
PPAM
2005
Springer
15 years 9 months ago
Adapting Linear Algebra Codes to the Memory Hierarchy Using a Hypermatrix Scheme
Abstract. We present the way in which we adapt data and computations to the underlying memory hierarchy by means of a hierarchical data structure known as hypermatrix. The applicat...
José R. Herrero, Juan J. Navarro
MM
2009
ACM
177views Multimedia» more  MM 2009»
15 years 10 months ago
Transfer non-metric measures into metric for similarity search
Similarity search is widely used in multimedia retrieval systems to find the most similar ones for a given object. Some similarity measures, however, are not metric, leading to e...
Danzhou Liu, Kien A. Hua
140
Voted
MOBIDE
2005
ACM
15 years 9 months ago
Tolerance of localization imprecision in efficiently managing mobile sensor databases
Query processing on mobile sensor networks requires efficient indexing and partitioning of the data space to support efficient routing as the network scales up. Building an index ...
Lin Xiao, Aris M. Ouksel
EDBT
2009
ACM
108views Database» more  EDBT 2009»
15 years 8 months ago
Reverse k-nearest neighbor search in dynamic and general metric databases
In this paper, we propose an original solution for the general reverse k-nearest neighbor (RkNN) search problem. Compared to the limitations of existing methods for the RkNN searc...
Elke Achtert, Hans-Peter Kriegel, Peer Kröger...
121
Voted
KBSE
1998
IEEE
15 years 8 months ago
Specification-based Browsing of Software Component Libraries
Specification-based retrieval provides exact contentoriented access to component libraries but requires too much deductive power. Specification-based browsing evades this bottlene...
B. Fischer