Sciweavers

15485 search results - page 285 / 3097
» Computing Optimal Subsets
Sort
View
PSD
2004
Springer
132views Database» more  PSD 2004»
15 years 12 months ago
Computational Experiments with Minimum-Distance Controlled Perturbation Methods
Minimum-distance controlled perturbation is a recent family of methods for the protection of statistical tabular data. These methods are both efficient and versatile, since can dea...
Jordi Castro
185
Voted
EUROPAR
2001
Springer
15 years 11 months ago
A Software Architecture for User Transparent Parallel Image Processing on MIMD Computers
Abstract. This paper describes a software architecture that allows image processing researchers to develop parallel applications in a transparent manner. The architecture’s main ...
Frank J. Seinstra, Dennis Koelma, Jan-Mark Geusebr...
ASPDAC
2007
ACM
105views Hardware» more  ASPDAC 2007»
15 years 10 months ago
An Efficient Computation of Statistically Critical Sequential Paths Under Retiming
Abstract-- In this paper we present the Statistical Retimingbased Timing Analysis (SRTA) algorithm. The goal is to compute the timing slack distribution for the nodes in the timing...
Mongkol Ekpanyapong, Xin Zhao, Sung Kyu Lim
182
Voted
EUROGP
2000
Springer
177views Optimization» more  EUROGP 2000»
15 years 10 months ago
Register Based Genetic Programming on FPGA Computing Platforms
The use of FPGA based custom computing platforms is proposed for implementing linearly structured Genetic Programs. Such a context enables consideration of micro architectural and ...
Malcolm I. Heywood, A. Nur Zincir-Heywood
SIROCCO
2003
15 years 8 months ago
Polynomial-Time Computable Backup Tables for Shortest-Path Routing
For networks employing shortest-path routing, we introduce a new recovery scheme which needs only one backup routing table. By precomputing this backup table, the network recovers...
Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihi...