Sciweavers

332 search results - page 28 / 67
» The Monochromatic Column problem
Sort
View
HICSS
2008
IEEE
199views Biometrics» more  HICSS 2008»
14 years 4 months ago
Clustering and the Biclique Partition Problem
A technique for clustering data by common attribute values involves grouping rows and columns of a binary matrix to make the minimum number of submatrices all 1’s. As binary mat...
Doina Bein, Linda Morales, Wolfgang W. Bein, C. O....
KDD
2004
ACM
181views Data Mining» more  KDD 2004»
14 years 10 months ago
Column-generation boosting methods for mixture of kernels
We devise a boosting approach to classification and regression based on column generation using a mixture of kernels. Traditional kernel methods construct models based on a single...
Jinbo Bi, Tong Zhang, Kristin P. Bennett
SIAMAM
2008
79views more  SIAMAM 2008»
13 years 9 months ago
Transport-Based Imaging in Random Media
This paper generalizes well-established derivations of the radiative transfer equation from first principles to model the energy density of time-dependent and monochromatic high f...
Guillaume Bal, Kui Ren
STOC
2009
ACM
271views Algorithms» more  STOC 2009»
14 years 10 months ago
A fast and efficient algorithm for low-rank approximation of a matrix
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
Nam H. Nguyen, Thong T. Do, Trac D. Tran
NIPS
2007
13 years 11 months ago
Convex Learning with Invariances
Incorporating invariances into a learning algorithm is a common problem in machine learning. We provide a convex formulation which can deal with arbitrary loss functions and arbit...
Choon Hui Teo, Amir Globerson, Sam T. Roweis, Alex...