19320 search results - page 222 / 3864 » On the complexity of computing determinants |
109
click to vote
IPPS
2006
IEEE
16 years 18 days ago
2006
IEEE
We study a version of the β-assignment problem [3] on asynchronous rings: consider a set of items and a set of m colors, where each item is associated to one color. Consider also...
171
click to vote
MFCS
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggre...
181
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
In this paper the problem of fault-tolerant message routing in two-dimensional meshes, with each inner node having 4 neighbors, is investigated. It is assumed that some nodes/links...
184
click to vote
MICRO
2006
IEEE
15 years 6 months ago
2006
IEEE
Predication facilitates high-bandwidth fetch and large static scheduling regions, but has typically been too complex to implement comprehensively in out-of-order microarchitecture...
219
click to vote
TWC
2010
15 years 1 months ago
2010
This paper proposes a framework for distributed sequential parameter estimation in wireless sensor networks. In the proposed scheme, the estimator is updated sequentially at the c...