Sciweavers

4850 search results - page 176 / 970
» Approximate Data Structures with Applications
Sort
View
159
Voted
PAMI
2011
15 years 1 months ago
Approximate Nearest Subspace Search
—Subspaces offer convenient means of representing information in many pattern recognition, machine vision, and statistical learning applications. Contrary to the growing populari...
Ronen Basri, Tal Hassner, Lihi Zelnik-Manor
172
Voted
IGIS
1994
145views GIS» more  IGIS 1994»
15 years 10 months ago
Approximations for a Multi-Step Processing of Spatial Joins
The basic concept for processing spatial joins consists of two steps: First, the spatial join is performed on the minimum bounding rectangles of the objects by using a spatial acce...
Thomas Brinkhoff, Hans-Peter Kriegel
GIS
2007
ACM
16 years 7 months ago
Approximate order-k Voronoi cells over positional streams
Handling streams of positional updates from numerous moving objects has become a challenging task for many monitoring applications. Several algorithms have been recently proposed ...
Kostas Patroumpas, Theofanis Minogiannis, Timos K....
VLDB
2007
ACM
107views Database» more  VLDB 2007»
16 years 6 months ago
VGRAM: Improving Performance of Approximate Queries on String Collections Using Variable-Length Grams
Many applications need to solve the following problem of approximate string matching: from a collection of strings, how to find those similar to a given string, or the strings in ...
Chen Li, Bin Wang, Xiaochun Yang
199
Voted
ICPR
2008
IEEE
16 years 18 days ago
Approximation of salient contours in cluttered scenes
This paper proposes a new approach to describe the salient contours in cluttered scenes. No need to do the preprocessing, such as edge detection, we directly use a set of random s...
Rui Huang, Nong Sang, Qiling Tang