Sciweavers

11565 search results - page 120 / 2313
» Computing Minimal Mappings
Sort
View
146
Voted
ISMB
1993
15 years 5 months ago
Minimizing Complexity in Cellular Automata Models of Self-Replication
Understanding self-replication from an information processing perspective is important because, amongother things, it can shed light on molecular mechanismsof biological reproduct...
James A. Reggia, Hui-Hsien Chou, Steven L. Armentr...
ICCAD
2007
IEEE
113views Hardware» more  ICCAD 2007»
16 years 28 days ago
Combinational and sequential mapping with priority cuts
An algorithm for technology mapping of combinational and sequential logic networks is proposed and applied to mapping into K-input lookup-tables (K-LUTs). The new algorithm avoids...
Alan Mishchenko, Sungmin Cho, Satrajit Chatterjee,...
SIGGRAPH
2000
ACM
15 years 8 months ago
Deep shadow maps
We introduce deep shadow maps, a technique that produces fast, high-quality shadows for primitives such as hair, fur, and smoke. Unlike traditional shadow maps, which store a sing...
Tom Lokovic, Eric Veach
145
Voted
WCE
2007
15 years 5 months ago
Transformation Model Estimation for Point Matching Via Gaussian Processes
—One of main issues in point matching is the choice of the mapping function and the computation of its optimal hyperparameters. In this paper, we propose an attractive approach t...
Xin Yu, Jin-Wen Tian, Jian Liu
ISVC
2005
Springer
15 years 9 months ago
A Vectorial Self-dual Morphological Filter Based on Total Variation Minimization
We present a vectorial self dual morphological filter. Contrary to many methods, our approach does not require the use of an ordering on vectors. It relies on the minimization of ...
Jérôme Darbon, Sylvain Peyronnet