Sciweavers

4172 search results - page 768 / 835
» Computing Machinery and Understanding
Sort
View
STOC
2009
ACM
96views Algorithms» more  STOC 2009»
15 years 10 months ago
MaxMin allocation via degree lower-bounded arborescences
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...
MohammadHossein Bateni, Moses Charikar, Venkatesan...
CHES
2009
Springer
239views Cryptology» more  CHES 2009»
15 years 10 months ago
Algebraic Side-Channel Attacks on the AES: Why Time also Matters in DPA
Algebraic side-channel attacks have been recently introduced as a powerful cryptanalysis technique against block ciphers. These attacks represent both a target algorithm and its ph...
François-Xavier Standaert, Mathieu Renauld,...
KDD
2004
ACM
211views Data Mining» more  KDD 2004»
15 years 10 months ago
Towards parameter-free data mining
Most data mining algorithms require the setting of many input parameters. Two main dangers of working with parameter-laden algorithms are the following. First, incorrect settings ...
Eamonn J. Keogh, Stefano Lonardi, Chotirat (Ann) R...
KDD
2002
ACM
194views Data Mining» more  KDD 2002»
15 years 10 months ago
Scale Space Exploration For Mining Image Information Content
Images are highly complex multidimensional signals, with rich and complicated information content. For this reason they are difficult to analyze through a unique automated approach...
Mariana Ciucu, Patrick Héas, Mihai Datcu, J...
KDD
2001
ACM
150views Data Mining» more  KDD 2001»
15 years 10 months ago
Empirical bayes screening for multi-item associations
This paper considers the framework of the so-called "market basket problem", in which a database of transactions is mined for the occurrence of unusually frequent item s...
William DuMouchel, Daryl Pregibon