Sciweavers

696 search results - page 41 / 140
» A class of combinatorial identities
Sort
View
KDID
2004
134views Database» more  KDID 2004»
15 years 3 months ago
Theoretical Bounds on the Size of Condensed Representations
Abstract. Recent studies demonstrate the usefulness of condensed representations as a semantic compression technique for the frequent itemsets. Especially in inductive databases, c...
Nele Dexters, Toon Calders
DCG
2006
68views more  DCG 2006»
15 years 2 months ago
The Stirling Polynomial of a Simplicial Complex
We introduce a new encoding of the face numbers of a simplicial complex, its Stirling polynomial, that has a simple expression obtained by multiplying each face number with an app...
Gábor Hetyei
EJC
2006
15 years 2 months ago
Old and young leaves on plane trees
Abstract. A leaf of a plane tree is called an old leaf if it is the leftmost child of its parent, and it is called a young leaf otherwise. In this paper we enumerate plane trees wi...
William Y. C. Chen, Emeric Deutsch, Sergi Elizalde
PODC
1999
ACM
15 years 6 months ago
Optimal, Distributed Decision-Making: The Case of no Communication
We present a combinatorial framework for the study of a natural class of distributed optimization problems that involve decisionmaking by a collection of n distributed agents in th...
Marios Mavronicolas, Paul G. Spirakis
DM
2010
96views more  DM 2010»
15 years 2 months ago
On well-rounded sublattices of the hexagonal lattice
Abstract. We produce an explicit parameterization of well-rounded sublattices of the hexagonal lattice in the plane, splitting them into similarity classes. We use this parameteriz...
Lenny Fukshansky, Daniel Moore, R. Andrew Ohana, W...