Sciweavers

6750 search results - page 1316 / 1350
» Performance Analysis Framework for Layout Analysis Methods
Sort
View
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
15 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
EMSOFT
2007
Springer
15 years 1 months ago
Verification of device drivers and intelligent controllers: a case study
The soundness of device drivers generally cannot be verified in isolation, but has to take into account the reactions of the hardware devices. In critical embedded systems, interf...
David Monniaux
CANS
2006
Springer
136views Cryptology» more  CANS 2006»
15 years 1 months ago
Watermarking Essential Data Structures for Copyright Protection
Software watermarking is a new research area that aims at providing copyright protection for commercial software. It minimizes software piracy by hiding copyright signatures inside...
Qutaiba Albluwi, Ibrahim Kamel
CVPR
2006
IEEE
15 years 1 months ago
Multiple Face Model of Hybrid Fourier Feature for Large Face Image Set
The face recognition system based on the only single classifier considering the restricted information can not guarantee the generality and superiority of performances in a real s...
Wonjun Hwang, Gyu-tae Park, Jong Ha Lee, Seok-Cheo...
ESA
1998
Springer
162views Algorithms» more  ESA 1998»
15 years 1 months ago
External Memory Algorithms
Abstract. Data sets in large applications are often too massive to t completely inside the computer's internal memory. The resulting input output communication or I O between ...
Jeffrey Scott Vitter
« Prev « First page 1316 / 1350 Last » Next »