10608 search results - page 147 / 2122 » Complexity of O'Hara's Algorithm |
CIKM
2009
Springer
14 years 4 months ago
2009
Springer
Plenty of algorithms for link prediction have been proposed and were applied to various real networks. Among these works, the weights of links are rarely taken into account. In th...
WACV
2005
IEEE
14 years 3 months ago
2005
IEEE
Moving object detection is very important for video surveillance. In many environments, motion maybe either interesting (salient) motion (e.g., a person) or uninteresting motion (...
COCO
2005
Springer
14 years 3 months ago
2005
Springer
It is well known that the hardest bit of integer multiplication is the middle bit, i.e. MULn−1,n. This paper contains several new results on its complexity. First, the size s of...
ISAAC
2004
Springer
14 years 3 months ago
2004
Springer
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...
ICPR
2002
IEEE
14 years 3 months ago
2002
IEEE
Detecting and recognizing face images automatically is a difficult task due to the variability of illumination, presentation angle, face expression and other common problems of m...