107 search results - page 7 / 22 » Counting with rational generating functions |
TCS
2008
13 years 8 months ago
2008
A large class of q-distributions is defined on the stochastic model of Bernoulli trials in which the probability of success (=advancing to the next level) depends geometrically on...
COMBINATORICS
2007
13 years 8 months ago
2007
The idea of graph compositions, which was introduced by A. Knopfmacher and M. E. Mays, generalizes both ordinary compositions of positive integers and partitions of finite sets. ...
TACAS
2010
Springer
14 years 3 months ago
2010
Springer
Ranking function synthesis is a key aspect to the success of modern termination provers for imperative programs. While it is wellknown how to generate linear ranking functions for ...
ICASSP
2011
IEEE
13 years 10 days ago
2011
IEEE
This paper presents a new method for extracting orthogonal bases from AM-FM signals. Since AM-FM signals are non-stationary, appropriate basis functions are sought provided that i...
INFOCOM
2012
IEEE
11 years 11 months ago
2012
IEEE
Abstract—In this paper, we introduce FlowSifter, a systematic framework for online application protocol field extraction. FlowSifter introduces a new grammar model Counting Regu...