Sciweavers

2283 search results - page 277 / 457
» Bounds of Graph Characteristics
Sort
View
CORR
2007
Springer
85views Education» more  CORR 2007»
13 years 8 months ago
A multivariate interlace polynomial
We define a multivariate polynomial that generalizes in a unified way the twovariable interlace polynomial defined by Arratia, Bollob´as and Sorkin on the one hand, and a one-...
Bruno Courcelle
VLSISP
2008
111views more  VLSISP 2008»
13 years 8 months ago
Design Methodology for Throughput Optimum Architectures of Hash Algorithms of the MD4-class
Abstract. In this paper we propose an architecture design methodology to optimize the throughput of MD4-based hash algorithms. The proposed methodology includes an iteration bound ...
Yong Ki Lee, Herwin Chan, Ingrid Verbauwhede
DM
2000
158views more  DM 2000»
13 years 8 months ago
Bipartite Ramsey numbers and Zarankiewicz numbers
The Zarankiewicz number z(s, m) is the maximum number of edges in a subgraph of K(s, s) that does not contain K(m, m) as a subgraph. The bipartite Ramsey number b(m, n) is the lea...
Wayne Goddard, Michael A. Henning, Ortrud R. Oelle...
CORR
2002
Springer
95views Education» more  CORR 2002»
13 years 8 months ago
Qualitative Visualization of Distance Information
Different types of two- and three-dimensional representations of a finite metric space are studied that focus on the accurate representation of the linear order among the distance...
Jobst Heitzig
RSA
2002
71views more  RSA 2002»
13 years 8 months ago
The infamous upper tail
Let be a finite index set and k 1 a given integer. Let further S []k be an arbitrary family of k element subsets of . Consider a (binomial) random subset p of , where p = (pi :...
Svante Janson, Andrzej Rucinski