10988 search results - page 118 / 2198 » Algorithmic Folding Complexity |
143
Voted
ICA
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Mutual information (MI) is a common criterion in independent component analysis (ICA) optimization. MI is derived from probability density functions (PDF). There are scen...
120
click to vote
SG
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We present a method to generate glyphs which convey complex information in graphical form. A glyph has a linear geometry which is specified using geometric operations, e...
ICRA
1993
IEEE
15 years 6 months ago
1993
IEEE
In this paper we introduce a formalism which combines reliability and complexity as performance measures for Intelligent Machines. For a given desired reliability, di erent algori...
119
Voted
FOCS
1990
IEEE
15 years 6 months ago
1990
IEEE
The exponent of periodicity is an important factor in estimates of complexity of word-unification algorithms. We prove that the exponent of periodicity of a minimal solution of a w...
133
click to vote
PODC
2010
ACM
15 years 6 months ago
2010
ACM
During the analysis of packet log files from network experiments, the question arises which received packet belongs to which of the potentially many binary identical send events....