Sciweavers

266 search results - page 12 / 54
» High-Rank Matrix Completion
Sort
View
CORR
2004
Springer
152views Education» more  CORR 2004»
13 years 7 months ago
Non-negative matrix factorization with sparseness constraints
Non-negative matrix factorization (NMF) is a recently developed technique for finding parts-based, linear representations of non-negative data. Although it has successfully been a...
Patrik O. Hoyer
SCL
2010
114views more  SCL 2010»
13 years 2 months ago
Input-state incidence matrix of Boolean control networks and its applications
The input-state incidence matrix of control Boolean network is proposed. It is shown that this matrix contains complete information of the input-state mapping. Using it, an easily...
Yin Zhao, Hongsheng Qi, Daizhan Cheng
TASE
2008
IEEE
13 years 7 months ago
Integrated Supervisory and Operational Control of a Warehouse With a Matrix-Based Approach
This paper considers a matrix-based discrete event control approach for a warehouse. The control system is organized in two modules: a dynamic model and a controller. The model pro...
Vincenzo Giordano, Jing Bing Zhang, David Naso, Fr...
CORR
2010
Springer
115views Education» more  CORR 2010»
13 years 5 months ago
Tight oracle bounds for low-rank matrix recovery from a minimal number of random measurements
This paper presents several novel theoretical results regarding the recovery of a low-rank matrix from just a few measurements consisting of linear combinations of the matrix entr...
Emmanuel J. Candès, Yaniv Plan
TKDE
2012
250views Formal Methods» more  TKDE 2012»
11 years 9 months ago
Dense Subgraph Extraction with Application to Community Detection
— This paper presents a method for identifying a set of dense subgraphs of a given sparse graph. Within the main applications of this “dense subgraph problem”, the dense subg...
Jie Chen 0007, Yousef Saad