3038 search results - page 288 / 608 » High-Speed Function Approximation |
162
click to vote
DIALM
2008
ACM
15 years 8 months ago
2008
ACM
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
174
click to vote
NIPS
2008
15 years 8 months ago
2008
We present a multi-label multiple kernel learning (MKL) formulation in which the data are embedded into a low-dimensional space directed by the instancelabel correlations encoded ...
159
click to vote
NIPS
2007
15 years 8 months ago
2007
Variational methods are frequently used to approximate or bound the partition or likelihood function of a Markov random field. Methods based on mean field theory are guaranteed ...
153
click to vote
CCCG
2003
15 years 8 months ago
2003
Abstract Steph Durocher∗ and David Kirkpatrick† Department of Computer Science, University of British Columbia Vancouver BC, Canada Given a set of client positions as input, f...
196
click to vote
UAI
2004
15 years 8 months ago
2004
Although many real-world stochastic planning problems are more naturally formulated by hybrid models with both discrete and continuous variables, current state-of-the-art methods ...