Sciweavers

2312 search results - page 190 / 463
» The complexity of estimating min-entropy
Sort
View
ICMCS
2007
IEEE
188views Multimedia» more  ICMCS 2007»
16 years 27 days ago
A Fast Approach for Natural Image Matting using Structure Information
Natural image matting plays an important role in image and video editing. It has been addressed hotly because it is inherently an under-constrained problem – we must estimate bo...
Qianhui Ning, Weiqiang Wang, Caifeng Zhu, Laiyun Q...
GECCO
2009
Springer
159views Optimization» more  GECCO 2009»
15 years 11 months ago
Bayesian network structure learning using cooperative coevolution
We propose a cooperative-coevolution – Parisian trend – algorithm, IMPEA (Independence Model based Parisian EA), to the problem of Bayesian networks structure estimation. It i...
Olivier Barrière, Evelyne Lutton, Pierre-He...
COLT
2000
Springer
15 years 10 months ago
The Role of Critical Sets in Vapnik-Chervonenkis Theory
In the present paper, we present the theoretical basis, as well as an empirical validation, of a protocol designed to obtain effective VC dimension estimations in the case of a si...
Nicolas Vayatis
ECRTS
2005
IEEE
16 years 6 days ago
A WCET-Oriented Static Branch Prediction Scheme for Real Time Systems
Branch prediction mechanisms are becoming commonplace within current generation processors. Dynamic branch predictors, albeit able to predict branches quite accurately in average,...
François Bodin, Isabelle Puaut
TSP
2008
113views more  TSP 2008»
15 years 6 months ago
Avoiding Divergence in the Shalvi-Weinstein Algorithm
The most popular algorithms for blind equalization are the constant-modulus algorithm (CMA) and the ShalviWeinstein algorithm (SWA). It is well-known that SWA presents a higher co...
Maria D. Miranda, Magno T. M. Silva, Victor H. Nas...