Sciweavers

2957 search results - page 220 / 592
» The Complexity of Polynomial-Time Approximation
Sort
View
LCTRTS
2000
Springer
15 years 10 months ago
Approximation of Worst-Case Execution Time for Preemptive Multitasking Systems
The control system of many complex mechatronic products requires for each task the Worst Case Execution Time (WCET), which is needed for the scheduler's admission tests and su...
Matteo Corti, Roberto Brega, Thomas R. Gross
CGF
2008
98views more  CGF 2008»
15 years 6 months ago
Surface Reconstruction from Unorganized Point Data with Quadrics
We present a reverse engineering method for constructing a surface approximation scheme whose input is a set of unorganized noisy points in space and whose output is a set of quad...
Marek Vanco, Bernd Hamann, Guido Brunnett
ESA
2001
Springer
145views Algorithms» more  ESA 2001»
15 years 11 months ago
Grouping Techniques for Scheduling Problems: Simpler and Faster
In this paper we describe a general grouping technique to devise faster and simpler approximation schemes for several scheduling problems. We illustrate the technique on two diff...
Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastroli...
ICIP
2007
IEEE
16 years 27 days ago
Complexity Control for Real-Time Video Coding
A methodology for complexity scalable video encoding and complexity control within the framework of the H.264/AVC video encoder is presented. To yield good rate-distortion perform...
Emrah Akyol, Debargha Mukherjee, Yuxin Liu
ICANN
2009
Springer
16 years 1 months ago
Modelling Image Complexity by Independent Component Analysis, with Application to Content-Based Image Retrieval
Abstract. Estimating the degree of similarity between images is a challenging task as the similarity always depends on the context. Because of this context dependency, it seems qui...
Jukka Perkiö, Aapo Hyvärinen