9949 search results - page 239 / 1990 » On the Network Complexity of Selection |
171
click to vote
TCOM
2010
15 years 5 months ago
2010
Abstract—In this letter, we propose an extension of the probabilistic tree pruning sphere decoding (PTP-SD) algorithm that provides further improvement of the computational compl...
193
click to vote
ARGMAS
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. In this paper, we propose a new strategic and tactic reasoning for agent communication. This reasoning framework is specified using argumentation theory combined to a rel...
174
click to vote
COMPSEC
2010
15 years 5 months ago
2010
In this paper we address the problem of reducing the role mining complexity in RBAC systems. To this aim, we propose a three steps methodology: first, we associate a weight to rol...
118
click to vote
AINA
2007
IEEE
2007
IEEE
Reducing the Complexity in the Distributed Multiplication Protocol of Two Polynomially Shared Values
16 years 1 months ago
The multiparty multiplication of two polynomially shared values over Zq with a public prime number q is an important module in distributed computations. The multiplication protoco...
166
click to vote
EOR
2008
15 years 6 months ago
2008
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...