5138 search results - page 382 / 1028 » Randomized Algorithms for 3-SAT |
157
click to vote
SOFSEM
2001
Springer
15 years 11 months ago
2001
Springer
Knowledge discovery, that is, to analyze a given massive data set and derive or discover some knowledge from it, has been becoming a quite important subject in several fields incl...
171
click to vote
EUROPAR
1997
Springer
15 years 11 months ago
1997
Springer
In this paper various algorithms for sorting on processor networks are considered. We focus on meshes, but the results can be generalized easily to other decomposable architecture...
165
click to vote
TSP
2008
15 years 6 months ago
2008
Gossip algorithms for distributed computation are attractive due to their simplicity, distributed nature, and robustness in noisy and uncertain environments. However, using standa...
199
click to vote
FUIN
2010
15 years 1 months ago
2010
Machine learning methods are often used to classify objects described by hundreds of attributes; in many applications of this kind a great fraction of attributes may be totally irr...
202
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...