Sciweavers

4315 search results - page 221 / 863
» Sorting in linear time
Sort
View
STOC
2009
ACM
136views Algorithms» more  STOC 2009»
16 years 4 months ago
Random walks on polytopes and an affine interior point method for linear programming
Let K be a polytope in Rn defined by m linear inequalities. We give a new Markov Chain algorithm to draw a nearly uniform sample from K. The underlying Markov Chain is the first t...
Ravi Kannan, Hariharan Narayanan
WOWMOM
2005
ACM
82views Multimedia» more  WOWMOM 2005»
15 years 9 months ago
Power Control is not Required for Wireless Networks in the Linear Regime
— We consider the design of optimal strategies for joint power adaptation, rate adaptation and scheduling in a multi-hop wireless network. Most existing strategies control either...
Bozidar Radunovic, Jean-Yves Le Boudec
COMPGEOM
1992
ACM
15 years 8 months ago
A Subexponential Bound for Linear Programming
We present a simple randomized algorithm which solves linear programs with n constraints and d variables in expected minfO(d 22dn); e 2 pdln(n= p d)+O( p d+lnn)g time in the unit ...
Jirí Matousek, Micha Sharir, Emo Welzl
154
Voted
NIPS
2004
15 years 5 months ago
Two-Dimensional Linear Discriminant Analysis
Linear Discriminant Analysis (LDA) is a well-known scheme for feature extraction and dimension reduction. It has been used widely in many applications involving high-dimensional d...
Jieping Ye, Ravi Janardan, Qi Li
CDC
2008
IEEE
142views Control Systems» more  CDC 2008»
15 years 5 months ago
Stability analysis of linear hyperbolic systems with switching parameters and boundary conditions
Abstract— We study asymptotic stability of an infinite dimensional system that switches between a finite set of modes. Each mode is governed by a system of one-dimensional, lin...
Saurabh Amin, Falk M. Hante, Alexandre M. Bayen