989 search results - page 114 / 198 » Approximating the Pareto optimal set using a reduced set of ... |
ECCV
2006
Springer
14 years 10 months ago
2006
Springer
The paper introduces a new framework for feature learning in classification motivated by information theory. We first systematically study the information structure and present a n...
PLDI
2003
ACM
14 years 1 months ago
2003
ACM
Compiler writers have crafted many heuristics over the years to approximately solve NP-hard problems efficiently. Finding a heuristic that performs well on a broad range of applic...
IPMI
2007
Springer
14 years 9 months ago
2007
Springer
This paper presents a new method for constructing compact statistical point-based models of ensembles of similar shapes that does not rely on any specific surface parameterization....
CEC
2009
IEEE
14 years 2 months ago
2009
IEEE
— In this paper, we propose a new algorithm, named JACC-G, for large scale optimization problems. The motivation is to improve our previous work on grouping and adaptive weightin...
TON
2008
13 years 8 months ago
2008
We study the problem of load balancing the traffic from a set of unicast and multicast sessions. The problem is formulated as an optimization problem. However, we assume that the g...