Sciweavers

6142 search results - page 169 / 1229
» The Complexity of Partition Functions
Sort
View
103
Voted
STOC
1992
ACM
91views Algorithms» more  STOC 1992»
15 years 7 months ago
Randomized versus Nondeterministic Communication Complexity
Paul Beame Joan Lawry Department of Computer Science and Engineering, FR-35 University of Washington Seattle, Washington 98195 Our main result is the demonstration of a Boolean fu...
Paul Beame, Joan Lawry
COCO
2009
Springer
121views Algorithms» more  COCO 2009»
15 years 10 months ago
Lower Bounds on Quantum Multiparty Communication Complexity
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
Troy Lee, Gideon Schechtman, Adi Shraibman
ISCAS
2005
IEEE
140views Hardware» more  ISCAS 2005»
15 years 9 months ago
Macroblock-based algorithm for dual-bitstream MPEG video streaming with VCR functionalities
— Reverse playback is the most common video cassette recording (VCR) functions in many digital video players. However, the predictive processing techniques employed in MPEG sever...
Tak-Piu Ip, Yui-Lam Chan, Chang-Hong Fu, Wan-Chi S...
GI
2005
Springer
15 years 9 months ago
Modelling and Execution of Complex Semantic Transactions using WERIGO Metamodel
: Rapid evolution of modern Information Systems and Process-Aware Information Systems (PAIS) in particular requires transactional execution of business logic. The paper introduces ...
Alexander Tarabrin
126
Voted
FOCS
1998
IEEE
15 years 7 months ago
The Quantum Communication Complexity of Sampling
Sampling is an important primitive in probabilistic and quantum algorithms. In the spirit of communication complexity, given a function f : X
Andris Ambainis, Leonard J. Schulman, Amnon Ta-Shm...