359 search results - page 55 / 72 » Solving Geometric Covering Problems by Data Reduction |
JMLR
2012
11 years 10 months ago
2012
Traditional tensor decompositions such as the CANDECOMP / PARAFAC (CP) and Tucker decompositions yield higher-order principal components that have been used to understand tensor d...
WOB
2003
13 years 9 months ago
2003
The maximum subsequence problem finds the contiguous subsequence of n real numbers with the highest sum. This is an important problem that arises in several contexts in Computatio...
FGCS
2007
13 years 7 months ago
2007
Solving the structure prediction problem for complex proteins is difficult and computationally expensive. In this paper, we propose a bicriterion parallel hybrid genetic algorith...
COMCOM
2004
13 years 7 months ago
2004
In multihop wavelength division multiplexing systems, a connection between two communication nodes consists of one or more lightpaths. A wavelength conversion is required at the j...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
—The problem of optimal power allocation among the relays in a two-hop decode-and-forward cooperative relay network with independent Rayleigh fading channels is considered. It is...