663 search results - page 61 / 133 » Algorithms for Computing Minimal Unsatisfiable Subsets of Co... |
DCC
2000
IEEE
14 years 3 days ago
2000
IEEE
Multiple description codes are data compression algorithms designed with the goal of minimizing the distortion caused by data loss in packet-based or diversity communications syst...
PDPTA
2004
13 years 9 months ago
2004
Random data placement has recently emerged as an alternative to traditional data striping. From a performance perspective, it has been demonstrated to be an efficient and scalable...
FPL
2005
Springer
14 years 1 months ago
2005
Springer
Abstract— Modern advances in reconfigurable analog technologies are allowing field-programmable analog arrays (FPAAs) to dramatically grow in size, flexibility, and usefulness...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
Algorithms based on the minimization of the Total Variation are prevalent in computer vision. They are used in a variety of applications such as image denoising, compressive sensi...
CAD
2008
Springer
13 years 7 months ago
2008
Springer
When designing curves on surfaces the need arises to approximate a given noisy target shape by a smooth fitting shape. We discuss the problem of fitting a B-spline curve to a poin...