1798 search results - page 178 / 360 » A Tree for All Seasons |
186
click to vote
FSTTCS
2009
Springer
16 years 1 months ago
2009
Springer
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...
171
click to vote
FOCS
2005
IEEE
16 years 3 days ago
2005
IEEE
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, ...
152
click to vote
ICIP
2007
IEEE
16 years 8 months ago
2007
IEEE
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...
273
click to vote
ICDE
1995
IEEE
16 years 7 months ago
1995
IEEE
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...
149
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
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...