Sciweavers

6575 search results - page 140 / 1315
» Specializing visualization algorithms
Sort
View
APPROX
2004
Springer
117views Algorithms» more  APPROX 2004»
15 years 11 months ago
The Greedy Algorithm for the Minimum Common String Partition Problem
In the Minimum Common String Partition problem (MCSP) we are given two strings on input, and we wish to partition them into the same collection of substrings, minimizing the numbe...
Marek Chrobak, Petr Kolman, Jiri Sgall
SAT
2004
Springer
131views Hardware» more  SAT 2004»
15 years 11 months ago
A Comparative Study of 2QBF Algorithms
2QBF is the problem of evaluating a Quantified Boolean Formula (QBF) with two levels of quantification. Many practical problems in sequential verification can be formulated as i...
Darsh P. Ranjan, Daijue Tang, Sharad Malik
CC
2003
Springer
126views System Software» more  CC 2003»
15 years 11 months ago
Offset Assignment Showdown: Evaluation of DSP Address Code Optimization Algorithms
Abstract. Offset assignment is a highly effective DSP address code optimization technique that has been implemented in a number of ANSI C compilers. In this paper we concentrate on...
Rainer Leupers
IMA
1999
Springer
129views Cryptology» more  IMA 1999»
15 years 10 months ago
Some Soft-Decision Decoding Algorithms for Reed-Solomon Codes
Abstract. In this paper we introduce three soft-decision decoding algorithms for Reed-Solomon (RS) codes. We compare them in terms of performance over both the AWGN and Rayleigh Fa...
Stephan Wesemeyer, Peter Sweeney, David R. B. Burg...
STACS
1999
Springer
15 years 10 months ago
On Quantum Algorithms for Noncommutative Hidden Subgroups
Quantum algorithms for factoring and finding discrete logarithms have previously been generalized to finding hidden subgroups of finite Abelian groups. This paper explores the ...
Mark Ettinger, Peter Høyer