1379 search results - page 172 / 276 » The Complexity of the Annihilating Polynomial |
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 ...
153
click to vote
ACMSE
2006
ACM
16 years 11 days ago
2006
ACM
Although the satisfiability problem (SAT) is NP-complete, state-of-the-art solvers for SAT can solve instances that are considered to be very hard. Emerging applications demand t...
148
click to vote
SAS
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. In his seminal paper [5], Granger presents an analysis which infers linear congruence relations between integer variables. For affine programs without guards, his analys...