16596 search results - page 341 / 3320 » Generalized Assignment Problems |
196
click to vote
WG
2010
Springer
15 years 5 months ago
2010
Springer
Cluster Editing is a classical graph theoretic approach to tackle the problem of data set clustering: it consists of modifying a similarity graph into a disjoint union of cliques,...
324
Voted
NFM
2011
15 years 1 months ago
2011
Synthesis of finite-state machines from linear-time temporal logic (LTL) formulas is an important formal specification debugging technique for reactive systems and can quickly ge...
169
click to vote
ICCV
2011
IEEE
14 years 6 months ago
2011
IEEE
We propose a novel framework for imposing label ordering constraints in multilabel optimization. In particular, label jumps can be penalized differently depending on the jump dire...
217
click to vote
ICCV
2011
IEEE
14 years 6 months ago
2011
IEEE
We present a generalized subgraph preconditioning (GSP) technique to solve large-scale bundle adjustment problems efficiently. In contrast with previous work which uses either di...
186
click to vote
CVPR
2008
IEEE
16 years 9 months ago
2008
IEEE
Linear Discriminant Analysis (LDA) is one of the wellknown methods for supervised dimensionality reduction. Over the years, many LDA-based algorithms have been developed to cope w...