Sciweavers

13376 search results - page 399 / 2676
» Problem Solving with
Sort
View
ICCS
2004
Springer
15 years 10 months ago
A Jacobi-Davidson Method for Nonlinear Eigenproblems
For the nonlinear eigenvalue problem T(λ)x = 0 we consider a Jacobi–Davidson type iterative projection method. The resulting projected nonlinear eigenvalue problems are solved b...
Heinrich Voss
ASIACRYPT
2001
Springer
15 years 8 months ago
Efficient Zero-Knowledge Authentication Based on a Linear Algebra Problem MinRank
A Zero-knowledge protocol provides provably secure entity authentication based on a hard computational problem. Among many schemes proposed since 1984, the most practical rely on f...
Nicolas Courtois
BMCBI
2006
100views more  BMCBI 2006»
15 years 4 months ago
Towards a better solution to the shortest common supersequence problem: the deposition and reduction algorithm
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...
Kang Ning, Hon Wai Leong
CAI
2010
Springer
15 years 2 months ago
Constrained Longest Common Subsequence Computing Algorithms in Practice
The problem of finding a constrained longest common subsequence (CLCS) for the sequences A and B with respect to the sequence P was introduced recently. Its goal is to find a longe...
Sebastian Deorowicz, J. Obstoj
WAOA
2005
Springer
104views Algorithms» more  WAOA 2005»
15 years 10 months ago
The Online Target Date Assignment Problem
Abstract. Many online problems encountered in real-life involve a twostage decision process: upon arrival of a new request, an irrevocable firststage decision (the assignment of a...
Stefan Heinz, Sven Oliver Krumke, Nicole Megow, J&...