Sciweavers

20831 search results - page 127 / 4167
» Quantum Computation and Information
Sort
View
CCGRID
2001
IEEE
14 years 17 days ago
Supporting Disconnectedness-Transparent Information Delivery for Mobile and Invisible Computing
As computing devices become ubiquitous and increasingly mobile, it is becoming apparent that the directed peerto-peer communication model has shortcomings for many forms of distri...
Peter Sutton, Rhys Arkins, Bill Segall
ICML
2006
IEEE
14 years 9 months ago
An investigation of computational and informational limits in Gaussian mixture clustering
We investigate under what conditions clustering by learning a mixture of spherical Gaussians is (a) computationally tractable; and (b) statistically possible. We show that using p...
Nathan Srebro, Gregory Shakhnarovich, Sam T. Rowei...
SODA
2004
ACM
128views Algorithms» more  SODA 2004»
13 years 10 months ago
Computing equilibria for congestion games with (im)perfect information
We study algorithmic questions concerning a basic microeconomic congestion game in which there is a single provider that offers a service to a set of potential customers. Each cus...
René Beier, Artur Czumaj, Piotr Krysta, Ber...
RECOMB
2007
Springer
14 years 9 months ago
Improving Inversion Median Computation Using Commuting Reversals and Cycle Information
In the past decade, genome rearrangements have attracted increasing attention from both biologists and computer scientists as a new type of data for phylogenetic analysis. Methods ...
William Arndt, Jijun Tang
CRYPTO
2000
Springer
110views Cryptology» more  CRYPTO 2000»
14 years 1 months ago
Parallel Reducibility for Information-Theoretically Secure Computation
Secure Function Evaluation (SFE) protocols are very hard to design, and reducibility has been recognized as a highly desirable property of SFE protocols. Informally speaking, reduc...
Yevgeniy Dodis, Silvio Micali