971 search results - page 120 / 195 » Comparative Analysis of Arithmetic Coding Computational Comp... |
STOC
2004
ACM
14 years 8 months ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
RAID
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Many host-based anomaly detection systems monitor process execution at the granularity of system calls. Other recently proposed schemes instead verify the destinations of...
ASSETS
2004
ACM
14 years 1 months ago
2004
ACM
Using Internet Archive’s Wayback Machine, a random sample of websites from 1997-2002 were retrospectively analyzed for effects that technology has on accessibility for persons w...
VLSISP
2002
13 years 7 months ago
2002
A new and efficient class of nonlinear receivers is introduced for digital communication systems. These "iterated-decision" receivers use optimized multipass algorithms t...
ICPADS
2007
IEEE
14 years 2 months ago
2007
IEEE
Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum weight subtree spanning a given subset of (terminal) nodes...