Sciweavers

405 search results - page 18 / 81
» On the Simulation of Tikhonov Random Processes
Sort
View
IPSN
2005
Springer
15 years 3 months ago
QoM and lifetime-constrained random deployment of sensor networks for minimum energy consumption
— We consider the problem of energy efficient random deployment of sensor network. Our goal is to find the sensor node density, or alternatively, the energy resource density at e...
Morteza Maleki, Massoud Pedram
ICASSP
2011
IEEE
14 years 1 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

Source Code
1894views
15 years 4 months ago
Supervised Image Segmentation Using Markov Random Fields
This is the sample implementation of a Markov random field based image segmentation algorithm described in the following papers: 1. Mark Berthod, Zoltan Kato, Shan Yu, and Josi...
Csaba Gradwohl, Zoltan Kato
SSIAI
2000
IEEE
15 years 2 months ago
Pairwise Markov Random Fields and its Application in Textured Images Segmentation
The use of random fields, which allows one to take into account the spatial interaction among random variables in complex systems, is a frequent tool in numerous problems of stati...
Wojciech Pieczynski, Abdel-Nasser Tebbache
APPROX
2006
Springer
121views Algorithms» more  APPROX 2006»
15 years 1 months ago
A Randomized Solver for Linear Systems with Exponential Convergence
Abstract. The Kaczmarz method for solving linear systems of equations Ax = b is an iterative algorithm that has found many applications ranging from computer tomography to digital ...
Thomas Strohmer, Roman Vershynin