Sciweavers

334 search results - page 46 / 67
» Improved Algorithms and Complexity Results for Power Dominat...
Sort
View
CVPR
2004
IEEE
14 years 10 months ago
Efficient Belief Propagation for Early Vision
Markov random field models provide a robust and unified framework for early vision problems such as stereo, optical flow and image restoration. Inference algorithms based on graph...
Pedro F. Felzenszwalb, Daniel P. Huttenlocher
SACMAT
2006
ACM
14 years 2 months ago
The secondary and approximate authorization model and its application to Bell-LaPadula policies
We introduce the concept, model, and policy-specific algorithms for inferring new access control decisions from previous ones. Our secondary and approximate authorization model (...
Jason Crampton, Wing Leung, Konstantin Beznosov
COLT
2003
Springer
14 years 1 months ago
On Learning to Coordinate: Random Bits Help, Insightful Normal Forms, and Competency Isomorphisms
A mere bounded number of random bits judiciously employed by a probabilistically correct algorithmic coordinator is shown to increase the power of learning to coordinate compared ...
John Case, Sanjay Jain, Franco Montagna, Giulia Si...
ISVLSI
2002
IEEE
129views VLSI» more  ISVLSI 2002»
14 years 1 months ago
Accelerating Retiming Under the Coupled-Edge Timing Model
Retiming has been shown to be a powerful technique for improving the performance of synchronous circuits. However, even though retiming algorithms of polynomial time complexity ha...
Ingmar Neumann, Kolja Sulimma, Wolfgang Kunz
DATE
2008
IEEE
116views Hardware» more  DATE 2008»
14 years 2 months ago
A Variation Aware High Level Synthesis Framework
— The worst-case delay/power of function units has been used in traditional high level synthesis to facilitate design space exploration. As technology scales to nanometer regime,...
Feng Wang 0004, Guangyu Sun, Yuan Xie