311 search results - page 19 / 63 » Approximate XML joins |
133
click to vote
COCOON
2010
Springer
14 years 10 months ago
2010
Springer
The problem of sorting permutations by double-cut-and-joins (SBD) arises when we perform the double-cut-and-join (DCJ) operations on pairs of unichromosomal genomes without the gen...
102
click to vote
AOSD
2003
ACM
15 years 5 months ago
2003
ACM
We define a generic join point model for checking the Law of Demeter (LoD). Join points are trees, pointcuts are predicates over join points, and advice is checked statically sim...
ER
2003
Springer
15 years 5 months ago
2003
Springer
Existing solutions to data and schema integration require user interaction/input to generate a data transformation between two different schemas. These approaches are not appropri...
AAECC
2007
Springer
14 years 12 months ago
2007
Springer
We present an approximate implicitization method for planar curves. The computed implicit representation is a piecewise rational approximation of the distance function to the given...
127
click to vote
VLDB
2007
ACM
15 years 5 months ago
2007
ACM
In many applications, the underlying data (the web, an XML document, or a relational database) can be seen as a graph. These graphs may be enriched with weights, associated with t...