Sciweavers

123 search results - page 7 / 25
» Counting inversions in lists
Sort
View
SIGSOFT
2010
ACM
13 years 5 months ago
Representation dependence testing using program inversion
The definition of a data structure may permit many different concrete representations of the same logical content. A (client) program that accepts such a data structure as input i...
Aditya Kanade, Rajeev Alur, Sriram K. Rajamani, Ga...
COLING
2002
13 years 7 months ago
Extension of Zipf's Law to Words and Phrases
Zipf's law states that the frequency of word tokens in a large corpus of natural language is inversely proportional to the rank. The law is investigated for two languages Eng...
Le Quan Ha, Elvira I. Sicilia-Garcia, Ji Ming, F. ...
INFOCOM
2009
IEEE
14 years 2 months ago
Robust Counting Via Counter Braids: An Error-Resilient Network Measurement Architecture
—A novel counter architecture, called Counter Braids, has recently been proposed for accurate per-flow measurement on high-speed links. Inspired by sparse random graph codes, Co...
Yi Lu, Balaji Prabhakar
DM
1998
66views more  DM 1998»
13 years 7 months ago
Steep polyominoes, q-Motzkin numbers and q-Bessel functions
We introduce three deÿnitions of q-analogs of Motzkin numbers and illustrate some combinatorial interpretations of these q-numbers. We relate the ÿrst class of q-numbers to the ...
Elena Barcucci, Alberto Del Lungo, Jean-Marc Fedou...
EJC
2011
13 years 2 months ago
Enumeration of connected Catalan objects by type
Noncrossing set partitions, nonnesting set partitions, Dyck paths, and rooted plane trees are four classes of Catalan objects which carry a notion of type. There exists a product f...
Brendon Rhoades