Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
21,717
FastSLAM: A Factored Solution to the Simultaneous Localization and Mapping Problem
- In Proceedings of the AAAI National Conference on Artificial Intelligence
, 2002
"... The ability to simultaneously localize a robot and accurately map its surroundings is considered by many to be a key prerequisite of truly autonomous robots. However, few approaches to this problem scale up to handle the very large number of landmarks present in real environments. Kalman filter-base ..."
Abstract
-
Cited by 599 (10 self)
- Add to MetaCart
of landmarks in the map. This algorithm is based on a factorization of the posterior into a product of conditional landmark distributions and a distribution over robot paths. The algorithm has been run successfully on as many as 50,000 landmarks, environments far beyond the reach of previous approaches
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
, 1987
"... In this paper we describe simple identification and signature schemes which enable any user to prove his identity and the authenticity of his messages to any other user without shared or public keys. The schemes are provably secure against any known or chosen message attack ff factoring is difficult ..."
Abstract
-
Cited by 1028 (1 self)
- Add to MetaCart
In this paper we describe simple identification and signature schemes which enable any user to prove his identity and the authenticity of his messages to any other user without shared or public keys. The schemes are provably secure against any known or chosen message attack ff factoring
Shape and motion from image streams under orthography: a factorization method
- INTERNATIONAL JOURNAL OF COMPUTER VISION
, 1992
"... Inferring scene geometry and camera motion from a stream of images is possible in principle, but is an ill-conditioned problem when the objects are distant with respect to their size. We have developed a factorization method that can overcome this difficulty by recovering shape and motion under orth ..."
Abstract
-
Cited by 1094 (38 self)
- Add to MetaCart
uses the singular-value decomposition technique to factor the measurement matrix into two matrices which represent object shape and camera rotation respectively. Two of the three translation components are computed in a preprocessing stage. The method can also handle and obtain a full solution from a
Inverse Acoustic and Electromagnetic Scattering Theory, Second Edition
, 1998
"... Abstract. This paper is a survey of the inverse scattering problem for time-harmonic acoustic and electromagnetic waves at fixed frequency. We begin by a discussion of “weak scattering ” and Newton-type methods for solving the inverse scattering problem for acoustic waves, including a brief discussi ..."
Abstract
-
Cited by 1061 (45 self)
- Add to MetaCart
discussion of Tikhonov’s method for the numerical solution of ill-posed problems. We then proceed to prove a uniqueness theorem for the inverse obstacle problems for acoustic waves and the linear sampling method for reconstructing the shape of a scattering obstacle from far field data. Included in our
Studies of transformation of Escherichia coli with plasmids
- J. Mol. Biol
, 1983
"... Factors that affect he probability of genetic transformation f Escherichia coli by plasmids have been evaluated. A set of conditions is described under which about one in every 400 plasmid molecules produces a transformed cell. These conditions include cell growth in medium containing elevated level ..."
Abstract
-
Cited by 1632 (1 self)
- Add to MetaCart
Factors that affect he probability of genetic transformation f Escherichia coli by plasmids have been evaluated. A set of conditions is described under which about one in every 400 plasmid molecules produces a transformed cell. These conditions include cell growth in medium containing elevated
A density-based algorithm for discovering clusters in large spatial databases with noise
, 1996
"... Clustering algorithms are attractive for the task of class identification in spatial databases. However, the application to large spatial databases rises the following requirements for clustering algorithms: minimal requirements of domain knowledge to determine the input parameters, discovery of clu ..."
Abstract
-
Cited by 1786 (70 self)
- Add to MetaCart
of clusters with arbitrary shape and good efficiency on large databases. The well-known clustering algorithms offer no solution to the combination of these requirements. In this paper, we present the new clustering algorithm DBSCAN relying on a density-based notion of clusters which is designed to discover
A NEW POLYNOMIAL-TIME ALGORITHM FOR LINEAR PROGRAMMING
- COMBINATORICA
, 1984
"... We present a new polynomial-time algorithm for linear programming. In the worst case, the algorithm requires O(tf'SL) arithmetic operations on O(L) bit numbers, where n is the number of variables and L is the number of bits in the input. The running,time of this algorithm is better than the ell ..."
Abstract
-
Cited by 860 (3 self)
- Add to MetaCart
the ellipsoid algorithm by a factor of O(n~'~). We prove that given a polytope P and a strictly in-terior point a E P, there is a projective transformation of the space that maps P, a to P', a ' having the following property. The ratio of the radius of the smallest sphere with center a
Crystallography & NMR system: A new software suite for macromolecular structure determination.
- Acta Crystallogr. D Biol. Crystallogr.
, 1998
"... Abstract A new software suite, called Crystallography & NMR System (CNS), has been developed for macromolecular structure determination by X-ray crystallography or solution nuclear magnetic resonance (NMR) spectroscopy. In contrast to existing structure determination programs the architecture o ..."
Abstract
-
Cited by 1411 (6 self)
- Add to MetaCart
Abstract A new software suite, called Crystallography & NMR System (CNS), has been developed for macromolecular structure determination by X-ray crystallography or solution nuclear magnetic resonance (NMR) spectroscopy. In contrast to existing structure determination programs the architecture
The Dantzig selector: statistical estimation when p is much larger than n
, 2005
"... In many important statistical applications, the number of variables or parameters p is much larger than the number of observations n. Suppose then that we have observations y = Ax + z, where x ∈ R p is a parameter vector of interest, A is a data matrix with possibly far fewer rows than columns, n ≪ ..."
Abstract
-
Cited by 879 (14 self)
- Add to MetaCart
≪ p, and the zi’s are i.i.d. N(0, σ 2). Is it possible to estimate x reliably based on the noisy data y? To estimate x, we introduce a new estimator—we call the Dantzig selector—which is solution to the ℓ1-regularization problem min ˜x∈R p ‖˜x‖ℓ1 subject to ‖A T r‖ℓ ∞ ≤ (1 + t −1) √ 2 log p · σ
Ricci Flow with Surgery on Three-Manifolds
"... This is a technical paper, which is a continuation of [I]. Here we verify most of the assertions, made in [I, §13]; the exceptions are (1) the statement that a 3-manifold which collapses with local lower bound for sectional curvature is a graph manifold- this is deferred to a separate paper, as the ..."
Abstract
-
Cited by 448 (2 self)
- Add to MetaCart
, as the proof has nothing to do with the Ricci flow, and (2) the claim about the lower bound for the volumes of the maximal horns and the smoothness of the solution from some time on, which turned out to be unjustified, and, on the other hand, irrelevant for the other conclusions. The Ricci flow with surgery
Results 1 - 10
of
21,717
