21 search results - page 3 / 5 » Rearrangement Models and Single-Cut Operations |
SIGMOD
2004
ACM
14 years 6 months ago
2004
ACM
We present new algorithms on commodity graphics processors to perform fast computation of several common database operations. Specifically, we consider operations such as conjunct...
GG
2008
Springer
13 years 7 months ago
2008
Springer
In this paper we present meta-rules to express an infinite class of semantically related graph transformation rules in the context of pure topological modelling with G-maps. Our p...
ICDE
2009
IEEE
13 years 3 months ago
2009
IEEE
Many real world applications such as sensor networks and other monitoring applications naturally generate probabilistic streams that are highly correlated in both time and space. ...
ICSE
2003
IEEE-ACM
14 years 6 months ago
2003
IEEE-ACM
Editing graphic models always entails layout problems. Inserting and deleting items requires tedious manual work for shifting existing items and rearranging the diagram layout. He...
RECOMB
2010
Springer
13 years 4 months ago
2010
Springer
We study two problems in the double cut and join (DCJ) model: sorting – transforming one multilinear genome into another and halving – transforming a duplicated genome into a p...