Sciweavers

1982 search results - page 235 / 397
» Designing Efficient Distributed Algorithms Using Sampling Te...
Sort
View
130
Voted
FOCS
2009
IEEE
15 years 10 months ago
Faster Generation of Random Spanning Trees
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
Jonathan A. Kelner, Aleksander Madry
IVC
2007
188views more  IVC 2007»
15 years 3 months ago
Integration of deformable contours and a multiple hypotheses Fisher color model for robust tracking in varying illuminant enviro
In this paper, we propose a new technique to perform figure-ground segmentation in image sequences of moving objects under varying illumination conditions. Unlike most of the alg...
Francesc Moreno-Noguer, Alberto Sanfeliu, Dimitris...
MOBIHOC
2008
ACM
16 years 2 months ago
Bubble rap: social-based forwarding in delay tolerant networks
In this paper we seek to improve our understanding of human mobility in terms of social structures, and to use these structures in the design of forwarding algorithms for Pocket S...
Pan Hui, Jon Crowcroft, Eiko Yoneki
IPPS
1998
IEEE
15 years 7 months ago
Randomized Routing and PRAM Emulation on Parallel Machines
This paper shows the power of randomization in designing e cient parallel algorithms for the problems of routing and PRAM emulation. We show that with randomization techniques opti...
David S. L. Wei
BMCBI
2010
117views more  BMCBI 2010»
15 years 3 months ago
Beyond rotamers: a generative, probabilistic model of side chains in proteins
Background: Accurately covering the conformational space of amino acid side chains is essential for important applications such as protein design, docking and high resolution stru...
Tim Harder, Wouter Boomsma, Martin Paluszewski, Je...