Sciweavers

7924 search results - page 1530 / 1585
» Non-Malleable Functions and Their Applications
Sort
View
SPAA
1996
ACM
14 years 29 days ago
Constant Time per Edge is Optimal on Rooted Tree Networks
We analyze the relationship between the expected packet delay in rooted tree networks and the distribution of time needed for a packet to cross an edge using convexity-based stoch...
Michael Mitzenmacher
PCRCW
1997
Springer
14 years 29 days ago
Power/Performance Trade-offs for Direct Networks
High performance portable and space-borne systems continue to demand increasing computation speeds while concurrently attempting to satisfy size, weight, and power constraints. As...
Chirag S. Patel, Sek M. Chai, Sudhakar Yalamanchil...
ICIP
1994
IEEE
14 years 29 days ago
Total Variation Based Image Restoration with Free Local Constraints
The two main plagues of image restoration are oscillations and smoothing. Traditional image restoration techniques prevent parasitic oscillations by resorting to smooth regulariza...
Leonid I. Rudin, Stanley Osher
ICS
2010
Tsinghua U.
14 years 28 days ago
Weight Distribution and List-Decoding Size of Reed-Muller Codes
: We study the weight distribution and list-decoding size of Reed-Muller codes. Given a weight parameter, we are interested in bounding the number of Reed-Muller codewords with a w...
Tali Kaufman, Shachar Lovett, Ely Porat
STOC
2010
ACM
269views Algorithms» more  STOC 2010»
14 years 28 days ago
Approximations for the Isoperimetric and Spectral Profile of Graphs and Related Parameters
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
Prasad Raghavendra, David Steurer and Prasad Tetal...
« Prev « First page 1530 / 1585 Last » Next »