Sciweavers

133 search results - page 15 / 27
» Online Kernel Selection: Algorithms and Evaluations
Sort
View
SIGMOD
2011
ACM
219views Database» more  SIGMOD 2011»
12 years 10 months ago
Context-sensitive ranking for document retrieval
We study the problem of context-sensitive ranking for document retrieval, where a context is defined as a sub-collection of documents, and is specified by queries provided by do...
Liang Jeff Chen, Yannis Papakonstantinou
RECSYS
2009
ACM
14 years 5 days ago
Matching information content with music
This work addresses a particular kind of cross domain personalization task consisting of selecting simultaneously two items in two different domains and recommending them togethe...
Marius Kaminskas
JMLR
2010
162views more  JMLR 2010»
13 years 2 months ago
A Surrogate Modeling and Adaptive Sampling Toolbox for Computer Based Design
An exceedingly large number of scientific and engineering fields are confronted with the need for computer simulations to study complex, real world phenomena or solve challenging ...
Dirk Gorissen, Ivo Couckuyt, Piet Demeester, Tom D...
APPROX
2005
Springer
103views Algorithms» more  APPROX 2005»
14 years 1 months ago
Where's the Winner? Max-Finding and Sorting with Metric Costs
Traditionally, a fundamental assumption in evaluating the performance of algorithms for sorting and selection has been that comparing any two elements costs one unit (of time, work...
Anupam Gupta, Amit Kumar
CORR
2010
Springer
152views Education» more  CORR 2010»
13 years 7 months ago
Neuroevolutionary optimization
Temporal difference methods are theoretically grounded and empirically effective methods for addressing reinforcement learning problems. In most real-world reinforcement learning ...
Eva Volná