2168 search results - page 130 / 434 » Randomized Algorithms and Complexity Theory |
142
click to vote
COLT
2003
Springer
15 years 8 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...
110
Voted
ISCI
2008
15 years 3 months ago
2008
This paper considers the theory of database queries on the complex value data model with external functions. Motivated by concerns regarding query evaluation, we first identify re...
136
click to vote
COMPGEOM
2009
ACM
15 years 9 months ago
2009
ACM
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
128
Voted
GRC
2005
IEEE
15 years 9 months ago
2005
IEEE
An incremental target recognition algorithm based on improved discernibility matrix in rough set theory is presented. We compare the new approach with our previous nonincremental a...
178
Voted
STOC
2006
ACM
16 years 3 months ago
2006
ACM
We introduce a new low-distortion embedding of d 2 into O(log n) p (p = 1, 2), called the Fast-Johnson-LindenstraussTransform. The FJLT is faster than standard random projections ...