29908 search results - page 274 / 5982 » On the complexity of communication complexity |
182
click to vote
ICALP
2004
Springer
16 years 1 days ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
176
click to vote
IJCNLP
2004
Springer
16 years 18 hour ago
2004
Springer
The paper discusses two policies for recognizing NEs with complex structures by maximum entropy models. One policy is to develop cascaded MaxEnt models at different levels. The ot...
195
click to vote
RT
2004
Springer
16 years 5 hour 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...
177
click to vote
ARITH
2003
IEEE
15 years 12 months ago
2003
IEEE
Using the self duality of an optimal normal basis (ONB) of type II, we present a bit parallel systolic multiplier over GF(2m ) which has a low hardware complexity and a low latenc...
217
click to vote
TIME
2003
IEEE
15 years 12 months ago
2003
IEEE
We investigate expressivity and complexity of hybrid logics on linear structures. Hybrid logics are an enrichment of modal logics with certain first-order features which are algo...