Results 1  10
of
608,244
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 illconditioned 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 1090 (38 self)
 Add to MetaCart
Inferring scene geometry and camera motion from a stream of images is possible in principle, but is an illconditioned 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
The University of Florida sparse matrix collection
 NA DIGEST
, 1997
"... The University of Florida Sparse Matrix Collection is a large, widely available, and actively growing set of sparse matrices that arise in real applications. Its matrices cover a wide spectrum of problem domains, both those arising from problems with underlying 2D or 3D geometry (structural enginee ..."
Abstract

Cited by 535 (17 self)
 Add to MetaCart
The University of Florida Sparse Matrix Collection is a large, widely available, and actively growing set of sparse matrices that arise in real applications. Its matrices cover a wide spectrum of problem domains, both those arising from problems with underlying 2D or 3D geometry (structural
CURE: An Efficient Clustering Algorithm for Large Data sets
 Published in the Proceedings of the ACM SIGMOD Conference
, 1998
"... Clustering, in data mining, is useful for discovering groups and identifying interesting distributions in the underlying data. Traditional clustering algorithms either favor clusters with spherical shapes and similar sizes, or are very fragile in the presence of outliers. We propose a new clustering ..."
Abstract

Cited by 723 (5 self)
 Add to MetaCart
Clustering, in data mining, is useful for discovering groups and identifying interesting distributions in the underlying data. Traditional clustering algorithms either favor clusters with spherical shapes and similar sizes, or are very fragile in the presence of outliers. We propose a new
Robust wide baseline stereo from maximally stable extremal regions
 In Proc. BMVC
, 2002
"... The widebaseline stereo problem, i.e. the problem of establishing correspondences between a pair of images taken from different viewpoints is studied. A new set of image elements that are put into correspondence, the so called extremal regions, is introduced. Extremal regions possess highly desir ..."
Abstract

Cited by 1014 (35 self)
 Add to MetaCart
sirable properties: the set is closed under 1. continuous (and thus projective) transformation of image coordinates and 2. monotonic transformation of image intensities. An efficient (near linear complexity) and practically fast detection algorithm (near frame rate) is presented for an affinelyinvariant stable
On the gauge theory/geometry correspondence
 Adv. Theor. Math. Phys
, 1999
"... The ’t Hooft expansion of SU(N) ChernSimons theory on S3 is proposed to be exactly dual to the topological closed string theory on the S2 blow up of the conifold geometry. The Bfield on the S2 has magnitude Ngs = λ, the ’t Hooft coupling. We are able to make a number of checks, such as finding exa ..."
Abstract

Cited by 274 (36 self)
 Add to MetaCart
The ’t Hooft expansion of SU(N) ChernSimons theory on S3 is proposed to be exactly dual to the topological closed string theory on the S2 blow up of the conifold geometry. The Bfield on the S2 has magnitude Ngs = λ, the ’t Hooft coupling. We are able to make a number of checks, such as finding
The Impact of DHT Routing Geometry on Resilience and Proximity
, 2003
"... The various proposed DHT routing algorithms embody several different underlying routing geometries. These geometries include hypercubes, rings, treelike structures, and butterfly networks. In this paper we focus on how these basic geometric approaches affect the resilience and proximity properties ..."
Abstract

Cited by 286 (4 self)
 Add to MetaCart
The various proposed DHT routing algorithms embody several different underlying routing geometries. These geometries include hypercubes, rings, treelike structures, and butterfly networks. In this paper we focus on how these basic geometric approaches affect the resilience and proximity properties
On the geometry of metric measure spaces
 II, ACTA MATH
, 2004
"... We introduce and analyze lower (’Ricci’) curvature bounds Curv(M, d,m) ≥ K for metric measure spaces (M, d,m). Our definition is based on convexity properties of the relative entropy Ent(.m) regarded as a function on the L2Wasserstein space of probability measures on the metric space (M, d). Amo ..."
Abstract

Cited by 245 (8 self)
 Add to MetaCart
). Among others, we show that Curv(M, d,m) ≥ K implies estimates for the volume growth of concentric balls. For Riemannian manifolds, Curv(M, d,m) ≥ K if and only if RicM (ξ, ξ) ≥ K · ξ2 for all ξ ∈ TM. The crucial point is that our lower curvature bounds are stable under an appropriate notion of D
Analysis and Visualization of Classifier Performance: Comparison under Imprecise Class and Cost Distributions. In:
 3rd International Conference on Knowledge Discovery and Data Mining,
, 1997
"... Abstract Applications of inductive learning algorithms to realworld data mining problems have shown repeatedly that using accuracy to compare classifiers is not adequate because the underlying assumptions rarely hold. We present a method for the comparison of classifier performance that is robust t ..."
Abstract

Cited by 313 (15 self)
 Add to MetaCart
Abstract Applications of inductive learning algorithms to realworld data mining problems have shown repeatedly that using accuracy to compare classifiers is not adequate because the underlying assumptions rarely hold. We present a method for the comparison of classifier performance that is robust
Exploring the Contact Space to Plan Robot Motions under Geometry Uncertainty Constraints
"... The work presented on this paper has been derived from previous work around the area of fine motion assembly planning. However, the method that we present can be applied to solve different robot motion planning problems. The robustness of the trajectories produced by a robot motion planner depends o ..."
Abstract
 Add to MetaCart
The work presented on this paper has been derived from previous work around the area of fine motion assembly planning. However, the method that we present can be applied to solve different robot motion planning problems. The robustness of the trajectories produced by a robot motion planner depends on both, the models used to represent the uncertainty, and the strategies used to deal with it. A robot motion planner receives a geometric description of the manipulated object and its environment. This description is called the "nominal world" and is just an approximation of the mechanical world where the robot operates. The success of a robot manipulation program strongly relies on the information that the planner extracts from the nominal world to reduce the uncertainty, and how this information is combined with sensing operations in a control program. This paper presents a local approach to plan robot motions by exploring the contact space. A potential field function defined over both, t...
Conformal deformation of a Riemannian metric to constant curvature
 J. Diff. Geome
, 1984
"... A wellknown open question in differential geometry is the question of whether a given compact Riemannian manifold is necessarily conformally equivalent to one of constant scalar curvature. This problem is known as the Yamabe problem because it was formulated by Yamabe [8] in 1960, While Yamabe&apos ..."
Abstract

Cited by 308 (0 self)
 Add to MetaCart
A wellknown open question in differential geometry is the question of whether a given compact Riemannian manifold is necessarily conformally equivalent to one of constant scalar curvature. This problem is known as the Yamabe problem because it was formulated by Yamabe [8] in 1960, While Yamabe
Results 1  10
of
608,244