2200 search results - page 205 / 440 » Bloch's Constant is Computable |
197
click to vote
SODA
2000
ACM
15 years 8 months ago
2000
ACM
We present a new general upper bound on the number of examples required to estimate all of the expectations of a set of random variables uniformly well. The quality of the estimat...
142
click to vote
CCCG
2009
15 years 7 months ago
2009
When a graph is drawn in a classical manner, its vertices are shown as small disks and its edges with a positive width; zero-width edges exist only in theory. Let r denote the rad...
158
click to vote
AUTOMATICA
2008
15 years 6 months ago
2008
: For an infinite-horizon optimal control problem, the cost does not, in general, converge. The classical work-around to this problem is to introduce a discount or "forgetting...
153
click to vote
AEI
2006
15 years 6 months ago
2006
This study uses cognitive psychological experiments to elucidate human temporal co-creation with environments or other people. Time series analyses of alternate tapping with const...
180
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Fischer proposes in [4] a sequential algorithm to compute a minimum weight spanning tree of maximum degree at most b + logb n in time O n4+1/ln b for any constant b > 1, where ...