Sciweavers

10392 search results - page 2011 / 2079
» Introduction to Computer Science
Sort
View
107
Voted
AUSDM
2007
Springer
193views Data Mining» more  AUSDM 2007»
15 years 6 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
112
Voted
CSL
2007
Springer
15 years 6 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
115
Voted
GECCO
2007
Springer
165views Optimization» more  GECCO 2007»
15 years 6 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 6 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 ...
106
Voted
ICALP
2007
Springer
15 years 6 months ago
Model Theory Makes Formulas Large
Gaifman’s locality theorem states that every first-order sentence is equivalent to a local sentence. We show that there is no elementary bound on the length of the local sentenc...
Anuj Dawar, Martin Grohe, Stephan Kreutzer, Nicole...
« Prev « First page 2011 / 2079 Last » Next »