Sciweavers

1518 search results - page 52 / 304
» Exact and Approximate Bandwidth
Sort
View
IM
2007
14 years 9 months ago
Approximating Personalized PageRank with Minimal Use of Web Graph Data
Abstract. In this paper, we consider the problem of calculating fast and accurate approximations to the personalized PageRank score of a webpage. We focus on techniques to improve ...
David Gleich, Marzia Polito
ISCC
2005
IEEE
143views Communications» more  ISCC 2005»
15 years 3 months ago
Approximating Optimal Multicast Trees in Wireless Multihop Networks
— We study the problem of computing minimal cost multicast trees in multi-hop wireless mesh networks. This problem is known as the Steiner tree problem, and it has been widely st...
Pedro M. Ruiz, Antonio F. Gómez-Skarmeta
TIT
2011
116views more  TIT 2011»
14 years 4 months ago
Approximate Characterizations for the Gaussian Source Broadcast Distortion Region
We consider the joint source-channel coding problem of sending a Gaussian source over a K-user Gaussian broadcast channel with bandwidth mismatch. A new outer bound to the achieva...
Chao Tian, Suhas N. Diggavi, Shlomo Shamai
SIAMNUM
2010
131views more  SIAMNUM 2010»
14 years 4 months ago
A Rational Interpolation Scheme with Superpolynomial Rate of Convergence
The purpose of this study is to construct a high-order interpolation scheme for arbitrary scattered datasets. The resulting function approximation is an interpolation function when...
Qiqi Wang, Parviz Moin, Gianluca Iaccarino
STOC
2012
ACM
209views Algorithms» more  STOC 2012»
13 years 4 days ago
Nearly optimal solutions for the chow parameters problem and low-weight approximation of halfspaces
The Chow parameters of a Boolean function f : {−1, 1}n → {−1, 1} are its n + 1 degree-0 and degree-1 Fourier coefficients. It has been known since 1961 [Cho61, Tan61] that ...
Anindya De, Ilias Diakonikolas, Vitaly Feldman, Ro...