186 search results - page 13 / 38 » Tractability of Theory Patching |
113
click to vote
AAAI
2012
13 years 27 days ago
2012
The early classifications of the computational complexity of planning under various restrictions in STRIPS (Bylander) and SAS+ (B¨ackstr¨om and Nebel) have influenced followin...
CVPR
2007
IEEE
16 years 15 days ago
2007
IEEE
The compositional nature of visual objects significantly limits their representation complexity and renders learning of structured object models tractable. Adopting this modeling ...
102
click to vote
IWOCA
2010
Springer
14 years 5 months ago
2010
Springer
A homomorphism from a graph G to a graph R is locally surjective if its restriction to the neighborhood of each vertex of G is surjective. Such a homomorphism is also called an R-r...
74
Voted
ICIP
2000
IEEE
16 years 2 days ago
2000
IEEE
In this paper, we apply the complexity?regularization principle to Poisson imaging. We formulate a natural distortion measure in image space, and present a connection between comp...
ISSRE
2003
IEEE
15 years 3 months ago
2003
IEEE
Prior research has suggested that the failure rates of faults follow a log normal distribution. We propose a specific model where distributions close to a log normal arise natural...