Sciweavers

995 search results - page 60 / 199
» complexity 2011
Sort
View
121
Voted
CORR
2011
Springer
183views Education» more  CORR 2011»
14 years 9 months ago
Automatic Network Fingerprinting through Single-Node Motifs
Complex networks have been characterised by their specific connectivity patterns (network motifs), but their building blocks can also be identified and described by node-motifs—...
Christoph Echtermeyer, Luciano da Fontoura Costa, ...
123
Voted
ICASSP
2011
IEEE
14 years 6 months ago
An efficient rank-deficient computation of the Principle of Relevant Information
One of the main difficulties in computing information theoretic learning (ITL) estimators is the computational complexity that grows quadratically with data. Considerable amount ...
Luis Gonzalo Sánchez Giraldo, José C...
120
Voted
FGCS
2011
115views more  FGCS 2011»
14 years 9 months ago
An approach for virtual appliance distribution for service deployment
Fulfilling a service request in highly dynamic service environments may require deploying a service. Therefore, the effectiveness of service deployment systems affects initial ...
Gabor Kecskemeti, Gábor Terstyánszky...
91
Voted
ICASSP
2011
IEEE
14 years 6 months ago
Third order widely non linear Volterra MVDR beamforming
It is now well known that time invariant (TI) linear beamformers, such as the Capon’s beamformer, are only optimal for stationary Gaussian observations whose complex envelope is...
Pascal Chevalier, Abdelkader Oukaci, Jean Pierre D...
135
Voted
HPSR
2011
105views more  HPSR 2011»
14 years 2 months ago
Implementation of ARP-path low latency bridges in Linux and OpenFlow/NetFPGA
Abstract—This paper describes the implementation of ARPPath (a.k.a. FastPath) bridges, a recently proposed concept for low latency bridges, in Linux/Soekris and OpenFlow/NetFPGA ...
Guillermo Ibáñez, Bart De Schuymer, ...