Sciweavers

5100 search results - page 423 / 1020
» The Linear Complexity of a Graph
Sort
View
ICC
2007
IEEE
136views Communications» more  ICC 2007»
16 years 2 months ago
Multiple-Symbol Differential Detection Based on Combinatorial Geometry
— In this paper, the application of combinatorial geometry to noncoherent multiple–symbol differential detection (MSDD) is considered. The resulting algorithm is referred to as...
Volker Pauli, Lutz H.-J. Lampe, Robert Schober, Ko...
EUROCRYPT
2004
Springer
16 years 1 months ago
On the Hardness of Information-Theoretic Multiparty Computation
We revisit the following open problem in information-theoretic cryptography: Does the communication complexity of unconditionally secure computation depend on the computational com...
Yuval Ishai, Eyal Kushilevitz
KES
1998
Springer
15 years 12 months ago
Attractor systems and analog computation
Attractor systems are useful in neurodynamics,mainly in the modelingof associative memory. Thispaper presentsa complexity theory for continuous phase space dynamical systems with ...
Hava T. Siegelmann, Shmuel Fishman
TSP
2008
89views more  TSP 2008»
15 years 7 months ago
Coordinated Beamforming for the Multiuser MIMO Broadcast Channel With Limited Feedforward
Abstract-- Linear transmit beamforming and receive combining is a low complexity approach for communications in the multiuser multiple-input multiple-output (MIMO) channel. This pa...
Chan-Byoung Chae, David Mazzarese, Takao Inoue, Ro...
ATAL
2010
Springer
15 years 8 months ago
A decentralised coordination algorithm for minimising conflict and maximising coverage in sensor networks
In large wireless sensor networks, the problem of assigning radio frequencies to sensing agents such that no two connected sensors are assigned the same value (and will thus inter...
Ruben Stranders, Alex Rogers, Nicholas R. Jennings