Sciweavers

1066 search results - page 25 / 214
» Computing Private Set Operations with Linear Complexities
Sort
View
NIPS
2000
15 years 18 days ago
Foundations for a Circuit Complexity Theory of Sensory Processing
We introduce total wire length as salient complexity measure for an analysis of the circuit complexity of sensory processing in biological neural systems and neuromorphic engineer...
Robert A. Legenstein, Wolfgang Maass
VTC
2007
IEEE
15 years 5 months ago
Adaptive Conjugate Gradient DFEs for Wideband MIMO Systems Using Galerkin Projections
— Three new adaptive equalization algorithms for wireless systems operating over frequency selective MIMO channels are proposed. The problem of the MIMO DFE design is formulated ...
Vassilis Kekatos, Aris S. Lalos, Kostas Berberidis
IJAR
2008
67views more  IJAR 2008»
14 years 11 months ago
Implementing semantic merging operators using binary decision diagrams
There is a well-recognised need in diverse applications for reasoning with multiple, potentially inconsistent sources of information. One approach is to represent each source of i...
Nikos Gorogiannis, Anthony Hunter
ICASSP
2008
IEEE
15 years 5 months ago
Compressed sensing - a look beyond linear programming
Recently, significant attention in compressed sensing has been focused on Basis Pursuit, exchanging the cardinality operator with the l1-norm, which leads to a linear formulation...
Christian R. Berger, Javier Areta, Krishna R. Patt...
SDMW
2004
Springer
15 years 4 months ago
Experimental Analysis of Privacy-Preserving Statistics Computation
The recent investigation of privacy-preserving data mining and other kinds of privacy-preserving distributed computation has been motivated by the growing concern about the privacy...
Hiranmayee Subramaniam, Rebecca N. Wright, Zhiqian...