Sciweavers

1723 search results - page 334 / 345
» Cycling in linear programming problems
Sort
View
IMCSIT
2010
13 years 6 months ago
Efficient Portfolio Optimization with Conditional Value at Risk
The portfolio optimization problem is modeled as a mean-risk bicriteria optimization problem where the expected return is maximized and some (scalar) risk measure is minimized. In ...
Wlodzimierz Ogryczak, Tomasz Sliwinski
ICCAD
2009
IEEE
106views Hardware» more  ICCAD 2009»
13 years 6 months ago
An efficient pre-assignment routing algorithm for flip-chip designs
The flip-chip package is introduced for modern IC designs with higher integration density and larger I/O counts. In this paper, we consider the pre-assignment flip-chip routing pr...
Po-Wei Lee, Chung-Wei Lin, Yao-Wen Chang, Chin-Fan...
SIAMJO
2011
12 years 11 months ago
Rank-Sparsity Incoherence for Matrix Decomposition
Suppose we are given a matrix that is formed by adding an unknown sparse matrix to an unknown low-rank matrix. Our goal is to decompose the given matrix into its sparse and low-ran...
Venkat Chandrasekaran, Sujay Sanghavi, Pablo A. Pa...
CIKM
2011
Springer
12 years 8 months ago
Towards feature selection in network
Traditional feature selection methods assume that the data are independent and identically distributed (i.i.d.). In real world, tremendous amounts of data are distributed in a net...
Quanquan Gu, Jiawei Han
ICCV
2007
IEEE
14 years 10 months ago
3-D Reconstruction from Sparse Views using Monocular Vision
We consider the task of creating a 3-d model of a large novel environment, given only a small number of images of the scene. This is a difficult problem, because if the images are...
Ashutosh Saxena, Min Sun, Andrew Y. Ng