2899 search results - page 111 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
111
click to vote
PODS
2001
ACM
16 years 1 months ago
2001
ACM
The need to search for complex and recurring patterns in database sequences is shared by many applications. In this paper, we discuss how to express and support efficiently sophis...
134
click to vote
ISCAS
2011
IEEE
14 years 5 months ago
2011
IEEE
— The last two decades have seen many efficient algorithms and architectures for the design of low-complexity bit-parallel Multiple Constant Multiplications (MCM) operation, tha...
117
click to vote
CVPR
2005
IEEE
16 years 3 months ago
2005
IEEE
We propose a solution to the n-frame correspondence problem under the factorization framework. During the matching process, our algorithm takes explicitly into account the geometr...
77
Voted
ICCV
2007
IEEE
16 years 3 months ago
2007
IEEE
Color constancy is almost exclusively modeled with diagonal transforms. However, the choice of basis under which diagonal transforms are taken is traditionally ad hoc. Attempts to...
AAAI
2006
15 years 2 months ago
2006
Many learning tasks in adversarial domains tend to be highly dependent on the opponent. Predefined strategies optimized for play against a specific opponent are not likely to succ...