Sciweavers

595 search results - page 28 / 119
» Using Constraints with Memory to Implement Variable Eliminat...
Sort
View
ICIP
2009
IEEE
16 years 3 months ago
Memory-less Bit-plane Coder Architecture For Jpeg2000 With Concurrent Column-stripe Coding
In implementing an efficient block coder for JPEG2000, the memories required for storing the state variables dominate the hardware cost of a block coder. In this paper, we propose...
115
Voted
INFOCOM
2009
IEEE
15 years 9 months ago
Variable-Stride Multi-Pattern Matching For Scalable Deep Packet Inspection
Abstract—Accelerating multi-pattern matching is a critical issue in building high-performance deep packet inspection systems. Achieving high-throughputs while reducing both memor...
Nan Hua, Haoyu Song, T. V. Lakshman
156
Voted
CONCUR
1991
Springer
15 years 6 months ago
A Method for the Development of Totally Correct Shared-State Parallel Programs
Abstract. A syntax-directed formal system for the development of totally correct programs with respect to an (unfair) shared-state parallel programming language is proposed. The pr...
Ketil Stølen
120
Voted
POPL
2009
ACM
15 years 9 months ago
Comparing the performance of concurrent linked-list implementations in Haskell
Haskell has a rich set of synchronization primitives for implemented-state concurrency abstractions, ranging from the very high level (Software Transactional Memory) to the very l...
Martin Sulzmann, Edmund S. L. Lam, Simon Marlow
135
Voted
SARA
2009
Springer
15 years 9 months ago
Some Interval Approximation Techniques for MINLP
MINLP problems are hard constrained optimization problems, with nonlinear constraints and mixed discrete continuous variables. They can be solved using a Branch-and-Bound scheme c...
Nicolas Berger, Laurent Granvilliers