5100 search results - page 208 / 1020 » The Linear Complexity of a Graph |
CORR
2010
Springer
14 years 9 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...
89
Voted
ICASSP
2009
IEEE
15 years 7 months 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...
122
Voted
MFCS
2005
Springer
15 years 6 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...
79
Voted
CDC
2009
IEEE
15 years 5 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...
99
Voted
DAGSTUHL
2004
15 years 1 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...