Sciweavers

2520 search results - page 217 / 504
» The complexity of approximating entropy
Sort
View
CORR
2008
Springer
159views Education» more  CORR 2008»
15 years 6 months ago
Stochastic Limit-Average Games are in EXPTIME
The value of a finite-state two-player zero-sum stochastic game with limit-average payoff can be approximated to within in time exponential in a polynomial in the size of the gam...
Krishnendu Chatterjee, Rupak Majumdar, Thomas A. H...
IJNSEC
2006
81views more  IJNSEC 2006»
15 years 6 months ago
Small Size Hashes with Enhanced Security
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...
Lars R. Knudsen
KAIS
2006
110views more  KAIS 2006»
15 years 5 months ago
Multi-step density-based clustering
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...
Stefan Brecheisen, Hans-Peter Kriegel, Martin Pfei...
PAMI
2008
139views more  PAMI 2008»
15 years 5 months ago
A Fast Algorithm for Learning a Ranking Function from Large-Scale Data Sets
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...
Vikas C. Raykar, Ramani Duraiswami, Balaji Krishna...
ACTA
1998
111views more  ACTA 1998»
15 years 5 months ago
Machine Scheduling with Availability Constraints
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...
Eric Sanlaville, Günter Schmidt