Sciweavers

580 search results - page 70 / 116
» Choosing a random peer
Sort
View
NIPS
2000
15 years 1 months ago
Active Learning for Parameter Estimation in Bayesian Networks
Bayesian networks are graphical representations of probability distributions. In virtually all of the work on learning these networks, the assumption is that we are presented with...
Simon Tong, Daphne Koller
CORR
2010
Springer
143views Education» more  CORR 2010»
14 years 12 months ago
A Comparative Study of Removal Noise from Remote Sensing Image
This paper attempts to undertake the study of three types of noise such as Salt and Pepper (SPN), Random variation Impulse Noise (RVIN), Speckle (SPKN). Different noise densities ...
Salem Saleh Al-amri, Namdeo V. Kalyankar, Santosh ...
IJNSEC
2008
155views more  IJNSEC 2008»
14 years 12 months ago
Cryptanalysis of Liao-Lee-Hwang's Dynamic ID Scheme
Recently, Das, Saxena and Gulati proposed a dynamic Id based remote user authentication scheme that allows the users to choose and change their passwords freely and does not maint...
Mohammed Misbahuddin, C. Shoba Bindu
CORR
2007
Springer
131views Education» more  CORR 2007»
14 years 12 months ago
Multi-Access MIMO Systems with Finite Rate Channel State Feedback
This paper characterizes the effect of finite rate channel state feedback on the sum rate of a multi-access multiple-input multiple-output (MIMO) system. We propose to control th...
Wei Dai, Brian Rider, Youjian Liu
TEC
2002
163views more  TEC 2002»
14 years 11 months ago
Ants can solve constraint satisfaction problems
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...
Christine Solnon