4616 search results - page 249 / 924 » The Communication Complexity of Correlation |
181
click to vote
IAT
2006
IEEE
16 years 24 days ago
2006
IEEE
In this paper, we propose a novel approach to solving the distributed constraint optimisation problem (DCOP) that guarantees completeness, while having linear communication comple...
194
click to vote
COCO
2004
Springer
16 years 4 days ago
2004
Springer
We study the power of quantum proofs, or more precisely, the power of Quantum MerlinArthur (QMA) protocols, in two well studied models of quantum computation: the black box model ...
160
click to vote
CISST
2003
15 years 8 months ago
2003
This paper addresses computational efficiency issues of a new algebraic method for imagery registration/conflation. An algebraic approach to conflation/registration of images does ...
187
click to vote
VLDB
2002
ACM
15 years 6 months ago
2002
ACM
All existing proposals for querying XML (e.g., XQuery) rely on a pattern-specification language that allows (1) path navigation and branching through the label structure of the XM...
194
click to vote
MOBIHOC
2008
ACM
16 years 6 months ago
2008
ACM
Recent discovery of the mixture (power-law and exponential) behavior of inter-meeting time distribution of mobile nodes presents new challenge to the problem of mobility modeling ...