10988 search results - page 210 / 2198 » Algorithmic Folding Complexity |
189
click to vote
WACV
2005
IEEE
16 years 3 days 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 (...
155
click to vote
COCO
2005
Springer
16 years 2 days 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...
182
click to vote
ISAAC
2004
Springer
15 years 12 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...
177
click to vote
ICPR
2002
IEEE
15 years 11 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...
180
click to vote
MAAMAW
1993
Springer
15 years 10 months ago
1993
Springer
Autonomous agents are designed to reach goals that were pre-de ned by their operators. An important way to execute tasks and to maximize payo is to share resources and to cooperate...