Search
Now showing items 61-70 of 111
Theoretical Analysis of Geographic Routing in Social Networks
(2005-06-03)
We introduce a formal model for geographic social networks, and introduce the notion of rank-based friendship, in which the probability that a person v is a friend of a person u is inversely proportional to the number of ...
Approximating Buy-at-Bulk k-Steiner trees
(2005-11-15)
In the buy-at-bulk $k$-Steiner tree (or rent-or-buy$k$-Steiner tree) problem we are given a graph $G(V,E)$ with a setof terminals $T\subseteq V$ including a particular vertex $s$ calledthe root, and an integer $k\leq |T|$. ...
Polylogarithmic Approximation Algorithm for Non-Uniform Multicommodity Buy-at-Bulk
(2005-11-26)
We consider the non-uniform multicommodity buy-at-bulknetworkdesign problem. In this problem we are given a graph $G(V,E)$withtwo cost functions on the edges, a buy cost $b:E\longrightarrow \RR^+$and a rent cost$r:E\long ...
Error weighted classifier combination for multi-modal human identification
(2005-12-14)
In this paper we describe a technique of classifier combination used in a human identification system. The system integrates all available features from multi-modal sources within a Bayesian framework. The framework allows ...
Pyramid Match Kernels: Discriminative Classification with Sets of Image Features
(2005-03-17)
Discriminative learning is challenging when examples are setsof local image features, and the sets vary in cardinality and lackany sort of meaningful ordering. Kernel-based classificationmethods can learn complex decision ...
Exploiting Vector Parallelism in Software Pipelined Loops
(2005-06-03)
An emerging trend in processor design is the incorporation of short vector instructions into the ISA. In fact, vector extensions have appeared in most general-purpose microprocessors. To utilize these instructions, ...
Automatic Software Upgrades for Distributed Systems (PhD thesis)
(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 ...
Biologically-Inspired Robust Spatial Programming
(2005-01-18)
Inspired by the robustness and flexibility of biological systems, we are developing linguistic and programming tools to allow us to program spatial systems populated by vast numbers of unreliable components interconnected ...
A Dynamic Data Structure for Checking Hyperacyclicity
(2005-01-03)
We present a dynamic data structure that keeps track of an acyclic hypergraph (equivalently, a triangulated graph) and enables verifying that adding a candidate hyperedge (clique) will not break the acyclicity of the ...
Virtual Stationary Automata for Mobile Networks
(2005-01-21)
We define a programming abstraction formobile networks called the Virtual Stationary Automataprogramming layer, consisting of real mobile clients, virtualtimed I/O automata called virtual stationary automata(VSAs), and a ...