Sciweavers

2412 search results - page 466 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
EUROCRYPT
2004
Springer
15 years 6 months ago
Positive Results and Techniques for Obfuscation
Informally, an obfuscator O is an efficient, probabilistic “compiler” that transforms a program P into a new program O(P) with the same functionality as P, but such that O(P)...
Ben Lynn, Manoj Prabhakaran, Amit Sahai
148
Voted
FMCAD
2006
Springer
15 years 4 months ago
Design for Verification of the PCI-X Bus
The importance of re-usable Intellectual Properties (IPs) cores is increasing due to the growing complexity of today's system-on-chip and the need for rapid prototyping. In th...
Haja Moinudeen, Ali Habibi, Sofiène Tahar
116
Voted
PODS
2010
ACM
223views Database» more  PODS 2010»
15 years 2 months ago
Characterizing schema mappings via data examples
Schema mappings are high-level specifications that describe the relationship between two database schemas; they are considered to be the essential building blocks in data exchange...
Bogdan Alexe, Phokion G. Kolaitis, Wang Chiew Tan
LISA
1994
15 years 1 months ago
The Group Administration Shell and the GASH Network Computing Environment
Managing large scale UNIX networks so that users can use resources on multiple systems is traditionally performed using NIS, NFS, and DNS. Proper use of these tools requires exact...
Jonathan Abbey
SPRINGSIM
2007
15 years 1 months ago
Modeling and analysis of worm defense using stochastic activity networks
— Stochastic activity networks (SANs) are a widely used formalism for describing complex systems that have random behavior. Sophisticated software tools exist for the modeling an...
David M. Nicol, Steve Hanna, Frank Stratton, Willi...