Sciweavers

111 search results - page 11 / 23
» Fast Algorithm and Implementation of Dissimilarity Self-Orga...
Sort
View
TCBB
2011
14 years 4 months ago
Accurate Construction of Consensus Genetic Maps via Integer Linear Programming
—We study the problem of merging genetic maps, when the individual genetic maps are given as directed acyclic graphs. The computational problem is to build a consensus map, which...
Yonghui Wu, Timothy J. Close, Stefano Lonardi
SMA
2010
ACM
231views Solid Modeling» more  SMA 2010»
14 years 10 months ago
Fast and robust retrieval of Minkowski sums of rotating convex polyhedra in 3-space
We present a novel method for fast retrieval of exact Minkowski sums of pairs of convex polytopes in R3 , where one of the polytopes keeps rotating. The algorithm is based on pre-...
Naama Mayer, Efi Fogel, Dan Halperin
TVLSI
2008
133views more  TVLSI 2008»
14 years 9 months ago
A Medium-Grain Reconfigurable Architecture for DSP: VLSI Design, Benchmark Mapping, and Performance
Reconfigurable hardware has become a well-accepted option for implementing digital signal processing (DSP). Traditional devices such as field-programmable gate arrays offer good fi...
Mitchell J. Myjak, José G. Delgado-Frias
ICIAR
2004
Springer
15 years 3 months ago
A Fast Probabilistic Bidirectional Texture Function Model
The bidirectional texture function (BTF) describes rough texture appearance variations due to varying illumination and viewing conditions. Such a function consists of thousands of ...
Michal Haindl, Jirí Filip
ICCAD
1993
IEEE
134views Hardware» more  ICCAD 1993»
15 years 1 months ago
Beyond the combinatorial limit in depth minimization for LUT-based FPGA designs
In this paper, we present an integrated approach to synthesis and mapping to go beyond the combinatorial limit set up by the depth-optimal FlowMap algorithm. The new algorithm, na...
Jason Cong, Yuzheng Ding