Results 1  10
of
1,762,135
An Optimal Algorithm for the onLine Closest Pair Problem
 Algorithmica
, 1994
"... We give an algorithm that computes the closest pair in a set of n points in k dimensional space online, in O(n log n) time. The algorithm only uses algebraic functions and, therefore, is optimal. The algorithm maintains a hierarchical subdivision of kspace into hyperrectangles, which is stored i ..."
Abstract

Cited by 20 (4 self)
 Add to MetaCart
We give an algorithm that computes the closest pair in a set of n points in k dimensional space online, in O(n log n) time. The algorithm only uses algebraic functions and, therefore, is optimal. The algorithm maintains a hierarchical subdivision of kspace into hyperrectangles, which is stored
Structures for the Dynamic ClosestPair Problem
"... We describe a new randomized data structure, the sparse partition, for solving the dynamic closestpair problem. Using this data structure the closest pair of a set of n points in kdimensional space, for any fixed Ic, can be found in constant time. If the points are chosen from a finite universe, a ..."
Abstract
 Add to MetaCart
We describe a new randomized data structure, the sparse partition, for solving the dynamic closestpair problem. Using this data structure the closest pair of a set of n points in kdimensional space, for any fixed Ic, can be found in constant time. If the points are chosen from a finite universe
Randomized Data Structures for the Dynamic ClosestPair Problem
, 1993
"... We describe a new randomized data structure, the sparse partition, for solving the dynamic closestpair problem. Using this data structure the closest pair of a set of n points in Ddimensional space, for any fixed D, can be found in constant time. If a frame containing all the points is known in adv ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
We describe a new randomized data structure, the sparse partition, for solving the dynamic closestpair problem. Using this data structure the closest pair of a set of n points in Ddimensional space, for any fixed D, can be found in constant time. If a frame containing all the points is known
An Optimized DivideandConquer Algorithm for the ClosestPair Problem in the Planar Case
"... We present an engineered version of the divideandconquer algorithm for finding the closest pair of points, within a given set of points in the XYplane. In this version of the algorithm, only two pairwise comparisons are required in the combine step, for each point that lies in the 2δwide vertic ..."
Abstract
 Add to MetaCart
We present an engineered version of the divideandconquer algorithm for finding the closest pair of points, within a given set of points in the XYplane. In this version of the algorithm, only two pairwise comparisons are required in the combine step, for each point that lies in the 2δ
OnLine Construction of Suffix Trees
, 1995
"... An online algorithm is presented for constructing the suffix tree for a given string in time linear in the length of the string. The new algorithm has the desirable property of processing the string symbol by symbol from left to right. It has always the suffix tree for the scanned part of the strin ..."
Abstract

Cited by 432 (2 self)
 Add to MetaCart
An online algorithm is presented for constructing the suffix tree for a given string in time linear in the length of the string. The new algorithm has the desirable property of processing the string symbol by symbol from left to right. It has always the suffix tree for the scanned part
A Limited Memory Algorithm for Bound Constrained Optimization
 SIAM Journal on Scientific Computing
, 1994
"... An algorithm for solving large nonlinear optimization problems with simple bounds is described. ..."
Abstract

Cited by 557 (9 self)
 Add to MetaCart
An algorithm for solving large nonlinear optimization problems with simple bounds is described.
A DecisionTheoretic Generalization of onLine Learning and an Application to Boosting
, 1996
"... ..."
WordNet: An online lexical database
 International Journal of Lexicography
, 1990
"... WordNet is an online lexical reference system whose design is inspired by current ..."
Abstract

Cited by 1945 (9 self)
 Add to MetaCart
WordNet is an online lexical reference system whose design is inspired by current
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 827 (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
SNOPT: An SQP Algorithm For LargeScale Constrained Optimization
, 2002
"... Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective and constraints. Here we consider problems with general inequality constraints (linear and nonlinear). We assume that first deriv ..."
Abstract

Cited by 582 (23 self)
 Add to MetaCart
Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective and constraints. Here we consider problems with general inequality constraints (linear and nonlinear). We assume that first
Results 1  10
of
1,762,135