542 search results - page 17 / 109 » The Denjoy alternative for computable functions |
135
click to vote
ICIP
2007
IEEE
16 years 7 months ago
2007
IEEE
Finding the sparsest approximation of an image as a sum of basis functions drawn from a redundant dictionary is an NPhard problem. In the case of a dictionary whose elements form ...
190
click to vote
CRYPTO
2007
Springer
16 years 9 days ago
2007
Springer
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
147
click to vote
FOCS
2008
IEEE
16 years 18 days ago
2008
IEEE
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...
282
click to vote
ICDE
2006
IEEE
16 years 7 months ago
2006
IEEE
Given a set of multi-dimensional points, the skyline contains the best points according to any preference function that is monotone on all axes. In practice, applications that req...
158
click to vote
IEEECGIV
2009
IEEE
16 years 24 days ago
2009
IEEE
—There are several methods used for plotting curves in CAGD, e.g., by directly computing their basis functions (polynomials) or using their recursive algorithms. For the former m...