Results 1  10
of
1,126
Query PreProcessing of Topological Constraints: Comparing a CompositionBased with NeighborhoodBased Approach
"... This paper derives and compares two strategies for minimizing topological constraints in a query expressed by a visual example: (1) elimination of topological relations that are implied uniquely by composition and (2) restriction to topological relations that relate nearneighbor objects, as det ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
to their ability to reduce topological constraints, and with respect to the quality of the results obtained by a similaritybased searching that uses these preprocessing strategies. The main conclusion of this work is that similarity queries that are formulated in a visual language should exploit the metric
An Optimal Algorithm for Approximate Nearest Neighbor Searching in Fixed Dimensions
 ACMSIAM SYMPOSIUM ON DISCRETE ALGORITHMS
, 1994
"... Consider a set S of n data points in real ddimensional space, R d , where distances are measured using any Minkowski metric. In nearest neighbor searching we preprocess S into a data structure, so that given any query point q 2 R d , the closest point of S to q can be reported quickly. Given any po ..."
Abstract

Cited by 984 (32 self)
 Add to MetaCart
Consider a set S of n data points in real ddimensional space, R d , where distances are measured using any Minkowski metric. In nearest neighbor searching we preprocess S into a data structure, so that given any query point q 2 R d , the closest point of S to q can be reported quickly. Given any
Nearoptimal hashing algorithms for approximate nearest neighbor in high dimensions
, 2008
"... In this article, we give an overview of efficient algorithms for the approximate and exact nearest neighbor problem. The goal is to preprocess a dataset of objects (e.g., images) so that later, given a new query object, one can quickly return the dataset object that is most similar to the query. The ..."
Abstract

Cited by 457 (7 self)
 Add to MetaCart
In this article, we give an overview of efficient algorithms for the approximate and exact nearest neighbor problem. The goal is to preprocess a dataset of objects (e.g., images) so that later, given a new query object, one can quickly return the dataset object that is most similar to the query
Demand Queries with Preprocessing
, 2014
"... Given a set of items and a submodular setfunction f that determines the value of every subset of items, a demand query assigns prices to the items, and the desired answer is a set S of items that maximizes the pro t, namely, the value of S minus its price. The use of demand queries is well motivate ..."
Abstract
 Add to MetaCart
motivated in the context of combinatorial auctions. However, answering a demand query (even approximately) is NPhard. We consider the question of whether exponential time preprocessing of f prior to receiving the demand query can help in later answering demand queries in polynomial time. We design a
Optimal preprocessing for answering online product queries
, 1987
"... We examine the amount of preprocessing needed for answering certain online queries as fast as possible. We start with the following basic problem. Suppose we are given a semigroup (S,°). Let s 1,..., sn be elements of S. We want to answer online queries of the form, "What is the product s ..."
Abstract

Cited by 61 (3 self)
 Add to MetaCart
We examine the amount of preprocessing needed for answering certain online queries as fast as possible. We start with the following basic problem. Suppose we are given a semigroup (S,°). Let s 1,..., sn be elements of S. We want to answer online queries of the form, "What is the product
PreProcessing Queries with Spatial Constraints
 Remote Sensing
, 1994
"... This paper discusses strategies for preprocessing spatial queries before executing them in a geographic database. A computational method has been devised, which is capable of assessing whether or not a spatial query is consistent, i.e., that its constraints are free of any selfcontradictions. If th ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
This paper discusses strategies for preprocessing spatial queries before executing them in a geographic database. A computational method has been devised, which is capable of assessing whether or not a spatial query is consistent, i.e., that its constraints are free of any selfcontradictions
Viewdependent simplification of arbitrary polygonal environments
, 1997
"... Hierarchical dynamic simplification (HDS) is a new approach to the problem of simplifying arbitrary polygonal environments. HDS operates dynamically, retessellating the scene continuously as the user’s viewing position shifts, and adaptively, processing the entire database without first decomposing ..."
Abstract

Cited by 286 (15 self)
 Add to MetaCart
the environment into individual objects. The resulting system allows realtime display of very complex polygonal CAD models consisting of thousands of parts and hundreds of thousands of polygons. HDS supports various preprocessing algorithms and various runtime criteria, providing a general framework for dynamic
Approximate distance oracles
, 2004
"... Let G = (V, E) be an undirected weighted graph with V  = n and E  = m. Let k ≥ 1 be an integer. We show that G = (V, E) can be preprocessed in O(kmn 1/k) expected time, constructing a data structure of size O(kn 1+1/k), such that any subsequent distance query can be answered, approximately, in ..."
Abstract

Cited by 273 (9 self)
 Add to MetaCart
Let G = (V, E) be an undirected weighted graph with V  = n and E  = m. Let k ≥ 1 be an integer. We show that G = (V, E) can be preprocessed in O(kmn 1/k) expected time, constructing a data structure of size O(kn 1+1/k), such that any subsequent distance query can be answered, approximately
Determining the Separation of Preprocessed Polyhedra  A Unified Approach
, 1990
"... We show how (now familiar) hierarchical representations of (convex) polyhedra can be used to answer various separation queries efficiently (in a number of cases, optimally). Our emphasis is i) the uniform treatment of polyhedra separation problems, ii) the use of hierarchical representations of prim ..."
Abstract

Cited by 115 (5 self)
 Add to MetaCart
We show how (now familiar) hierarchical representations of (convex) polyhedra can be used to answer various separation queries efficiently (in a number of cases, optimally). Our emphasis is i) the uniform treatment of polyhedra separation problems, ii) the use of hierarchical representations
Finding similar files in a large file system
 in Proceedings of the USENIX Winter 1994 Technical Conference
, 1994
"... We present a tool, called sif, for finding all similar files in a large file system. Files are considered similar if they have significant number of common pieces, even if they are very different otherwise. For example, one file may be contained, possibly with some changes, in another file, or a fil ..."
Abstract

Cited by 260 (3 self)
 Add to MetaCart
processing stage, which is very fast. Sif can also be used to very quickly identify all similar files to a query file using a preprocessed index. Application of sif can be found in file management, information collecting (to remove duplicates), program reuse, file synchronization, data compression, and maybe even
Results 1  10
of
1,126