3604 search results - page 120 / 721 » All Common Subsequences |
129
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Symmetry is a common feature of many combinatorial problems. Unfortunately eliminating all symmetry from a problem is often computationally intractable. This paper argues...
127
click to vote
TCC
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We study the necessary and sufficient assumptions for universally composable (UC) computation, both in terms of setup and computational assumptions. We look at the common...
CORR
2011
Springer
14 years 11 months ago
2011
Springer
We consider the extension of the last-in-first-out graph searching game of Giannopoulou and Thilikos to digraphs. We show that all common variations of the game require the same ...
156
click to vote
SIAMCO
2011
14 years 11 months ago
2011
Abstract. We consider switched systems on Banach and Hilbert spaces governed by strongly continuous one-parameter semigroups of linear evolution operators. We provide necessary and...
119
click to vote
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
This paper presents a sparse approach of solving the onesided Procrustes problem with special orthogonal constraint. By leveraging a planar decomposition common to all rotation ma...