2799 search results - page 326 / 560 » computing 1998 |
166
click to vote
FOCS
1998
IEEE
15 years 8 months ago
1998
IEEE
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...
118
click to vote
LCTRTS
2004
Springer
15 years 9 months ago
2004
Springer
— This paper describes our experiences with a simulation environment for electronic textiles. This simulation environment, based upon Ptolemy, enables us to model a diverse range...
106
click to vote
ACL
1998
15 years 5 months ago
1998
Abstract Resource adaptlvity" Because the sets of strucNatural language parsing is conceived to be a procedure of disambiguation, which successively reduces an initially total...
190
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
We consider the model of random trees introduced by Devroye [SIAM J Comput 28, 409– 432, 1998]. The model encompasses many important randomized algorithms and data structures. T...
121
click to vote
CLUSTER
2006
IEEE
15 years 10 months ago
2006
IEEE
The RandomAccess benchmark as defined by the High Performance Computing Challenge (HPCC) tests the speed at which a machine can update the elements of a table spread across globa...