Sciweavers

6142 search results - page 74 / 1229
» The Complexity of Partition Functions
Sort
View
JDM
1998
101views more  JDM 1998»
14 years 9 months ago
Fault-Tolerant Quorum Consensus Scheme for Replication Control in Mobile Distributed Database Systems
We propose a new replication control scheme for multiple-copy consistency in mobile distributed database systems. Replicating data at multiple sites could contribute to enhance th...
Siwoo Byun, Songchun Moon
HPDC
2009
IEEE
15 years 4 months ago
Maintaining reference graphs of globally accessible objects in fully decentralized distributed systems
Since the advent of electronic computing, the processors’ clock speed has risen tremendously. Now that energy efficiency requirements have stopped that trend, the number of proc...
Björn Saballus, Thomas Fuhrmann
DAC
2001
ACM
15 years 10 months ago
Factoring and Recognition of Read-Once Functions using Cographs and Normality
An approach for factoring general boolean functions was described in [15, 16] which is based on graph partitioning algorithms. In this paper, we present a very fast algorithm for ...
Martin Charles Golumbic, Aviad Mintz, Udi Rotics
DCG
2002
71views more  DCG 2002»
14 years 9 months ago
A Polytope Related to Empirical Distributions, Plane Trees, Parking Functions, and the Associahedron
The volume of the n-dimensional polytope nx := fy 2 Rn : yi 0 and y1 + + yi x1 + + xi for all 1 i ng for arbitrary x := x1; : : : ; xn with xi 0 for all i de nes a polyn...
Richard P. Stanley, Jim Pitman
COMBINATORICS
2006
135views more  COMBINATORICS 2006»
14 years 10 months ago
Lyndon Words and Transition Matrices between Elementary, Homogeneous and Monomial Symmetric Functions
Let h, e, and m denote the homogeneous symmetric function, the elementary symmetric function and the monomial symmetric function associated with the partition respectively. We gi...
Andrius Kulikauskas, Jeffrey B. Remmel