Sciweavers

3038 search results - page 181 / 608
» High-Speed Function Approximation
Sort
View
ICML
2010
IEEE
15 years 7 months ago
Restricted Boltzmann Machines are Hard to Approximately Evaluate or Simulate
Restricted Boltzmann Machines (RBMs) are a type of probability model over the Boolean cube {-1, 1}n that have recently received much attention. We establish the intractability of ...
Philip M. Long, Rocco A. Servedio
EOR
2008
93views more  EOR 2008»
15 years 6 months ago
Approximate methods for convex minimization problems with series-parallel structure
Consider a problem of minimizing a separable, strictly convex, monotone and differentiable function on a convex polyhedron generated by a system of m linear inequalities. The probl...
Adi Ben-Israel, Genrikh Levin, Yuri Levin, Boris R...
JCO
2007
128views more  JCO 2007»
15 years 6 months ago
Approximation algorithms and hardness results for labeled connectivity problems
Let G = (V, E) be a connected multigraph, whose edges are associated with labels specified by an integer-valued function L : E → N. In addition, each label ℓ ∈ N has a non-...
Refael Hassin, Jérôme Monnot, Danny S...
MST
2010
140views more  MST 2010»
15 years 4 months ago
Approximability of Clausal Constraints
We study a family of problems, called Maximum Solution (Max Sol), where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variab...
Peter Jonsson, Gustav Nordh
ICMLA
2009
15 years 4 months ago
ECON: A Kernel Basis Pursuit Algorithm with Automatic Feature Parameter Tuning, and its Application to Photometric Solids Approx
This paper introduces a new algorithm, namely the EquiCorrelation Network (ECON), to perform supervised classification, and regression. ECON is a kernelized LARS-like algorithm, b...
Manuel Loth, Philippe Preux, Samuel Delepoulle, Ch...