103 search results - page 6 / 21 » The Arithmetical Complexity of Dimension and Randomness |
178
click to vote
CACM
2010
15 years 6 months ago
2010
Data represented geometrically in high-dimensional vector spaces can be found in many applications. Images and videos, are often represented by assigning a dimension for every pix...
161
click to vote
FOCM
2007
15 years 6 months ago
2007
Abstract. We consider the problem of efficient integration of an n-variate polynomial with respect to the Gaussian measure in Rn and related problems of complex integration and opt...
164
click to vote
ICALP
2007
Springer
16 years 23 days ago
2007
Springer
While data compression and Kolmogorov complexity are both about effective coding of words, the two settings differ in the following respect. A compression algorithm or compressor...
176
click to vote
ITC
2003
IEEE
15 years 12 months ago
2003
IEEE
Functional verification of complex designs largely relies on the use of simulation in conjunction high-level verification languages (HVL) and test-bench automation (TBA) tools. In...
179
click to vote
TCS
1998
15 years 6 months ago
1998
Results on random oracles typically involve showing that a class {X : P(X)} has Lebesgue measure one, i.e., that some property P(X) holds for “almost every X.” A potentially m...