5451 search results - page 163 / 1091 » On very high degrees |
164
click to vote
APAL
2005
15 years 7 months ago
2005
Abstract. We prove that a finitely generated group is context-free whenever its Cayleygraph has a decidable monadic second-order theory. Hence, by the seminal work of Muller and Sc...
149
Voted
APAL
1998
15 years 6 months ago
1998
We investigate the relationship of (jumps of) the degrees of splittings of a computably enumerable set and the degree of the set. We prove that there is a high computably enumerab...
207
Voted
TCOM
2010
15 years 5 months ago
2010
—In a wireless network, the use of cooperation among nodes can significantly improve capacity and robustness to fading. Node cooperation can take many forms, including relaying ...
238
Voted
IPL
2011
15 years 2 months ago
2011
The resource allocation problem is a fundamental problem in Grid and Cloud computing environments. This paper focuses on constructing nondominated (ND) local coteries to solve the...
178
Voted
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
This paper proposes a method to optimize the performance of tandem source–channel coding with respect to the mean-squared error by exploiting the unequal error protection coding...