Sciweavers

5580 search results - page 800 / 1116
» Randomized priority algorithms
Sort
View
ASPLOS
2008
ACM
15 years 5 months ago
Archipelago: trading address space for reliability and security
Memory errors are a notorious source of security vulnerabilities that can lead to service interruptions, information leakage and unauthorized access. Because such errors are also ...
Vitaliy B. Lvin, Gene Novark, Emery D. Berger, Ben...
DIMVA
2007
15 years 4 months ago
On the Adaptive Real-Time Detection of Fast-Propagating Network Worms
Abstract. We present two light-weight worm detection algorithms that offer significant advantages over fixed-threshold methods. The first algorithm, RBS (ratebased sequential hy...
Jaeyeon Jung, Rodolfo A. Milito, Vern Paxson
SDM
2003
SIAM
123views Data Mining» more  SDM 2003»
15 years 4 months ago
Fast Online SVD Revisions for Lightweight Recommender Systems
The singular value decomposition (SVD) is fundamental to many data modeling/mining algorithms, but SVD algorithms typically have quadratic complexity and require random access to ...
Matthew Brand
125
Voted
ATAL
2009
Springer
15 years 4 months ago
Efficient physics-based planning: sampling search via non-deterministic tactics and skills
Motion planning for mobile agents, such as robots, acting in the physical world is a challenging task, which traditionally concerns safe obstacle avoidance. We are interested in p...
Stefan Zickler, Manuela M. Veloso
BMCBI
2008
128views more  BMCBI 2008»
15 years 3 months ago
Efficient computation of absent words in genomic sequences
Background: Analysis of sequence composition is a routine task in genome research. Organisms are characterized by their base composition, dinucleotide relative abundance, codon us...
Julia Herold, Stefan Kurtz, Robert Giegerich