1816 search results - page 166 / 364 » A New Approach for Solving the Maximum Clique Problem |
216
click to vote
IEEESCC
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
166
click to vote
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
We cast some new insights into solving the digital matting
problem by treating it as a semi-supervised learning
task in machine learning. A local learning based approach
and a g...
164
click to vote
AICCSA
2001
IEEE
15 years 10 months ago
2001
IEEE
This paper presents a novel approach based on clustering algorithms in combination with the location area (LA) scheme to solve the mobility management problem. Users' movemen...
177
click to vote
SDM
2003
SIAM
15 years 7 months ago
2003
SIAM
Serial criminals are a major threat in the modern society. Associating incidents committed by the same offender is of great importance in studying serial criminals. In this paper,...
146
click to vote
NIPS
1997
15 years 7 months ago
1997
We present a new approach to reinforcement learning in which the policies considered by the learning process are constrained by hierarchies of partially specified machines. This ...