#### Filter Results:

#### Publication Year

2011

2015

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

Characterizing the set of routes used between domains is an important and difficult problem. The size and complexity of the millions of BGP paths in use at any time can hide important phenomena and hinder attempts to understand the path selection behavior of ASes. In this paper we introduce a new approach to analysis of the interdomain routing system… (More)

Consider this simple question: how can a network operator identify the set of routes that pass through its network? Answering this question is surprisingly hard: BGP only informs an operator about a limited set of routes. By observing traffic, an operator can only conclude that a particular route passes through its network -- but not that a route does not… (More)

In this paper, we describe a physical activity classification system using a body sensor network (BSN) consisting of cost-sensitive tri-axial accelerometers. We focus on workspace activities (different motions and sitting postures). We use a Naive Bayes classifier and show that we can train the system simply and systematically. For each task, we find a set… (More)

In many applications, e.g., recommender systems and traffic monitoring, the data comes in the form of a matrix that is only partially observed and low rank. A fundamental data-analysis task for these datasets is <i>matrix completion</i>, where the goal is to accurately infer the entries missing from the matrix. Even when the data satisfies the low-rank… (More)

The Wiener index of a graph is the sum of all pairwise shortest-path distances between its vertices. In this paper we study the novel problem of finding a <i>minimum Wiener connector</i>: given a connected graph <i>G=(V,E)</i> and a set <i>Q</i> ⊆ <i>V</i> of query vertices, find a subgraph of <i>G</i> that connects all query vertices and has minimum… (More)

The Wiener index of a graph is the sum of all pairwise shortest-path distances between its vertices. In this paper we study the novel problem of finding a minimum Wiener connector : given a connected graph G = (V, E) and a set Q ⊆ V of query vertices, find a subgraph of G that connects all query vertices and has minimum Wiener index. We show that Min Wiener… (More)

- ‹
- 1
- ›