Sciweavers

107 search results - page 5 / 22
» A methodology for creating fast wait-free data structures
Sort
View
CODES
2004
IEEE
15 years 8 months ago
Hardware synthesis from coarse-grained dataflow specification for fast HW/SW cosynthesis
This paper concerns automatic hardware synthesis from data flow graph (DFG) specification for fast HW/SW cosynthesis. A node in DFG represents a coarse grain block such as FIR and...
Hyunuk Jung, Soonhoi Ha
SCIA
2009
Springer
140views Image Analysis» more  SCIA 2009»
15 years 11 months ago
Fast Prototype Based Noise Reduction
This paper introduces a novel method for noise reduction in medical images based on concepts of the Non-Local Means algorithm. The main objective has been to develop a method that ...
Kajsa Tibell, Hagen Spies, Magnus Borga
ICCAD
2003
IEEE
114views Hardware» more  ICCAD 2003»
16 years 1 months ago
A Novel Geometric Algorithm for Fast Wire-Optimized Floorplanning
As the size and complexity of VLSI circuits increase, the need for faster floorplanning algorithms also grows. In this work we introduce Traffic, a new method for creating wire- a...
Peter G. Sassone, Sung Kyu Lim
ESANN
2006
15 years 5 months ago
An algorithm for fast and reliable ESOM learning
The training of Emergent Self-organizing Maps (ESOM ) with large datasets can be a computationally demanding task. Batch learning may be used to speed up training. It is demonstrat...
Mario Nöcker, Fabian Mörchen, Alfred Ult...
VMCAI
2007
Springer
15 years 10 months ago
Constructing Specialized Shape Analyses for Uniform Change
Abstract. This paper is concerned with one of the basic problems in abstract interpretation, namely, for a given abstraction and a given set of concrete transformers (that express ...
Tal Lev-Ami, Mooly Sagiv, Neil Immerman, Thomas W....