Sciweavers

71 search results - page 11 / 15
» see 2011
Sort
View
AML
2011
204views Mathematics» more  AML 2011»
13 years 4 months ago
A note on propositional proof complexity of some Ramsey-type statements
Any valid Ramsey statement n −→ (k)2 2 can be encoded into a DNF formula RAM(n, k) of size O(nk) and with terms of size k 2 . Let rk be the minimal n for which the statement h...
Jan Krajícek
BMCBI
2011
13 years 4 months ago
A novel approach to the clustering of microarray data via nonparametric density estimation
Background: Cluster analysis is a crucial tool in several biological and medical studies dealing with microarray data. Such studies pose challenging statistical problems due to di...
Riccardo De Bin, Davide Risso
BSL
2011
13 years 4 months ago
Combinatorial dichotomies in set theory
show that an abstract analysis of one of these three set theoretic principles can sometimes lead us to results that do not require additional axioms at all but which could have bee...
Stevo Todorcevic
GC
2011
Springer
13 years 4 months ago
Properly Edge-Coloured Subgraphs in Colourings of Bounded Degree
The smallest n such that every colouring of the edges of Kn must contain a monochromatic star K1,s+1 or a properly edge-coloured Kt is denoted by f(s, t). Its existence is guarant...
Klas Markström, Andrew Thomason, Peter Wagner...
WWW
2011
ACM
13 years 4 months ago
Parallel boosted regression trees for web search ranking
Gradient Boosted Regression Trees (GBRT) are the current state-of-the-art learning paradigm for machine learned websearch ranking — a domain notorious for very large data sets. ...
Stephen Tyree, Kilian Q. Weinberger, Kunal Agrawal...