Sciweavers

819 search results - page 52 / 164
» Parallelization with Tree Skeletons
Sort
View
ICC
2007
IEEE
15 years 4 months ago
Orthogonal En/Decoders for Truly Asynchronous Spectral Amplitude Encoded OCDMA
— In this paper, theoretical results are presented on the modular construction of tree and cascade encoders/decoders of any size for truly asynchronous and orthogonal spectral am...
Bas Huiszoon, Laurens Bakker, Huug de Waardt, Giok...
SC
1995
ACM
15 years 1 months ago
Parallelizing the Phylogeny Problem
The problem of determining the evolutionary history of species in the form of phylogenetic trees is known as the phylogeny problem. We present a parallelization of the character c...
Jeff A. Jones, Katherine A. Yelick
RT
1995
Springer
15 years 1 months ago
Rendering Trees from Precomputed Z-Buffer Views
Parallel projection z-buffer images are precomputed for a number of preset viewing directions on the unit sphere. Using the depth information, we can reconstruct a 3-D point from e...
Nelson L. Max, Keiichi Ohsaki
ECCC
2002
74views more  ECCC 2002»
14 years 9 months ago
On the proper learning of axis parallel concepts
We study the proper learnability of axis-parallel concept classes in the PAC-learning and exactlearning models. These classes include union of boxes, DNF, decision trees and multi...
Nader H. Bshouty, Lynn Burroughs
WG
1997
Springer
15 years 1 months ago
Parallel Algorithms for Treewidth Two
In this paper we present a parallel algorithm that decides whether a graph G has treewidth at most two, and if so, construct a tree decomposition or path decomposition of minimum ...
Babette de Fluiter, Hans L. Bodlaender