Results 1  10
of
305,844
Depthfirst IterativeDeepening: An Optimal Admissible Tree Search
 Artificial Intelligence
, 1985
"... The complexities of various search algorithms are considered in terms of time, space, and cost of solution path. It is known that breadthfirst search requires too much space and depthfirst search can use too much time and doesn't always find a cheapest path. A depthfirst iteratiwdeepening a ..."
Abstract

Cited by 527 (24 self)
 Add to MetaCart
The complexities of various search algorithms are considered in terms of time, space, and cost of solution path. It is known that breadthfirst search requires too much space and depthfirst search can use too much time and doesn't always find a cheapest path. A depthfirst iteratiw
Efficient similarity search in sequence databases
, 1994
"... We propose an indexing method for time sequences for processing similarity queries. We use the Discrete Fourier Transform (DFT) to map time sequences to the frequency domain, the crucial observation being that, for most sequences of practical interest, only the first few frequencies are strong. Anot ..."
Abstract

Cited by 515 (19 self)
 Add to MetaCart
We propose an indexing method for time sequences for processing similarity queries. We use the Discrete Fourier Transform (DFT) to map time sequences to the frequency domain, the crucial observation being that, for most sequences of practical interest, only the first few frequencies are strong
Similarity search in high dimensions via hashing
, 1999
"... The nearest or nearneighbor query problems arise in a large variety of database applications, usually in the context of similarity searching. Of late, there has been increasing interest in building search/index structures for performing similarity search over highdimensional data, e.g., image dat ..."
Abstract

Cited by 641 (10 self)
 Add to MetaCart
to 20, searching in kd trees and related structures involves the inspection of a large fraction of the database, thereby doing no better than bruteforce linear search. It has been suggested that since the selection of features and the choice of a distance metric in typical applications is rather
OBBTree: A hierarchical structure for rapid interference detection
 PROC. ACM SIGGRAPH, 171–180
, 1996
"... We present a data structure and an algorithm for efficient and exact interference detection amongst complex models undergoing rigid motion. The algorithm is applicable to all general polygonal and curved models. It precomputes a hierarchical representation of models using tightfitting oriented bo ..."
Abstract

Cited by 845 (53 self)
 Add to MetaCart
bounding box trees. At runtime, the algorithm traverses the tree and tests for overlaps between oriented bounding boxes based on a new separating axis theorem, which takes less than 200 operations in practice. It has been implemented and we compare its performance with other hierarchical data structures
Suffix arrays: A new method for online string searches
, 1991
"... A new and conceptually simple data structure, called a suffix array, for online string searches is introduced in this paper. Constructing and querying suffix arrays is reduced to a sort and search paradigm that employs novel algorithms. The main advantage of suffix arrays over suffix trees is that ..."
Abstract

Cited by 835 (0 self)
 Add to MetaCart
A new and conceptually simple data structure, called a suffix array, for online string searches is introduced in this paper. Constructing and querying suffix arrays is reduced to a sort and search paradigm that employs novel algorithms. The main advantage of suffix arrays over suffix trees
Nearest neighbor queries.
 ACM SIGMOD Record,
, 1995
"... Abstract A frequently encountered type of query in Geographic Information Systems is to nd the k nearest neighbor objects to a given point in space. Processing such queries requires substantially di erent search algorithms than those for location or range queries. In this paper we present a n e cie ..."
Abstract

Cited by 592 (1 self)
 Add to MetaCart
cient branchandbound Rtree traversal algorithm to nd the nearest neighbor object to a point, and then generalize it to nding the k nearest neighbors. We also discuss metrics for an optimistic and a pessimistic search ordering strategy as well as for pruning. Finally, w e present the results
The SRtree: An Index Structure for HighDimensional Nearest Neighbor Queries
, 1997
"... Recently, similarity queries on feature vectors have been widely used to perform contentbased retrieval of images. To apply this technique to large databases, it is required to develop multidimensional index structures supporting nearest neighbor queries e ciently. The SStree had been proposed for ..."
Abstract

Cited by 438 (3 self)
 Add to MetaCart
volume than bounding rectangles with highdimensional data and that this reduces search efficiency. To overcome this drawback, we propose a new index structure called the SRtree (Sphere/Rectangletree) which integrates bounding spheres and bounding rectangles. A region of the SRtree is specified
Complexity of finding embeddings in a ktree
 SIAM JOURNAL OF DISCRETE MATHEMATICS
, 1987
"... A ktree is a graph that can be reduced to the kcomplete graph by a sequence of removals of a degree k vertex with completely connected neighbors. We address the problem of determining whether a graph is a partial graph of a ktree. This problem is motivated by the existence of polynomial time al ..."
Abstract

Cited by 386 (1 self)
 Add to MetaCart
algorithms for many combinatorial problems on graphs when the graph is constrained to be a partial ktree for fixed k. These algorithms have practical applications in areas such as reliability, concurrent broadcasting and evaluation of queries in a relational database system. We determine the complexity
On visible surface generation by a priori tree structures
 Computer Graphics
, 1980
"... This paper describes a new algorithm for solving the hidden surface (or line) problem, to more rapidly generate realistic images of 3D scenes composed of polygons, and presents the development of theoretical foundations in the area as well as additional related algorithms. As in many applications t ..."
Abstract

Cited by 370 (6 self)
 Add to MetaCart
;quot;ninary space partitioning " tree whose inorder traversal of visibility priority at runtime will produce a lineaL " order, dependent upon the viewing position, on (parts of) the polygons, which can then be used to easily solve the hidden surfac6 problem. In the application where the entire
Limited Discrepancy Search
 In Proceedings IJCAI’95
, 1995
"... Many problems of practical interest can be solved using tree search methods because carefully tuned successor ordering heuristics guide the search toward regions of the space that are likely to contain solutions. For some problems, the heuristics often lead directly to a solution— but not always. Li ..."
Abstract

Cited by 304 (5 self)
 Add to MetaCart
Many problems of practical interest can be solved using tree search methods because carefully tuned successor ordering heuristics guide the search toward regions of the space that are likely to contain solutions. For some problems, the heuristics often lead directly to a solution— but not always
Results 1  10
of
305,844