Sciweavers

568 search results - page 30 / 114
» New bounds for the Cebysev functional
Sort
View
JMIV
2006
78views more  JMIV 2006»
13 years 7 months ago
Shape Estimation from Support and Diameter Functions
We address the problem of reconstructing a planar shape from a finite number of noisy measurements of its support function or its diameter function. New linear and non-linear algor...
Amyn Poonawala, Peyman Milanfar, Richard J. Gardne...
SCALESPACE
1999
Springer
13 years 11 months ago
Scales in Natural Images and a Consequence on their Bounded Variation Norm
This paper introduces a new method for analyzing scaling phenomena in natural images, and draws some consequences as to whether natural images belong to the space of functions with...
Luis Alvarez, Yann Gousseau, Jean-Michel Morel
MST
2002
152views more  MST 2002»
13 years 7 months ago
Average-Case Analysis of Greedy Packet Scheduling
We study the average number of delays suffered by packets routed using greedy (work conserving) scheduling policies. We obtain tight bounds on the worst-case average number of del...
Zvi Lotker, Boaz Patt-Shamir
DAC
2004
ACM
14 years 8 months ago
Fast statistical timing analysis handling arbitrary delay correlations
CT An efficient statistical timing analysis algorithm that can handle arbitrary (spatial and structural) causes of delay correlation is described. The algorithm derives the entire ...
Michael Orshansky, Arnab Bandyopadhyay
ICLP
2009
Springer
14 years 8 months ago
Using Histograms to Better Answer Queries to Probabilistic Logic Programs
Probabilistic logic programs (PLPs) define a set of probability distribution functions (PDFs) over the set of all Herbrand interpretations of the underlying logical language. When...
Matthias Broecheler, Gerardo I. Simari, V. S. Subr...