Sciweavers

400 search results - page 78 / 80
» An Algorithm for the Reduction of Linear DAE
Sort
View
WWW
2011
ACM
13 years 3 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...
COCO
2011
Springer
217views Algorithms» more  COCO 2011»
12 years 8 months ago
Noisy Interpolation of Sparse Polynomials, and Applications
Let f ∈ Fq[x] be a polynomial of degree d ≤ q/2. It is well-known that f can be uniquely recovered from its values at some 2d points even after some small fraction of the valu...
Shubhangi Saraf, Sergey Yekhanin
STOC
2009
ACM
150views Algorithms» more  STOC 2009»
14 years 9 months ago
Integrality gaps for Sherali-Adams relaxations
We prove strong lower bounds on integrality gaps of Sherali?Adams relaxations for MAX CUT, Vertex Cover, Sparsest Cut and other problems. Our constructions show gaps for Sherali?A...
Moses Charikar, Konstantin Makarychev, Yury Makary...
PR
2006
101views more  PR 2006»
13 years 8 months ago
Efficient Legendre moment computation for grey level images
9 Legendre orthogonal moments have been widely used in the field of image analysis. Because their computation by a direct method is very time expensive, recent efforts have been d...
G. Y. Yang, Huazhong Shu, Christine Toumoulin, Guo...
KDD
2006
ACM
113views Data Mining» more  KDD 2006»
14 years 9 months ago
A new multi-view regression approach with an application to customer wallet estimation
Motivated by the problem of customer wallet estimation, we propose a new setting for multi-view regression, where we learn a completely unobserved target (in our case, customer wa...
Srujana Merugu, Saharon Rosset, Claudia Perlich