Sciweavers

2143 search results - page 389 / 429
» corr 2010
Sort
View
CORR
2010
Springer
208views Education» more  CORR 2010»
15 years 3 months ago
Real-time Robust Principal Components' Pursuit
In the recent work of Candes et al, the problem of recovering low rank matrix corrupted by i.i.d. sparse outliers is studied and a very elegant solution, principal component pursui...
Chenlu Qiu, Namrata Vaswani
CORR
2010
Springer
171views Education» more  CORR 2010»
15 years 1 months ago
Online Learning in Opportunistic Spectrum Access: A Restless Bandit Approach
We consider an opportunistic spectrum access (OSA) problem where the time-varying condition of each channel (e.g., as a result of random fading or certain primary users' activ...
Cem Tekin, Mingyan Liu
293
Voted
CORR
2010
Springer
169views Education» more  CORR 2010»
15 years 1 months ago
Recommender Systems by means of Information Retrieval
In this paper we present a method for reformulating the Recommender Systems problem in an Information Retrieval one. In our tests we have a dataset of users who give ratings for s...
Alberto Costa, Fabio Roda
CORR
2010
Springer
128views Education» more  CORR 2010»
15 years 6 months ago
A Performance Study of GA and LSH in Multiprocessor Job Scheduling
Multiprocessor task scheduling is an important and computationally difficult problem. This paper proposes a comparison study of genetic algorithm and list scheduling algorithm. Bo...
S. R. Vijayalakshmi, G. Padmavathi
CORR
2010
Springer
149views Education» more  CORR 2010»
15 years 6 months ago
Pebbling and Branching Programs Solving the Tree Evaluation Problem
We study restricted computation models related to the tree evaluation problem. The TEP was introduced in earlier work as a simple candidate for the (very) long term goal of separa...
Dustin Wehr