6575 search results - page 426 / 1315 » Specializing visualization algorithms |
145
click to vote
NIPS
2003
15 years 8 months ago
2003
We describe a procedure which finds a hierarchical clustering by hillclimbing. The cost function we use is a hierarchical extension of the -means cost; our local moves are tree...
147
Voted
CORR
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. Spacetime-discontinuous Galerkin (SDG) finite element methods are used to solve hyperbolic spacetime partial differential equations (PDEs) to accurately model wave propag...
136
click to vote
DAM
2006
15 years 6 months ago
2006
: In this paper we consider the edge ranking problem of weighted trees. We prove that a special instance of this problem, namely edge ranking of multitrees is NP-hard already for m...
157
click to vote
DISOPT
2007
15 years 6 months ago
2007
The job rotation problem (JRP) is the following: Given an n × n matrix A over R ∪ {−∞} and k ≤ n, find a k × k principal submatrix of A whose optimal assignment problem...
174
click to vote
MCS
2006
Springer
15 years 6 months ago
2006
Springer
8 The training of some types of neural networks leads to separable non-linear least squares problems. These problems may be9 ill-conditioned and require special techniques. A robus...