1933 search results - page 286 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
128
Voted
JGAA
2000
15 years 3 months ago
2000
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a ...
198
Voted
ESA
2010
Springer
15 years 4 months ago
2010
Springer
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
151
Voted
CP
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. In this paper we propose an optimal anytime version of constrained simulated annealing (CSA) for solving constrained nonlinear programming problems (NLPs). One of the goa...
117
Voted
CIVR
2007
Springer
15 years 9 months ago
2007
Springer
Fusion of multimedia streams for enhanced performance is a critical problem for retrieval. However, fusion performance tends to easily overfit the hillclimb set used to learn fus...
114
Voted
CVPR
2010
IEEE
16 years 9 hour ago
2010
IEEE
Active learning methods aim to select the most informative unlabeled instances to label first, and can help to focus image or video annotations on the examples that will most impr...