Sciweavers

18572 search results - page 845 / 3715
» High performance C
Sort
View
ECML
2005
Springer
16 years 1 months ago
A Comparison of Approaches for Learning Probability Trees
Probability trees (or Probability Estimation Trees, PET’s) are decision trees with probability distributions in the leaves. Several alternative approaches for learning probabilit...
Daan Fierens, Jan Ramon, Hendrik Blockeel, Maurice...
IPPS
2003
IEEE
16 years 26 days ago
Lazy Parallelization: A Finite State Machine Based Optimization Approach for Data Parallel Image Processing Applications
Performance obtained with existing library-based parallelization tools for implementing high performance image processing applications is often sub-optimal. This is because inter-...
Frank J. Seinstra, Dennis Koelma
IPPS
2005
IEEE
16 years 1 months ago
Packet Routing in Dynamically Changing Networks on Chip
On-line routing strategies for communication in a dynamic network on chip (DyNoC) environment are presented. The DyNoC has been presented as a medium supporting communication amon...
Mateusz Majer, Christophe Bobda, Ali Ahmadinia, J&...
MSWIM
2005
ACM
16 years 1 months ago
Comparison of multi-channel MAC protocols
This paper compares, through analysis and simulation, a number of multichannel MAC protocols for wireless networks. We first classify these protocols into 4 categories based on t...
Jeonghoon Mo, Hoi-sheung Wilson So, Jean C. Walran...
IPPS
1997
IEEE
15 years 11 months ago
Fast Parallel Computation of the Polynomial Shift
Given an n-degree polynomial fx over an arbitrary ring, the shift of fx by c is the operation which computes coefficients of the polynomial fx + c. In this paper we conside...
Eugene V. Zima