Sciweavers

277 search results - page 48 / 56
» Opportunistic Data Structures for Range Queries
Sort
View
ICDAR
2011
IEEE
12 years 7 months ago
Subgraph Spotting through Explicit Graph Embedding: An Application to Content Spotting in Graphic Document Images
—We present a method for spotting a subgraph in a graph repository. Subgraph spotting is a very interesting research problem for various application domains where the use of a re...
Muhammad Muzzamil Luqman, Jean-Yves Ramel, Josep L...
JCST
2008
175views more  JCST 2008»
13 years 7 months ago
Improved Approximate Detection of Duplicates for Data Streams Over Sliding Windows
Detecting duplicates in data streams is an important problem that has a wide range of applications. In general, precisely detecting duplicates in an unbounded data stream is not fe...
Hong Shen, Yu Zhang
PODS
2006
ACM
134views Database» more  PODS 2006»
14 years 7 months ago
Finding global icebergs over distributed data sets
Finding icebergs ? items whose frequency of occurrence is above a certain threshold ? is an important problem with a wide range of applications. Most of the existing work focuses ...
Qi Zhao, Mitsunori Ogihara, Haixun Wang, Jun Xu
PODS
2000
ACM
120views Database» more  PODS 2000»
13 years 11 months ago
Indexing the Edges - A Simple and Yet Efficient Approach to High-Dimensional Indexing
In this paper, we propose a new tunable index scheme, called iMinMax , that maps points in high dimensional spaces to single dimension values determined by their maximum or minimu...
Beng Chin Ooi, Kian-Lee Tan, Cui Yu, Stépha...
SSD
2001
Springer
113views Database» more  SSD 2001»
14 years 1 days ago
Object-Relational Indexing for General Interval Relationships
Intervals represent a fundamental data type for temporal, scientific, and spatial databases where time stamps and point data are extended to time spans and range data, respectively...
Hans-Peter Kriegel, Marco Pötke, Thomas Seidl