2434 search results - page 332 / 487 » Algorithmic Randomness of Closed Sets |
133
Voted
KDD
2007
ACM
16 years 4 months ago
2007
ACM
Data mining tasks such as supervised classification can often benefit from a large training dataset. However, in many application domains, privacy concerns can hinder the construc...
203
Voted
SIGMOD
2008
ACM
16 years 3 months ago
2008
ACM
Random sampling is an appealing approach to build synopses of large data streams because random samples can be used for a broad spectrum of analytical tasks. Users are often inter...
135
Voted
COCO
2009
Springer
15 years 10 months ago
2009
Springer
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
157
Voted
MIDDLEWARE
2004
Springer
15 years 9 months ago
2004
Springer
In recent years, the gossip-based communication model in large-scale distributed systems has become a general paradigm with important applications which include information dissemi...
115
Voted
JAIR
2000
15 years 3 months ago
2000
The local search algorithm WSat is one of the most successful algorithms for solving the satisfiability (SAT) problem. It is notably effective at solving hard Random 3-SAT instanc...