Sciweavers

5785 search results - page 230 / 1157
» Approximability of Probability Distributions
Sort
View
CVPR
2000
IEEE
16 years 6 months ago
Order Parameters for Minimax Entropy Distributions: When Does High Level Knowledge Help?
Many problems in vision can be formulated as Bayesian inference. It is important to determine the accuracy of these inferences and how they depend on the problem domain. In recent...
Alan L. Yuille, James M. Coughlan, Song Chun Zhu, ...
WDAG
2009
Springer
103views Algorithms» more  WDAG 2009»
15 years 11 months ago
Distributed Discovery of Large Near-Cliques
Given an undirected graph and 0 ≤ ≤ 1, a set of nodes is called -near clique if all but an fraction of the pairs of nodes in the set have a link between them. In this paper we...
Zvika Brakerski, Boaz Patt-Shamir
INFOCOM
2008
IEEE
15 years 10 months ago
Robust Distributed Spectrum Sensing in Cognitive Radio Networks
Abstract—Distributed spectrum sensing (DSS) enables a Cognitive Radio (CR) network to reliably detect licensed users and avoid causing interference to licensed communications. Th...
Ruiliang Chen, Jung Min Park, Kaigui Bian
GLOBECOM
2006
IEEE
15 years 10 months ago
Performance Analysis of Distributed Source Coding and Packet Aggregation in Wireless Sensor Networks
— In this paper, we propose a theoretical setup for evaluation of energy efficiency of wireless sensor networks (WSNs) with distributed source coding (DSC) algorithms and packet...
L. Di Paolo, Carlo Fischione, Carlo Graziosi, Fort...
GECCO
2005
Springer
154views Optimization» more  GECCO 2005»
15 years 9 months ago
Genetic drift in univariate marginal distribution algorithm
Like Darwinian-type genetic algorithms, there also exists genetic drift in Univariate Marginal Distribution Algorithm (UMDA). Since the universal analysis of genetic drift in UMDA...
Yi Hong, Qingsheng Ren, Jin Zeng