Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
SPIESR
2004
152views Database» more  SPIESR 2004»
11 years 6 months ago
Issues in managing image and video data
This paper presents an overview of our recent work on managing image and video data. The first half of the paper describes a representation for the semantic spatial layout of vide...
Shawn D. Newsam, Jelena Tesic, Lei Wang, B. S. Man...
CCCG
2006
11 years 7 months ago
(Approximate) Conic Nearest Neighbors and the induced Voronoi Diagram
For a given point set in Euclidean space we consider the problem of finding (approximate) nearest neighbors of a query point but restricting only to points that lie within a fixed...
Stefan Funke, Theocharis Malamatos, Domagoj Matije...
PODS
1989
ACM
155views Database» more  PODS 1989»
11 years 9 months ago
Fractals for Secondary Key Retrieval
In this paper we propose the use of fractals and especially the Hilbert curve, in order to design good distance-preserving mappings. Such mappings improve the performance of secon...
Christos Faloutsos, Shari Roseman
SSD
2001
Springer
119views Database» more  SSD 2001»
11 years 10 months ago
Constrained Nearest Neighbor Queries
In this paper we introduce the notion of constrained nearest neighbor queries (CNN) and propose a series of methods to answer them. This class of queries can be thought of as neare...
Hakan Ferhatosmanoglu, Ioana Stanoi, Divyakant Agr...
ICDT
2001
ACM
116views Database» more  ICDT 2001»
11 years 10 months ago
On Optimizing Nearest Neighbor Queries in High-Dimensional Data Spaces
Abstract. Nearest-neighbor queries in high-dimensional space are of high importance in various applications, especially in content-based indexing of multimedia data. For an optimiz...
Stefan Berchtold, Christian Böhm, Daniel A. K...
DAWAK
2005
Springer
11 years 11 months ago
Nearest Neighbor Search on Vertically Partitioned High-Dimensional Data
Abstract. In this paper, we present a new approach to indexing multidimensional data that is particularly suitable for the efficient incremental processing of nearest neighbor quer...
Evangelos Dellis, Bernhard Seeger, Akrivi Vlachou
STOC
2002
ACM
119views Algorithms» more  STOC 2002»
12 years 5 months ago
Space-efficient approximate Voronoi diagrams
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
Sunil Arya, Theocharis Malamatos, David M. Mount
ICDE
2001
IEEE
201views Database» more  ICDE 2001»
12 years 6 months ago
Approximate Nearest Neighbor Searching in Multimedia Databases
In this paper, we develop a general framework for approximate nearest neighbor queries. We categorize the current approaches for nearest neighbor query processing based on either ...
Hakan Ferhatosmanoglu, Ertem Tuncel, Divyakant Agr...
ICDE
2002
IEEE
143views Database» more  ICDE 2002»
12 years 6 months ago
Discovering Similar Multidimensional Trajectories
We investigate techniques for analysis and retrieval of object trajectories in a two or three dimensional space. Such kind of data usually contain a great amount of noise, that ma...
Michail Vlachos, Dimitrios Gunopulos, George Kolli...
books