1888 search results - page 217 / 378 » Proof theory and computational analysis |
194
click to vote
COMPGEOM
2005
ACM
15 years 9 months ago
2005
ACM
We initiate the study of exact geometric algorithms that require limited storage and make only a small number of passes over the input. Fundamental problems such as lowdimensional...
231
click to vote
ACST
2006
15 years 8 months ago
2006
Consider the problem of membership query for a given partially ordered set. We devise a greedy algorithm which can produce near-optimal search strategies. Rigorous analysis has be...
160
click to vote
SYMMETRY
2010
15 years 1 months ago
2010
Abstract: The vertices of regular four-dimensional polytopes are used to generate sets of uniformly distributed three-dimensional rotations, which are provided as tables of Euler a...
185
click to vote
JACM
2000
15 years 7 months ago
2000
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
202
click to vote
COLT
1999
Springer
15 years 11 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...