1383 search results - page 174 / 277 » On the Complexity of the Interlace Polynomial |
148
click to vote
SPIRE
2007
Springer
16 years 16 days ago
2007
Springer
The Longest Common Subsequence (LCS) is a well studied problem, having a wide range of implementations. Its motivation is in comparing strings. It has long been of interest to dev...
159
click to vote
TGC
2007
Springer
16 years 16 days ago
2007
Springer
Many techniques exist for statically computing properties of the evolution of processes expressed in process algebras. Static analysis has shown how to obtain useful results that c...
199
click to vote
CCECE
2006
IEEE
16 years 14 days ago
2006
IEEE
In this paper, we introduce new algorithms for selecting taxon samples from large evolutionary trees, maintaining uniformity and randomness, under certain new constraints on the t...
154
click to vote
GLOBECOM
2006
IEEE
16 years 14 days ago
2006
IEEE
— We consider a ring topology with limited or full switching capability as deployed in high bandwidth metro optical networks and develop a model to estimate the probability of bl...
178
click to vote
VTC
2006
IEEE
16 years 12 days ago
2006
IEEE
Abstract— This paper proposes a maximum likelihood detection (MLD) method for the differential space-time block code (DSTBC) in cooperation with blind linear prediction (BLP) of ...