976 search results - page 81 / 196 » The Complexity of Timetable Construction Problems |
WACV
2012
IEEE
12 years 4 months ago
2012
IEEE
We propose an online algorithm based on local sparse representation for robust object tracking. Local image patches of a target object are represented by their sparse codes with a...
MOBIHOC
2002
ACM
14 years 8 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
WWW
2007
ACM
14 years 9 months ago
2007
ACM
Many databases have become Web-accessible through form-based search interfaces (i.e., HTML forms) that allow users to specify complex and precise queries to access the underlying ...
DCG
2008
13 years 9 months ago
2008
Let S be the boundary of a convex polytope of dimension d + 1, or more generally let S be a convex polyhedral pseudomanifold. We prove that S has a polyhedral nonoverlapping unfold...
IANDC
2008
13 years 9 months ago
2008
In the area of Description Logic (DL), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problem...