Sciweavers

47 search results - page 10 / 10
» The Magic of Duplicates and Aggregates
Sort
View
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
15 years 3 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
TFS
2008
153views more  TFS 2008»
14 years 10 months ago
Encoding Words Into Interval Type-2 Fuzzy Sets Using an Interval Approach
This paper presents a very practical type-2-fuzzistics methodology for obtaining interval type-2 fuzzy set (IT2 FS) models for words, one that is called an interval approach (IA). ...
Feilong Liu, Jerry M. Mendel