Sciweavers

4820 search results - page 272 / 964
» Implementing Signatures for C
Sort
View
135
Voted
AI
2006
Springer
15 years 7 months ago
Exploiting Dynamic Independence in a Static Conditioning Graph
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...
Kevin Grant, Michael C. Horsch
162
Voted
ASAP
2004
IEEE
185views Hardware» more  ASAP 2004»
15 years 7 months ago
Families of FPGA-Based Algorithms for Approximate String Matching
Dynamic programming for approximate string matching is a large family of different algorithms, which vary significantly in purpose, complexity, and hardware utilization. Many impl...
Tom Van Court, Martin C. Herbordt
ICIAP
1995
ACM
15 years 7 months ago
PhotoPix: an Object-Oriented Framework for Digital Image Processing Systems
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...
Alisson Augusto Souza Sol, Arnaldo de Albuquerque ...
PPOPP
1995
ACM
15 years 7 months ago
pC++/streams: a Library for I/O on Complex Distributed Data Structures
paper we describe d/streams, a language-independent abstraction with a small set of simple primitives for buffered I/O on distributed data-structures. We describe the interface an...
Jacob Gotwals, Suresh Srinivas, Dennis Gannon
CISSE
2008
Springer
15 years 5 months ago
Testing Grammars For Top-Down Parsers
According to the software engineering perspective, grammars can be viewed as "Specifications for defining languages or compilers". They form the basics of languages and ...
A. M. Paracha, F. Franek