2957 search results - page 173 / 592 » The Complexity of Polynomial-Time Approximation |
152
click to vote
FSTTCS
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Given two simplicial complexes C1 and C2 embedded in Euclidean space IRd , C1 subdivides C2 if (i) C1 and C2 have the same underlying space, and (ii) every simplex in C1 ...
163
click to vote
GLOBECOM
2007
IEEE
16 years 14 days ago
2007
IEEE
— A low complexity soft-input soft-output (SISO) block decision feedback equalization (BDFE) algorithm is presented for Turbo equalization. Based on minimum mean square error (MM...
198
Voted
DCC
2011
IEEE
15 years 1 months ago
2011
IEEE
Abstract Many attacks on encryption schemes rely on statistical considerations using plaintext/ciphertext pairs to find some information on the key. We provide here simple formula...
169
click to vote
WADS
2005
Springer
15 years 11 months ago
2005
Springer
Important generalizations of the Vertex Cover problem (Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in terms of...
177
click to vote
ISAAC
2001
Springer
15 years 10 months ago
2001
Springer
A fragmentary pattern is a multiset of non-empty strings, and it matches a string w if all the strings in it occur within w without any overlaps. We study some fundamental issues o...