4103 search results - page 148 / 821 » Some results on the Collatz problem |
185
click to vote
MST
2010
15 years 5 months ago
2010
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...
197
click to vote
DSS
2002
15 years 6 months ago
2002
Recent research has sought to develop formal languages for business communication as more expressive, flexible and powerful alternatives to current electronic data interchange (ED...
177
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We investigate the problem of secure communication over parallel relay channel in the presence of a passive eavesdropper. We consider a four terminal relay-eavesdropper channel wh...
138
click to vote
SIAMJO
2008
15 years 6 months ago
2008
We give some new regularity conditions for Fenchel duality in separated locally convex vector spaces, written in terms of the notion of quasi interior and quasi-relative interior, ...
174
click to vote
VTC
2008
IEEE
16 years 1 months ago
2008
IEEE
— We consider a resource allocation problem for spectrum sharing in cognitive radio networks. Specifically, we investigate the joint subchannel, rate and power allocation for se...