Sciweavers

256 search results - page 7 / 52
» Timing Verification by Successive Approximation
Sort
View
DPHOTO
2010
208views Hardware» more  DPHOTO 2010»
14 years 9 days ago
A signature analysis based method for elliptical shape
The high level context image analysis regards many fields as face recognition, smile detection, automatic red eye removal, iris recognition, fingerprint verification, etc. Techniq...
Ivana Guarneri, Mirko Guarnera, Giuseppe Messina, ...
EMSOFT
2004
Springer
14 years 4 months ago
Approximation of the worst-case execution time using structural analysis
We present a technique to approximate the worst-case execution time that combines structural analysis with a loop-bounding algorithm based on local induction variable analysis. St...
Matteo Corti, Thomas R. Gross
SODA
2008
ACM
122views Algorithms» more  SODA 2008»
14 years 8 days ago
Fast approximation of the permanent for very dense problems
Approximation of the permanent of a matrix with nonnegative entries is a well studied problem. The most successful approach to date for general matrices uses Markov chains to appr...
Mark Huber, Jenny Law
WWW
2005
ACM
14 years 11 months ago
Static approximation of dynamically generated Web pages
Server-side programming is one of the key technologies that support today's WWW environment. It makes it possible to generate Web pages dynamically according to a user's...
Yasuhiko Minamide
CAV
2003
Springer
188views Hardware» more  CAV 2003»
14 years 2 months ago
Thread-Modular Abstraction Refinement
odular Abstraction Refinement Thomas A. Henzinger1 , Ranjit Jhala1 , Rupak Majumdar1 , and Shaz Qadeer2 1 University of California, Berkeley 2 Microsoft Research, Redmond Abstract....
Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar,...