Sciweavers

4103 search results - page 102 / 821
» Some results on the Collatz problem
Sort
View
CIE
2007
Springer
15 years 8 months ago
Finding Most Likely Solutions
Abstract. As one simple type of statistical inference problems we consider Most Likely Solution problem, a task of finding a most likely solution (MLS in short) for a given proble...
Osamu Watanabe, Mikael Onsjö
AC
1998
Springer
15 years 6 months ago
The State of Cryptographic Hash Functions
This paper describes the state of the art for cryptographic hash functions. Different definitions are compared, and the few theoretical results on hash functions are discussed. A...
Bart Preneel
DM
1998
56views more  DM 1998»
15 years 6 months ago
Factoring cardinal product graphs in polynomial time
In this paper a polynomial algorithm for the prime factorization of finite, connected nonbipartite graphs with respect to the cardinal product is presented. This algorithm also d...
Wilfried Imrich
BSL
2010
15 years 3 months ago
Almost disjoint families and diagonalizations of length continuum
Abstract. We present a survey of some results and problems concerning constructions which require a diagonalization of length continuum to be carried out, particularly construction...
Dilip Raghavan
CORR
2010
Springer
119views Education» more  CORR 2010»
15 years 3 months ago
Using Information Theory to Study the Efficiency and Capacity of Computers and Similar Devices
We address the problems of estimating the computer efficiency and the computer capacity. We define the computer efficiency and capacity and suggest a method for their estimation, ...
Boris Ryabko