Search results for "Jan Arpe"

Found 18 publication records. Showing 18 according to the selection in the facets

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Jan Arpe, Elchanan Mossel	Application of a Generalization of Russo's Formula to Learning from Multiple Random Oracles.	Combinatorics, Probability & Computing	2010	DBLP DOI BibTeX RDF
1	Jan Arpe, Bodo Manthey	Approximability of Minimum AND-Circuits.	Algorithmica	2009	DBLP DOI BibTeX RDF	Approximation algorithms, Circuit design, Inapproximability
1	Jan Arpe, Elchanan Mossel	Agnostically Learning Juntas from Random Walks	CoRR	2008	DBLP BibTeX RDF
1	Jan Arpe, Elchanan Mossel	Multiple Random Oracles Are Better Than One	CoRR	2008	DBLP BibTeX RDF
1	Jan Arpe, Rüdiger Reischuk	Learning juntas in the presence of noise.	Theor. Comput. Sci.	2007	DBLP DOI BibTeX RDF
1	Jan Arpe, Rüdiger Reischuk	When Does Greedy Learning of Relevant Attributes Succeed?	COCOON	2007	DBLP DOI BibTeX RDF
1	Jan Arpe	Learning concepts with few unknown relevant attributes from noisy data.		2006	RDF
1	Jan Arpe, Rüdiger Reischuk	When Does Greedy Learning of Relevant Features Succeed? --- A Fourier-based Characterization ---.	Electronic Colloquium on Computational Complexity (ECCC)	2006	DBLP BibTeX RDF
1	Jan Arpe, Bodo Manthey	Approximability of Minimum AND-Circuits.	Electronic Colloquium on Computational Complexity (ECCC)	2006	DBLP BibTeX RDF
1	Jan Arpe, Rüdiger Reischuk	Learning Juntas in the Presence of Noise.	TAMC	2006	DBLP DOI BibTeX RDF
1	Jan Arpe, Bodo Manthey	Approximability of Minimum AND-Circuits.	Complexity of Boolean Functions	2006	DBLP BibTeX RDF
1	Jan Arpe, Bodo Manthey	Approximability of Minimum AND-Circuits.	SWAT	2006	DBLP DOI BibTeX RDF
1	Jan Arpe, Rüdiger Reischuk	On the Complexity of Optimal Grammar-Based Compression.	DCC	2006	DBLP DOI BibTeX RDF
1	Jan Arpe	Learning Juntas in the Presence of Noise	Electronic Colloquium on Computational Complexity (ECCC)	2005	DBLP BibTeX RDF
1	Jan Arpe, Andreas Jakoby, Maciej Liskiewicz	One-way communication complexity of symmetric Boolean functions.	ITA	2005	DBLP DOI BibTeX RDF
1	Jan Arpe, Andreas Jakoby, Maciej Liskiewicz	One-Way Communication Complexity of Symmetric Boolean Functions	Electronic Colloquium on Computational Complexity (ECCC)	2003	DBLP BibTeX RDF
1	Jan Arpe, Andreas Jakoby, Maciej Liskiewicz	One-Way Communication Complexity of Symmetric Boolean Functions.	FCT	2003	DBLP DOI BibTeX RDF
1	Jan Arpe, Rüdiger Reischuk	Robust Inference of Relevant Attributes.	ALT	2003	DBLP DOI BibTeX RDF

Publications of "Jan Arpe" ( http://dblp.L3S.de/Authors/Jan_Arpe )