Sciweavers

65 search results - page 13 / 13
» Quantum Entanglement and Communication Complexity
Sort
View
PPOPP
2005
ACM
13 years 10 months ago
Performance modeling and optimization of parallel out-of-core tensor contractions
The Tensor Contraction Engine (TCE) is a domain-specific compiler for implementing complex tensor contraction expressions arising in quantum chemistry applications modeling elect...
Xiaoyang Gao, Swarup Kumar Sahoo, Chi-Chung Lam, J...
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
13 years 10 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
COCO
2008
Springer
146views Algorithms» more  COCO 2008»
13 years 6 months ago
A Direct Product Theorem for Discrepancy
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...
Troy Lee, Adi Shraibman, Robert Spalek
GECCO
2008
Springer
179views Optimization» more  GECCO 2008»
13 years 6 months ago
Emergent architecture in self organized swarm systems for military applications
Many sectors of the military are interested in Self-Organized (SO) systems because of their flexibility, versatility and economics. The military is researching and employing auto...
Dustin J. Nowak, Gary B. Lamont, Gilbert L. Peters...
CN
2010
120views more  CN 2010»
13 years 5 months ago
A survey on bio-inspired networking
The developments in the communication and networking technologies have yielded many existing and envisioned information network architectures such as cognitive radio networks, sen...
Falko Dressler, Özgür B. Akan