1617 search results - page 228 / 324 » Using Gaussian Processes to Optimize Expensive Functions |
129
click to vote
DAGSTUHL
2007
15 years 2 months ago
2007
Abstract. In this paper, we consider two particular problems of directed graph matching. The first problem concerns graphs with nodes that have been subdivided into classes of di...
108
click to vote
SIGGRAPH
2010
ACM
15 years 5 months ago
2010
ACM
We propose a technique that takes a triangulated surface as input and outputs a surface with the same topology but altered geometry such that each polygon falls into a set of disc...
116
Voted
SODA
2008
ACM
15 years 2 months ago
2008
ACM
Local ratio is a well-known paradigm for designing approximation algorithms for combinatorial optimization problems. At a very high level, a local-ratio algorithm first decomposes ...
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Iterative algorithms aimed at solving some problems are discussed. For certain problems, such as finding a common point in the intersection of a finite number of convex sets, there...
128
click to vote
ICA
2010
Springer
15 years 2 months ago
2010
Springer
We study a sparse coding learning algorithm that allows for a simultaneous learning of the data sparseness and the basis functions. The algorithm is derived based on a generative m...