3415 search results - page 671 / 683 » Lower bounds on kernelization |
86
Voted
CORR
2007
Springer
14 years 9 months ago
2007
Springer
—Resource allocation is investigated for fading relay channels under separate power constraints at the source and relay nodes. As a basic information-theoretic model for fading r...
80
Voted
CORR
2007
Springer
14 years 9 months ago
2007
Springer
Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs...
118
click to vote
DATAMINE
2007
14 years 9 months ago
2007
Many high level representations of time series have been proposed for data mining, including Fourier transforms, wavelets, eigenwaves, piecewise polynomial models etc. Many researc...
JCB
2006
14 years 9 months ago
2006
Tree structures are useful for describing and analyzing biological objects and processes. Consequently, there is a need to design metrics and algorithms to compare trees. A natura...
JPDC
2008
14 years 9 months ago
2008
This paper presents an algorithm for fast sorting of large lists using modern GPUs. The method achieves high speed by efficiently utilizing the parallelism of the GPU throughout th...