4277 search results - page 84 / 856 » On Multiple Linear Approximations |
165
click to vote
MP
2006
15 years 6 months ago
2006
Given an undirected graph G = (V;E) and three speci ed terminal nodes t1;t2;t3, a 3-cut is a subset A of E such that no two terminals are in the same component of GnA. If a non-neg...
142
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
: We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful ...
170
Voted
ICML
2001
IEEE
16 years 6 months ago
2001
IEEE
We introduce the first algorithm for off-policy temporal-difference learning that is stable with linear function approximation. Off-policy learning is of interest because it forms...
139
click to vote
ISMVL
2003
IEEE
15 years 11 months ago
2003
IEEE
Discrete functions are now commonly represented by binary (BDD) and multiple-valued (MDD) decision diagrams. Sifting is an effective heuristic technique which applies adjacent var...
182
click to vote
SGP
2004
15 years 8 months ago
2004
We propose a metric for surface parameterization specialized to its signal that can be used to create more efficient, high-quality texture maps. Derived from Taylor expansion of s...