Sciweavers

10447 search results - page 2022 / 2090
» The Philosophy of Computer Science
Sort
View
ATAL
2007
Springer
15 years 7 months ago
Commitment and extortion
Making commitments, e.g., through promises and threats, enables a player to exploit the strengths of his own strategic position as well as the weaknesses of that of his opponents....
Paul Harrenstein, Felix Brandt, Felix A. Fischer
109
Voted
AUSDM
2007
Springer
193views Data Mining» more  AUSDM 2007»
15 years 7 months ago
Are Zero-suppressed Binary Decision Diagrams Good for Mining Frequent Patterns in High Dimensional Datasets?
Mining frequent patterns such as frequent itemsets is a core operation in many important data mining tasks, such as in association rule mining. Mining frequent itemsets in high-di...
Elsa Loekito, James Bailey
115
Voted
CSL
2007
Springer
15 years 7 months ago
From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
Dale Miller, Alexis Saurin
116
Voted
GECCO
2007
Springer
165views Optimization» more  GECCO 2007»
15 years 7 months ago
Peptide detectability following ESI mass spectrometry: prediction using genetic programming
The accurate quantification of proteins is important in several areas of cell biology, biotechnology and medicine. Both relative and absolute quantification of proteins is often d...
David C. Wedge, Simon J. Gaskell, Simon J. Hubbard...
ICALP
2007
Springer
15 years 7 months ago
Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity
d Abstract) Paul Beame1, , Matei David2, , Toniann Pitassi2, , and Philipp Woelfel2,† 1 University of Washington 2 University of Toronto Abstract. We solve some fundamental probl...
Paul Beame, Matei David, Toniann Pitassi, Philipp ...
« Prev « First page 2022 / 2090 Last » Next »