128 search results - page 18 / 26 » Applying IC-Scheduling Theory to Familiar Classes of Computa... |
PODS
2000
ACM
13 years 11 months ago
2000
ACM
An estimation algorithm for a query is a probabilistic algorithm that computes an approximation for the size (number of tuples) of the query. One class of estimation algorithms us...
ALT
1995
Springer
13 years 11 months ago
1995
Springer
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
STOC
2010
ACM
14 years 7 days ago
2010
ACM
There has been much progress on geometric set cover problems, but most known techniques only apply to the unweighted setting. For the weighted setting, very few results are known ...
CORR
2011
Springer
13 years 1 months ago
2011
Springer
A fundamental question of longstanding theoretical interest is to prove the lowest exact count of real additions and multiplications required to compute a power-of-two discrete Fo...
CIE
2010
Springer
13 years 11 months ago
2010
Springer
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...