Sciweavers

11211 search results - page 1992 / 2243
» Rank-Sensitive Data Structures
Sort
View
100
Voted
CCS
2003
ACM
15 years 8 months ago
Anomaly detection of web-based attacks
Web-based vulnerabilities represent a substantial portion of the security exposures of computer networks. In order to detect known web-based attacks, misuse detection systems are ...
Christopher Krügel, Giovanni Vigna
116
Voted
CIA
2003
Springer
15 years 8 months ago
A Framework for the Social Description of Resources in Open Environments
Abstract. The description of public resources such as web site contents, web services or data files in open peer-to-peer networks using some formal framework like RDF usually reļ¬...
Matthias Nickles, Gerhard Weiß
107
Voted
CICLING
2003
Springer
15 years 8 months ago
Automatic Sense Disambiguation of the Near-Synonyms in a Dictionary Entry
We present an automatic method to disambiguate the senses of the near-synonyms in the entries of a dictionary of synonyms. We combine different indicators that take advantage of th...
Diana Zaiu Inkpen, Graeme Hirst
144
Voted
ERSHOV
2003
Springer
15 years 8 months ago
On the Possibility of Provably Secure Obfuscating Programs
By obfuscation we mean any efficient semantic-preserving transformation of computer programs aimed at bringing a program into such a form, which impedes the understanding of its al...
Nikolay P. Varnovsky, Vladimir A. Zakharov
132
Voted
ESA
2003
Springer
111views Algorithms» more  ESA 2003»
15 years 8 months ago
Fast Smallest-Enclosing-Ball Computation in High Dimensions
Abstract. We develop a simple combinatorial algorithm for computing the smallest enclosing ball of a set of points in high dimensional Euclidean space. The resulting code is in mos...
Kaspar Fischer, Bernd Gärtner, Martin Kutz
« Prev « First page 1992 / 2243 Last » Next »