450 search results - page 42 / 90 » The Complexity of Computing Minimal Unidirectional Covering ... |
HEURISTICS
2010
14 years 6 months ago
2010
The challenge in shift scheduling lies in the construction of a set of work shifts, which are subject to specific regulations, in order to cover fluctuating staff demands. This pro...
ICCV
2009
IEEE
16 years 4 months ago
2009
IEEE
We present a novel keyframe selection and recognition
method for robust markerless real-time camera tracking.
Our system contains an ofine module to select features
from a grou...
128
click to vote
SIAMCOMP
1998
14 years 11 months ago
1998
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
112
click to vote
KI
2007
Springer
15 years 6 months ago
2007
Springer
Axiom pinpointing has been introduced in description logics (DLs) to help the user understand the reasons why consequences hold by computing minimal subsets of the knowledge base t...
3DPVT
2006
IEEE
15 years 6 months ago
2006
IEEE
We present a systematic view planning method to assist construction of 3-D models of large outdoor sites using a mobile robot platform with mounted scanner. In the first stage, w...