2489 search results - page 360 / 498 » On the Subgroup Distance Problem |
134
click to vote
CORR
2004
Springer
15 years 3 months ago
2004
Springer
We study the simultaneous message passing model of communication complexity. Building on the quantum fingerprinting protocol of Buhrman et al., Yao recently showed that a large cl...
147
click to vote
COMCOM
2000
15 years 3 months ago
2000
As the popularity of the World Wide Web increases, the amount of traffic results in major congestion problems for the retrieval of data over wide distances. To react to this, user...
142
click to vote
IJFCS
2002
15 years 3 months ago
2002
Vector algorithms allow the computation of an output vector r = r1r2 :::rm given an input vector e = e1e2 :::em in a bounded number of operations, independent of m the length of t...
139
click to vote
INFORMATICALT
2002
15 years 3 months ago
2002
Abstract. Real life scheduling problems are solved by heuristics with parameters defined by experts, as usual. In this paper a new approach is proposed where the parameters of vari...
120
click to vote
TIT
1998
15 years 3 months ago
1998
—We investigate a new class of codes for the optimal covering of vertices in an undirected graph Gsuch that any vertex in G can be uniquely identified by examining the vertices ...