Sciweavers

1518 search results - page 303 / 304
» Exact and Approximate Bandwidth
Sort
View
SIAMMAX
2010
164views more  SIAMMAX 2010»
13 years 1 months ago
Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
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...
Amit Singer, Mihai Cucuringu
TSP
2010
13 years 1 months ago
On optimum regenerative relaying with imperfect channel knowledge
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...
Ramesh Annavajjala
CORR
2011
Springer
205views Education» more  CORR 2011»
12 years 10 months ago
Algorithms for Implicit Hitting Set Problems
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...
Karthekeyan Chandrasekaran, Richard Karp, Erick Mo...
POPL
2011
ACM
12 years 9 months ago
Pick your contexts well: understanding object-sensitivity
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...
Yannis Smaragdakis, Martin Bravenboer, Ondrej Lhot...
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
12 years 9 months ago
Neighborhood based fast graph search in large networks
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...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...