81 search results - page 8 / 17 » Parameterized algorithmics for linear arrangement problems |
ICDM
2008
IEEE
14 years 1 months ago
2008
IEEE
In this work, we study a visual data mining problem: Given a set of discovered overlapping submatrices of interest, how can we order the rows and columns of the data matrix to bes...
FSTTCS
2006
Springer
13 years 11 months ago
2006
Springer
Abstract Decision procedures underlie many program analysis problems. Traditional program analysis algorithms attempt to prove some property about a single, statically-defined prog...
ICALP
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. In this work we study the tractability of well supported approximate Nash Equilibria (SuppNE in short) in bimatrix games. In view of the apparent intractability of constr...
COMPUTING
2007
13 years 7 months ago
2007
The discrete Laplace-Beltrami operator plays a prominent role in many Digital Geometry Processing applications ranging from denoising to parameterization, editing, and physical si...
ICPR
2006
IEEE
14 years 8 months ago
2006
IEEE
We present a dynamic inference algorithm in a globally parameterized nonlinear manifold and demonstrate it on the problem of visual tracking. An appearance manifold is usually non...