Sciweavers

328 search results - page 45 / 66
» Deterministic k-set structure
Sort
View
ASPLOS
2011
ACM
12 years 11 months ago
Ensuring operating system kernel integrity with OSck
Kernel rootkits that modify operating system state to avoid detection are a dangerous threat to system security. This paper presents OSck, a system that discovers kernel rootkits ...
Owen S. Hofmann, Alan M. Dunn, Sangman Kim, Indraj...
SWAT
2004
Springer
153views Algorithms» more  SWAT 2004»
14 years 20 days ago
Melding Priority Queues
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup,...
BMCBI
2008
132views more  BMCBI 2008»
13 years 7 months ago
The Average Mutual Information Profile as a Genomic Signature
Background: Occult organizational structures in DNA sequences may hold the key to understanding functional and evolutionary aspects of the DNA molecule. Such structures can also p...
Mark Bauer, Sheldon M. Schuster, Khalid Sayood
COMPGEOM
2009
ACM
14 years 1 months ago
Cache-oblivious range reporting with optimal queries requires superlinear space
We consider a number of range reporting problems in two and three dimensions and prove lower bounds on the amount of space used by any cache-oblivious data structure for these pro...
Peyman Afshani, Chris H. Hamilton, Norbert Zeh
SODA
2010
ACM
704views Algorithms» more  SODA 2010»
14 years 4 months ago
A locality-sensitive hash for real vectors
We present a simple and practical algorithm for the c-approximate near neighbor problem (c-NN): given n points P Rd and radius R, build a data structure which, given q Rd , can ...
Tyler Neylon