Sciweavers

1068 search results - page 80 / 214
» Factorization as a Rank 1 Problem
Sort
View
CIKM
2011
Springer
13 years 9 months ago
Factorization-based lossless compression of inverted indices
Many large-scale Web applications that require ranked top-k retrieval are implemented using inverted indices. An inverted index represents a sparse term-document matrix, where non...
George Beskales, Marcus Fontoura, Maxim Gurevich, ...
NIPS
2008
14 years 11 months ago
High-dimensional support union recovery in multivariate regression
We study the behavior of block 1/ 2 regularization for multivariate regression, where a K-dimensional response vector is regressed upon a fixed set of p covariates. The problem of...
Guillaume Obozinski, Martin J. Wainwright, Michael...
CORR
2010
Springer
86views Education» more  CORR 2010»
14 years 10 months ago
Online Scheduling on Identical Machines using SRPT
Due to its optimality on a single machine for the problem of minimizing average flow time, ShortestRemaining-Processing-Time (SRPT) appears to be the most natural algorithm to con...
Kyle Fox, Benjamin Moseley
FOCS
1993
IEEE
15 years 2 months ago
On Bounded Queries and Approximation
This paper investigates the computational complexity of approximating several NPoptimization problems using the number of queries to an NP oracle as a complexity measure. The resu...
Richard Chang, William I. Gasarch
TALG
2010
158views more  TALG 2010»
14 years 4 months ago
Clustering for metric and nonmetric distance measures
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
Marcel R. Ackermann, Johannes Blömer, Christi...