Sciweavers

718 search results - page 13 / 144
» Timing Yield Calculation Using an Impulse-Train Approach
Sort
View
IACR
2011
124views more  IACR 2011»
12 years 7 months ago
Using the Cloud to Determine Key Strengths
We develop a new methodology to assess cryptographic key strength using cloud computing, by calculating the true economic cost of (symmetric- or private-) key retrieval for the mos...
Thorsten Kleinjung, Arjen K. Lenstra, Dan Page, Ni...
CVPR
2007
IEEE
14 years 9 months ago
A Graph Cut Approach to Image Segmentation in Tensor Space
This paper proposes a novel method to apply the standard graph cut technique to segmenting multimodal tensor valued images. The Riemannian nature of the tensor space is explicitly...
Allen Tannenbaum, James G. Malcolm, Yogesh Rathi
CORR
2008
Springer
124views Education» more  CORR 2008»
13 years 7 months ago
A New Upper Bound for Max-2-Sat: A Graph-Theoretic Approach
In MaxSat, we ask for an assignment which satisfies the maximum number of clauses for a boolean formula in CNF. We present an algorithm yielding a run time upper bound of O (2 K 6....
Daniel Raible, Henning Fernau
PE
2002
Springer
111views Optimization» more  PE 2002»
13 years 7 months ago
Forwarders vs. centralized server: an evaluation of two approaches for locating mobile agents
This paper evaluates and compares the performance of two approaches for locating an agent in a mobile agent environment. The first approach dynamically creates a chain of forwarde...
Sara Alouf, Fabrice Huet, Philippe Nain
CGF
2006
132views more  CGF 2006»
13 years 7 months ago
Verification of Physically Based Rendering Algorithms
Within computer graphics, the field of predictive rendering is concerned with those methods of image synthesis which yield results that do not only look real, but are also radiome...
Christiane Ulbricht, Alexander Wilkie, Werner Purg...