1612 search results - page 123 / 323 » Analysing Randomized Distributed Algorithms |
154
click to vote
BMCBI
2005
15 years 4 months ago
2005
Background: Microarray experiments, as well as other genomic analyses, often result in large gene sets containing up to several hundred genes. The biological significance of such ...
123
click to vote
ICC
2007
IEEE
15 years 11 months ago
2007
IEEE
— Optimal bandwidth utilisation together with resilience and recovery from failure are two key drivers for Traffic Engineering (TE) which have been widely addressed by the IP co...
162
click to vote
NETCOOP
2009
Springer
15 years 11 months ago
2009
Springer
Wireless sensor networks are designed to extract data from the deployment environment and combine sensing, data processing and wireless communication to provide useful information ...
154
click to vote
SIGMOD
1998
ACM
15 years 9 months ago
1998
ACM
Clustering, in data mining, is useful for discovering groups and identifying interesting distributions in the underlying data. Traditional clustering algorithms either favor clust...
180
click to vote
ESA
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. This paper addresses strategies for the stable marriage problem. For the Gale-Shapley algorithm with men proposing, a classical theorem states that it is impossible for e...