Sciweavers

77 search results - page 8 / 16
» The Core Concept for 0 1 Integer Programming
Sort
View
SOFSEM
2012
Springer
12 years 3 months ago
Turing Machines for Dummies - Why Representations Do Matter
Abstract. Various methods exists in the literature for denoting the configuration of a Turing Machine. A key difference is whether the head position is indicated by some integer ...
Peter van Emde Boas
CORR
2010
Springer
92views Education» more  CORR 2010»
13 years 8 months ago
Parameterizing by the Number of Numbers
The usefulness of parameterized algorithmics has often depended on what Niedermeier has called, "the art of problem parameterization." In this paper we introduce and expl...
Michael R. Fellows, Serge Gaspers, Frances A. Rosa...
ICIP
1999
IEEE
14 years 9 months ago
An Efficient VLSI Architecture for Separable 2-D Discrete Wavelet Transform
In this paper, we present a VLSI architecture for separable 2-D Discrete Wavelet Transform (DWT). Based on 1-D DWT Recursive Pyramid Algorithm (RPA), a complete 2-D DWT output sch...
Wen-Shiaw Peng, Chen-Yi Lee
SAT
2007
Springer
95views Hardware» more  SAT 2007»
14 years 1 months ago
Solving Multi-objective Pseudo-Boolean Problems
Integer Linear Programs are widely used in areas such as routing problems, scheduling analysis and optimization, logic synthesis, and partitioning problems. As many of these proble...
Martin Lukasiewycz, Michael Glaß, Christian ...
DATE
2003
IEEE
97views Hardware» more  DATE 2003»
14 years 1 months ago
Enhancing Speedup in Network Processing Applications by Exploiting Instruction Reuse with Flow Aggregation
Instruction reuse is a microarchitectural technique that improves the execution time of a program by removing redundant computations at run-time. Although this is the job of an op...
G. Surendra, Subhasis Banerjee, S. K. Nandy