7 search results - page 2 / 2 » cpm 2003 |
123
click to vote
CPM
2003
Springer
15 years 10 months ago
2003
Springer
Given n fragments from k > 2 genomes, we will show how to find an optimal chain of colinear non-overlapping fragments in time O(n logk−2 n log log n) and space O(n logk−2 n...
158
Voted
DOLAP
2003
ACM
15 years 10 months ago
2003
ACM
Data visualization is one of the big issues of database research. OLAP as a decision support technology is highly related to the developments of data visualization area. In this p...