Sciweavers

1199 search results - page 217 / 240
» Parameterized Proof Complexity
Sort
View
TII
2010
146views Education» more  TII 2010»
13 years 2 months ago
A Flexible Design Flow for Software IP Binding in FPGA
Software intellectual property (SWIP) is a critical component of increasingly complex field programmable gate arrays (FPGA)-based system-on-chip (SOC) designs. As a result, develop...
Michael A. Gora, Abhranil Maiti, Patrick Schaumont
CORR
2011
Springer
247views Education» more  CORR 2011»
12 years 11 months ago
The Extraordinary SVD
: We review the singular value decomposition (SVD) and discuss some lesser-known applications of it that we find particularly interesting. We also discuss generalizations of the S...
Carla D. Martin, Mason A. Porter
WDAG
2009
Springer
166views Algorithms» more  WDAG 2009»
14 years 2 months ago
New Bounds for the Controller Problem
The (M, W)-controller, originally studied by Afek, Awerbuch, Plotkin, and Saks, is a basic ted tool that provides an abstraction for managing the consumption of a global resource ...
Yuval Emek, Amos Korman
ESAS
2004
Springer
14 years 28 days ago
Public Key Cryptography in Sensor Networks - Revisited
The common perception of public key cryptography is that it is complex, slow and power hungry, and as such not at all suitable for use in ultra-low power environments like wireless...
Gunnar Gaubatz, Jens-Peter Kaps, Berk Sunar
ACISP
2001
Springer
14 years 1 days ago
Private Information Retrieval Based on the Subgroup Membership Problem
Abstract. Many algorithmic problems, which are used to prove the security of a cryptographic system, are shown to be characterized as the subgroup membership problem. We then apply...
Akihiro Yamamura, Taiichi Saito