50 search results - page 5 / 10 » Construction of expanders and superconcentrators using Kolmo... |
DCC
2008
IEEE
14 years 7 months ago
2008
IEEE
Let Fq be a finite field and consider an extension Fqn where an optimal normal element exists. Using the trace of an optimal normal element in Fqn , we provide low complexity norma...
STOC
1994
ACM
13 years 11 months ago
1994
ACM
We define pseudorandom generators for Yao's twoparty communication complexity model and exhibit a simple construction, based on expanders, for it. We then use a recursive com...
ENTCS
2008
13 years 7 months ago
2008
This paper initiates the study of sets in Euclidean space Rn (n 2) that are defined in terms of the dimensions of their elements. Specifically, given an interval I [0, 1], we ar...
SIGMETRICS
2010
ACM
14 years 8 days ago
2010
ACM
Perhaps surprisingly, no practical performance models exist for popular (and complex) client applications such as Adobe’s Creative Suite, Microsoft’s Office and Visual Studio...
WSC
2004
13 years 8 months ago
2004
From the perspective of flow analysis, the more complex the project, the more wastes are prone to build up, due to the increasing number of interfaces between activities. When pro...