Sciweavers

792 search results - page 14 / 159
» Constrained Ramsey Numbers
Sort
View
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
EOR
2007
174views more  EOR 2007»
13 years 7 months ago
A Benders approach for the constrained minimum break problem
This paper presents a hybrid IP/CP algorithm for designing a double round robin schedule with a minimal number of breaks. Both mirrored and non-mirrored schedules with and without ...
Rasmus V. Rasmussen, Michael A. Trick
ICMCS
2006
IEEE
105views Multimedia» more  ICMCS 2006»
14 years 1 months ago
Entropy and Memory Constrained Vector Quantization with Separability Based Feature Selection
An iterative model selection algorithm is proposed. The algorithm seeks relevant features and an optimal number of codewords (or codebook size) as part of the optimization. We use...
Sangho Yoon, Robert M. Gray
CORR
2010
Springer
90views Education» more  CORR 2010»
13 years 7 months ago
Logical complexity of graphs: a survey
We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth D(G) of a graph G is equal to ...
Oleg Pikhurko, Oleg Verbitsky
WINE
2009
Springer
194views Economy» more  WINE 2009»
14 years 1 months ago
Mechanism Design for Complexity-Constrained Bidders
A well-known result due to Vickery gives a mechanism for selling a number of goods to interested buyers in a way that achieves the maximum social welfare. In practice, a problem wi...
Ravi Kumar, Mohammad Mahdian, Amin Sayedi