507 search results - page 65 / 102 » Sizes of Ordered Decision Trees |
FSE
2006
Springer
13 years 11 months ago
2006
Springer
The security of hash functions has recently become one of the hottest topics in the design and analysis of cryptographic primitives. Since almost all the hash functions used today ...
WG
2005
Springer
14 years 1 months ago
2005
Springer
We prove that for all 0 ≤ t ≤ k and d ≥ 2k, every graph G with treewidth at most k has a ‘large’ induced subgraph H, where H has treewidth at most t and every vertex in ...
UAI
1996
13 years 9 months ago
1996
Many algorithms for processing probabilistic networks are dependent on the topological properties of the problem's structure. Such algorithmse.g., clustering, conditioning ar...
GC
2011
Springer
13 years 2 months ago
2011
Springer
The Ramsey number r(H, Kn) is the smallest positive integer N such that every graph of order N contains either a copy of H or an independent set of size n. The Tur´an number ex(m,...
IPPS
2008
IEEE
14 years 2 months ago
2008
IEEE
Website capacity determination is crucial to measurement-based access control, because it determines when to turn away excessive client requests to guarantee consistent service qu...