Sciweavers

1054 search results - page 80 / 211
» A Formalization of the Turing Test
Sort
View
GIS
2006
ACM
15 years 4 months ago
Qualitative polyline similarity testing with applications to query-by-sketch, indexing and classification
We present an algorithm for polyline (and polygon) similarity testing that is based on the double-cross formalism. To determine the degree of similarity between two polylines, the...
Bart Kuijpers, Bart Moelans, Nico Van de Weghe
116
Voted
ICML
2006
IEEE
16 years 5 months ago
Nightmare at test time: robust learning by feature deletion
When constructing a classifier from labeled data, it is important not to assign too much weight to any single input feature, in order to increase the robustness of the classifier....
Amir Globerson, Sam T. Roweis
SAC
2004
ACM
15 years 10 months ago
Using mobile agents as roaming security guards to test and improve security of hosts and networks
1 This paper discusses the design and implementation details of MAST (Mobile Agent-based Security Tool), a new mobile agentbased network security approach. MAST has been designed t...
Marco M. Carvalho, Thomas B. Cowin, Niranjan Suri,...
CHARME
2003
Springer
97views Hardware» more  CHARME 2003»
15 years 10 months ago
Convergence Testing in Term-Level Bounded Model Checking
We consider the problem of bounded model checking of systems expressed in a decidable fragment of first-order logic. While model checking is not guaranteed to terminate for an ar...
Randal E. Bryant, Shuvendu K. Lahiri, Sanjit A. Se...
CCS
2011
ACM
14 years 4 months ago
Trace equivalence decision: negative tests and non-determinism
We consider security properties of cryptographic protocols that can be modeled using the notion of trace equivalence. The notion of equivalence is crucial when specifying privacy-...
Vincent Cheval, Hubert Comon-Lundh, Stéphan...