4323 search results - page 182 / 865 » Callback Implementations in C |
207
click to vote
LCN
1996
IEEE
15 years 11 months ago
1996
IEEE
Development of new transport protocols or protocol algorithms suffers from the complexity of the envir onment in which they ar e intended to run. Modeling techniques attempt to av...
164
click to vote
HPCN
1994
Springer
15 years 11 months ago
1994
Springer
Abstract. High Performance Fortran (hpf) is a data-parallel Fortran for Distributed Memory Multiprocessors. Hpf provides an interesting programming model but compilers are yet to c...
181
click to vote
AI
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. A conditioning graph (CG) is a graphical structure that attempt to minimize the implementation overhead of computing probabilities in belief networks. A conditioning grap...
228
Voted
ASAP
2004
IEEE
15 years 10 months ago
2004
IEEE
Dynamic programming for approximate string matching is a large family of different algorithms, which vary significantly in purpose, complexity, and hardware utilization. Many impl...
201
Voted
ICIAP
1995
ACM
15 years 10 months ago
1995
ACM
This work describes how the use of object-oriented technology can help to separate the implementation of algorithms in digital image processing systems from the coding of “non-es...