Sciweavers

3038 search results - page 39 / 608
» High-Speed Function Approximation
Sort
View
COCO
1994
Springer
140views Algorithms» more  COCO 1994»
15 years 1 months ago
Random Debaters and the Hardness of Approximating Stochastic Functions
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter ...
ICML
2006
IEEE
15 years 10 months ago
Efficient MAP approximation for dense energy functions
We present an efficient method for maximizing energy functions with first and second order potentials, suitable for MAP labeling estimation problems that arise in undirected graph...
Marius Leordeanu, Martial Hebert
DFG
2007
Springer
15 years 3 months ago
Natural Neighbor Concepts in Scattered Data Interpolation and Discrete Function Approximation
: The concept of natural neighbors employs the notion of distance to define local neighborhoods in discrete data. Especially when querying and accessing large scale data, it is im...
Tom Bobach, Georg Umlauf
POLICY
2005
Springer
15 years 3 months ago
Approximating Service Utility from Policies and Value Function Patterns
Service-oriented computing provides the right means for building flexible systems that allow dynamic configuration and on-the-fly composition. In order to realize this vision, ...
Steffen Lamparter, Daniel Oberle, Andreas Eberhart
MICAI
2004
Springer
15 years 3 months ago
MultiGrid-Based Fuzzy Systems for Function Approximation
In this paper we make use of a modified Grid Based Fuzzy System architecture, which may provide an exponential reduction in the number of rules needed. We also introduce an algori...
Luis Javier Herrera, Héctor Pomares, Ignaci...