1469 search results - page 269 / 294 » Approximate polynomial decomposition |
PERCOM
2010
ACM
14 years 10 months ago
2010
ACM
Abstract—Choosing the right feature for motion based activity spotting is not a trivial task. Often, features derived by intuition or that proved to work well in previous work ar...
109
click to vote
TAMC
2010
Springer
14 years 10 months ago
2010
Springer
Clique-width is an important graph parameter whose computation is NP-hard. In fact we do not know of any other algorithm than brute force for the exact computation of clique-width...
100
click to vote
TCS
2010
14 years 10 months ago
2010
Abstract. We study a general class of non-cooperative games coming from combinatorial covering and facility location problems. A game for k players is based on an integer programmi...
111
click to vote
OPODIS
2010
14 years 9 months ago
2010
The Earliest Deadline First (EDF) scheduling algorithm is known to be suboptimal for meeting all deadlines under global scheduling on multiprocessor platforms. However, EDF is an a...
PIMRC
2010
IEEE
14 years 9 months ago
2010
IEEE
This paper tackles the problem of fast varying channel estimation in LTE systems. Particular attention is given to downlink transmission where OFDMA is used as the multiple access ...