804 search results - page 4 / 161 » Experiments on Union-Find Algorithms for the Disjoint-Set Da... |
Publication
We consider the computational problem of finding nearest neighbors in general metric spaces. Of particular interest are spaces that may not be conveniently embedded or approximate...
BMCBI
2010
13 years 7 months ago
2010
Background: High-throughput sequencing (HTS) technologies play important roles in the life sciences by allowing the rapid parallel sequencing of very large numbers of relatively s...
SIGCSE
2002
ACM
13 years 7 months ago
2002
ACM
We present our experience using a large, real-world application as a course project for the second half of the semester of a CS2 course. Our primary goal for the project was to cr...
APWEB
2005
Springer
14 years 1 months ago
2005
Springer
When XML documents are modeled as graphs, many challenging research issues arise. In particular, query processing for graphstructured XML data brings new challenges because traditi...
JDA
2006
13 years 7 months ago
2006
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...