Sciweavers

3934 search results - page 351 / 787
» Approximate Schedulability Analysis
Sort
View
STOC
2001
ACM
138views Algorithms» more  STOC 2001»
16 years 7 months ago
Fast computation of low rank matrix
Given a matrix A, it is often desirable to find a good approximation to A that has low rank. We introduce a simple technique for accelerating the computation of such approximation...
Dimitris Achlioptas, Frank McSherry
DAC
1996
ACM
15 years 11 months ago
A Sparse Image Method for BEM Capacitance Extraction
Boundary element methods (BEM) are often used for complex 3-D capacitance extraction because of their efficiency, ease of data preparation, and automatic handling of open regions. ...
Byron Krauter, Yu Xia, E. Aykut Dengi, Lawrence T....
APPROX
2008
Springer
101views Algorithms» more  APPROX 2008»
15 years 8 months ago
Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity
Clustering is a common problem in the analysis of large data sets. Streaming algorithms, which make a single pass over the data set using small working memory and produce a cluster...
Richard Matthew McCutchen, Samir Khuller
ICML
2010
IEEE
15 years 7 months ago
A scalable trust-region algorithm with application to mixed-norm regression
We present a new algorithm for minimizing a convex loss-function subject to regularization. Our framework applies to numerous problems in machine learning and statistics; notably,...
Dongmin Kim, Suvrit Sra, Inderjit S. Dhillon
MOC
2011
15 years 1 months ago
Convergence of a mixed method for a semi-stationary compressible Stokes system
We propose and analyze a finite element method for a semi– stationary Stokes system modeling compressible fluid flow subject to a Navier– slip boundary condition. The veloci...
Kenneth H. Karlsen, Trygve K. Karper