2434 search results - page 220 / 487 » Algorithmic Randomness of Closed Sets |
106
click to vote
DAWAK
2006
Springer
15 years 8 months ago
2006
Springer
The main idea of iceberg data cubing methods relies on optimization techniques for computing only the cuboids cells above certain minimum support threshold. Even using such approac...
158
click to vote
COLT
1991
Springer
15 years 7 months ago
1991
Springer
Abstract. This paper presents a polynomial-time algorithm for inferring a probabilistic generalization of the class of read-once Boolean formulas over the usual basis {AND,OR,NOT}....
144
click to vote
CISS
2008
IEEE
15 years 10 months ago
2008
IEEE
—We consider a wireless node that randomly receives data from different sensor units. The arriving data must be compressed, stored, and transmitted over a wireless link, where bo...
166
click to vote
CIAC
1994
Springer
15 years 8 months ago
1994
Springer
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...
146
click to vote
SDM
2010
SIAM
15 years 5 months ago
2010
SIAM
Large graph databases are commonly collected and analyzed in numerous domains. For reasons related to either space efficiency or for privacy protection (e.g., in the case of socia...