Sciweavers

208 search results - page 4 / 42
» Improved upper bounds on the crossing number
Sort
View
EUROPAR
2004
Springer
13 years 10 months ago
Improving Data Cache Performance via Address Correlation: An Upper Bound Study
Address correlation is a technique that links the addresses that reference the same data values. Using a detailed source-code level analysis, a recent study [1] revealed that diffe...
Peng-fei Chuang, Resit Sendag, David J. Lilja
SACRYPT
2000
Springer
107views Cryptology» more  SACRYPT 2000»
13 years 9 months ago
Improved Upper Bound on the Nonlinearity of High Order Correlation Immune Functions
It has recently been shown that when m > 1 2 n - 1, the nonlinearity Nf of an mth-order correlation immune function f with n variables satisfies the condition of Nf 2n-1 - 2m ,...
Yuliang Zheng, Xian-Mo Zhang
DCG
2006
96views more  DCG 2006»
13 years 5 months ago
k-Sets, Convex Quadrilaterals, and the Rectilinear Crossing Number of Kn
We use circular sequences to give an improved lower bound on the minimum number of ( k)
József Balogh, Gelasio Salazar
ENDM
2008
101views more  ENDM 2008»
13 years 5 months ago
A central approach to bound the number of crossings in a generalized configuration
A generalized configuration is a set of n points and n 2 pseudolines such that each pseudoline passes through exactly two points, two pseudolines intersect exactly once, and no th...
Bernardo M. Ábrego, Silvia Fernández...
SODA
2003
ACM
103views Algorithms» more  SODA 2003»
13 years 6 months ago
On the rectilinear crossing number of complete graphs
We prove a lower bound of 0.3288   n 4¡ for the rectilinear crossing number cr(Kn) of a complete graph on n vertices, or in other words, for the minimum number of convex quadril...
Uli Wagner