2223 search results - page 132 / 445 » Ontological Framework for Approximation |
138
click to vote
CVPR
2004
IEEE
16 years 7 months ago
2004
IEEE
Given a set of patterns and a similarity measure between them, we will present an optimization framework to approximate a small subset, known as a canonical set, whose members clo...
150
click to vote
STACS
2009
Springer
15 years 12 months ago
2009
Springer
We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner tree, low-conn...
130
click to vote
IJCNN
2006
IEEE
15 years 11 months ago
2006
IEEE
— This paper applies a recently developed neural network called plausible neural network (PNN) to function approximation. Instead of using error correction, PNN estimates the mut...
135
click to vote
ESA
2005
Springer
15 years 10 months ago
2005
Springer
The input to the minimum latency set cover problem (MLSC) consists of a set of jobs and a set of tools. Each job j needs a specific subset Sj of the tools in order to be processed...
114
click to vote
VLBV
2005
Springer
15 years 10 months ago
2005
Springer
In this paper we propose a very simple FIR pre-filter based method for near optimal least-squares linear approximation of discrete time signals. A digital pre-processing filter,...