19320 search results - page 276 / 3864 » On the complexity of computing determinants |
219
click to vote
SIAMCOMP
2010
15 years 5 months ago
2010
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...
131
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
An answer to a query has a well-defined lineage expression (alternatively called how-provenance) that explains how the answer was derived. Recent work has also shown how to comput...
172
click to vote
ICCSA
2007
Springer
16 years 25 days ago
2007
Springer
Ubiquitous multimedia services are emerging to be available at anytime and anywhere using a variety of computing devices. In this paper, we propose a low-complexity unequal loss pr...
143
click to vote
STACS
2007
Springer
16 years 23 days ago
2007
Springer
Abstract. We give a characterization, in terms of computational complexity, of the family Rec1 of the unary picture languages that are tiling recognizable. We introduce quasi-unary...
196
click to vote
SI3D
2003
ACM
15 years 12 months ago
2003
ACM
: We present occlusion-switches for interactive visibility culling in complex 3D environments. An occlusionswitch consists of two GPUs (graphics processing units) and each GPU is u...