Details of the building facades are needed for high quality fly-through visualization or
simulation applications. Windows form a key structure in the detailed facade reconstruction …

We study the task of estimating the number of edges in a graph, where the access to the
graph is provided via an independent set oracle. Independent set queries draw motivation …

We investigate the problem of exactly reconstructing, with high confidence and up to
isomorphism, the ball of radius r centered at the starting state of a Markov process from …

We study the problem of finding a spanning forest in an undirected, $ n $-vertex multi-graph
under two basic query models. One is the Linear query model which are linear …

We consider the problem of finding an unknown graph by using two types of queries with an
additive property. Given a graph, an additive query asks the number of edges in a set of …

We consider the problem of inferring the most likely social network given connectivity
constraints imposed by observations of outbreaks within the network. Given a set of vertices …

How efficiently can we find an unknown graph using distance queries between its vertices?
We assume that the unknown graph is connected, unweighted, and has bounded degree …

How efficiently can we find an unknown graph using distance or shortest path queries
between its vertices? We assume that the unknown graph G is connected, unweighted, and …

In this paper, we study the problem of learning a monotone DNF with at most s terms of size
(number of variables in each term) at most r (s term r-MDNF) from membership queries. This …

We consider the task of topology discovery of sparse random graphs using end-to-end
random measurements (eg, delay) between a subset of nodes, referred to as the …