Sciweavers

1301 search results - page 121 / 261
» Bounded Version Vectors
Sort
View
FOCS
2007
IEEE
15 years 7 months ago
On the Hardness and Smoothed Complexity of Quasi-Concave Minimization
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
Jonathan A. Kelner, Evdokia Nikolova
129
Voted
CORR
2010
Springer
182views Education» more  CORR 2010»
15 years 23 days ago
Index coding via linear programming
Abstract Anna Blasiak Robert Kleinberg Eyal Lubetzky Index Coding has received considerable attention recently motivated in part by applications such as fast video-on-demand and e...
Anna Blasiak, Robert D. Kleinberg, Eyal Lubetzky
108
Voted
COMPGEOM
2010
ACM
15 years 5 months ago
The complexity of the normal surface solution space
Normal surface theory is a central tool in algorithmic threedimensional topology, and the enumeration of vertex normal surfaces is the computational bottleneck in many important a...
Benjamin A. Burton
JMLR
2011
148views more  JMLR 2011»
14 years 7 months ago
Multitask Sparsity via Maximum Entropy Discrimination
A multitask learning framework is developed for discriminative classification and regression where multiple large-margin linear classifiers are estimated for different predictio...
Tony Jebara
ICDE
2012
IEEE
227views Database» more  ICDE 2012»
13 years 3 months ago
Horizontal Reduction: Instance-Level Dimensionality Reduction for Similarity Search in Large Document Databases
—Dimensionality reduction is essential in text mining since the dimensionality of text documents could easily reach several tens of thousands. Most recent efforts on dimensionali...
Min-Soo Kim 0001, Kyu-Young Whang, Yang-Sae Moon