Sciweavers

3495 search results - page 128 / 699
» On the random satisfiable process
Sort
View
ICASSP
2011
IEEE
14 years 8 months ago
Identification of ARMA models using intermittent and quantized output observations
This paper studies system identification of ARMA models whose outputs are subject to finite-level quantization and random packet dropouts. A simple adaptive quantizer and the co...
Damián Marelli, Keyou You, Minyue Fu
MSWIM
2006
ACM
15 years 10 months ago
The power of choice in random walks: an empirical study
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
Chen Avin, Bhaskar Krishnamachari
ICASSP
2011
IEEE
14 years 8 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
138
Voted
IPPS
2006
IEEE
15 years 10 months ago
Load balancing in the presence of random node failure and recovery
In many distributed computing systems that are prone to either induced or spontaneous node failures, the number of available computing resources is dynamically changing in a rando...
Sagar Dhakal, Majeed M. Hayat, Jorge E. Pezoa, Cha...
CVBIA
2005
Springer
15 years 9 months ago
Segmenting Brain Tumors with Conditional Random Fields and Support Vector Machines
Abstract. Markov Random Fields (MRFs) are a popular and wellmotivated model for many medical image processing tasks such as segmentation. Discriminative Random Fields (DRFs), a dis...
Chi-Hoon Lee, Mark Schmidt, Albert Murtha, Aalo Bi...