Results 31 to 40 of about 171,225 (171)
IEEE Open Journal of the Computer Society, 2022 Software defined networking (SDN), which can provide a dynamic and configurable network architecture for resource allocation, have been widely employed for efficient massive data traffic management. To accelerate the packet classification process in SDN,
Minghao Xie +5 more
doaj +1 more source
Fuzzy rule based multiwavelet ECG signal denoising [PDF]
, 2008 Since different multiwavelets, pre- and post-filters have different impulse responses and frequency responses, different multiwavelets, pre- and post-filters should be selected and applied at different noise levels for signal denoising if signals are ...
Chan, Yick-Po +5 more
core +1 more source
Frequency-Domain Set-Membership Filtering and Its Applications [PDF]
IEEE Transactions on Signal Processing, 2007 Frequency-domain adaptive filtering is appealing in many applications, particularly channel equalization. This paper presents frequency-domain set-membership filtering (F-SMF) and derives adaptive algorithms for F-SMF. The F-SMF is employed to design single-carrier frequency-domain equalizer (SC-FDE).
Li Guo, Yih-Fang Huang
openaire +1 more source
Suitability of a new Bloom filter for numerical vectors with high dimensions.
PLoS ONE, 2018 The notable increase in the size and dimensions of data have presented challenges for data storage and retrieval. The Bloom filter and its generations, due to efficient space overheads and constant query delays, have been broadly applied to querying ...
Chunyan Shuai +3 more
doaj +1 more source
New variant of NLMS/F algorithm with low computational cost
Revista Elektrón, 2022 Adaptive filters are used in a wide variety of signal processing applications (e.g., acoustic echo cancellation, system identification, channel equalization, etc.).
Laura Jazmín Hidalgo Hernández +4 more
doaj +1 more source
, 2013 A Bloom filter is a method for reducing the space (memory) required for representing a set by allowing a small error probability. In this paper we consider a \emph{Sliding Bloom Filter}: a data structure that, given a stream of elements, supports ...
Naor, Moni, Yogev, Eylon
core +1 more source
Opportunistic linked data querying through approximate membership metadata [PDF]
, 2015 Between URI dereferencing and the SPARQL protocol lies a largely unexplored axis of possible interfaces to Linked Data, each with its own combination of trade-offs.
BH Bloom +9 more
core +1 more source
Robust Set-Membership Affine-Projection Adaptive-Filtering Algorithm [PDF]
IEEE Transactions on Signal Processing, 2012 An improved set-membership affine-projection (AP) adaptive-filtering algorithm is proposed. The new algorithm uses two error bounds that are estimated during the learning phase and by this means significantly reduced steady-state misalignment is achieved as compared to those in the conventional AP and set-membership AP algorithms while achieving ...
Md. Zulfiquar Ali Bhotto +1 more
openaire +1 more source
A Shifting Bloom Filter Framework for Set Queries
, 2016 Set queries are fundamental operations in computer systems and applications.This paper addresses the fundamental problem of designing a probabilistic data structure that can quickly process set queries using a small amount of memory.
Fu, Qiaobin +7 more
core +1 more source
Nonlinear Filtering: The Set-Membership (Bounding) and the H ∞ Techniques [PDF]
IFAC Proceedings Volumes, 1995 We consider the problem of nonlinear filtering within the framework of deterministic uncertain systems (i.e. control systems with disturbances). We investigate the relationship between the two main approaches to the problems: the set-membership approach and the nonlinear H∞ approach.
J.S. Baras, A. Kurzhanski
openaire +1 more source