Results 1  10
of
207,432
DivideandConquer in Multidimensional Space
, 1976
"... We investigate a divideandconquer technique in multidimensional space which decomposes a geometric problem on N points in k dimensions into two problems on N/2 points in k dimensions plus a single problem on N points in k1 dimension. Special structure of the subproblems is exploited to obtain an ..."
Abstract

Cited by 35 (0 self)
 Add to MetaCart
We investigate a divideandconquer technique in multidimensional space which decomposes a geometric problem on N points in k dimensions into two problems on N/2 points in k dimensions plus a single problem on N points in k1 dimension. Special structure of the subproblems is exploited to obtain
The Integration of in a Multidimensional Space
, 2000
"... this paper, we will first give the interpretation of the following integral (EQ 2) ..."
Abstract
 Add to MetaCart
this paper, we will first give the interpretation of the following integral (EQ 2)
Inverse queries for multidimensional spaces
 In The ACM Computing Research Repository (CoRR), http://arxiv.org/abs/1103.0172
, 2011
"... Abstract. Traditional spatial queries return, for a given query object q, all database objects that satisfy a given predicate, such as epsilon range and knearest neighbors. This paper defines and studies inverse spatial queries, which, given a subset of database objects Q and a query predicate, ret ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
to apply this framework on a variety of inverse queries, using appropriate space pruning strategies. In particular, we propose solutions for inverse epsilon range queries, inverse knearest neighbor queries, and inverse skyline queries. Our experiments show that our framework is significantly more
LocalityPreserving Hashing in Multidimensional Spaces
 In Proceedings of the 29th ACM Symposium on Theory of Computing
, 1997
"... this paper was published in Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pages 618625, 1997 ..."
Abstract

Cited by 58 (5 self)
 Add to MetaCart
this paper was published in Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pages 618625, 1997
The particel swarm: Explosion, stability, and convergence in a multidimensional complex space
 IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTION
"... The particle swarm is an algorithm for finding optimal regions of complex search spaces through interaction of individuals in a population of particles. Though the algorithm, which is based on a metaphor of social interaction, has been shown to perform well, researchers have not adequately explained ..."
Abstract

Cited by 822 (10 self)
 Add to MetaCart
The particle swarm is an algorithm for finding optimal regions of complex search spaces through interaction of individuals in a population of particles. Though the algorithm, which is based on a metaphor of social interaction, has been shown to perform well, researchers have not adequately
N Degrees of Separation: MultiDimensional Separation of Concerns
 IN PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING
, 1999
"... Done well, separation of concerns can provide many software engineering benefits, including reduced complexity, improved reusability, and simpler evolution. The choice of boundaries for separate concerns depends on both requirements on the system and on the kind(s) of decompositionand composition a ..."
Abstract

Cited by 514 (8 self)
 Add to MetaCart
Done well, separation of concerns can provide many software engineering benefits, including reduced complexity, improved reusability, and simpler evolution. The choice of boundaries for separate concerns depends on both requirements on the system and on the kind(s) of decompositionand composition a given formalism supports. The predominant methodologies and formalisms available, however, support only orthogonal separations of concerns, along single dimensions of composition and decomposition. These characteristics lead to a number of wellknown and difficult problems. This paper describes a new paradigm for modeling and implementing software artifacts, one that permits separation of overlapping concerns along multiple dimensions of composition and decomposition. This approach addresses numerous problems throughout the software lifecycle in achieving wellengineered, evolvable, flexible software artifacts and traceability across artifacts.
Nearest Neighbor Search in Multidimensional Spaces
, 1999
"... The Nearest Neighbor Search problem is defined as follows: given a set P of n points, preprocess the points so as to efficiently answer queries that require finding the closest point in P to a query point q. If we are willing to settle for a point that is almost as close as the nearest neighbor, t ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
these applications is similarity search: given a database of objects, we want to return the object in the database that is most similar to a query object. The objects are mapped onto points in a high dimensional metric space , and similarity search reduces to a nearest neighbor search. The dimension
Entropic measure on multidimensional spaces, preprint
"... Abstract. We construct the entropic measure P β on compact manifolds of any dimension. It is defined as the push forward of the Dirichlet process (another random probability measure, wellknown to exist on spaces of any dimension) under the conjugation map C: P(M) → P(M). This conjugation map is a ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Abstract. We construct the entropic measure P β on compact manifolds of any dimension. It is defined as the push forward of the Dirichlet process (another random probability measure, wellknown to exist on spaces of any dimension) under the conjugation map C: P(M) → P(M). This conjugation map is a
DIMS Direct methods In Multidimensional Space
"... program for solving onedimensionally modulated incommensurate structures and composite structures consists of two subsystems with two axes of the unit cell coincided to each other. Actually DIMS can also deal with threedimensional periodic structures including commensurate modulated structures. Th ..."
Abstract
 Add to MetaCart
program for solving onedimensionally modulated incommensurate structures and composite structures consists of two subsystems with two axes of the unit cell coincided to each other. Actually DIMS can also deal with threedimensional periodic structures including commensurate modulated structures. The latter
Finding Path in Multidimensional Space with Obstacles
, 2002
"... The motion of a robotic arms, in an environment containing obstacles, and the determining the minimum energy (stable) state for protein, can be modeled as a high dimensionality search problem. Search in a high dimensional space is quite a complex problem. The solution to this problem, using complete ..."
Abstract
 Add to MetaCart
The motion of a robotic arms, in an environment containing obstacles, and the determining the minimum energy (stable) state for protein, can be modeled as a high dimensionality search problem. Search in a high dimensional space is quite a complex problem. The solution to this problem, using
Results 1  10
of
207,432