Sciweavers

1208 search results - page 89 / 242
» On Counting Generalized Colorings
Sort
View
COMBINATORICS
2006
137views more  COMBINATORICS 2006»
13 years 9 months ago
Three-Letter-Pattern-Avoiding Permutations and Functional Equations
We present an algorithm for finding a system of recurrence relations for the number of permutations of length n that satisfy a certain set of conditions. A rewriting of these rela...
Ghassan Firro, Toufik Mansour
COMBINATORICS
1998
80views more  COMBINATORICS 1998»
13 years 9 months ago
Increasing Subsequences and the Classical Groups
We show that the moments of the trace of a random unitary matrix have combinatorial interpretations in terms of longest increasing subsequences of permutations. To be precise, we s...
Eric M. Rains
HT
2010
ACM
13 years 6 months ago
On the robustness of google scholar against spam
In this poster we present the current results of several experiments in which we analyzed whether spamming Google Scholar is possible. Our results show, it is possible: We ,,impro...
Jöran Beel, Bela Gipp
ICDT
2009
ACM
128views Database» more  ICDT 2009»
14 years 10 months ago
Efficient asymmetric inclusion between regular expression types
The inclusion of Regular Expressions (REs) is the kernel of any type-checking algorithm for XML manipulation languages. XML applications would benefit from the extension of REs wi...
Dario Colazzo, Giorgio Ghelli, Carlo Sartiani
CORR
2010
Springer
44views Education» more  CORR 2010»
13 years 9 months ago
Evolution of National Nobel Prize Shares in the 20th Century
We analyze the evolution of cumulative national shares of Nobel Prizes since 1901, properly taking into account that most prizes were divided among several laureates. We rank by c...
Jürgen Schmidhuber