Open Access Repositories: Recent submissions
Now showing items 2461-2480 of 4204
-
Automatic Software Upgrades for Distributed Systems
(2005-11-30)Upgrading the software of long-lived, highly-available distributed systems is difficult. It is not possible to upgrade all the nodes in a system at once, since some nodes may be unavailable and halting the system for an ...
-
Conditional Random People: Tracking Humans with CRFs and Grid Filters
(2005-12-01)We describe a state-space tracking approach based on a Conditional Random Field(CRF) model, where the observation potentials are \emph{learned} from data. Wefind functions that embed both state and observation into a space ...
-
Identifying Expression Fingerprints using Linguistic Information
(2005-11-18)This thesis presents a technology to complement taxation-based policy proposals aimed at addressing the digital copyright problem. Theapproach presented facilitates identification of intellectual propertyusing expression ...
-
Accurate and Scalable Surface Representation and Reconstruction from Images
(2005-11-18)We introduce a new surface representation, the patchwork, to extend the problem of surface reconstruction from multiple images. A patchwork is the combination of several patches that are built one by one. This design ...
-
Analysis of Perceptron-Based Active Learning
(2005-11-17)We start by showing that in an active learning setting, the Perceptron algorithm needs $\Omega(\frac{1}{\epsilon^2})$ labels to learn linear separators within generalization error $\epsilon$. We then present a simple ...
-
Online Learning of Non-stationary Sequences
(2005-11-17)We consider an online learning scenario in which the learner can make predictions on the basis of a fixed set of experts. We derive upper and lower relative loss bounds for a class of universal learning algorithms involving ...
-
New LSH-based Algorithm for Approximate Nearest Neighbor
(2005-11-04)We present an algorithm for c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time ofO(dn^{1/c^2+o(1)}) and space O(dn + n^{1+1/c^2+o(1)}).
-
On Field Constraint Analysis
(2005-11-03)We introduce field constraint analysis, a new technique for verifying data structure invariants. A field constraint for a field is a formula specifying a set of objects to which the field can point. Field constraints ...
-
Subcontracted Rational SFE
(2005-11-02)In their paper, "Rational Secure Computation and Ideal Mechanism Design," Izmalkov, Lepinski and Micali show that any one-shot mediated game can be simulated by the players themselves, without the help of a trusted mediator, ...
-
Towards Realizing the Performance and Availability Benefits of a Global Overlay Network
(2005-11-01)Prior analyses of the benefits of routing overlays are based onplatforms consisting of nodes located primarily in North America, onthe academic Internet, and at the edge of the network. This paper isthe first global study ...
-
Using Cyclic Memory Allocation to Eliminate Memory Leaks
(2005-10-26)We present and evaluate a new memory management technique foreliminating memory leaks in programs with dynamic memoryallocation. This technique observes the execution of the program on asequence of training inputsto find ...
-
MPEG-2 in a Stream Programming Language
(2005-10-22)Image and video codecs are prevalent in multimedia applications, ranging from embedded systems, to desktop computers, to high-end servers such as HDTV editing consoles. It is not uncommon however that developers create ...
-
Asymptotics of Gaussian Regularized Least-Squares
(2005-10-20)We consider regularized least-squares (RLS) with a Gaussian kernel. Weprove that if we let the Gaussian bandwidth $\sigma \rightarrow\infty$ while letting the regularization parameter $\lambda\rightarrow 0$, the RLS solution ...
-
Knowledge Flow Analysis for Security Protocols
(2005-10-19)Knowledge flow analysis offers a simple and flexible way to find flaws in security protocols. A protocol is described by a collection of rules constraining the propagation of knowledge amongst principals. Because this ...
-
Towards the Prevention of Dyslexia
(2005-10-18)Previous studies have shown that dyslexic individuals who supplement windowed reading practice with intensive small-scale hand-eye coordination tasks exhibit marked improvement in their reading skills. Here we examine ...
-
Victim Migration: Dynamically Adapting Between Private and Shared CMP Caches
(2005-10-10)Future CMPs will have more cores and greater onchip cache capacity. The on-chip cache can either be divided into separate private L2 caches for each core, or treated as a large shared L2 cache. Private caches provide low ...
-
Learning to Trade with Insider Information
(2005-10-07)This paper introduces algorithms for learning how to trade usinginsider (superior) information in Kyle's model of financial markets.Prior results in finance theory relied on the insider having perfectknowledge of the ...
-
Automatic Software Upgrades for Distributed Systems
(2005-10-06)Upgrading the software of long-lived, highly-available distributedsystems is difficult. It is not possible to upgrade all the nodes in asystem at once, since some nodes may be unavailable and halting thesystem for an ...
-
Secondary Structure Prediction of All-Helical Proteins Using Hidden Markov Support Vector Machines
(2005-10-06)Our goal is to develop a state-of-the-art predictor with an intuitive and biophysically-motivated energy model through the use of Hidden Markov Support Vector Machines (HM-SVMs), a recent innovation in the field of machine ...
-
Combining diagrammatic and symbolic reasoning
(2005-10-06)We introduce a domain-independent framework for heterogeneous natural deduction that combines diagrammatic and sentential reasoning. The framework is presented in the form of a family of denotational proof languages (DPLs). ...
