Sciweavers

1798 search results - page 178 / 360
» A Tree for All Seasons
Sort
View
FSTTCS
2009
Springer
14 years 3 months ago
Fractional Pebbling and Thrifty Branching Programs
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
Mark Braverman, Stephen A. Cook, Pierre McKenzie, ...
FOCS
2005
IEEE
14 years 2 months ago
Lower Bounds for the Noisy Broadcast Problem
We prove the first non-trivial (super linear) lower bound in the noisy broadcast model, defined by El Gamal in [6]. In this model there are n + 1 processors P0, P1, . . . , Pn, ...
Navin Goyal, Guy Kindler, Michael E. Saks
ICIP
2007
IEEE
14 years 11 months ago
Perceptual Image Coding Based on a Maximum of Minimal Structural Similarity Criterion
Perceptual image coding algorithms typically impose perceptual modeling in a preprocessing stage. A perceptual normalization model is often used to transform the original image si...
Zhou Wang, Qiang Li, Xinli Shang
ICDE
1995
IEEE
118views Database» more  ICDE 1995»
14 years 10 months ago
A Version Numbering Scheme with a Useful Lexicographical Order
We describe a numbering scheme for versions with alternatives that has a useful lexicographical ordering. The version hierarchy is a tree. By inspection of the version numbers, we...
Arthur M. Keller, Jeffrey D. Ullman
STOC
2002
ACM
115views Algorithms» more  STOC 2002»
14 years 9 months ago
Reimer's inequality and tardos' conjecture
Let f : {0, 1}n {0, 1} be a boolean function. For 0 let D (f) be the minimum depth of a decision tree for f that makes an error for fraction of the inputs x {0, 1}n . We also ma...
Clifford D. Smyth