Sciweavers

5153 search results - page 371 / 1031
» Introduction to Randomized Algorithms
Sort
View
ACMSE
2005
ACM
15 years 10 months ago
Bibliometric approach to community discovery
Recent research suggests that most of the real-world random networks organize themselves into communities. Communities are formed by subsets of nodes in a graph, which are closely...
Narsingh Deo, Hemant Balakrishnan
SOFSEM
2001
Springer
15 years 9 months ago
How Can Computer Science Contribute to Knowledge Discovery?
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...
Osamu Watanabe
EUROPAR
1997
Springer
15 years 8 months ago
Sample Sort on Meshes
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...
Jop F. Sibeyn
TSP
2008
100views more  TSP 2008»
15 years 4 months ago
Geographic Gossip: Efficient Averaging for Sensor Networks
Gossip algorithms for distributed computation are attractive due to their simplicity, distributed nature, and robustness in noisy and uncertain environments. However, using standa...
Alexandros G. Dimakis, Anand D. Sarwate, Martin J....
FUIN
2010
268views more  FUIN 2010»
14 years 11 months ago
Boruta - A System for Feature Selection
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...
Miron B. Kursa, Aleksander Jankowski, Witold R. Ru...