Search
Now showing items 41-50 of 111
The Theory of Timed I/O Automata
(2005-03-02)
This monograph presents the Timed Input/Output Automaton (TIOA) modeling framework, a basic mathematical framework to support description and analysis of timed systems.
Ultra-fast Object Recognition from Few Spikes
(2005-07-06)
Understanding the complex brain computations leading to object recognition requires quantitatively characterizing the information represented in inferior temporal cortex (IT), the highest stage of the primate visual stream. ...
On Algorithms and Complexity for Sets with Cardinality Constraints
(2005-08-03)
Typestate systems ensure many desirable properties of imperativeprograms, including initialization of object fields and correct use ofstateful library interfaces. Abstract sets with cardinalityconstraints naturally ...
Boosting a Biologically Inspired Local Descriptor for Geometry-free Face and Full Multi-view 3D Object Recognition
(2005-07-07)
Object recognition systems relying on local descriptors are increasingly used because of their perceived robustness with respect to occlusions and to global geometrical deformations. Descriptors of this type -- based on ...
How to Construct a Correct and Scalable iBGP Configuration
(2005-08-03)
The Border Gateway Protocol (BGP), the current inter domain routing protocol in the Internet, has two modes of operation: eBGP (External BGP), used to exchange routing information between autonomous systems, and iBGP ...
Byzantine Clients Rendered Harmless
(2005-07-21)
Byzantine quorum systems have been proposed that work properly even when up to f replicas fail arbitrarily.However, these systems are not so successful when confronted with Byzantine faulty clients. This paper presents ...
Etna: a Fault-tolerant Algorithm for Atomic Mutable DHT Data
(2005-06-15)
This paper presents Etna, an algorithm for atomic reads and writes of replicated data stored in a distributed hash table. Etna correctly handles dynamically changing sets of replica hosts, and is optimized for reads, writes, ...
Proving Atomicity: An Assertional Approach
(2005-07-22)
Atomicity (or linearizability) is a commonly used consistency criterion for distributed services and objects. Although atomic object implementations are abundant, proving that algorithms achieve atomicity has turned out ...
Autonomous Virtual Mobile Nodes
(2005-06-15)
This paper presents a new abstraction for virtual infrastructure in mobile ad hoc networks. An AutonomousVirtual Mobile Node (AVMN) is a robust and reliable entity that is designed to cope with theinherent difficulties ...
Implementing Probabilistically Checkable Proofs of Proximity
(2005-08-08)
Abstract: In this paper, we describe a proof-of-concept implementation of the probabilistically checkable proof of proximity (PCPP) system described by Ben-Sasson and Sudan in \\cite{bs05}. In particular, we implement a ...