Sciweavers

2743 search results - page 535 / 549
» Minimization of an M-convex Function
Sort
View
SPAA
1996
ACM
14 years 1 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
ICIP
1994
IEEE
14 years 12 hour 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.
13 years 12 months 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»
13 years 12 months 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...
SIGMOD
1993
ACM
150views Database» more  SIGMOD 1993»
13 years 12 months ago
Predicate Migration: Optimizing Queries with Expensive Predicates
The traditional focus of relational query optimization schemes has been on the choice of join methods and join orders. Restrictions have typically been handled in query optimizers ...
Joseph M. Hellerstein, Michael Stonebraker