2479 search results - page 234 / 496 » Random Event Structures |
206
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
184
click to vote
GLOBECOM
2007
IEEE
16 years 28 days ago
2007
IEEE
— In this paper, we consider the design of synchronization-aware distributed space-time codes, which we denote as diagonal distributed space-time codes (DDSTC), for N relay nodes...
162
click to vote
SARA
2007
Springer
16 years 22 days ago
2007
Springer
Abstract. In constraint satisfaction, local search is an incomplete method for finding a solution to a problem. Solving a general constraint satisfaction problem (CSP) is known to...
157
click to vote
IPPS
1993
IEEE
15 years 10 months ago
1993
IEEE
The dramatic improvements in the processing rates of parallel computers are turning many compute-bound jobs into IO-bound jobs. Parallel le systems have been proposed to better ma...
233
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
We consider the problem of recovering a target matrix that is a superposition of low-rank and sparse components, from a small set of linear measurements. This problem arises in co...