526 search results - page 3 / 106 » Increments of Random Partitions |
RSA
1998
13 years 5 months ago
1998
: For a pair of integers 1F␥-r, the ␥-chromatic number of an r-uniform Ž .hypergraph Hs V, E is the minimal k, for which there exists a partition of V into subsets < <T ...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
: We give the first combinatorial approximation algorithm for MAXCUT that beats the trivial 0.5 factor by a constant. The main partitioning procedure is very intuitive, natural, an...
WSC
2007
13 years 8 months ago
2007
We consider the problem of efficient estimation of first passage time probabilities for a multidimensional random walk with t distributed increments, via simulation. In addition...
ASPDAC
2009
ACM
14 years 8 days ago
2009
ACM
— Power distribution networks (PDNs) are designed and analyzed iteratively. Random walk is among the most efficient methods for PDN analysis. We develop in this paper an increme...
ER
2001
Springer
13 years 10 months ago
2001
Springer
A Data Warehouse (DW) can be used to integrate data from multiple distributed data sources. A DW can be seen as a set of materialized views that determine its schema and its conten...