3934 search results - page 205 / 787 » Approximate Schedulability Analysis |
159
click to vote
DAGSTUHL
2010
15 years 8 months ago
2010
We present a method for hierarchical data approximation using curved quadratic simplicial elements for domain decomposition. Scientific data defined over two- or three-dimensional ...
183
click to vote
NIPS
1998
15 years 7 months ago
1998
Inference is a key component in learning probabilistic models from partially observable data. When learning temporal models, each of the many inference phases requires a complete ...
162
click to vote
JACM
1998
15 years 6 months ago
1998
Given a collection Ᏺ of subsets of S ϭ {1, . . . , n}, set cover is the problem of selecting as few as possible subsets from Ᏺ such that their union covers S, and max k-cover ...
183
click to vote
PAMI
2012
13 years 9 months ago
2012
—We study the problem of approximating a 3D solid with a union of overlapping spheres. In comparison with a stateof-the-art approach, our method offers more than an order of magn...
178
click to vote
RTAS
2005
IEEE
16 years 2 days ago
2005
IEEE
We present an on-line Dynamic Voltage Scaling (DVS) algorithm for preemptive fixed-priority real-time systems called low power Limited Demand Analysis with Transition overhead (l...