Instances of constraint satisfaction problems can be solved efficiently if they are representable as a tree decomposition of small width. Unfortunately, the task of finding a deco...
Runtime data alignment has been paid attention recently since it can allocate data segment to processors dynamically according to applications' requirement. One of the key opt...
—The optimal performance-complexity tradeoff for error-correcting codes at rates strictly below the Shannon limit is a central question in coding theory. This paper proposes a nu...
Benjamin Smith, Masoud Ardakani, Wei Yu, Frank R. ...
Correspondence problems are of great importance in
computer vision. They appear as subtasks in many applications
such as object recognition, merging partial 3D reconstructions
a...
This paper addresses the issue of optimal scale selection for circular edge extraction in the context of higher dimensional multiscale edge extraction. Based on a classification o...