3864 search results - page 156 / 773 » time 2005 |
186
click to vote
WDAG
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...
178
click to vote
COCOON
2005
Springer
16 years 4 hour ago
2005
Springer
In this paper, we study the following disc covering problem: Given a set of discs of various radii on the plane, find a subset of discs to maximize the area covered by exactly on...
149
click to vote
FSE
2007
Springer
16 years 19 days ago
2007
Springer
This paper examines the security of AES-192 and AES-256 against a related-key rectangle attack. We find the following new attacks: 8-round reduced AES-192 with 2 related keys, 10-...
165
click to vote
SYNASC
2005
IEEE
16 years 1 days ago
2005
IEEE
The paper presents a new reinforcement learning mechanism for spiking neural networks. The algorithm is derived for networks of stochastic integrate-and-fire neurons, but it can ...
180
click to vote
RECOMB
2005
Springer
16 years 6 months ago
2005
Springer
The study of genome rearrangements is an important tool in comparative genomics. This paper revisits the problem of sorting a multichromosomal genome by translocations, i.e. exchan...