Results 1  10
of
2,693,254
On the maximum number . . .
, 2008
"... Given a finite set P ⊆ R d, called a pattern, tP (n) denotes the maximum number of translated copies of P determined by n points in R d. We give the exact value of tP (n) when P is a rational simplex, that is, the points of P are rationally affinely independent. In this case, we prove that tP (n) = ..."
Abstract
 Add to MetaCart
Given a finite set P ⊆ R d, called a pattern, tP (n) denotes the maximum number of translated copies of P determined by n points in R d. We give the exact value of tP (n) when P is a rational simplex, that is, the points of P are rationally affinely independent. In this case, we prove that tP (n
On the maximum number of translates
, 2008
"... Given a finite set P ⊆ Rd, called a pattern, tP (n) denotes the maximum number of translated copies of P determined by n points in Rd. Wegivetheexactvalueof tP (n) when P is a rational simplex, that is, the points of P are rationally affinely independent. In this case, we prove that tP (n) =n − mr ( ..."
Abstract
 Add to MetaCart
Given a finite set P ⊆ Rd, called a pattern, tP (n) denotes the maximum number of translated copies of P determined by n points in Rd. Wegivetheexactvalueof tP (n) when P is a rational simplex, that is, the points of P are rationally affinely independent. In this case, we prove that tP (n) =n − mr
On the maximum number of cliques in a graph
, 2006
"... Abstract. A clique is a set of pairwise adjacent vertices in a graph. We determine the maximum number of cliques in a graph for various graph classes. For example, we prove that the maximum number of cliques in a planar graph with n vertices is 8(n − 2). 1. ..."
Abstract

Cited by 15 (7 self)
 Add to MetaCart
Abstract. A clique is a set of pairwise adjacent vertices in a graph. We determine the maximum number of cliques in a graph for various graph classes. For example, we prove that the maximum number of cliques in a planar graph with n vertices is 8(n − 2). 1.
On the maximum number of decoherent histories
 Phys. Lett. 203 A
, 1995
"... bulletin board ref.: grqc/9409028 It is shown that N 2 is the upper limit for the number of histories in a decohering family of Nstate quantum system. Simple criterion is found for a family of N 2 fine grained decohering histories of GellMann and Hartle to be identical with a family of Griffiths ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
bulletin board ref.: grqc/9409028 It is shown that N 2 is the upper limit for the number of histories in a decohering family of Nstate quantum system. Simple criterion is found for a family of N 2 fine grained decohering histories of GellMann and Hartle to be identical with a family of Griffiths
Maximum Number of Participants:
"... Through handson exploration, participants will discover different types of animal signs that are used to learn about and track animals big and small. ..."
Abstract
 Add to MetaCart
Through handson exploration, participants will discover different types of animal signs that are used to learn about and track animals big and small.
A MaximumEntropyInspired Parser
, 1999
"... We present a new parser for parsing down to Penn treebank style parse trees that achieves 90.1% average precision/recall for sentences of length 40 and less, and 89.5% for sentences of length 100 and less when trained and tested on the previously established [5,9,10,15,17] "stan dard" se ..."
Abstract

Cited by 963 (19 self)
 Add to MetaCart
" sections of the Wall Street Journal tree bank. This represents a 13% decrease in error rate over the best singleparser results on this corpus [9]. The major technical innova tion is the use of a "maximumentropyinspired" model for conditioning and smoothing that let us successfully to test
Assigned Numbers
 STD 2, RFC 1700, USC/Information Sciences Institute
, 1994
"... Status of this Memo ..."
A Maximum Entropy approach to Natural Language Processing
 COMPUTATIONAL LINGUISTICS
, 1996
"... The concept of maximum entropy can be traced back along multiple threads to Biblical times. Only recently, however, have computers become powerful enough to permit the widescale application of this concept to real world problems in statistical estimation and pattern recognition. In this paper we des ..."
Abstract

Cited by 1341 (5 self)
 Add to MetaCart
The concept of maximum entropy can be traced back along multiple threads to Biblical times. Only recently, however, have computers become powerful enough to permit the widescale application of this concept to real world problems in statistical estimation and pattern recognition. In this paper we
THE MAXIMUM NUMBER OF 2 × 2 ODD
"... Abstract. Let A be an m×n, (0, 1)matrix. A submatrix of A is odd if the sum of its entries is an odd integer and even otherwise. The maximum number of 2×2 odd submatrices in a (0, 1)matrix is related to the existence of Hadamard matrices and bounds on Turán numbers. Pinelis [On the minimal number ..."
Abstract
 Add to MetaCart
Abstract. Let A be an m×n, (0, 1)matrix. A submatrix of A is odd if the sum of its entries is an odd integer and even otherwise. The maximum number of 2×2 odd submatrices in a (0, 1)matrix is related to the existence of Hadamard matrices and bounds on Turán numbers. Pinelis [On the minimal
Results 1  10
of
2,693,254