Results 1  10
of
4,669
A Probabilistic Approach to Concurrent Mapping and Localization for Mobile Robots
 Machine Learning
, 1998
"... . This paper addresses the problem of building largescale geometric maps of indoor environments with mobile robots. It poses the map building problem as a constrained, probabilistic maximumlikelihood estimation problem. It then devises a practical algorithm for generating the most likely map from ..."
Abstract

Cited by 483 (43 self)
 Add to MetaCart
data, alog with the most likely path taken by the robot. Experimental results in cyclic environments of size up to 80 by 25 meter illustrate the appropriateness of the approach. Keywords: Bayes rule, expectation maximization, mobile robots, navigation, localization, mapping, maximum likelihood
On Compiling BlockCyclic Data Redistribution
, 1997
"... The paper proposes compilation techniques for blockcyclic data redistribution on distributedmemory multicomputers when twolevel dataprocessor mapping is adopted. Since static data distribution is insufficient in achieving high performance computing for many scientific and engineering applications ..."
Abstract
 Add to MetaCart
to efficiently generate communication sets for blockcyclic data redistribution, assuming dataprocessor mapping is a twolevel mapping, that is, related array objects are first aligned with each other or aligned with an abstract index space; this group of arrays is then distributed onto the user
Aggregate Productivity Growth: Lessons from Microeconomic Evidence
, 2000
"... Recent research using establishment and firm level data has raised a variety of conceptual and measurement questions regarding our understanding of aggregate productivity growth. 1 Several key, related findings are of interest. First, there is large scale, ongoing reallocation of outputs and input ..."
Abstract

Cited by 472 (49 self)
 Add to MetaCart
Recent research using establishment and firm level data has raised a variety of conceptual and measurement questions regarding our understanding of aggregate productivity growth. 1 Several key, related findings are of interest. First, there is large scale, ongoing reallocation of outputs
Efficient Block Cyclic Data Redistribution
 In EuroPar'96
, 1996
"... : Implementing linear algebra kernels on distributed memory parallel computers raises the problem of data distribution of matrices and vectors among the processors. Blockcyclic distribution seems to suit well for most algorithms. But one has to choose a good compromise for the size of the blocks (t ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
: Implementing linear algebra kernels on distributed memory parallel computers raises the problem of data distribution of matrices and vectors among the processors. Blockcyclic distribution seems to suit well for most algorithms. But one has to choose a good compromise for the size of the blocks
A Query Language and Optimization Techniques for Unstructured Data
, 1996
"... A new kind of data model has recently emerged in which the database is not constrained by a conventional schema. Systems like ACeDB, which has become very popular with biologists, and the recent Tsimmis proposal for data integration organize data in treelike structures whose components can be used ..."
Abstract

Cited by 407 (35 self)
 Add to MetaCart
be represented as fixeddepth trees, and on such trees UnQL is equivalent to the relational algebra. The novelty of UnQL consists in its programming constructs for arbitrarily deep data and for cyclic structures. While strictly more powerful than query languages with path expressions like XSQL, UnQL can still
Automated Termination Proofs for Java Programs with Cyclic Data
, 2012
"... In earlier work, we developed a technique to prove termination of Java programs automatically: first, Java programs are automatically transformed to term rewrite systems (TRSs) and then, existing methods and tools are used to prove termination of the resulting TRSs. In this paper, we extend our tech ..."
Abstract

Cited by 10 (5 self)
 Add to MetaCart
technique in order to prove termination of algorithms on cyclic data such as cyclic lists or graphs automatically. We implemented our technique in the tool AProVE and performed extensive experiments to evaluate its practical applicability.
Incremental mapping of large cyclic environments
 In Computational Intelligence in Robotics and Automation
, 1999
"... Mobile robots can use geometric or topological maps of their environment to navigate reliably. Automatic creation of such maps is still an unrealized goal, especially in environments that have large cyclical structures. Drawing on recent techniques of global registration and correlation, we present ..."
Abstract

Cited by 332 (19 self)
 Add to MetaCart
Mobile robots can use geometric or topological maps of their environment to navigate reliably. Automatic creation of such maps is still an unrealized goal, especially in environments that have large cyclical structures. Drawing on recent techniques of global registration and correlation, we present
Dynamic Cyclic Data Structures in Lazy Functional Languages
, 1995
"... Many popular myths have evolved about functional programming languages and their power of expression; one such myth is that "functional languages cannot construct arbitrary cyclic data structures at runtime" and therefore that functional languages are not appropriate for problems which re ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Many popular myths have evolved about functional programming languages and their power of expression; one such myth is that "functional languages cannot construct arbitrary cyclic data structures at runtime" and therefore that functional languages are not appropriate for problems which
Sparse Block and Cyclic Data Distributions for Matrix Computations
 In Proceedings of High Performance Computing: Technology, Methods and Applications Advanced Workshop
, 1994
"... A significant part of scientific codes consist of sparse matrix computations. In this work we propose two new pseudoregular data distributions for sparse matrices. The Multiple Recursive Decomposition (MRD) partitions the data using the prime factors of the dimensions of a multiprocessor network wit ..."
Abstract

Cited by 19 (13 self)
 Add to MetaCart
by other analyzed methods, being their implementation easier. In fact, the data distributions resulting from the MRD and BRS methods are a generalization of the Block and Cyclic distributions used in dense matrices. 1.
Redistribution of BlockCyclic Data Distributions Using MPI
, 1996
"... Arrays that are distributed in a block cyclic fashion are important for many applications in the computational sciences since they often lead to parallel algorithms with good load balancing properties. We consider the problem of redistributing such an array to a new block size. This operation is dir ..."
Abstract

Cited by 19 (0 self)
 Add to MetaCart
Arrays that are distributed in a block cyclic fashion are important for many applications in the computational sciences since they often lead to parallel algorithms with good load balancing properties. We consider the problem of redistributing such an array to a new block size. This operation
Results 1  10
of
4,669