2957 search results - page 204 / 592 » The Complexity of Polynomial-Time Approximation |
186
Voted
GLOBECOM
2008
IEEE
16 years 22 days ago
2008
IEEE
— In this paper, we propose a low-complexity iterative joint channel estimation, detection and decoding technique for doubly selective channels. The key is a segment-by-segment f...
167
click to vote
AAIM
2005
Springer
15 years 12 months ago
2005
Springer
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
163
click to vote
ISVC
2005
Springer
15 years 11 months ago
2005
Springer
The Ambient Intelligence (AmI) paradigm requires a robust interpretation of people actions and behaviour and a way for automatically generating persistent spatial-temporal models o...
142
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
— In recent years, idempotent methods (specifically, max-plus methods) have been developed for solution of nonlinear control problems. It was thought that idempotent linearity o...
136
click to vote
ISAAC
2001
Springer
15 years 10 months ago
2001
Springer
We consider a problem faced by train companies: How can trains be assigned to satisfy scheduled routes in a cost efficient way? Currently, many railway companies create solutions b...