Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 11 - 20
of
35
Test Sets for Vertex Cover Problems (Extended Abstract)
, 1999
"... We describe the structure of the unique minimal test set T for a family of vertex cover problems. The set T corresponds to the Gröbner basis of the binomial ideal for the problem as described in [1]. While T has a surprisingly simple structure, in particular when the underlying graph is complete, it ..."
Abstract
- Add to MetaCart
We describe the structure of the unique minimal test set T for a family of vertex cover problems. The set T corresponds to the Gröbner basis of the binomial ideal for the problem as described in [1]. While T has a surprisingly simple structure, in particular when the underlying graph is complete
Proc. Amer. Math. Soc. 129(2001), no. 12, 3471–3478. AN EXTENSION OF LUCAS ’ THEOREM
"... Abstract. Let p be a prime. A famous theorem of Lucas states that ( mp+s) ≡ np+t m) ( s) (mod p) if m, n, s, t are nonnegative integers with s, t < p. In this paper we n t aim to prove a similar result for generalized binomial coefficients defined in terms of second order recurrent sequences with ..."
Abstract
- Add to MetaCart
Abstract. Let p be a prime. A famous theorem of Lucas states that ( mp+s) ≡ np+t m) ( s) (mod p) if m, n, s, t are nonnegative integers with s, t < p. In this paper we n t aim to prove a similar result for generalized binomial coefficients defined in terms of second order recurrent sequences
Xerox Site Report: Four TREC-4 Tracks
- The Fourth Text REtrieval Conference (TREC-4
, 1996
"... this document sample than one would expect by chance. The terms are selected according to a binomial likelihood ratio test [10], comparing their occurrence in the first 20 documents to their occurrence in the rest of the collection. The selected terms are then weighted in proportion to the signific ..."
Abstract
-
Cited by 12 (2 self)
- Add to MetaCart
this document sample than one would expect by chance. The terms are selected according to a binomial likelihood ratio test [10], comparing their occurrence in the first 20 documents to their occurrence in the rest of the collection. The selected terms are then weighted in proportion
Local resilience and Hamiltonicity Maker-Breaker games in random regular graphs
- Combinatorics, Probability, and Computing
"... For an increasing monotone graph property P the local resilience of a graph G with respect to P is the minimal r for which there exists of a subgraph H ⊆ G with all degrees at most r such that the removal of the edges of H from G creates a graph that does not possesses P. This notion, which was impl ..."
Abstract
-
Cited by 13 (5 self)
- Add to MetaCart
is at least (1−ε)d/6. We also prove that for the Binomial random graph model G(n, p), for every positive ε> 0 and large enough values of K, if p> K ln n n then with high probability the local resilience of G(n, p) with respect to being Hamiltonian is at least (1 − ε)np/6. Finally, we apply similar
Improving MPI Multicast Performance over Grid Environment using Intelligent Message Scheduling
- Proceeding of International Conference on Scientific and Engineering Computation
, 2004
"... Abstract: The multicast operation used by MPI under Grid environment can have a substantial impact on performance of parallel applications. Since the finding of an optimal multicast operation is an NP-hard problem, a near-optimal heuristic is crucial for building an efficient MPI runtime. This paper ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Abstract: The multicast operation used by MPI under Grid environment can have a substantial impact on performance of parallel applications. Since the finding of an optimal multicast operation is an NP-hard problem, a near-optimal heuristic is crucial for building an efficient MPI runtime
n p
, 2006
"... These notes accompany a lecture given in the summer of 2006 at the Center for Combinatorics at Nankai University. They are provided as a reference (and especially bibliography) for students new to sharp concentration phenomena. 1 A Basic Problem Perhaps one of the most basic examples in probability ..."
Abstract
- Add to MetaCart
theory is that of the coin flip sequence. We flip a biased coin n times which is heads with probability p, and count the number of occurrences of heads, X. Clearly, X is binomially distributed with parameters n and p. While it is possible that X = n, it is elementary that this probability is vanishingly
Combinatorics Counts TEXTBOOK UNIT OBJECTIVES
"... • Combinatorics is about organization. • Many combinatorial problems involve ways to enumerate, or count, various things in an efficient manner. • The counting function C(n,k), is a powerful tool used to count subsets of a larger set, or give coefficients in binomial expansions. • Bijection—the iden ..."
Abstract
- Add to MetaCart
• Combinatorics is about organization. • Many combinatorial problems involve ways to enumerate, or count, various things in an efficient manner. • The counting function C(n,k), is a powerful tool used to count subsets of a larger set, or give coefficients in binomial expansions. • Bijection
The lacunary, or supersparse, representation of a polynomial
"... We present a deterministic polynomial-time algorithm which computes the multilinear factors of multivariate lacunary polynomials over number fields. It is based on a new Gap theorem which allows to test whether P(X) = ∑kj=1 ajX αj(vX+ t)β j(uX+ w)γj is identically zero in polynomial time. Previous ..."
Abstract
- Add to MetaCart
-tivariate lacunary polynomials of finite fields of large characteristic. We provide NP-hardness results to explain our inability to compute binomial factors.
1 Problems Computational Geometry- Homework I (Solutions)
"... 1. Tail Bounds: In class, we established that the RANDOMIZED-QUICKSELECT() algorithm runs in expected time O(n), when asked to find the k th largest element in an array of n elements. Argue that there exists a constant c, such that the probability that more than c · n · log n comparisons are made in ..."
Abstract
- Add to MetaCart
in a run of RANDOMIZED-QUICKSELECT() is at most 1 n. Solution: For this problem, we will need the Chernoff bound. Theorem 1.1 Let X1, X2,..., Xn denote the indicator random variables of n Bernoulli trials, each with probability of success p. The random variable X = �n i=1 Xi is a Binomial random
2006) The parameter of preposition stranding: A view from child English. Language Acquisition
"... Introduction In this squib, we investigate the time course of the acquisition of English to evaluate the basic insight of 2. The observed cross-linguistic variation is summarized in Given these syntactic differences between English, French and Icelandic, Predictions for Acquisition The fundamen ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
after the first use of the later construction, and continuing for a total of fifteen transcripts or through the end of the corpus (whichever came first). We then used a Binomial Test to obtain the probability of sampling the observed number of tokens of the earlier construction simply by chance, before
Results 11 - 20
of
35
