Sciweavers

18306 search results - page 121 / 3662
» Algorithmics in Exponential Time
Sort
View
ESOP
1999
Springer
15 years 2 months ago
Dynamic Programming via Static Incrementalization
Abstract. Dynamicprogramming is an importantalgorithm design technique. It is used for solving problems whose solutions involve recursively solving subproblems that share subsubpro...
Yanhong A. Liu, Scott D. Stoller
CORR
2008
Springer
81views Education» more  CORR 2008»
14 years 10 months ago
The Golden Ratio Encoder
This paper proposes a novel Nyquist-rate analog-to-digital (A/D) conversion algorithm which achieves exponential accuracy in the bit-rate despite using imperfect components. The p...
Ingrid Daubechies, C. Sinan Güntürk, Y. ...
IPPS
1997
IEEE
15 years 2 months ago
Time-Stamping Algorithms for Parallelization of Loops at Run-Time
In this paper, we present two new run-time algorithms for the parallelization of loops that have indirect access patterns. The algorithms can handle any type of loop-carried depen...
Cheng-Zhong Xu, Vipin Chaudhary
JUCS
2010
124views more  JUCS 2010»
14 years 8 months ago
Performance Optimizations for DAA Signatures on Java enabled Platforms
: With the spreading of embedded and mobile devices, public-key cryptography has become an important feature for securing communication and protecting personal data. However, the c...
Kurt Dietrich, Franz Röck
CPM
2009
Springer
189views Combinatorics» more  CPM 2009»
15 years 4 months ago
Average-Case Analysis of Perfect Sorting by Reversals
A sequence of reversals that takes a signed permutation to the identity is perfect if it preserves all common intervals between the permutation and the identity. The problem of com...
Mathilde Bouvel, Cedric Chauve, Marni Mishna, Domi...