Sciweavers

291 search results - page 14 / 59
» On Generalizing Pawlak Approximation Operators
Sort
View
ISLPED
2007
ACM
123views Hardware» more  ISLPED 2007»
13 years 10 months ago
Approximation algorithms for power minimization of earliest deadline first and rate monotonic schedules
We address power minimization of earliest deadline first and ratemonotonic schedules by voltage and frequency scaling. We prove that the problems are NP-hard, and present (1+ ) f...
Sushu Zhang, Karam S. Chatha, Goran Konjevod
CVPR
2010
IEEE
13 years 6 months ago
Efficient computation of robust low-rank matrix approximations in the presence of missing data using the L1 norm
The calculation of a low-rank approximation of a matrix is a fundamental operation in many computer vision applications. The workhorse of this class of problems has long been the ...
Anders Eriksson, Anton van den Hengel
ICRA
2007
IEEE
155views Robotics» more  ICRA 2007»
14 years 2 months ago
Swept Volume approximation of polygon soups
— We present a fast GPU-based algorithm to approximate the Swept Volume (SV) boundary of arbitrary polygon soup models. Despite the extensive research on calculating the volume s...
Jesse C. Himmelstein, Etienne Ferre, Jean-Paul Lau...
MICCAI
1999
Springer
14 years 25 days ago
Quantitative Comparison of Sinc-Approximating Kernels for Medical Image Interpolation
Interpolation is required in many medical image processing operations. From sampling theory, it follows that the ideal interpolation kernel is the sinc function, which is of infin...
Erik H. W. Meijering, Wiro J. Niessen, Josien P. W...
SIGMOD
2007
ACM
192views Database» more  SIGMOD 2007»
14 years 8 months ago
Benchmarking declarative approximate selection predicates
Declarative data quality has been an active research topic. The fundamental principle behind a declarative approach to data quality is the use of declarative statements to realize...
Amit Chandel, Oktie Hassanzadeh, Nick Koudas, Moha...