Sciweavers

1717 search results - page 89 / 344
» A Computable Spectral Theorem
Sort
View
WISE
2009
Springer
16 years 1 months ago
Spectral Clustering in Social-Tagging Systems
Social tagging is an increasingly popular phenomenon with substantial impact on the way we perceive and understand the Web. For the many Web resources that are not self-descriptive...
Alexandros Nanopoulos, Hans-Henning Gabriel, Myra ...
MFCS
1989
Springer
15 years 8 months ago
Space Bounded Computations: Review And New Separation Results
In this paper we review the key results about space bounded complexity classes, discuss the central open problems and outline the prominent proof techniques. We show that, for a s...
Juris Hartmanis, Desh Ranjan
CORR
2004
Springer
94views Education» more  CORR 2004»
15 years 4 months ago
Quantum Computing, Postselection, and Probabilistic Polynomial-Time
I study the class of problems efficiently solvable by a quantum computer, given the ability to "postselect" on the outcomes of measurements. I prove that this class coin...
Scott Aaronson
COCO
2007
Springer
109views Algorithms» more  COCO 2007»
15 years 10 months ago
Perfect Parallel Repetition Theorem for Quantum XOR Proof Systems
We consider a class of two-prover interactive proof systems where each prover returns a single bit to the verifier and the verifier’s verdict is a function of the XOR of the tw...
Richard Cleve, William Slofstra, Falk Unger, Sarva...
FCT
2005
Springer
15 years 9 months ago
Generic Density and Small Span Theorem
We refine the genericity concept of Ambos-Spies, by assigning a real number in [0, 1] to every generic set, called its generic density. We construct sets of generic density any E...
Philippe Moser