450 search results - page 6 / 90 » The Complexity of Computing Minimal Unidirectional Covering ... |
102
click to vote
IPL
2011
14 years 3 months ago
2011
We propose a probabilistic network model, called asynchronous bounded expected delay (ABE), which requires a known bound on the expected message delay. In ABE networks all asynchr...
ICNC
2005
Springer
15 years 5 months ago
2005
Springer
In completeness theories of multiple-valued logic, the characterization of Sheffer functions is an important problem，and the solution can be reduced to determining the minimal co...
110
click to vote
MFCS
2009
Springer
15 years 6 months ago
2009
Springer
We investigate the computational complexity of a general “compression task” centrally occurring in the recently developed technique of iterative compression for exactly solving...
CVPR
1996
IEEE
16 years 1 months ago
1996
IEEE
A fundamental problem in depth from defocus is the measurement of relative defocus between images. We propose a class of broadband operators that, when used together, provide inva...
116
click to vote
GC
2007
Springer
14 years 11 months ago
2007
Springer
We propose a novel subdivision of the plane that consists of both convex polygons and pseudotriangles. This pseudo-convex decomposition is significantly sparser than either conve...