Sciweavers

6393 search results - page 300 / 1279
» Randomized Algorithms on the Mesh
Sort
View
IPL
2002
119views more  IPL 2002»
15 years 6 months ago
Randomized splay trees: Theoretical and experimental results
Splay trees are self-organizing binary search trees that were introduced by Sleator and Tarjan [12]. In this paper we present a randomized variant of these trees. The new algorith...
Susanne Albers, Marek Karpinski
CORR
2010
Springer
39views Education» more  CORR 2010»
15 years 4 months ago
Non-redundant random generation from weighted context-free languages
We address the non-redundant random generation of k words of length n from a context-free language. Additionally, we want to avoid a predefined set of words. We study the limits of...
Yann Ponty
IANDC
2011
84views more  IANDC 2011»
15 years 1 months ago
Teaching randomized learners with feedback
The present paper introduces a new model for teaching randomized learners. Our new model, though based on the classical teaching dimension model, allows to study the influence of...
Frank J. Balbach, Thomas Zeugmann
ICIP
2001
IEEE
16 years 8 months ago
Disparity map restoration by integration of confidence in Markov random fields models
This paper proposes some Markov Random Field (MRF) models for restoration of stereo disparity maps. The main aspect is the use of confidence maps provided by the Symmetric Multipl...
Andrea Fusiello, Umberto Castellani, Vittorio Muri...
COMPGEOM
2009
ACM
16 years 1 months ago
Randomly removing g handles at once
It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one giv...
Glencora Borradaile, James R. Lee, Anastasios Sidi...