Sciweavers

1054 search results - page 193 / 211
» A Formalization of the Turing Test
Sort
View
AMSTERDAM
2009
14 years 9 months ago
There Is Something about Might
In this paper we present an alternative interpretation of statements of epistemic possibility, which does not induce a consistency test on a common ground, as in (Veltman 1996), bu...
Paul Dekker
ISCA
2011
IEEE
269views Hardware» more  ISCA 2011»
14 years 3 months ago
Crafting a usable microkernel, processor, and I/O system with strict and provable information flow security
High assurance systems used in avionics, medical implants, and cryptographic devices often rely on a small trusted base of hardware and software to manage the rest of the system. ...
Mohit Tiwari, Jason Oberg, Xun Li 0001, Jonathan V...
ECOOP
2010
Springer
15 years 4 months ago
The Essence of JavaScript
We reduce JavaScript to a core calculus structured as a small-step operational semantics. We present several peculiarities of the language and show that our calculus models them. W...
Arjun Guha, Claudiu Saftoiu, Shriram Krishnamurthi
ECCV
2006
Springer
16 years 1 months ago
EMD-L1: An Efficient and Robust Algorithm for Comparing Histogram-Based Descriptors
We propose a fast algorithm, EMD-L1, for computing the Earth Mover's Distance (EMD) between a pair of histograms. Compared to the original formulation, EMD-L1 has a largely si...
Haibin Ling, Kazunori Okada
SIGSOFT
2007
ACM
16 years 17 days ago
Quantitative verification: models techniques and tools
Automated verification is a technique for establishing if certain properties, usually expressed in temporal logic, hold for a system model. The model can be defined using a high-l...
Marta Z. Kwiatkowska