7924 search results - page 396 / 1585 » Non-Malleable Functions and Their Applications |
188
click to vote
CORR
2002
Springer
15 years 7 months ago
2002
Springer
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
224
click to vote
INFORMATICALT
2000
15 years 7 months ago
2000
Abstract. In this paper we suggest a three-language (3L) paradigm for building the program generator models. The basis of the paradigm is a relationship model of the specification,...
246
click to vote
SIAMCOMP
1998
15 years 7 months ago
1998
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
185
click to vote
TC
1998
15 years 7 months ago
1998
—Many modern Field Programmable Logic Arrays (FPGAs) use lookup table (LUT) logic blocks which can be programmed to realize any function of a fixed number of inputs. It is possib...
233
click to vote
TCSV
2002
15 years 7 months ago
2002
Abstract--The emerging video coding standard MPEG-4 enables various content-based functionalities for multimedia applications. To support such functionalities, as well as to improv...