Open Access Repositories: Recent submissions
Now showing items 2021-2040 of 4204
-
Understanding camera trade-offs through a Bayesian analysis of light field projections - A revision
(2008-07-28)Computer vision has traditionally focused on extracting structure,such as depth, from images acquired using thin-lens or pinholeoptics. The development of computational imaging is broadening thisscope; a variety of ...
-
Event Order Abstraction for Parametric Real-Time System Verification
(2008-07-28)We present a new abstraction technique, event order abstraction (EOA), for parametric safety verification of real-time systems in which ``correct orderings of events'' needed for system correctness are maintained by timing ...
-
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 ...
-
Elastic-Net Regularization in Learning Theory
(2008-07-24)Within the framework of statistical learning theory we analyze in detail the so-called elastic-net regularization scheme proposed by Zou and Hastie ["Regularization and variable selection via the elastic net" J. R. Stat. ...
-
A Projected Subgradient Method for Scalable Multi-Task Learning
(2008-07-23)Recent approaches to multi-task learning have investigated the use of a variety of matrix norm regularization schemes for promoting feature sharing across tasks.In essence, these approaches aim at extending the l1 framework ...
-
Composable Probabilistic Inference with Blaise
(2008-07-23)Probabilistic inference provides a unified, systematic framework for specifying and solving these problems. Recent work has demonstrated the great value of probabilistic models defined over complex, structured domains. ...
-
A Distributed Building Evacuation System
(2008-07-14)This thesis investigates the feasibility of a smart building evacuation system, capable of guiding occupants along safe paths to exits and responding to changing threats. Inspired by developments in amorphous computing, ...
-
Knowledge Benchmarks in Adversarial Mechanism Design (Part I) and Implementation in Surviving Strategies (Part I)
(2008-07)We put forward new benchmarks and solution concepts for Adversarial Mechanism Design, as defined by [MV07.a], and we exemplify them in the case of truly combinatorial auctions.We benchmark the combined performance (the sum ...
-
Knowledge Benchmarks in Adversarial Mechanism Design and Implementation in Surviving Strategies (Part I)
(2008-06)We put forward new benchmarks and solution concepts for Adversarial Mechanism Design, as defined by [MV07.a], and we exemplify them in the case of truly combinatorial auctions.We benchmark the combined performance (the sum ...
-
-
Flexible MIPS Soft Processor Architecture
(2008-06-16)The flexible MIPS soft processor architecture borrows selected technologies from high-performance computing to deliver a modular, highly customizable CPU targeted towards FPGA implementations for embedded systems; the ...
-
Detecting and Tolerating Byzantine Faults in Database Systems
(2008-06-30)This thesis describes the design, implementation, and evaluation of a replication scheme to handle Byzantine faults in transaction processing database systems. The scheme compares answers from queries and updates on multiple ...
-
Revenue in Truly Combinatorial Auctions and Adversarial Mechanism Design
(2007- 11-0)Little is known about generating revenue in UNRESTRICTED combinatorial auctions. (In particular, the VCG mechanism has no revenue guarantees.) In this paper we determine how much revenue can be guaranteed in such auctions. ...
-
Safe Open-Nested Transactions Through Ownership
(2008-02-20)Researchers in transactional memory (TM) have proposed open nesting asa methodology for increasing the concurrency of a program. The ideais to ignore certain "low-level" memory operations of anopen-nested transaction when ...
-
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 ...
-
Fast concurrent object classification and localization
(2008-06-10)Object localization and classification are important problems incomputer vision. However, in many applications, exhaustive searchover all class labels and image locations is computationallyprohibitive. While several methods ...
-
Agent Organization in the Knowledge Plane
(2008-06-11)In designing and building a network like the Internet, we continue to face the problems of scale and distribution. With the dramatic expansion in scale and heterogeneity of the Internet, network management has become an ...
-
Non-Metrical Navigation Through Visual Path Control
(2008-06-06)We describe a new method for wide-area, non-metrical robot navigationwhich enables useful, purposeful motion indoors. Our method has twophases: a training phase, in which a human user directs a wheeledrobot with an attached ...
-
On a model of visual cortex: learning invariance and selectivity
(2008-04-04)In this paper we present a class of algorithms for similarity learning on spaces of images. The general framework that we introduce is motivated by some well-known hierarchical pre-processing architectures for object ...
-
The SoftPHY Abstraction: from Packets to Symbols in Wireless Network Design
(2008-06-03)At ever-increasing rates, we are using wireless systems to communicatewith others and retrieve content of interest to us. Current wirelesstechnologies such as WiFi or Zigbee use forward error correction todrive bit error ...
