2244 search results - page 117 / 449 » A new heuristic approach for non-convex optimization problem... |
238
click to vote
ICCAD
2010
IEEE
15 years 4 months ago
2010
IEEE
In this paper, we present an efficient method to solve the obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem optimally. Our work is a major improvement over the w...
178
click to vote
ICIP
2010
IEEE
15 years 4 months ago
2010
IEEE
How to adaptively choose optimal neighborhoods is very important to pixel-domain image denoising algorithms since too many neighborhoods may cause over-smooth artifacts and too fe...
178
click to vote
TC
2010
15 years 1 months ago
2010
Abstract-- Scheduling problems are already difficult on traditional parallel machines, and they become extremely challenging on heterogeneous clusters. In this paper we deal with t...
194
click to vote
JMLR
2012
13 years 8 months ago
2012
The main theme of this paper is to develop a novel eigenvalue optimization framework for learning a Mahalanobis metric. Within this context, we introduce a novel metric learning a...
180
click to vote
DOLAP
2000
ACM
15 years 10 months ago
2000
ACM
Being able to efficiently answer arbitrary OLAP queries that aggregate along any combination of dimensions over numerical and categorical attributes has been a continued, major co...