1518 search results - page 303 / 304 » Exact and Approximate Bandwidth |
125
click to vote
SIAMMAX
2010
14 years 4 months ago
2010
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...
TSP
2010
14 years 4 months ago
2010
This paper is concerned with the performance of a regenerative relaying protocol on fading wireless channels with imperfect channel knowledge at the receivers. Assuming a single s...
CORR
2011
Springer
14 years 1 months ago
2011
Springer
A hitting set for a collection of sets is a set that has a nonempty intersection with each set in the collection; the hitting set problem is to find a hitting set of minimum card...
112
click to vote
POPL
2011
ACM
14 years 12 days ago
2011
ACM
ensitivity has emerged as an excellent context abstraction for points-to analysis in object-oriented languages. Despite its practical success, however, object-sensitivity is poorl...
101
click to vote
SIGMOD
2011
ACM
14 years 11 days ago
2011
ACM
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...