6045 search results - page 319 / 1209 » Computable Linearizations of Well-partial-orderings |
197
click to vote
TIP
2008
15 years 7 months ago
2008
Abstract--We propose an algorithm for designing linear equalizers that maximize the structural similarity (SSIM) index between the reference and restored signals. The SSIM index ha...
177
Voted
ICRA
1998
IEEE
15 years 11 months ago
1998
IEEE
An algorithm is presented which computes feasible manipulator trajectories along fixed paths in the presence of kinematic singularities. The resulting trajectories are close to mi...
179
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
We present greedy algorithms for some classes of combinatorial packing and cover problems within the general formal framework of Hoffman and Schwartz' lattice polyhedra. Our ...
196
Voted
ICML
2010
IEEE
15 years 8 months ago
2010
IEEE
We describe an algorithm for clustering using a similarity graph. The algorithm (a) runs in O(n log3 n + m log n) time on graphs with n vertices and m edges, and (b) with high pro...
170
click to vote
SCL
2008
15 years 7 months ago
2008
This paper proposes a methodology to compute quadratic performance bounds when the closed loop poles of a discrete-time multivariable control loop are confined to a disk, centred ...