Sciweavers

1424 search results - page 128 / 285
» Improving on Version Stamps
Sort
View
SODA
2004
ACM
104views Algorithms» more  SODA 2004»
15 years 19 days ago
Variable length path coupling
We present a new technique for constructing and analyzing couplings to bound the convergence rate of finite Markov chains. Our main theorem is a generalization of the path couplin...
Thomas P. Hayes, Eric Vigoda
VMV
2001
115views Visualization» more  VMV 2001»
15 years 19 days ago
Segmentation-Based Postprocessing in Real-Time Immersive Video Conferencing
We present a novel, real-time disparity analysis frame work developed for immersive teleconferencing. This two-stage method computes a limited number of highly reliable disparitie...
Oliver Schreer, Serap Askar, Nicole Brandenburg, P...
FLAIRS
2000
15 years 19 days ago
Latin Hypercube Sampling in Bayesian Networks
Wepropose a schemefor producingLatin hypercube samples that can enhanceany of the existing sampling algorithms in Bayesiannetworks. Wetest this scheme in combinationwith the likel...
Jian Cheng, Marek J. Druzdzel
IJCAI
1997
15 years 18 days ago
Learning Short-Term Weights for GSAT
We investigate an improvement to GSAT which associates a weight with each clause. We change the objective function so that GSAT moves to assignments maximizing the weight of satis...
Jeremy Frank
ICEC
1996
81views more  ICEC 1996»
15 years 18 days ago
A Self-Adaptive Approach to Representation Shifts in Cultural Algorithms
Abstract - The paper describes how a formal model of selfadaptation [Angeline, 1995] can be expressed in terms of Cultural Algorithms. A particular form of self-adaptation concerns...
Robert G. Reynolds, Chan-Jin Chung