280 search results - page 23 / 56 » New Algorithms for Enumerating All Maximal Cliques |
CVPR
2007
IEEE
15 years 6 months ago
2007
IEEE
We propose a framework for general multiple target tracking, where the input is a set of candidate regions in each frame, as obtained from a state of the art background learning, ...
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
This paper deals with the problem of finding the optimal sequence of sub-word unit HMMs for a number of given utterances of a word. For this problem we present a new solution bas...
CN
2007
14 years 11 months ago
2007
Efficient dynamic resource provisioning algorithms are necessary to the development and automation of Quality of Service (QoS) networks. The main goal of these algorithms is to o...
EOR
2007
14 years 11 months ago
2007
This paper models supply chain (SC) uncertainties by fuzzy sets and develops a possibilistic SC configuration model for new products with unreliable or unavailable SC statistical...
128
click to vote
COCOON
2009
Springer
15 years 6 months ago
2009
Springer
We take a new look at the convex path recoloring (CPR), convex tree recoloring (CTR), and convex leaf recoloring (CLR) problems through the eyes of the independent set problem. Th...