29908 search results - page 144 / 5982 » On the Complexity of |
174
click to vote
ICALP
2004
Springer
15 years 12 months 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 ...
182
click to vote
IFIP
2004
Springer
15 years 12 months ago
2004
Springer
In this paper we study the complexity of the model-checking problem for the tree logic introduced as the basis for the query language TQL [Cardelli and Ghelli, 2001]. We define tw...
176
click to vote
IJCNLP
2004
Springer
15 years 12 months 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...
192
click to vote
RT
2004
Springer
15 years 11 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...
170
click to vote
ARITH
2003
IEEE
15 years 11 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...