166 search results - page 12 / 34 » Partitioning Graphs to Speed Up Dijkstra's Algorithm |
VMV
2007
13 years 8 months ago
2007
This article focuses on algorithms for fast computation of the Euclidean distance between a query point and a subdivision surface. The analyzed algorithms include uniform tessella...
RECOMB
2007
Springer
14 years 8 months ago
2007
Springer
Association, or LD (linkage disequilibrium), mapping is an intensely-studied approach to gene mapping (genome-wide or in candidate regions) that is widely hoped to be able to effic...
INFOVIS
2005
IEEE
14 years 1 months ago
2005
IEEE
We present PRISAD, the first generic rendering infrastructure for information visualization applications that use the accordion drawing technique: rubber-sheet navigation with gu...
PE
2011
Springer
13 years 2 months ago
2011
Springer
High-level semi-Markov modelling paradigms such as semi-Markov stochastic Petri nets and process algebras are used to capture realistic performance models of computer and communic...
AMAI
2004
Springer
14 years 1 months ago
2004
Springer
We study three new techniques which will speed up the branch-and-bound algorithm for the MAX-2-SAT problem: The first technique is a new lower bound function for the algorithm an...