1686 search results - page 174 / 338 » Programs as polygraphs: computability and complexity |
141
click to vote
DCC
2005
IEEE
16 years 3 months ago
2005
IEEE
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
126
click to vote
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
The excessive complexity of both machine architectures and applications have made it difficult for compilers to statically model and predict application behavior. This observatio...
120
click to vote
COCO
2005
Springer
15 years 9 months ago
2005
Springer
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...
136
click to vote
ICALP
1992
Springer
15 years 7 months ago
1992
Springer
Abstract. We investigate the complexity of merging sequences of small integers on the EREW PRAM. Our most surprising result is that two sorted sequences of n bits each can be merge...
142
click to vote
MP
2006
15 years 3 months ago
2006
We present a series of related robust optimization models for placing sensors in municipal water networks to detect contaminants that are maliciously or accidentally injected. We f...