Sciweavers

1064 search results - page 28 / 213
» Exact Algorithms for the Quadratic Linear Ordering Problem
Sort
View
140
Voted
ALENEX
2009
106views Algorithms» more  ALENEX 2009»
15 years 4 months ago
Drawing Binary Tanglegrams: An Experimental Evaluation
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...
Martin Nöllenburg, Markus Völker, Alexan...
130
Voted
JCT
2010
114views more  JCT 2010»
15 years 2 months ago
An almost quadratic bound on vertex Folkman numbers
The vertex Folkman number F(r, n, m), n < m, is the smallest integer t such that there exists a Km-free graph of order t with the property that every r-coloring of its vertices...
Andrzej Dudek, Vojtech Rödl
CVPR
2009
IEEE
16 years 11 months ago
Minimizing Sparse Higher Order Energy Functions of Discrete Variables
Higher order energy functions have the ability to encode high level structural dependencies between pixels, which have been shown to be extremely powerful for image labeling pro...
Carsten Rother (Microsoft Research Cambridge), Pus...
120
Voted
ESANN
2007
15 years 5 months ago
Model Selection for Kernel Probit Regression
Abstract. The convex optimisation problem involved in fitting a kernel probit regression (KPR) model can be solved efficiently via an iteratively re-weighted least-squares (IRWLS)...
Gavin C. Cawley
143
Voted
GECCO
2009
Springer
15 years 7 months ago
Evolving heuristically difficult instances of combinatorial problems
When evaluating a heuristic for a combinatorial problem, randomly generated instances of the problem may not provide a thorough exploration of the heuristic's performance, an...
Bryant A. Julstrom