402 search results - page 48 / 81 » A branch and cut algorithm for the Steiner problem in graphs |
TVCG
2011
13 years 3 months ago
2011
—This paper considers the problem of interactively finding the cutting contour to extract components from an existing mesh. First, we propose a constrained random walks algorith...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
Like Darwinian-type genetic algorithms, there also exists genetic drift in Univariate Marginal Distribution Algorithm (UMDA). Since the universal analysis of genetic drift in UMDA...
JOIN
2007
13 years 8 months ago
2007
This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...
WWW
2008
ACM
14 years 9 months ago
2008
ACM
The paper is concerned with the problem of question recommendation. Specifically, given a question as query, we are to retrieve and rank other questions according to their likelih...
ICCV
2003
IEEE
14 years 10 months ago
2003
IEEE
We address visual correspondence problems without assuming that scene points have similar intensities in different views.This situation is common, usually due to non-lambertian sc...