Sciweavers

4084 search results - page 10 / 817
» The Method of Quantum Clustering
Sort
View
FOCS
2009
IEEE
15 years 8 months ago
Two-Message Quantum Interactive Proofs Are in PSPACE
We prove that QIP(2), the class of problems having two-message quantum interactive proof systems, is a subset of PSPACE. This relationship is obtained by means of an efficient pa...
Rahul Jain, Sarvagya Upadhyay, John Watrous
STOC
2007
ACM
98views Algorithms» more  STOC 2007»
16 years 1 months ago
Negative weights make adversaries stronger
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
Peter Høyer, Troy Lee, Robert Spalek
CPHYSICS
2007
103views more  CPHYSICS 2007»
15 years 1 months ago
Algorithms for the evolution of electronic properties in nanocrystals
We illustrate recent progress in developing algorithms for solving the Kohn-Sham problem. Key ingredients of our algorithm include pseudopotentials implemented on a real space gri...
James R. Chelikowsky, Murilo L. Tiago, Yousef Saad...
ICPP
2008
IEEE
15 years 7 months ago
Scioto: A Framework for Global-View Task Parallelism
We introduce Scioto, Shared Collections of Task Objects, a lightweight framework for providing task management on distributed memory machines under one-sided and globalview parall...
James Dinan, Sriram Krishnamoorthy, D. Brian Larki...
FLAIRS
2007
15 years 3 months ago
Improving Cluster Method Quality by Validity Indices
Clustering attempts to discover significant groups present in a data set. It is an unsupervised process. It is difficult to define when a clustering result is acceptable. Thus,...
Narjes Hachani, Habib Ounelli