We study the problem of counting and randomly sampling binary contingency tables. For given row and column sums, we are interested in approximately counting (or sampling) 0/1 n
With 39% of Americans admitting the use of the Web to get unfiltered campaign materials, it becomes important to evaluate how they are searching for these materials and what they a...
Eni Mustafaraj, Panagiotis Takis Metaxas, Catherin...
We have developed a distributed search engine, Cooperative Search Engine (CSE) to retrieve fresh information. In CSE, a local search engine located in each web server makes an ind...
In this work we present algorithms for Minimum Energy Consumption Broadcast Subgraph (MECBS) problem. First, we focus on designing distributed algorithms for MECBS. To our knowled...