Sciweavers

218 search results - page 37 / 44
» Subexponential Algorithms for Unique Games and Related Probl...
Sort
View
STOC
2005
ACM
93views Algorithms» more  STOC 2005»
14 years 8 months ago
Representing hard lattices with O(n log n) bits
We present a variant of the Ajtai-Dwork public-key cryptosystem where the size of the public-key is only O(n log n) bits and the encrypted text/clear text ratio is also O(n log n)...
Miklós Ajtai
STOC
2006
ACM
121views Algorithms» more  STOC 2006»
14 years 8 months ago
Narrow proofs may be spacious: separating space and width in resolution
The width of a resolution proof is the maximal number of literals in any clause of the proof. The space of a proof is the maximal number of clauses kept in memory simultaneously if...
Jakob Nordström
EMSOFT
2005
Springer
14 years 2 months ago
Deeply embedded XML communication: towards an interoperable and seamless world
Current consumer electronics devices do not interoperate and are hard to use. Devices use proprietary, device-specific and inflexible protocols. Resources across device classes, s...
Johannes Helander
ICCAD
1997
IEEE
76views Hardware» more  ICCAD 1997»
14 years 20 days ago
Simulation methods for RF integrated circuits
Abstract — The principles employed in the development of modern RF simulators are introduced and the various techniques currently in use, or expected to be in use in the next few...
Kenneth S. Kundert
IUI
2006
ACM
14 years 2 months ago
Automatic construction of personalized customer interfaces
Interface personalization can improve a user’s performance and subjective impression of interface quality and responsiveness. Personalization is difficult to implement as it req...
Robert Price, Russell Greiner, Gerald Häubl, ...