Sciweavers

5115 search results - page 184 / 1023
» On Randomized Lanczos Algorithms
Sort
View
ICIP
1998
IEEE
16 years 8 months ago
Reducing the Computational Complexity of a Map Post-Processing Algorithm for Video Sequences
Maximum a posteriori (MAP) filtering using the HuberMarkov random field (HMRF) image model has been shown in the past to be an effective method of reducing compression artifacts i...
Mark A. Robertson, Robert L. Stevenson
ICASSP
2011
IEEE
14 years 10 months ago
A general proof of convergence for adaptive distributed beamforming schemes
This work focuses on the convergence analysis of adaptive distributed beamforming schemes that can be reformulated as local random search algorithms via a random search framework....
Chang-Ching Chen, Chia-Shiang Tseng, Che Lin
ICML
2001
IEEE
16 years 7 months ago
Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data
We present conditional random fields, a framework for building probabilistic models to segment and label sequence data. Conditional random fields offer several advantages over hid...
John D. Lafferty, Andrew McCallum, Fernando C. N. ...
CIE
2009
Springer
16 years 1 months ago
Numberings and Randomness
Abstract. We prove various results on effective numberings and Friedberg numberings of families related to algorithmic randomness. The family of all Martin-L¨of random left-compu...
Paul Brodhead, Bjørn Kjos-Hanssen
AINA
2007
IEEE
16 years 1 months ago
Random Oracle Instantiation in Distributed Protocols Using Trusted Platform Modules
The random oracle model is an idealized theoretical model that has been successfully used for designing many cryptographic algorithms and protocols. Unfortunately, a series of res...
Vandana Gunupudi, Stephen R. Tate