Sciweavers

620 search results - page 64 / 124
» Learning with Temporary Memory
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...
EJC
2010
13 years 3 months ago
Modelling a Query Space Using Associations
We all use our associative memory constantly. Words and concepts form paths that we can follow to find new related concepts; for example, when we think about a car we may associate...
Mika Timonen, Paula Silvonen, Melissa Kasari
ICML
2006
IEEE
14 years 9 months ago
Fast and space efficient string kernels using suffix arrays
String kernels which compare the set of all common substrings between two given strings have recently been proposed by Vishwanathan & Smola (2004). Surprisingly, these kernels...
Choon Hui Teo, S. V. N. Vishwanathan
OSDI
2008
ACM
14 years 8 months ago
Digging for Data Structures
Because writing computer programs is hard, computer programmers are taught to use encapsulation and modularity to hide complexity and reduce the potential for errors. Their progra...
Anthony Cozzie, Frank Stratton, Hui Xue, Samuel T....
JSSPP
2007
Springer
14 years 2 months ago
A Self-optimized Job Scheduler for Heterogeneous Server Clusters
Heterogeneous clusters and grid infrastructures are becoming increasingly popular. In these computing infrastructures, machines have different resources, including memory sizes, d...
Elad Yom-Tov, Yariv Aridor