Sciweavers

3598 search results - page 105 / 720
» New efficient algorithms for computing effective capacitance
Sort
View
CCS
2009
ACM
16 years 3 months ago
A new hash family obtained by modifying the SHA-2 family
In this work, we study several properties of the SHA-2 design which have been utilized in recent collision attacks against reduced round SHA-2. Small modifications to the SHA-2 des...
Somitra Kumar Sanadhya, Palash Sarkar
85
Voted
ICPR
2008
IEEE
15 years 9 months ago
Computational approaches for real-time extraction of soft biometrics
Soft biometrics, as a prescreening filter, contribute to a much smaller candidate pool and allow the overall query to perform better and faster. In this paper, we focus on the eff...
Yang Ran, Gavin Rosenbush, Qinfen Zheng
119
Voted
VLSID
1999
IEEE
87views VLSI» more  VLSID 1999»
15 years 6 months ago
Optimal Retiming for Initial State Computation
Retiming is a transformation that optimizes a sequential circuit by relocating the registers. When the circuit has an initial state, one must compute an equivalent initial state f...
Peichen Pan, Guohua Chen
AAAI
1998
15 years 3 months ago
Fast Transformation of Temporal Plans for Efficient Execution
Temporal plans permit significant flexibility in specifying the occurrence time of events. Plan execution can make good use of that flexibility. However, the advantage of executio...
Ioannis Tsamardinos, Nicola Muscettola, Paul H. Mo...
CGF
2008
153views more  CGF 2008»
15 years 2 months ago
Computing Local Signed Distance Fields for Large Polygonal Models
The signed distance field for a polygonal model is a useful representation that facilitates efficient computation in many visualization and geometric processing tasks. Often it is...
Byungjoon Chang, Deukhyun Cha, Insung Ihm