155 search results - page 20 / 31 » A Comparison Between ACO Algorithms for the Set Covering Pro... |
152
Voted
WEA
2010
Springer
15 years 10 months ago
2010
Springer
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
138
Voted
ALENEX
2009
15 years 4 months ago
2009
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
120
Voted
BMCBI
2008
15 years 3 months ago
2008
Background: Structural alignment is an important step in protein comparison. Well-established methods exist for solving this problem under the assumption that the structures under...
146
Voted
SRDS
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract--Fault localization in enterprise networks is extremely challenging. A recent approach called Sherlock makes some headway into this problem by using an inference algorithm...
146
Voted
SODA
2003
ACM
15 years 4 months ago
2003
ACM
In a recent paper, Ajtai et al. [1] give a streaming algorithm to count the number of inversions in a stream Ä ¾ Ñ Ò using two passes and Ç´¯ ½ ÔÒÐÓ Ò´ÐÓ Ñ·ÐÓ...