3096 search results - page 300 / 620 » The Generalized FITC Approximation |
155
click to vote
RECSYS
2009
ACM
16 years 1 months ago
2009
ACM
We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the course ‘Real Ana...
165
click to vote
ESA
2007
Springer
16 years 24 days ago
2007
Springer
In this paper we study several routing problems that generalize shortest paths and the Traveling Salesman Problem. We consider a more general model that incorporates the actual co...
189
click to vote
ECML
2005
Springer
16 years 5 days ago
2005
Springer
Finding a point which minimizes the maximal distortion with respect to a dataset is an important estimation problem that has recently received growing attentions in machine learnin...
206
click to vote
GECCO
2005
Springer
16 years 4 days ago
2005
Springer
Many real-world problems are multi-objective optimization problems and evolutionary algorithms are quite successful on such problems. Since the task is to compute or approximate t...
179
click to vote
SIGECOM
2000
ACM
15 years 11 months ago
2000
ACM
General combinatorial auctions—auctions in which bidders place unrestricted bids for bundles of goods—are the subject of increasing study. Much of this work has focused on alg...