6142 search results - page 863 / 1229 » The Complexity of Partition Functions |
219
Voted
COCO
2005
Springer
16 years 10 days ago
2005
Springer
Consider a two-party quantum communication protocol for computing some function f : {0, 1}n × {0, 1}n → Z. We show that the first message of P can be compressed to O(k) classi...
173
click to vote
IMR
2004
Springer
16 years 5 days ago
2004
Springer
The finite element (FE) mesh sizing has great influence on computational time, memory usage, and accuracy of FE analysis. Based on a systematic in-depth study of the geometric com...
206
click to vote
MIDDLEWARE
2004
Springer
16 years 4 days ago
2004
Springer
Application servers provide many functionalities commonly needed in the development of a complex distributed application. So far, the functionalities have mostly been developed an...
192
click to vote
SPW
2004
Springer
16 years 4 days ago
2004
Springer
Abstract Fabio Massacci1 and Nicola Zannone1 Department of Information and Communication Technology University of Trento - Italy {massacci,zannone} at dit.unitn.it The last years h...
225
click to vote
UPP
2004
Springer
16 years 4 days ago
2004
Springer
Abstract. Achieving real-time response to complex, ambiguous, highbandwidth data is impractical with conventional programming. Only the narrow class of compressible input-output ma...