45 search results - page 2 / 9 » cats 2008 |
CATS
2008
13 years 6 months ago
2008
An extension of a new multidimensional bisection method for minimizing function over simplex is proposed for solving nonlinear unconstrained minimization problem. The method does ...
CATS
2008
13 years 6 months ago
2008
The problem of deciding whether the edge-set of a given graph can be partitioned into at most k cliques is well known to be NP-complete. In this paper we investigate this problem ...
CATS
2008
13 years 6 months ago
2008
Pollard's rho method is a randomized algorithm for computing discrete logarithms. It works by defining a pseudo-random sequence and then detecting a match in the sequence. Ma...
COLING
1992
13 years 6 months ago
1992
ECCV
2008
Springer
14 years 6 months ago
2008
Springer
In this paper, we focus on the problem of detecting the head of cat-like animals, adopting cat as a test case. We show that the performance depends crucially on how to effectively ...