Sciweavers

1717 search results - page 27 / 344
» On the analysis of the (1 1) memetic algorithm
Sort
View
BMCBI
2010
100views more  BMCBI 2010»
13 years 8 months ago
Trimming of mammalian transcriptional networks using network component analysis
Background: Network Component Analysis (NCA) has been used to deduce the activities of transcription factors (TFs) from gene expression data and the TF-gene binding relationship. ...
Linh M. Tran, Daniel R. Hyduke, James C. Liao
DAGSTUHL
2007
13 years 10 months ago
Exact Elimination of Cycles in Graphs
One of the standard basic steps in drawing hierarchical graphs is to invert some arcs of the given graph to make the graph acyclic. We discuss exact and parameterized algorithms fo...
Daniel Raible, Henning Fernau
SPAA
2009
ACM
14 years 9 months ago
Dynamic external hashing: the limit of buffering
Hash tables are one of the most fundamental data structures in computer science, in both theory and practice. They are especially useful in external memory, where their query perf...
Zhewei Wei, Ke Yi, Qin Zhang
IPL
2006
88views more  IPL 2006»
13 years 8 months ago
On Quickselect, partial sorting and Multiple Quickselect
We present explicit solutions of a class of recurrences related to the Quickselect algorithm. Thus we are immediately able to solve recurrences arising at the partial sorting probl...
Markus Kuba
FAW
2007
Springer
110views Algorithms» more  FAW 2007»
14 years 2 months ago
Maximizing the Number of Independent Labels in the Plane
In this paper, we consider a map labeling problem to maximize the number of independent labels in the plane. We first investigate the point labeling model that each label can be ...
Kuen-Lin Yu, Chung-Shou Liao, Der-Tsai Lee