1998 search results - page 205 / 400 » Complexity of the Cover Polynomial |
ICC
2007
IEEE
16 years 27 days ago
2007
IEEE
This paper presents a new decoding method inspired by Mitzenmacher’s idea of adding a different pseudo-random number to each packet, in a packet-symbol (n, k) code, for verificat...
183
click to vote
FASE
2007
Springer
16 years 22 days ago
2007
Springer
We use 63 features extracted from sources such as versioning and issue tracking systems to predict defects in short time frames of two months. Our multivariate approach covers aspe...
183
click to vote
COCOON
2005
Springer
16 years 3 days ago
2005
Springer
To monitor an electric power system by placing as few phase measurement units (PMUs) as possible is closely related to the famous vertex cover problem and domination problem in gr...
204
click to vote
SPAA
1993
ACM
15 years 10 months ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
180
click to vote
IPMU
1992
Springer
15 years 10 months ago
1992
Springer
This paper deals with the problem of inference under uncertain information. This is a generalization of a paper of Cardona et al. (1991a) where rules were not allowed to contain n...