15073 search results - page 2648 / 3015 » Probabilistic algorithms for computing resultants |
155
click to vote
ALT
1995
Springer
15 years 8 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...
121
click to vote
APPROX
2008
Springer
15 years 6 months ago
2008
Springer
Let C be a class of probability distributions over a finite set . A function D : {0, 1}m is a disperser for C with entropy threshold k and error if for any distribution X in C s...
149
click to vote
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
We consider a multiagent resource allocation domain where the marginal production of each resource is diminishing. A set of identical, self-interested agents requires access to sh...
138
click to vote
APPROX
2010
Springer
15 years 6 months ago
2010
Springer
We initiate the study of multi-source extractors in the quantum world. In this setting, our goal is to extract random bits from two independent weak random sources, on which two q...
146
click to vote
RSS
2007
15 years 6 months ago
2007
— While robot mapping has seen massive strides , higher level abstractions in map representation are still not widespread. Maps containing semantic concepts such as objects and l...