2957 search results - page 400 / 592 » The Complexity of Polynomial-Time Approximation |
181
click to vote
VTC
2006
IEEE
16 years 14 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 ...
148
click to vote
ISSTA
2006
ACM
16 years 13 days ago
2006
ACM
Web services, service-oriented, and service-discovery architectures help developers solve complex business cases, reduce costs, risks, and time-to-market. The task of developers i...
166
click to vote
SMA
2006
ACM
16 years 13 days ago
2006
ACM
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...
172
click to vote
AIPR
2005
IEEE
16 years 3 days ago
2005
IEEE
In this paper, we analyze the perturbation in the reconstructed optical absorption images, resulting from the discretization of the forward and inverse problems. We show that the ...
160
click to vote
CEC
2005
IEEE
16 years 3 days ago
2005
IEEE
AbstractInteractive evolutionary algorithms (IEA) often suffer from what is called the “user bottleneck.” In this paper, we propose and analyse a method to limit the user inter...