5183 search results - page 56 / 1037 » The Complexity of Distributions |
138
click to vote
COCOON
2008
Springer
15 years 6 months ago
2008
Springer
This paper describes a general quantum lower bounding technique for the communication complexity of a function that depends on the inputs given to two parties connected via paths,...
127
click to vote
ITA
2006
15 years 4 months ago
2006
Abstract. We compare various computational complexity classes defined within the framework of membrane systems, a distributed parallel computing device which is inspired from the f...
159
click to vote
RT
2004
Springer
15 years 9 months ago
2004
Springer
We introduce a tiled 3D MIP map representation of global illumination data. The representation is an adaptive, sparse octree with a “brick” at each octree node; each brick con...
124
click to vote
TSP
2010
14 years 11 months ago
2010
We derive the entropy rate formula for a complex Gaussian random process by using a widely linear model. The resulting expression is general and applicable to both circular and non...
136
click to vote
ESM
2000
15 years 5 months ago
2000
We are located in the context of the simulation of complex industrial systems, which are distributed in geographical, decisional and informational terms. This paper is divided int...