215 search results - page 28 / 43 » On the number of factorizations of a full cycle |
105
Voted
TAMC
2010
Springer
15 years 3 months ago
2010
Springer
In this paper, we investigate partial words, or finite sequences that may have some undefined positions called holes, of maximum subword complexity. The subword complexity functi...
ECML
2006
Springer
15 years 3 months ago
2006
Springer
In this paper we formulate the problem of grouping the states of a discrete Markov chain of arbitrary order simultaneously with deconvolving its transition probabilities. As the na...
FPL
2006
Springer
15 years 3 months ago
2006
Springer
High-performance document clustering systems enable similar documents to automatically self-organize into groups. In the past, the large amount of computational time needed to clu...
RT
2000
Springer
15 years 3 months ago
2000
Springer
The photon map method allows efficient computation of global illumination in general scenes. Individual photon hits, generated using Monte Carlo particle tracing, are stored in the...
103
click to vote
HUC
2010
Springer
15 years 23 days ago
2010
Springer
A fairly common modern setting entails users, each in possession of a personal wireless device, wanting to communicate securely, via their devices. If these users (and their devic...