Sciweavers

1301 search results - page 120 / 261
» Bounded Version Vectors
Sort
View
91
Voted
APPROX
2006
Springer
107views Algorithms» more  APPROX 2006»
15 years 4 months ago
A Fast Random Sampling Algorithm for Sparsifying Matrices
We describe a simple random-sampling based procedure for producing sparse matrix approximations. Our procedure and analysis are extremely simple: the analysis uses nothing more th...
Sanjeev Arora, Elad Hazan, Satyen Kale
86
Voted
CDC
2008
IEEE
116views Control Systems» more  CDC 2008»
15 years 26 days ago
On external semi-global stochastic stabilization of a double integrator with input saturation
This paper considers external semi-global stochastic stabilization for linear plants with saturating actuators, driven by a stochastic external disturbance, and having random Gauss...
Anton A. Stoorvogel, Ali Saberi
140
Voted
COMBINATORICS
2006
169views more  COMBINATORICS 2006»
15 years 22 days ago
The Diameter and Laplacian Eigenvalues of Directed Graphs
For undirected graphs it has been known for some time that one can bound the diameter using the eigenvalues. In this note we give a similar result for the diameter of strongly con...
Fan R. K. Chung
94
Voted
FOCS
2010
IEEE
14 years 10 months ago
Learning Convex Concepts from Gaussian Distributions with PCA
We present a new algorithm for learning a convex set in n-dimensional space given labeled examples drawn from any Gaussian distribution. The complexity of the algorithm is bounded ...
Santosh Vempala
114
Voted
CORR
2010
Springer
102views Education» more  CORR 2010»
14 years 10 months ago
A contribution to the conditioning of the total least squares problem
We derive closed formulas for the condition number of a linear function of the total least squares solution. Given an over determined linear systems Ax = b, we show that this condi...
Marc Baboulin, Serge Gratton