Sciweavers

1053 search results - page 18 / 211
» Oriented Projective Geometry
Sort
View
COMPGEOM
2008
ACM
13 years 9 months ago
Tighter bounds for random projections of manifolds
The Johnson-Lindenstrauss random projection lemma gives a simple way to reduce the dimensionality of a set of points while approximately preserving their pairwise distances. The m...
Kenneth L. Clarkson
AMC
2010
114views more  AMC 2010»
13 years 7 months ago
Witness sets of projections
Elimination is a basic algebraic operation which geometrically corresponds to projections. This article describes using the numerical algebraic geometric concept of witness sets t...
Jonathan D. Hauenstein, Andrew J. Sommese
CORR
2007
Springer
76views Education» more  CORR 2007»
13 years 7 months ago
Some problems in asymptotic convex geometry and random matrices motivated by numerical algorithms
Abstract. The simplex method in Linear Programming motivates several problems of asymptotic convex geometry. We discuss some conjectures and known results in two related directions...
Roman Vershynin
MICCAI
2002
Springer
14 years 8 months ago
A Spin Glass Based Framework to Untangle Fiber Crossing in MR Diffusion Based Tracking
We propose a general approach to the reconstruction of brain white matter geometry from diffusion-weighted data. This approach is based on an inverse problem framework. The optimal...
Yann Cointepas, Cyril Poupon, Denis Le Bihan, Jean...
DM
2008
117views more  DM 2008»
13 years 7 months ago
Classes of optical orthogonal codes from arcs in root subspaces
We present new constructions for (n, w, ) optical orthogonal codes (OOC) using techniques from finite projective geometry. In one case codewords correspond to (q - 1)-arcs contain...
T. L. Alderson, Keith E. Mellinger