Sciweavers

1272 search results - page 124 / 255
» Approximate Parameterized Matching
Sort
View
129
Voted
ANTSW
2006
Springer
15 years 7 months ago
Kernelization as Heuristic Structure for the Vertex Cover Problem
Abstract. For solving combinatorial optimisation problems, exact methods accurately exploit the structure of the problem but are tractable only up to a certain size; approximation ...
Stephen Gilmour, Mark Dras
111
Voted
IJIT
2004
15 years 5 months ago
Learning of Class Membership Values by Ellipsoidal Decision Regions
A novel method of learning complex fuzzy decision regions in the n-dimensional feature space is proposed. Through the fuzzy decision regions, a given pattern's class membershi...
Leehter Yao, Chin-chin Lin
133
Voted
NIPS
2004
15 years 5 months ago
Log-concavity Results on Gaussian Process Methods for Supervised and Unsupervised Learning
Log-concavity is an important property in the context of optimization, Laplace approximation, and sampling; Bayesian methods based on Gaussian process priors have become quite pop...
Liam Paninski
124
Voted
TIP
2008
89views more  TIP 2008»
15 years 3 months ago
Snakuscules
Abstract--A snakuscule (a minuscule snake) is the simplest active contour that we were able to design while keeping the quintessence of traditional snakes: an energy term governed ...
Philippe Thévenaz, Michael Unser
ML
2002
ACM
168views Machine Learning» more  ML 2002»
15 years 3 months ago
On Average Versus Discounted Reward Temporal-Difference Learning
We provide an analytical comparison between discounted and average reward temporal-difference (TD) learning with linearly parameterized approximations. We first consider the asympt...
John N. Tsitsiklis, Benjamin Van Roy