Sciweavers

89 search results - page 13 / 18
» Sparse Recovery by Non-convex Optimization -- Instance Optim...
Sort
View
COLT
2005
Springer
14 years 1 months ago
General Polynomial Time Decomposition Algorithms
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...
Nikolas List, Hans-Ulrich Simon
EOR
2007
84views more  EOR 2007»
13 years 7 months ago
The multi-layered network design problem
act 11 We address the problem of designing a network built on several layers. This problem occurs in practical applications 12 but has not been studied extensively from the point o...
Arnaud Knippel, Benoit Lardeux
SIAMCOMP
1998
176views more  SIAMCOMP 1998»
13 years 7 months ago
An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
It is shown that the minimum cut ratio is within a factor of O(log k) of the maximum concurrent flow for k-commodity flow instances with arbitrary capacities and demands. This im...
Yonatan Aumann, Yuval Rabani
CORR
2008
Springer
178views Education» more  CORR 2008»
13 years 7 months ago
Model-Based Compressive Sensing
Compressive sensing (CS) is an alternative to Shannon/Nyquist sampling for acquisition of sparse or compressible signals that can be well approximated by just K N elements from a...
Richard G. Baraniuk, Volkan Cevher, Marco F. Duart...
AAAI
2012
11 years 10 months ago
Multinomial Relation Prediction in Social Data: A Dimension Reduction Approach
The recent popularization of social web services has made them one of the primary uses of the World Wide Web. An important concept in social web services is social actions such as...
Nozomi Nori, Danushka Bollegala, Hisashi Kashima