288 search results - page 43 / 58 » Notes on computing minimal approximant bases |
161
click to vote
TALG
2010
14 years 11 months ago
2010
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
132
click to vote
IMR
2005
Springer
15 years 10 months ago
2005
Springer
The first stage in an adaptive finite element scheme (cf. [CAS95, bor1]) consists in creating an initial mesh of a given domain Ω, which is used to perform an initial computati...
180
click to vote
SCL
2011
14 years 7 months ago
2011
The fact that the heat equation is controllable to zero in any bounded domain of the euclidean space, any time T > 0 and from any open subset of the boundary is well known. On ...
155
click to vote
EPIA
2007
Springer
15 years 11 months ago
2007
Springer
Recently, the logics of minimal knowledge and negation as failure MKNF [12] was used to introduce hybrid MKNF knowledge bases [14], a powerful formalism for combining open and clos...
161
click to vote
WIOPT
2005
IEEE
15 years 10 months ago
2005
IEEE
We consider the problem of transmission scheduling of data over a wireless fading channel with hard deadline constraints. Our system consists of N users, each with a fixed amount...