Sciweavers

170 search results - page 6 / 34
» On the Probability of the Number of Solutions for the P4P Pr...
Sort
View
ISBI
2006
IEEE
14 years 8 months ago
Continuous image representations avoid the histogram binning problem in mutual information based image registration
Mutual information (MI) based image-registration methods that use histograms are known to suffer from the so-called binning problem, caused by the absence of a principled techniqu...
Ajit Rajwade, Arunava Banerjee, Anand Rangarajan
CJ
2008
97views more  CJ 2008»
13 years 7 months ago
Three Kinds of Probabilistic Induction: Universal Distributions and Convergence Theorems
We will describe three kinds of probabilistic induction problems, and give general solutions for each , with associated convergence theorems that show they tend to give good proba...
Ray J. Solomonoff
WEA
2010
Springer
284views Algorithms» more  WEA 2010»
14 years 2 months ago
Paging Multiple Users in Cellular Network: Yellow Page and Conference Call Problems
Abstract. Mobile users are roaming in a zone of cells in a cellular network system. The probabilities of each user residing in each cell are known, and all probabilities are indepe...
Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng 0002
EJWCN
2010
229views more  EJWCN 2010»
13 years 2 months ago
Throughput-Efficient Dynamic Coalition Formation in Distributed Cognitive Radio Networks
We formulate the problem of distributed throughput-efficient sensing in cognitive radio (CR) networks as a dynamic coalition formation game based on a Markovian model. The propose...
Zaheer Khan, Janne J. Lehtomäki, Marian Codre...
CISS
2010
IEEE
12 years 11 months ago
Cost constrained spectrum sensing in cognitive radio networks
—This paper addresses optimal spectrum sensing in cognitive radio networks considering its system level cost that accounts for the local processing cost of sensing (sample collec...
Gang Xiong, Shalinee Kishore, Aylin Yener