256 search results - page 35 / 52 » A New Synchronous Lower Bound for Set Agreement |
WG
2005
Springer
14 years 1 months ago
2005
Springer
In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph G. Our method is based on the addition of edges and contraction of non-edges of ...
SIGIR
1992
ACM
13 years 11 months ago
1992
ACM
Our previous research on one-probe access to large collections of data indexed by alphanumeric keys has produced the first practical minimal perfect hash functions for this proble...
CORR
1998
Springer
13 years 7 months ago
1998
Springer
Abstract. Consider a system F of n polynomial equations in n unknowns, over an algebraically closed field of arbitrary characteristic. We present a fast method to find a point in...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
This paper presents a detailed sum rate investigation of Zero-Forcing (ZF) detectors over composite multiple-input multiple-output (MIMO) channels. To this end, we consider the ge...
SP
2010
IEEE
13 years 5 months ago
2010
IEEE
Abstract--We consider resource-constrained broadcast authentication for n receivers in a static, known network topology. There are only two known broadcast authentication protocols...