Sciweavers

851 search results - page 118 / 171
» Random constructions and density results
Sort
View
CORR
2004
Springer
115views Education» more  CORR 2004»
14 years 10 months ago
Bounds on the decoding complexity of punctured codes on graphs
We present two sequences of ensembles of non-systematic irregular repeat-accumulate codes which asymptotically (as their block length tends to infinity) achieve capacity on the bi...
Henry D. Pfister, Igal Sason, Rüdiger L. Urba...
NPL
2000
95views more  NPL 2000»
14 years 9 months ago
Bayesian Sampling and Ensemble Learning in Generative Topographic Mapping
Generative topographic mapping (GTM) is a statistical model to extract a hidden smooth manifold from data, like the self-organizing map (SOM). Although a deterministic search algo...
Akio Utsugi
NMA
2010
14 years 8 months ago
Metaheuristics for the Asymmetric Hamiltonian Path Problem
One of the most important applications of the Asymmetric Hamiltonian Path Problem is in scheduling. In this paper we describe a variant of this problem, and develop both a mathemat...
João Pedro Pedroso
SIGMETRICS
2006
ACM
15 years 4 months ago
Robust network connectivity: when it's the big picture that matters
This work analyzes the connectivity of large diameter networks where every link has an independent probability p of failure. We give a (relatively simple) topological condition th...
Enoch Peserico, Larry Rudolph
84
Voted
TITS
2008
112views more  TITS 2008»
14 years 10 months ago
An Efficient Approach to Onboard Stereo Vision System Pose Estimation
Abstract--This paper presents an efficient technique for estimating the pose of an onboard stereo vision system relative to the environment's dominant surface area, which is s...
Angel Domingo Sappa, Fadi Dornaika, Daniel Ponsa, ...