Sciweavers

5183 search results - page 1006 / 1037
» The Complexity of Distributions
Sort
View
CCS
2010
ACM
13 years 8 months ago
Modeling attacks on physical unclonable functions
We show in this paper how several proposed Physical Unclonable Functions (PUFs) can be broken by numerical modeling attacks. Given a set of challenge-response pairs (CRPs) of a PU...
Ulrich Rührmair, Frank Sehnke, Jan Sölte...
SAC
2010
ACM
13 years 8 months ago
Graph-based verification of static program constraints
Software artifacts usually have static program constraints and these constraints should be satisfied in each reuse. In addition to this, the developers are also required to satisf...
Selim Ciraci, Pim van den Broek, Mehmet Aksit
SIGCOMM
2010
ACM
13 years 8 months ago
Energy proportionality of an enterprise network
Energy efficiency is becoming increasingly important in the operation of networking infrastructure, especially in enterprise and data center networks. While strategies for lowerin...
Priya Mahadevan, Sujata Banerjee, Puneet Sharma
SIGECOM
2010
ACM
173views ECommerce» more  SIGECOM 2010»
13 years 8 months ago
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna
SOFTVIS
2010
ACM
13 years 8 months ago
Heapviz: interactive heap visualization for program understanding and debugging
Understanding the data structures in a program is crucial to understanding how the program works, or why it doesn't work. Inspecting the code that implements the data structu...
Edward Aftandilian, Sean Kelley, Connor Gramazio, ...
« Prev « First page 1006 / 1037 Last » Next »