Sciweavers

70 search results - page 5 / 14
» Approximation Reformulations
Sort
View
ICML
2010
IEEE
13 years 8 months ago
A DC Programming Approach for Sparse Eigenvalue Problem
We investigate the sparse eigenvalue problem which arises in various fields such as machine learning and statistics. Unlike standard approaches relying on approximation of the l0n...
Mamadou Thiao, Pham Dinh Tao, Le Thi Hoai An
WIDM
2006
ACM
14 years 2 months ago
SRI: exploiting semantic information for effective query routing in a PDMS
The huge amount of data available from Internet information sources has focused much attention on the sharing of distributed information through Peer Data Management Systems (PDMS...
Federica Mandreoli, Riccardo Martoglia, Simona Sas...
KDD
2010
ACM
223views Data Mining» more  KDD 2010»
13 years 10 months ago
An efficient algorithm for a class of fused lasso problems
The fused Lasso penalty enforces sparsity in both the coefficients and their successive differences, which is desirable for applications with features ordered in some meaningful w...
Jun Liu, Lei Yuan, Jieping Ye
CAGD
2008
154views more  CAGD 2008»
13 years 8 months ago
From extension of Loop's approximation scheme to interpolatory subdivisions
The minimum-supported bivariate C2-cubic spline on a 6-directional mesh constructed in our previous work [2] can be used to extend Loop's approximation subdivision scheme to ...
Charles K. Chui, Qingtang Jiang
CCE
2010
13 years 6 months ago
A simple heuristic for reducing the number of scenarios in two-stage stochastic programming
In this work we address the problem of solving multiscenario optimization models that are deterministic equivalents of two-stage stochastic programs. We present a heuristic approx...
Ramkumar Karuppiah, Mariano Martín, Ignacio...