371 search results - page 52 / 75 » Partition Theorems and Computability Theory |
FOCM
2002
14 years 9 months ago
2002
We present an algorithm for computing rigorous solutions to a large class of ordinary differential equations. The main algorithm is based on a partitioning process and the use of i...
COLT
1999
Springer
15 years 1 months ago
1999
Springer
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
APAL
2010
14 years 9 months ago
2010
A well-known polymodal provability logic GLP is complete w.r.t. the arithmetical semantics where modalities correspond to reflection principles of restricted logical complexity in...
IM
2007
14 years 9 months ago
2007
PageRank is a popularity measure designed by Google to rank Web pages. Experiments confirm that PageRank values obey a power law with the same exponent as In-Degree values. This ...
ARITH
2003
IEEE
15 years 3 months ago
2003
IEEE
SRT division, as it was discovered in the late 1950s represented an important improvement in the speed of division algorithms for computers at the time. A variant of SRT division ...