Sciweavers

2254 search results - page 274 / 451
» Computing the minimal covering set
Sort
View
ICCAD
1995
IEEE
180views Hardware» more  ICCAD 1995»
15 years 10 months ago
Design based analog testing by Characteristic Observation Inference
In this paper, a new approach to analog test design based on the circuit design process, called Characteristic Observation Inference (COI), is presented. In many situations, it is...
Walter M. Lindermeir, Helmut E. Graeb, Kurt Antrei...
CVGIP
2006
106views more  CVGIP 2006»
15 years 6 months ago
Precomputing avatar behavior from human motion data
Creating controllable, responsive avatars is an important problem in computer games and virtual environments. Recently, large collections of motion capture data have been exploite...
Jehee Lee, Kang Hoon Lee
VLSISP
2010
205views more  VLSISP 2010»
15 years 5 months ago
Adaptable, Fast, Area-Efficient Architecture for Logarithm Approximation with Arbitrary Accuracy on FPGA
— This paper presents ALA (Adaptable Logarithm Approximation), a novel hardware architecture for the approximation of the base-2 logarithm of integers at an arbitrary accuracy, s...
Dimitris G. Bariamis, Dimitris Maroulis, Dimitrios...
ISAAC
2010
Springer
253views Algorithms» more  ISAAC 2010»
15 years 4 months ago
Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut
Abstract. We consider the Steiner tree problem under a 2-stage stochastic model with recourse and finitely many scenarios (SSTP). Thereby, edges are purchased in the first stage wh...
Immanuel M. Bomze, Markus Chimani, Michael Jü...
ISTCS
1997
Springer
15 years 10 months ago
Exact Analysis of Exact Change
We introduce the k-payment problem: given a total budget of N units, the problem is to represent this budget as a set of coins, so that any k exact payments of total value at most ...
Pat Frankel