We seek to both detect and segment objects in images. To exploit both local image data as well as contextual information, we introduce Boosted Random Fields (BRFs), which use boos...
Antonio Torralba, Kevin P. Murphy, William T. Free...
: We study a model of random uniform hypergraphs, where a random instance is obtained by adding random edges to a large hypergraph of a given density. The research on this model fo...
Vertex pursuit games, such as the game of Cops and Robbers, are a simplified model for network security. In these games, cops try to capture a robber loose on the vertices of the ...
Theoretical analysis of the Web graph is often used to improve the efficiency of search engines. The PageRank algorithm, proposed by [5], is used by the Google search engine [4] t...
The Web graph is a giant social network whose properties have been measured and modeled extensively in recent years. Most such studies concentrate on the graph structure alone, an...