Sciweavers

1688 search results - page 68 / 338
» Implementing Optimizations at Decode Time
Sort
View
JDA
2007
83views more  JDA 2007»
13 years 8 months ago
Optimal leaf ordering of complete binary trees
Ordering a set of items so as to minimize the sum of distances between consecutive elements is a fundamental optimization problem occurring in many settings. While it is NP-hard i...
Ulrik Brandes
ISAAC
2005
Springer
113views Algorithms» more  ISAAC 2005»
14 years 1 months ago
A Simple Optimal Randomized Algorithm for Sorting on the PDM
Abstract. The Parallel Disks Model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the processing of massive data sets. Sorting has been extensively studied ...
Sanguthevar Rajasekaran, Sandeep Sen
SCOPES
2004
Springer
14 years 1 months ago
DSP Code Generation with Optimized Data Word-Length Selection
Digital signal processing applications are implemented in embedded systems with fixed-point arithmetic to minimize the cost and the power consumption. To reduce the application ti...
Daniel Menard, Olivier Sentieys
ET
2002
105views more  ET 2002»
13 years 7 months ago
An Integrated Framework for the Design and Optimization of SOC Test Solutions
We propose an integrated framework for the design of SOC test solutions, which includes a set of algorithms for early design space exploration as well as extensive optimization for...
Erik Larsson, Zebo Peng
CORR
2002
Springer
144views Education» more  CORR 2002»
13 years 7 months ago
Polynomial Time Data Reduction for Dominating Set
Dealing with the NP-complete Dominating Set problem on graphs, we demonstrate the power of data reduction by preprocessing from a theoretical as well as a practical side. In parti...
Jochen Alber, Michael R. Fellows, Rolf Niedermeier