Sciweavers

467 search results - page 72 / 94
» The Complexity of Polynomials and Their Coefficient Function...
Sort
View
COLT
2007
Springer
15 years 6 months ago
A Lower Bound for Agnostically Learning Disjunctions
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose there ...
Adam R. Klivans, Alexander A. Sherstov
ASIACRYPT
2000
Springer
15 years 4 months ago
Construction of Hyperelliptic Curves with CM and Its Application to Cryptosystems
Abstract. Construction of secure hyperelliptic curves is of most important yet most difficult problem in design of cryptosystems based on the discrete logarithm problems on hyperel...
Jinhui Chao, Kazuto Matsuo, Hiroto Kawashiro, Shig...
91
Voted
DAM
2007
100views more  DAM 2007»
14 years 11 months ago
Memory management optimization problems for integrated circuit simulators
In hardware design, it is necessary to simulate the anticipated behavior of the integrated circuit before it is actually cast in silicon. As simulation procedures are long due to ...
Timothée Bossart, Alix Munier Kordon, Franc...
ICIP
1999
IEEE
16 years 1 months ago
Programmable Hardware Implementation for the Median-Rational Hybrid Filters
The Median-Rational Hybrid Filter (MRHF) has been recently introduced [1][2] as a new class of nonlinear filters and successfully applied to image filtering problems. The main cha...
Lazhar Khriji, Giuseppe Bernacchia, Moncef Gabbouj...
RTCSA
2006
IEEE
15 years 5 months ago
Instruction Scheduling with Release Times and Deadlines on ILP Processors
ILP (Instruction Level Parallelism) processors are being increasingly used in embedded systems. In embedded systems, instructions may be subject to timing constraints. An optimisi...
Hui Wu, Joxan Jaffar, Jingling Xue