Sciweavers

3038 search results - page 170 / 608
» High-Speed Function Approximation
Sort
View
DEDS
2010
97views more  DEDS 2010»
15 years 6 months ago
On Regression-Based Stopping Times
We study approaches that fit a linear combination of basis functions to the continuation value function of an optimal stopping problem and then employ a greedy policy based on the...
Benjamin Van Roy
INTERSPEECH
2010
15 years 1 months ago
Asymptotically exact noise-corrupted speech likelihoods
Model compensation techniques for noise-robust speech recognition approximate the corrupted speech distribution. This paper introduces a sampling method that, given speech and noi...
Rogier C. van Dalen, Mark J. F. Gales
AAIM
2007
Springer
188views Algorithms» more  AAIM 2007»
16 years 13 days ago
Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree
Given an undirected graph G = (V, E) and a weight function w : E → Z+ , we consider the problem of orienting all edges in E so that the maximum weighted outdegree among all verti...
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirot...
ILP
2004
Springer
15 years 11 months ago
Learning an Approximation to Inductive Logic Programming Clause Evaluation
One challenge faced by many Inductive Logic Programming (ILP) systems is poor scalability to problems with large search spaces and many examples. Randomized search methods such as ...
Frank DiMaio, Jude W. Shavlik
ATAL
2006
Springer
15 years 10 months ago
False-name-proof combinatorial auction protocol: Groves Mechanism with SubModular Approximation
This paper develops a new combinatorial auction protocol called the Groves Mechanism with SubModular Approximation (GM-SMA). This protocol satisfies the following characteristics:...
Makoto Yokoo, Toshihiro Matsutani, Atsushi Iwasaki