7015 search results - page 360 / 1403 » Approximation algorithms for co-clustering |
170
click to vote
COCOON
2008
Springer
15 years 8 months ago
2008
Springer
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...
185
click to vote
FOIKS
2008
Springer
15 years 8 months ago
2008
Springer
Visibly Pushdown Languages (VPLs), recognized by Visibly Pushdown Automata (VPAs), are a nicely behaved family of contextfree languages. It has been shown that VPAs are equivalent ...
190
click to vote
MST
2007
15 years 6 months ago
2007
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
102
click to vote
CDC
2008
IEEE
16 years 1 months ago
2008
IEEE
— Motivated by some crowd motion models in the presence of noise, we consider an optimal control problem governed by the Fokker-Planck equation. We sketch optimality conditions b...
163
click to vote
AES
2007
Springer
15 years 6 months ago
2007
Springer
We present some heuristics incorporating the philosophy of compatible relaxation into an existing algebraic multigrid method, the so-called multigraph solver of Bank and Smith [1]...