170 search results - page 6 / 34 » A Bounding Quantifier |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth D(G) of a graph G is equal to ...
TIT
2008
13 years 7 months ago
2008
Abstract. The recent algebraic attacks have received a lot of attention in cryptographic literature. The algebraic immunity of a Boolean function quantifies its resistance to the s...
TNN
2011
13 years 1 months ago
2011
—Prediction intervals (PIs) have been proposed in the literature to provide more information by quantifying the level of uncertainty associated to the point forecasts. Traditiona...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
In this paper, we consider the problem of estimating finite rate of innovation (FRI) signals from noisy measurements, and specifically analyze the interaction between FRI technique...
MICRO
2010
IEEE
13 years 5 months ago
2010
IEEE
Soft error reliability is increasingly becoming a first-order design concern for microprocessors, as a result of higher transistor counts, shrinking device geometries and lowering ...