Sciweavers

223 search results - page 7 / 45
» Generalized Descriptor Compression for Storage and Matching
Sort
View
EMSOFT
2009
Springer
14 years 4 months ago
Adding aggressive error correction to a high-performance compressing flash file system
While NAND flash memories have rapidly increased in both capacity and performance and are increasingly used as a storage device in many embedded systems, their reliability has de...
Yangwook Kang, Ethan L. Miller
WWW
2007
ACM
14 years 10 months ago
A kernel based structure matching for web services search
This paper describes a kernel based Web Services (abbreviated as service) matching mechanism for service discovery and integration. The matching mechanism tries to exploit the lat...
Yu Jianjun, Guo Shengmin, Su Hao, Zhang Hui, Xu Ke
WWW
2009
ACM
14 years 10 months ago
Detecting image spam using local invariant features and pyramid match kernel
Image spam is a new obfuscating method which spammers invented to more effectively bypass conventional text based spam filters. In this paper, we extract local invariant features ...
Haiqiang Zuo, Weiming Hu, Ou Wu, Yunfei Chen, Guan...
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
14 years 1 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
C3S2E
2009
ACM
14 years 1 months ago
The promise of solid state disks: increasing efficiency and reducing cost of DBMS processing
Most database systems (DBMSs) today are operating on servers equipped with magnetic disks. In our contribution, we want to motivate the use of two emerging and striking technologi...
Karsten Schmidt 0002, Yi Ou, Theo Härder