5056 search results - page 467 / 1012 » Network Coding Theory |
138
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
The paper is organized as a self-contained literate Haskell program that implements elements of an executable finite set theory with focus on combinatorial generation and arithmet...
157
Voted
FUIN
2008
15 years 5 months ago
2008
Abstract. Approximation of an image by the attractor evolved through iterations of a set of contractive maps is usually known as fractal image compression. The set of maps is calle...
153
Voted
CORR
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constr...
170
click to vote
DAM
2007
15 years 5 months ago
2007
Primitive words, or strings over a finite alphabet that cannot be written as a power of another string, play an important role in numerous research areas including formal language...
160
Voted
JCT
2006
15 years 5 months ago
2006
When Jack van Lint was appointed as full professor at the Eindhoven University of Technology at the age of 26 he combined a PhD in number theory with a very open scientific mind. ...