Sciweavers

6365 search results - page 24 / 1273
» Fast Local Computation Algorithms
Sort
View
TITB
2010
145views Education» more  TITB 2010»
14 years 4 months ago
Fast katsevich algorithm based on GPU for helical cone-beam computed tomography
Katsevich reconstruction algorithm represents a breakthrough for helical cone-beam computed tomography (CT) reconstruction, because it is the first exact cone-beam reconstruction a...
Guorui Yan, Jie Tian, Shouping Zhu, Chenghu Qin, Y...
ICCSA
2004
Springer
15 years 3 months ago
A Robust and Fast Algorithm for Computing Exact and Approximate Shortest Visiting Routes
Abstract. Given a simple n-sided polygon in the plane with a boundary partitioned into subchains some of which are convex and colored, we consider the following problem: Which is t...
Håkan Jonsson
ISAAC
2005
Springer
113views Algorithms» more  ISAAC 2005»
15 years 3 months ago
Fast Algorithms for Computing the Tripartition-Based Distance Between Phylogenetic Networks
Consider two phylogenetic networks N and N′ of size n. The tripartition-based distance finds the proportion of tripartitions which are not shared by N and N′ . This distance i...
Nguyen Bao Nguyen, C. Thach Nguyen, Wing-Kin Sung
CDC
2008
IEEE
161views Control Systems» more  CDC 2008»
14 years 11 months ago
A fast algorithm to compute the controllability, decentralized fixed-mode, and minimum-phase radius of LTI systems
In this paper, an efficient algorithm is presented for solving the 2-D optimization problem which is associated with computing the robustness measures of a number of linear time-in...
Simon Lam, Edward J. Davison
JPDC
2006
134views more  JPDC 2006»
14 years 9 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong