450 search results - page 14 / 90 » The Complexity of Computing Minimal Unidirectional Covering ... |
PVLDB
2008
14 years 11 months ago
2008
The dependency propagation problem is to determine, given a view defined on data sources and a set of dependencies on the sources, whether another dependency is guaranteed to hold...
JUCS
2010
14 years 10 months ago
2010
Abstract: This paper discusses three rectilinear (that is, axis-parallel) covering problems in d dimensions and their variants. The first problem is the Rectilinear Line Cover whe...
AIPS
2008
15 years 2 months ago
2008
We present a complex scheduling problem where we want to plan meetings between customers and exhibitors at a trade event. One cause of the complexity of the problem is the general...
ICPR
2000
IEEE
15 years 4 months ago
2000
IEEE
All the methods for estimating the fundamental matrix do not naturally exploit the rank-2 constraint. For these reason some few rank-2 parameterizations of the fundamental matrix ...
CSFW
2005
IEEE
15 years 5 months ago
2005
IEEE
We consider expansions of the Abadi-Rogaway logic of indistinguishability of formal cryptographic expressions. We expand the logic in order to cover cases when partial information...