2957 search results - page 313 / 592 » The Complexity of Polynomial-Time Approximation |
150
Voted
IJNSEC
2006
15 years 6 months ago
2006
This paper contains techniques for enhancing the strength of any cryptographic hash function. For an "ideal", traditional hash function with an m-bit result, the complex...
183
click to vote
KAIS
2006
15 years 6 months ago
2006
Abstract. Data mining in large databases of complex objects from scientific, engineering or multimedia applications is getting more and more important. In many areas, complex dista...
163
click to vote
PAMI
2008
15 years 6 months ago
2008
We consider the problem of learning a ranking function that maximizes a generalization of the Wilcoxon-Mann-Whitney statistic on the training data. Relying on an -accurate approxim...
172
click to vote
ACTA
1998
15 years 6 months ago
1998
We will give a survey on results related to scheduling problems where machines are not continuously available for processing. We will deal with single and multi machine problems an...
172
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We investigate enumerability properties for classes of random reals which permit recursive approximations from below, or left-r.e. reals. In addition to pinpointing the complexity...