Sciweavers

213 search results - page 30 / 43
» Grasp Analysis as Linear Matrix Inequality Problems
Sort
View
ASPLOS
2009
ACM
15 years 10 months ago
QR decomposition on GPUs
QR decomposition is a computationally intensive linear algebra operation that factors a matrix A into the product of a unitary matrix Q and upper triangular matrix R. Adaptive sys...
Andrew Kerr, Dan Campbell, Mark Richards
NCI
2004
125views Neural Networks» more  NCI 2004»
14 years 11 months ago
A new approach to blind source separation with global optimal property
This paper presents a new independency metric for blind source separation (BSS) problem. It is mathematically proved that the metric value of any linear combination of source sign...
Yiu-ming Cheung, Hailin Liu
TLCA
2007
Springer
15 years 3 months ago
Polynomial Size Analysis of First-Order Functions
We present a size-aware type system for first-order shapely function definitions. Here, a function definition is called shapely when the size of the result is determined exactly...
Olha Shkaravska, Ron van Kesteren, Marko C. J. D. ...
ICML
2007
IEEE
15 years 10 months ago
Full regularization path for sparse principal component analysis
Given a sample covariance matrix, we examine the problem of maximizing the variance explained by a particular linear combination of the input variables while constraining the numb...
Alexandre d'Aspremont, Francis R. Bach, Laurent El...
84
Voted
STACS
2005
Springer
15 years 3 months ago
Sampling Sub-problems of Heterogeneous Max-cut Problems and Approximation Algorithms
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...
Petros Drineas, Ravi Kannan, Michael W. Mahoney