Search
Now showing items 41-50 of 96
The Theory of Timed I/O Automata
(2003-08-27)
Revised version -- November 23, 2004.This paper presents the Timed Input/Output Automaton (TIOA) modeling framework, a basic mathematical framework to support description and analysis of timed systems.
Scalable Internet Routing on Topology-Independent Node Identities
(2003-10-31)
Unmanaged Internet Protocol (UIP) is a fully selforganizingnetwork-layer protocol that implements scalableidentity-based routing. In contrast with addressbasedrouting protocols, which depend for scalability oncentralized ...
Component based recognition of objects in an office environment
(2003-11-28)
We present a component-based approach for recognizing objectsunder large pose changes. From a set of training images of a givenobject we extract a large number of components which are clusteredbased on the similarity of ...
Efficient Specification-Assisted Error Localization and Correction
(2003-11-13)
We present a new error localization tool, Archie, that accepts aspecification of key data structure consistency constraints, then generatesan algorithm that checks if the data structures satisfy theconstraints. We also ...
Evolving Robocode Tank Fighters
(2003-10-28)
In this paper, I describe the application of genetic programming to evolve a controller for a robotic tank in a simulated environment.The purpose is to explore how genetic techniques can best be applied to produce controllers ...
On Role Logic
(2003-10-24)
We present role logic, a notation for describing propertiesof relational structures in shape analysis, databases, andknowledge bases. We construct role logic using the ideas ofde Bruijn's notation for lambda calculus, an ...
A Stream Algorithm for the SVD
(2003-10-22)
We present a stream algorithm for the Singular-Value Decomposition (SVD) of anM X N matrix A. Our algorithm trades speed of numerical convergence for parallelism,and derives from a one-sided, cyclic-by-rows Hestenes SVD. ...
Updatable Zero-Knowledge Sets
(2003-10-14)
We build on the work of Micali, Rabin, and Killian [4] to introduce zero-knowledge sets and databases that may be updated in a desirable way. In particular, in order to make an update the owner of the set must publish a ...
The Satisfiability Threshold of Random 3-SAT Is at Least 3.52
(2003-11-20)
We prove that a random 3-SAT instance with clause-to-variable densityless than 3.52 is satisfiable with high probability.The proof comes through an algorithm which selects (and sets) a variabledepending on its degree and ...
Finding Longest Increasing and Common Subsequences in Streaming Data
(2003-11-26)
In this paper, we present algorithms and lower bounds for the Longest Increasing Subsequence(LIS) and Longest Common Subsequence (LCS) problems in the data streaming model.