Sciweavers

1969 search results - page 96 / 394
» Financial Theory 1
Sort
View
SIGCSE
1994
ACM
115views Education» more  SIGCSE 1994»
14 years 2 months ago
LLparse and LRparse: visual and interactive tools for parsing
This paper describes instructional tools, LLparse and LRparse, for visualizing and interacting with small examples of LL and LR parsing. These tools can be used to understand the ...
Stephen A. Blythe, Michael C. James, Susan H. Rodg...
ALGORITHMICA
2006
74views more  ALGORITHMICA 2006»
13 years 10 months ago
On the Number of t-Ary Trees with a Given Path Length
We show that the number of t-ary trees with path length equal to p is t h(t-1) tp log2 p(1+o(1)) , where h(x)=-x log2 x-(1-x) log2(1-x) is the binary entropy function. Besides its...
Gadiel Seroussi
JGT
2008
83views more  JGT 2008»
13 years 10 months ago
Monochromatic Hamiltonian t-tight Berge-cycles in hypergraphs
Abstract: In any r-uniform hypergraph H for 2 t r we define an runiform t-tight Berge-cycle of length , denoted by C(r,t) , as a sequence of distinct vertices v1, v2, . . . , v ,...
Paul Dorbec, Sylvain Gravier, Gábor N. S&aa...
JCT
2006
73views more  JCT 2006»
13 years 10 months ago
Colouring lines in projective space
Let V be a vector space of dimension v over a field of order q. The q-Kneser graph has the kdimensional subspaces of V as its vertices, where two subspaces and are adjacent if and...
Ameera Chowdhury, Chris D. Godsil, Gordon F. Royle
CC
2010
Springer
117views System Software» more  CC 2010»
13 years 7 months ago
Efficiently Certifying Non-Integer Powers
We describe a randomized algorithm that, given an integer a, produces a certificate that the integer is not a pure power of an integer in expected (log a)1+o(1) bit operations unde...
Erich Kaltofen, Mark Lavin