Sciweavers

314 search results - page 32 / 63
» A Comparison of Known Codes, Random Codes, and the Best Code...
Sort
View
SIAMDM
2010
137views more  SIAMDM 2010»
13 years 7 months ago
Repetition Error Correcting Sets: Explicit Constructions and Prefixing Methods
In this paper we study the problem of finding maximally sized subsets of binary strings (codes) of equal length that are immune to a given number r of repetitions, in the sense th...
Lara Dolecek, Venkat Anantharam
VLUDS
2010
270views Visualization» more  VLUDS 2010»
13 years 3 months ago
Detection and Identification Techniques for Markers Used in Computer Vision
This paper summarizes and compares techniques for detecting and identifying markers in the context of computer vision. Existing approaches use correlation, digital, or topological...
Johannes Köhler, Alain Pagani, Didier Stricke...
ISSRE
2010
IEEE
13 years 6 months ago
Preventing Overflow Attacks by Memory Randomization
Buffer overflow is known to be a common memory vulnerability affecting software. It is exploited to gain various kinds of privilege escalation. C and C++ are very commonly used to ...
Vivek Iyer, Amit Kanitkar, Partha Dasgupta, Raghun...
RAID
2005
Springer
14 years 2 months ago
FLIPS: Hybrid Adaptive Intrusion Prevention
Intrusion detection systems are fundamentally passive and fail–open. Because their primary task is classification, they do nothing to prevent an attack from succeeding. An intru...
Michael E. Locasto, Ke Wang, Angelos D. Keromytis,...
HPCA
1996
IEEE
14 years 24 days ago
A Comparison of Entry Consistency and Lazy Release Consistency Implementations
This paper compares several implementations of entry consistency (EC) and lazy release consistency (LRC), two relaxed memory models in use with software distributed shared memory ...
Sarita V. Adve, Alan L. Cox, Sandhya Dwarkadas, Ra...