5215 search results - page 35 / 1043 » Quantum clustering algorithms |
82
Voted
ICALP
2004
Springer
15 years 3 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 ...
RTSS
1998
IEEE
15 years 1 months ago
1998
IEEE
We consider the problem of implementing shared objects in uniprocessor and multiprocessor real-time systems in which tasks are executed using a scheduling quantum. In most quantum...
CORR
2000
Springer
14 years 9 months ago
2000
Springer
A polynomial depth quantum circuit affects, by definition, a poly-local unitary transformation of a tensor product state space. It is a reasonable belief [Fe], [L], [FKW] that, at ...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
The continuous-time query model is a variant of the discrete query model in which queries can be interleaved with known operations (called "driving operations") continuo...
IV
2005
IEEE
15 years 3 months ago
2005
IEEE
We have developed a visual syntax for representing concepts that are contingent on temporal properties (timedependent semantics). A within-group (N=24) experiment was conducted to...