15033 search results - page 40 / 3007 » Complexity Theory and Algorithms |
COMPGEOM
2005
ACM
14 years 11 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...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Identification of defective members of large populations has been widely studied in the statistics community under the name of group testing. It involves grouping subsets of items...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
AI
2010
Springer
14 years 10 months ago
2010
Springer
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
COLT
2003
Springer
15 years 3 months ago
2003
Springer
This paper studies sequence prediction based on the monotone Kolmogorov complexity Km=−log m, i.e. based on universal deterministic/one-part MDL. m is extremely close to Solomon...