Sciweavers

5056 search results - page 486 / 1012
» Network Coding Theory
Sort
View
CORR
2008
Springer
85views Education» more  CORR 2008»
15 years 5 months ago
Ranking and Unranking of Hereditarily Finite Functions and Permutations
Prolog's ability to return multiple answers on backtracking provides an elegant mechanism to derive reversible encodings of combinatorial objects as Natural Numbers i.e. ranki...
Paul Tarau
147
Voted
DCC
2010
IEEE
15 years 5 months ago
On multiple caps in finite projective spaces
In this paper, we consider new results on (k, n)-caps with n > 2. We provide a lower bound on the size of such caps. Furthermore, we generalize two product constructions for (k,...
Yves Edel, Ivan N. Landjev
150
Voted
CORR
2006
Springer
98views Education» more  CORR 2006»
15 years 5 months ago
A field-theory motivated approach to symbolic computer algebra
Field theory is an area in physics with a deceptively compact notation. Although general purpose computer algebra systems, built around generic list-based data structures, can be ...
Kasper Peeters
JACM
2006
112views more  JACM 2006»
15 years 5 months ago
Linear work suffix array construction
Suffix trees and suffix arrays are widely used and largely interchangeable index structures on strings and sequences. Practitioners prefer suffix arrays due to their simplicity an...
Juha Kärkkäinen, Peter Sanders, Stefan B...
154
Voted
LISP
2008
101views more  LISP 2008»
15 years 5 months ago
Flow-sensitive type systems and the ambient calculus
The Ambient Calculus was developed by Cardelli and Gordon as a formal framework to study issues of mobility and migrant code. Numerous analyses have been developed for numerous va...
Torben Amtoft