663 search results - page 61 / 133 » Algorithms for Computing Minimal Unsatisfiable Subsets of Co... |
122
click to vote
DCC
2000
IEEE
15 years 6 months 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...
132
click to vote
PDPTA
2004
15 years 3 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...
99
Voted
FPL
2005
Springer
15 years 7 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...
103
Voted
ICASSP
2011
IEEE
14 years 5 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...
138
click to vote
CAD
2008
Springer
15 years 1 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...