Sciweavers

1008 search results - page 74 / 202
» Minimizing Average Flow-Time
Sort
View
DAC
1994
ACM
14 years 2 months ago
Partitioning Very Large Circuits Using Analytical Placement Techniques
A new partitioningapproach for very largecircuits is described. We demonstrate that applying a recently developed analytical placement algorithm, that pro ts from a linear objecti...
Bernhard M. Riess, Konrad Doll, Frank M. Johannes
ACIVS
2008
Springer
14 years 4 hour ago
An Efficient Hardware Architecture without Line Memories for Morphological Image Processing
In this paper, we present a novel hardware architecture to achieve erosion and dilation with a large structuring element. We are proposing a modification of HGW algorithm with a bl...
Christophe Clienti, Michel Bilodeau, Serge Beucher
ICASSP
2010
IEEE
13 years 10 months ago
Distance-based discretization of parametric signal manifolds
The characterization of signals and images in manifolds often lead to efficient dimensionality reduction algorithms based on manifold distance computation for analysis or classi...
Elif Vural, Pascal Frossard
MCM
2011
13 years 5 months ago
The Das-Moser commutator closure for filtering through a boundary is well-posed
When filtering through a wall with constant averaging radius, in addition to the subfilter scale stresses, a non-closed commutator term arises. We consider a proposal of Das and ...
William Layton, Catalin Trenchea
PC
2011
314views Management» more  PC 2011»
13 years 5 months ago
Restart strategies in optimization: parallel and serial cases
This paper addresses the problem of minimizing the average running time of the Las Vegas type algorithm, both in serial and parallel setups. The necessary conditions for the exist...
Oleg V. Shylo, Timothy Middelkoop, Panos M. Pardal...