Sciweavers

7840 search results - page 141 / 1568
» On generalized Ramsey numbers
Sort
View
MSCS
2006
93views more  MSCS 2006»
13 years 10 months ago
Uniform regular enumerations
Abstract. In the paper we introduce and study the uniform regular enumerations for arbitrary recursive ordinals. As an application of the technique we obtain a uniform generalizati...
Ivan N. Soskov, Bogomil Kovachev
CSDA
2002
77views more  CSDA 2002»
13 years 10 months ago
Numerically stable cointegration analysis
Cointegration analysis involves the solution of a generalized eigenproblem involving moment matrices and inverted moment matrices. These formulae are unsuitable for actual computa...
Jurgen A. Doornik, R. J. O'Brien
DAM
2007
107views more  DAM 2007»
13 years 10 months ago
Eliminating graphs by means of parallel knock-out schemes
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic,...
SIGMOD
2005
ACM
97views Database» more  SIGMOD 2005»
14 years 11 months ago
Incognito: Efficient Full-Domain K-Anonymity
A number of organizations publish microdata for purposes such as public health and demographic research. Although attributes that clearly identify individuals, such as Name and So...
Kristen LeFevre, David J. DeWitt, Raghu Ramakrishn...
ASIACRYPT
2000
Springer
14 years 3 months ago
On the Pseudorandomness of Top-Level Schemes of Block Ciphers
Block ciphers are usually based on one top-level scheme into which we plug “round functions”. To analyze security, it is important to study the intrinsic security provided by t...
Shiho Moriai, Serge Vaudenay