2143 search results - page 389 / 429 » corr 2010 |
137
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
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...
132
Voted
CORR
2010
Springer
14 years 7 months ago
2010
Springer
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...
195
click to vote
CORR
2010
Springer
14 years 7 months ago
2010
Springer
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...
125
click to vote
CORR
2010
Springer
15 years 20 days ago
2010
Springer
Multiprocessor task scheduling is an important and computationally difficult problem. This paper proposes a comparison study of genetic algorithm and list scheduling algorithm. Bo...
117
Voted
CORR
2010
Springer
15 years 20 days ago
2010
Springer
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...