Sciweavers

2310 search results - page 253 / 462
» Coloring Random Graphs
Sort
View
CVPR
2011
IEEE
13 years 4 months ago
Object Stereo - Joint Stereo Matching and Object Segmentation
This paper presents a method for joint stereo matching and object segmentation. In our approach a 3D scene is represented as a collection of visually distinct and spatially cohere...
Michael Bleyer, Carsten Rother, Pushmeet Kohli, Da...
ESA
2004
Springer
97views Algorithms» more  ESA 2004»
14 years 1 months ago
Radio Network Clustering from Scratch
Abstract. We propose a novel randomized algorithm for computing a dominating set based clustering in wireless ad-hoc and sensor networks. The algorithm works under a model which ca...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
ADHOCNOW
2005
Springer
14 years 1 months ago
Performance Analysis of the Hierarchical Layer Graph for Wireless Networks
The Hierarchical Layer Graph (HL graph) is a promising network topology for wireless networks with variable transmission ranges. It was introduced and analyzed by Meyer auf der He...
Stefan Rührup, Christian Schindelhauer, Klaus...
COMBINATORICA
2004
79views more  COMBINATORICA 2004»
13 years 8 months ago
The Deletion Method For Upper Tail Estimates
We present a new method to show concentration of the upper tail of random variables that can be written as sums of variables with plenty of independence. We compare our method with...
Svante Janson, Andrzej Rucinski
CRYPTO
2007
Springer
134views Cryptology» more  CRYPTO 2007»
14 years 2 months ago
Domain Extension of Public Random Functions: Beyond the Birthday Barrier
A public random function is a random function that is accessible by all parties, including the adversary. For example, a (public) random oracle is a public random function {0, 1}â...
Ueli M. Maurer, Stefano Tessaro