Sciweavers

104 search results - page 6 / 21
» Nodes of large degree in random trees and forests
Sort
View
RSA
2010
108views more  RSA 2010»
14 years 10 months ago
Resolvent of large random graphs
We analyze the convergence of the spectrum of large random graphs to the spectrum of a limit infinite graph. We apply these results to graphs converging locally to trees and deri...
Charles Bordenave, Marc Lelarge
CVPR
2011
IEEE
14 years 8 months ago
Combining Randomization and Discrimination for Fine-Grained Image Categorization
In this paper, we study the problem of fine-grained image categorization. The goal of our method is to explore fine image statistics and identify the discriminative image patche...
Bangpeng Yao, Aditya Khosla, Li Fei-Fei
OPODIS
2007
15 years 1 months ago
Worm Versus Alert: Who Wins in a Battle for Control of a Large-Scale Network?
Consider the following game between a worm and an alert3 over a network of n nodes. Initially, no nodes are infected or alerted and each node in the network is a special detector n...
James Aspnes, Navin Rustagi, Jared Saia
EJC
2008
14 years 12 months ago
Expansion properties of a random regular graph after random vertex deletions
We investigate the following vertex percolation process. Starting with a random regular graph of constant degree, delete each vertex independently with probability p, where p = n-...
Catherine S. Greenhill, Fred B. Holt, Nicholas C. ...
DAGM
2011
Springer
13 years 11 months ago
Real Time Head Pose Estimation from Consumer Depth Cameras
We present a system for estimating location and orientation of a person’s head, from depth data acquired by a low quality device. Our approach is based on discriminative random r...
Gabriele Fanelli, Thibaut Weise, Juergen Gall, Luc...