10988 search results - page 210 / 2198 » Algorithmic Folding Complexity |
150
Voted
WACV
2005
IEEE
15 years 9 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 (...
114
Voted
COCO
2005
Springer
15 years 9 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...
140
Voted
ISAAC
2004
Springer
15 years 9 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...
141
Voted
ICPR
2002
IEEE
15 years 8 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...
148
Voted
MAAMAW
1993
Springer
15 years 7 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...