Sciweavers

79 search results - page 5 / 16
» A Result in Dual Ramsey Theory
Sort
View
66
Voted
APAL
2004
105views more  APAL 2004»
14 years 9 months ago
Dual weak pigeonhole principle, Boolean complexity, and derandomization
We study the extension (introduced as BT in [5]) of the theory S1 2 by instances of the dual (onto) weak pigeonhole principle for p-time functions, dWPHP(PV )x x2 . We propose a n...
Emil Jerábek
GLVLSI
2009
IEEE
159views VLSI» more  GLVLSI 2009»
15 years 4 months ago
On the complexity of graph cuboidal dual problems for 3-D floorplanning of integrated circuit design
This paper discusses the impact of migrating from 2-D to 3-D on floorplanning and placement. By looking at a basic formulation of graph cuboidal dual problem, we show that the 3-...
Renshen Wang, Chung-Kuan Cheng
120
Voted
CODASPY
2012
13 years 5 months ago
Comparison-based encryption for fine-grained access control in clouds
Access control is one of the most important security mechanisms in cloud computing. However, there has been little work that explores various comparison-based constraints for regu...
Yan Zhu, Hongxin Hu, Gail-Joon Ahn, Mengyang Yu, H...
71
Voted
ADCM
2007
59views more  ADCM 2007»
14 years 9 months ago
Gabor frames by sampling and periodization
By sampling the window of a Gabor frame for L2 (R) belonging to Feichtinger’s algebra, S0(R), one obtains a Gabor frame for l2 (Z). In this article we present a survey of results...
Peter L. Søndergaard
SODA
2008
ACM
144views Algorithms» more  SODA 2008»
14 years 11 months ago
Fast dimension reduction using Rademacher series on dual BCH codes
The Fast Johnson-Lindenstrauss Transform (FJLT) was recently discovered by Ailon and Chazelle as a novel technique for performing fast dimension reduction with small distortion fr...
Nir Ailon, Edo Liberty