1209 search results - page 21 / 242 » Approximation by pseudo-linear operators |
82
Voted
LICS
2003
IEEE
15 years 3 months ago
2003
IEEE
This paper reports on and discusses three notions of approximation for Labelled Markov Processes that have been developed last year. The three schemes are improvements over former...
111
click to vote
ECAI
2008
Springer
14 years 12 months ago
2008
Springer
Abstract. Typical ontology matching applications, such as ontology integration, focus on the computation of correspondences holding between the nodes of two graph-like structures, ...
ADCM
2010
14 years 10 months ago
2010
Let Rd be a compact convex set of positive measure. In a recent paper, we established a definiteness theory for cubature formulae of order two on . Here we study extremal propert...
IJFCS
2002
14 years 9 months ago
2002
Vector algorithms allow the computation of an output vector r = r1r2 :::rm given an input vector e = e1e2 :::em in a bounded number of operations, independent of m the length of t...
77
Voted
SODA
1997
ACM
14 years 11 months ago
1997
ACM
Job-shop scheduling is a classical NP-hard problem. Shmoys, Stein, and Wein presented the first polynomial-time approximation algorithm for this problem that has a good (polylogar...