Sciweavers

714 search results - page 120 / 143
» An efficient algorithm for positive realizations
Sort
View
SAS
1994
Springer
159views Formal Methods» more  SAS 1994»
14 years 17 days ago
Iterative Fixed Point Computation for Type-Based Strictness Analysis
Amtoft has formulated an "on-line" constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normaliz...
Fritz Henglein
DAC
2010
ACM
13 years 8 months ago
Instruction cache locking using temporal reuse profile
The performance of most embedded systems is critically dependent on the average memory access latency. Improving the cache hit rate can have significant positive impact on the per...
Yun Liang, Tulika Mitra
IJCV
2008
192views more  IJCV 2008»
13 years 8 months ago
Learning to Locate Informative Features for Visual Identification
Object identification (OID) is specialized recognition where the category is known (e.g. cars) and the algorithm recognizes an object's exact identity (e.g. Bob's BMW). ...
Andras Ferencz, Erik G. Learned-Miller, Jitendra M...
ICCAD
2009
IEEE
147views Hardware» more  ICCAD 2009»
13 years 6 months ago
SAT-based protein design
Computational protein design can be formulated as an optimization problem, where the objective is to identify the sequence of amino acids that minimizes the energy of a given prot...
Noah Ollikainen, Ellen Sentovich, Carlos Coelho, A...
MVA
1992
159views Computer Vision» more  MVA 1992»
13 years 9 months ago
Qualitative Visual Interpretation of 3d Hand Gestures Using Motion Parallax
We present an efficient and geometrically intuitive algorithm to reliably interpret the image velocities of moving objects in 3D. It is well known that in a small neighbourhood th...
Roberto Cipolla, Yasukazu Okamoto, Yoshinori Kuno