Sciweavers

371 search results - page 29 / 75
» Partition Theorems and Computability Theory
Sort
View
FOCS
2006
IEEE
15 years 3 months ago
Points on Computable Curves
The “analyst’s traveling salesman theorem” of geometric measure theory characterizes those subsets of Euclidean space that are contained in curves of finite length. This re...
Xiaoyang Gu, Jack H. Lutz, Elvira Mayordomo
MKM
2004
Springer
15 years 3 months ago
Flexible Encoding of Mathematics on the Computer
This paper reports on refinements and extensions to the MathLang framework that add substantial support for natural language text. We show how the extended framework supports mult...
Fairouz Kamareddine, Manuel Maarek, J. B. Wells
ECCC
2006
87views more  ECCC 2006»
14 years 9 months ago
The Learnability of Quantum States
Traditional quantum state tomography requires a number of measurements that grows exponentially with the number of qubits n. But using ideas from computational learning theory, we...
Scott Aaronson
ICNP
2005
IEEE
15 years 3 months ago
On Static and Dynamic Partitioning Behavior of Large-Scale Networks
In this paper, we analyze the problem of network disconnection in the context of large-scale P2P networks and understand how both static and dynamic patterns of node failure affec...
Derek Leonard, Zhongmei Yao, Xiaoming Wang, Dmitri...
SIGGRAPH
1996
ACM
15 years 1 months ago
Consequences of Stratified Sampling in Graphics
Antialiased pixel values are often computed as the mean of N point samples. Using uniformly distributed random samples, the central limit theorem predicts a variance of the mean o...
Don P. Mitchell