5100 search results - page 208 / 1020 » The Linear Complexity of a Graph |
142
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
The Hopper-Blum (HB) protocol, which uses noised linear parities of a shared key for authentication, has been proposed for light-weight applications such as RFID. Recently, algorit...
150
click to vote
ICASSP
2009
IEEE
16 years 24 days ago
2009
IEEE
A multisource cooperative protocol is developed capable of achieving diversity order up to the number of cooperating users at a high throughput. In this design each source jointly...
178
click to vote
MFCS
2005
Springer
15 years 11 months ago
2005
Springer
This paper investigates the word problem for inverse monoids generated by a set Γ subject to relations of the form e = f, where e and f are both idempotents in the free inverse m...
140
click to vote
CDC
2009
IEEE
15 years 10 months ago
2009
IEEE
— In recent years, idempotent methods (specifically, max-plus methods) have been developed for solution of nonlinear control problems. It was thought that idempotent linearity o...
160
click to vote
DAGSTUHL
2004
15 years 7 months ago
2004
We study the intrinsic difficulty of solving linear parabolic initial value problems numerically at a single point. We present a worst case analysis for deterministic as well as fo...