387 search results - page 35 / 78 » Many Random Walks Are Faster Than One |
ICML
2010
IEEE
13 years 10 months ago
2010
IEEE
Learning undirected graphical models such as Markov random fields is an important machine learning task with applications in many domains. Since it is usually intractable to learn...
SODA
2007
ACM
13 years 10 months ago
2007
ACM
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...
TIT
2010
13 years 3 months ago
2010
Wideband analog signals push contemporary analog-to-digital conversion systems to their performance limits. In many applications, however, sampling at the Nyquist rate is inefficie...
GLVLSI
2008
IEEE
14 years 3 months ago
2008
IEEE
In this paper, we propose a novel statistical capacitance extraction method for interconnects considering process variations. The new method, called statCap, is based on the spect...
PAMI
2010
13 years 7 months ago
2010
—In this paper, we introduce a local image descriptor, DAISY, which is very efficient to compute densely. We also present an EM-based algorithm to compute dense depth and occlusi...