1511 search results - page 150 / 303 » Randomness, lowness and degrees |
164
click to vote
CASCON
1996
15 years 7 months ago
1996
The estimation of reliability of modules using code coverage is motivated by a two-phase method for estimating the quality of software using static structure and predicted quality...
156
click to vote
CC
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. We present an algorithm for counting the irreducible components of a complex algebraic variety defined by a fixed number of polynomials encoded as straight-line programs ...
155
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We obtain a lower bound of n 1 k+1 22k (k-1)2k-1 on the k-party randomized communication complexity of the Disjointness function in the `Number on the Forehead' model of mul...
184
click to vote
TIT
2008
15 years 6 months ago
2008
Abstract--We consider sources and channels with memory observed through erasure channels. In particular, we examine the impact of sporadic erasures on the fundamental limits of los...
187
click to vote
JGAA
2007
15 years 6 months ago
2007
The task of finding the largest subset of vertices of a graph that induces a planar subgraph is known as the Maximum Induced Planar Subgraph problem (MIPS). In this paper, some n...