Sciweavers

2142 search results - page 319 / 429
» Improved Conditional E-Payments
Sort
View
ECCC
2010
91views more  ECCC 2010»
13 years 10 months ago
Limits on the rate of locally testable affine-invariant codes
A linear code is said to be affine-invariant if the coordinates of the code can be viewed as a vector space and the code is invariant under an affine transformation of the coordin...
Eli Ben-Sasson, Madhu Sudan
DSP
2008
13 years 10 months ago
Extension of higher-order HMC modeling with application to image segmentation
In this work, we propose to improve the neighboring relationship ability of the Hidden Markov Chain (HMC) model, by extending the memory lengthes of both the Markov chain process ...
Lamia Benyoussef, Cyril Carincotte, Stéphan...
AI
2006
Springer
13 years 10 months ago
Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
This article presents and analyzes algorithms that systematically generate random Bayesian networks of varying difficulty levels, with respect to inference using tree clustering. ...
Ole J. Mengshoel, David C. Wilkins, Dan Roth
AIR
2006
107views more  AIR 2006»
13 years 10 months ago
Just enough learning (of association rules): the TAR2 "Treatment" learner
Abstract. An over-zealous machine learner can automatically generate large, intricate, theories which can be hard to understand. However, such intricate learning is not necessary i...
Tim Menzies, Ying Hu
CORR
2006
Springer
113views Education» more  CORR 2006»
13 years 10 months ago
Towards the Optimal Amplify-and-Forward Cooperative Diversity Scheme
How to find a cooperative diversity scheme that achieves the transmit diversity bound is still an open problem. In fact, all previously proposed amplify-and-forward (AF) and decod...
Sheng Yang, Jean-Claude Belfiore