159 search results - page 17 / 32 » Computing minimum cuts by randomized search heuristics |
118
click to vote
WWW
2008
ACM
16 years 1 months ago
2008
ACM
High-quality, personalized recommendations are a key feature in many online systems. Since these systems often have explicit knowledge of social network structures, the recommenda...
119
click to vote
WEA
2010
Springer
15 years 7 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...
125
click to vote
ICIG
2009
IEEE
14 years 10 months ago
2009
IEEE
Optical flow estimation is one of the main subjects in computer vision. Many methods developed to compute the motion fields are built using standard heuristic formulation. In this...
93
Voted
GECCO
2005
Springer
15 years 6 months ago
2005
Springer
We study if and when the inequality dp(H) ≤ rel∆(H) holds for schemas H in chromosomes that are structured as trees. The disruption probability dp(H) is the probability that a...
86
Voted
AINA
2008
IEEE
15 years 7 months ago
2008
IEEE
This paper shows that the performance of peer-to-peer resource discovery algorithms is upper bounded by a k-Steiner minimum tree and proposes an algorithm locating near-optimal qu...