8196 search results - page 323 / 1640 » Computational Modeling and Complexity Science |
159
click to vote
FOCS
2003
IEEE
15 years 12 months ago
2003
IEEE
We consider a model of learning Boolean functions from examples generated by a uniform random walk on {0, 1}n . We give a polynomial time algorithm for learning decision trees and...
191
click to vote
MICRO
2010
IEEE
15 years 4 months ago
2010
IEEE
To extend the exponential performance scaling of future chip multiprocessors, improving energy efficiency has become a first-class priority. Single-chip heterogeneous computing ha...
179
click to vote
COMPGEOM
2008
ACM
15 years 8 months ago
2008
ACM
We investigate the complexity of the outer face in arrangements of line segments of a fixed length in the plane, drawn uniformly at random within a square. We derive upper bounds ...
187
click to vote
ICALP
2003
Springer
15 years 12 months ago
2003
Springer
Kolmogorov complexity measures the ammount of information in a string as the size of the shortest program that computes the string. The Kolmogorov structure function divides the s...
145
click to vote
CAGD
2010
15 years 6 months ago
2010
This paper derives strong relations that boundary curves of a smooth complex of patches have to obey when the patches are computed by local averaging. These relations restrict the...