686 search results - page 72 / 138 » On the General Applicability of Instruction-Set Randomizatio... |
COMPGEOM
2004
ACM
14 years 2 months ago
2004
ACM
We consider the problem of approximate range counting over streams of d-dimensional points. In the data stream model, the algorithm makes a single scan of the data, which is prese...
ISCAS
2003
IEEE
14 years 2 months ago
2003
IEEE
The Hamiltonian Cycle (HC) problem is an important graph problem with many applications. The general backtracking algorithm normally used for random graphs often takes far too lon...
CIKM
2003
Springer
14 years 2 months ago
2003
Springer
We present a series of experiments to demonstrate the validity of Relative Utility (RU) as a measure for evaluating extractive summarizers. RU is applicable in both singledocument...
CRYPTO
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. In this paper, we reconsider the notion of plaintext awareness. We present a new model for plaintext-aware encryption that is both natural and useful. We achieve plaintex...
GECCO
2006
Springer
14 years 12 days ago
2006
Springer
This paper presents an automatic design method for piping arrangement. A pipe arrangement design problem is proposed for a space in which many pipes and objects co-exist. This pro...