Sciweavers

1798 search results - page 172 / 360
» A Tree for All Seasons
Sort
View
APPINF
2003
13 years 10 months ago
Corner-First Tree-based Region Broadcasting in Mesh Networks
In direct interconnection networks, the collective communication operation one to all, which is usually referred to as broadcasting, can be generalized to allow one source node to...
Hadeel Haddad, Muhammad F. Mudawwar
WSCG
2000
107views more  WSCG 2000»
13 years 10 months ago
Faster ASV Decomposition for Orthogonal Polyhedra, Using the Extreme Vertices Model (EVM)
The alternating sum of volumes (ASV) decomposition is a widely used technique for converting a b-rep into a CSG model, with all its implicit uses and advantages -like form feature...
Antonio Aguilera, Dolors Ayala
CORR
2006
Springer
141views Education» more  CORR 2006»
13 years 9 months ago
Iterative Decoding Performance Bounds for LDPC Codes on Noisy Channels
The asymptotic iterative decoding performances of low-density parity-check (LDPC) codes using min-sum (MS) and sum-product (SP) decoding algorithms on memoryless binary-input outp...
Chun-Hao Hsu, Achilleas Anastasopoulos
TOG
2008
145views more  TOG 2008»
13 years 9 months ago
Real-time KD-tree construction on graphics hardware
We present an algorithm for constructing kd-trees on GPUs. This algorithm achieves real-time performance by exploiting the GPU's streaming architecture at all stages of kd-tr...
Kun Zhou, Qiming Hou, Rui Wang 0004, Baining Guo
ICIP
2001
IEEE
14 years 10 months ago
Algorithmic modifications to SPIHT
This paper proposes several low complexity algorithmic modifications to the SPIHT (Set Partitioning in Hierarchical Trees) image coding method of [3]. The modifications exploit un...
Ulug Bayazit, William A. Pearlman