In this paper, we study the problem of decomposing gates in fanin-unbounded or K-bounded networks such that the K-input LUT mapping solutions computed by a depthoptimal mapper hav...
The MAP (maximum a posteriori hypothesis) problem in Bayesian networks is to find the most likely states of a set of variables given partial evidence on the complement of that set...
Suppose that an organization O wants to do the following: to reveal only part of its network map; to filter unwanted traffic passing through its network; and to route, to the righ...
Creating user friendly map interfaces for the mobile platform presents several challenges that are uniquely different from those of their desktop counterparts. High resolution, p...
Recent growth of geospatial information online has made it possible to access various maps and orthoimagery. Conflating these maps and imagery can create images that combine the vi...
Ching-Chien Chen, Craig A. Knoblock, Cyrus Shahabi