1677 search results - page 179 / 336 » On the Completeness of Quantum Computation Models |
142
click to vote
SPDP
1991
IEEE
15 years 10 months ago
1991
IEEE
In this paper, we present a randomized algorithm for the multipacket (i.e., k − k) routing problem on an n × n mesh. The algorithm completes with high probability in at the mos...
188
click to vote
UAI
2000
15 years 7 months ago
2000
In this paper we present decomposable priors, a family of priors over structure and parameters of tree belief nets for which Bayesian learning with complete observations is tracta...
217
click to vote
WSC
1997
15 years 7 months ago
1997
This tutorial introduces the MODSIM III language, showing how its simulation "world view" together with its object-oriented architecture and built in graphics contribute...
191
click to vote
EGH
2009
Springer
15 years 4 months ago
2009
Springer
We present a strategy for performing view-adaptive, crack-free tessellation of Catmull-Clark subdivision surfaces entirely on programmable graphics hardware. Our scheme extends th...
207
click to vote
STACS
2012
Springer
14 years 2 months ago
2012
Springer
Queueing networks are gaining attraction for the performance analysis of parallel computer systems. A Jackson network is a set of interconnected servers, where the completion of a...