Sciweavers

3096 search results - page 227 / 620
» Theory and Use of the EM Algorithm
Sort
View
GBRPR
2005
Springer
16 years 1 days ago
Hypergraph-Based Image Representation
Abstract. An appropriate image representation induces some good image treatment algorithms. Hypergraph theory is a theory of finite combinatorial sets, modeling a lot of problems ...
Alain Bretto, Luc Gillibert
GECCO
2005
Springer
114views Optimization» more  GECCO 2005»
16 years 1 days ago
Exploiting disruption aversion to control code bloat
The authors employ multiple crossovers as a novel natural extension to crossovers as a mixing operator. They use this as a framework to explore the ideas of code growth. Empirical...
Jason Stevens, Robert B. Heckendorn, Terence Soule
JCIT
2007
107views more  JCIT 2007»
15 years 6 months ago
A New Approach to Computing Weighted Attributes Values in Incomplete Information Systems
The Rough Sets theory has been conceived to deal with inexact, uncertain or vague knowledge in Information systems. The article is devoted to propose notions including the general...
Tian Hong, Wang Xiukun, Henryk Rybinski
EUROCRYPT
2012
Springer
13 years 9 months ago
Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
Decoding random linear codes is a well studied problem with many applications in complexity theory and cryptography. The security of almost all coding and LPN/LWE-based schemes rel...
Anja Becker, Antoine Joux, Alexander May, Alexande...
ATAL
2003
Springer
15 years 11 months ago
Risk-averse auction agents
Auctions are an important means for purchasing material in the era of e-commerce. Research on auctions often studies them in isolation. In practice, however, auction agents are pa...
Yaxin Liu, Richard Goodwin, Sven Koenig