Search
Now showing items 71-79 of 79
Context-based Visual Feedback Recognition
(2006-11-15)
During face-to-face conversation, people use visual feedback (e.g.,head and eye gesture) to communicate relevant information and tosynchronize rhythm between participants. When recognizing visualfeedback, people often rely ...
Quantitative Information-Flow Tracking for C and Related Languages
(2006-11-17)
We present a new approach for tracking programs' use of data througharbitrary calculations, to determine how much information about secretinputs is revealed by public outputs. Using a fine-grained dynamicbit-tracking ...
Implementing Atomic Data through Indirect Learning in Dynamic Network
(2006-10-12)
Developing middleware services for dynamic distributed systems, e.g., ad-hoc networks, is a challenging task given that suchservices must deal with communicating devices that may join and leave the system, and fail or ...
On the Adaptive Real-Time Detection of Fast-Propagating Network Worms
(2006-11-10)
We present two light-weight worm detection algorithms thatoffer significant advantages over fixed-threshold methods.The first algorithm, RBS (rate-based sequential hypothesis testing)aims at the large class of worms that ...
Scoop: An Adaptive Indexing Scheme for Stored Data in Sensor Networks
(2006-11-27)
In this paper, we present the design of Scoop, a system for indexing and querying stored data in sensor networks. Scoop works by collecting statistics about the rate of queries and distribution of sensor readings over a ...
Materialization Strategies in a Column-Oriented DBMS
(2006-11-27)
There has been renewed interest in column-oriented database architectures in recent years. For read-mostly query workloads such as those found in data warehouse and decision support applications, ``column-stores'' have ...
Matching Sets of Features for Efficient Retrieval and Recognition
(2006-08-11)
In numerous domains it is useful to represent a single example by the collection of local features or parts that comprise it. In computer vision in particular, local image features are a powerful way to describe images of ...
An $\Omega(n \log n)$ Lower Bound on the Cost of Mutual Exclusion
(2006-07-23)
We prove an $\Omega(n \log n)$ lower bound on the number ofnon-busywaiting memory accesses by any deterministic algorithm solving$n$ process mutual exclusion that communicates via shared registers.The cost of the algorithm ...
Optimal Temporal Planning at Reactive Time Scales via Dynamic Backtracking Branch and Bound
(2006-08-25)
Autonomous robots are being considered for increasingly capable roles in our society, such as urban search and rescue, automation for assisted living, and lunar habitat construction. To fulfill these roles, teams of ...