4674 search results - page 133 / 935 » cases 2008 |
142
click to vote
TCOM
2010
15 years 4 months ago
2010
—We consider the three-node Gaussian relay channel where the relay observes a noisy version of the interference present in the source–destination link. We investigate three fun...
126
click to vote
DISOPT
2008
15 years 6 months ago
2008
We follow the work of [7] and study the online bin packing problem, where every item has one of two possible sizes which are known in advance. We focus on the parametric case, whe...
133
click to vote
IVC
2008
15 years 6 months ago
2008
The preservation of topological properties during digitization is a hard problem in 3 and higher dimensions. Only for the very restricted class of r-regular shapes it is known tha...
138
click to vote
IPL
2007
15 years 6 months ago
2007
Culberson and Rudnicki [1] gave an algorithm that reconstructs a degree d restricted tree from its distance matrix. According to their analysis, it runs in time O(dn logd n) for t...
127
click to vote
DM
2000
15 years 5 months ago
2000
We consider the new problem of determining the number of partitions of a number into a fixed number k of squares, and find explicit formulae in the cases k = 2, 3, 4. Classificati...