2168 search results - page 205 / 434 » Randomized Algorithms and Complexity Theory |
123
Voted
SIGIR
2002
ACM
15 years 3 months ago
2002
ACM
We present a novel sequential clustering algorithm which is motivated by the Information Bottleneck (IB) method. In contrast to the agglomerative IB algorithm, the new sequential ...
164
Voted
FSTTCS
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
132
Voted
ALDT
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. The stable marriage problem has many practical applications in twosided markets like those that assign doctors to hospitals, students to schools, or buyers to vendors. Mo...
152
Voted
BMCBI
2006
15 years 3 months ago
2006
Background: The development of algorithms to infer the structure of gene regulatory networks based on expression data is an important subject in bioinformatics research. Validatio...
126
Voted
IADIS
2008
15 years 5 months ago
2008
One approach to reduce the complexity of the task in the analysis of large scale genome-wide expression is to group the genes showing similar expression patterns into what are cal...