4074 search results - page 409 / 815 » Abstract Graph Transformation |
183
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...
216
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
—We consider the problem of positioning a cloud of points in the Euclidean space Rd , from noisy measurements of a subset of pairwise distances. This task has applications in var...
176
click to vote
ICIAP
2009
ACM
16 years 7 months ago
2009
ACM
Abstract. We exploit the recurrence of structures at different locations, orientations and scales in an image to perform denoising. While previous methods based on "nonlocal f...
197
click to vote
ICFP
2003
ACM
16 years 6 months ago
2003
ACM
The task of designing and implementing a compiler can be a difficult and error-prone process. In this paper, we present proach based on the use of higher-order abstract syntax and...
155
click to vote
ICDE
2010
IEEE
16 years 1 months ago
2010
IEEE
Abstract—We introduce schema covering, the problem of identifying easily understandable common objects for describing large and complex schemas. Defining transformations between...