7106 search results - page 404 / 1422 » Restricted Complexity, General Complexity |
186
click to vote
WIOPT
2010
IEEE
15 years 5 months ago
2010
IEEE
—It has been shown that the well-known cutset bounds can be achieved for deterministic wireless networks by performing random coding at each intermediate node. The complexity and...
183
click to vote
INLG
2010
Springer
15 years 4 months ago
2010
Springer
In this paper, we propose a general way of constructing an NLG system that permits the systematic exploration of the effects of particular system choices on output quality. We cal...
225
click to vote
LPAR
2010
Springer
15 years 4 months ago
2010
Springer
Data trees and data words have been studied extensively in connection with XML reasoning. These are trees or words that, in addition to labels from a finite alphabet, carry labels ...
191
click to vote
CC
2010
Springer
15 years 4 months ago
2010
Springer
We describe a randomized algorithm that, given an integer a, produces a certificate that the integer is not a pure power of an integer in expected (log a)1+o(1) bit operations unde...
194
click to vote
CGA
2010
15 years 3 months ago
2010
Developing visualization applications is non-trivial and poses special challenges. This is due to the fact that typical visualization software processes a large amount of data res...