Sciweavers

225 search results - page 15 / 45
» On Adaptive Integer Sorting
Sort
View
CHES
2005
Springer
83views Cryptology» more  CHES 2005»
14 years 2 months ago
Fast Truncated Multiplication for Cryptographic Applications
The Truncated Multiplication computes a truncated product, a contiguous subsequence of the digits of the product of 2 integers. A few truncated polynomial multiplication algorithms...
Laszlo Hars
FCT
2001
Springer
14 years 29 days ago
Best Increments for the Average Case of Shellsort
This paper presents the results of using sequential analysis to find increment sequences that minimize the average running time of Shellsort, for array sizes up to several thousan...
Marcin Ciura
ISCAS
2002
IEEE
114views Hardware» more  ISCAS 2002»
14 years 1 months ago
Lossless, near-lossless and lossy adaptive coding based on the lossless DCT
This report proposes a new coding method, which realizes lossless, near-lossless and lossy coding with a unified single algorithm. The method is based on a lifting-structured loss...
Somchart Chokchaitam, Masahiro Iwahashi
AHS
2007
IEEE
219views Hardware» more  AHS 2007»
14 years 2 months ago
A learning machine for resource-limited adaptive hardware
Machine Learning algorithms allow to create highly adaptable systems, since their functionality only depends on the features of the inputs and the coefficients found during the tr...
Davide Anguita, Alessandro Ghio, Stefano Pischiutt...
IOR
2007
106views more  IOR 2007»
13 years 8 months ago
Planning and Scheduling by Logic-Based Benders Decomposition
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
John N. Hooker