Sciweavers

225 search results - page 31 / 45
» Explicit Combinatorial Structures for Cooperative Distribute...
Sort
View
INFOCOM
1999
IEEE
14 years 1 months ago
Inference of Multicast Routing Trees and Bottleneck Bandwidths Using End-to-end Measurements
Abstract-- The efficacy of end-to-end multicast transport protocols depends critically upon their ability to scale efficiently to a large number of receivers. Several research mult...
Sylvia Ratnasamy, Steven McCanne
ECCV
2002
Springer
14 years 11 months ago
Bayesian Self-Calibration of a Moving Camera
In this paper, a Bayesian self-calibration approach using sequential importance sampling (SIS) is proposed. Given a set of feature correspondences tracked through an image sequenc...
Gang Qian, Rama Chellappa
DAGM
2004
Springer
14 years 2 months ago
A Probabilistic Framework for Robust and Accurate Matching of Point Clouds
We present a probabilistic framework for matching of point clouds. Variants of the ICP algorithm typically pair points to points or points to lines. Instead, we pair data points to...
Peter Biber, Sven Fleck, Wolfgang Straßer
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
14 years 3 months ago
Some novel locality results for the blob code spanning tree representation
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
Tim Paulden, David K. Smith
MP
2006
175views more  MP 2006»
13 years 9 months ago
Conditional Value-at-Risk in Stochastic Programs with Mixed-Integer Recourse
In classical two-stage stochastic programming the expected value of the total costs is minimized. Recently, mean-risk models - studied in mathematical finance for several decades -...
Rüdiger Schultz, Stephan Tiedemann