Sciweavers

158 search results - page 22 / 32
» Some counting problems related to permutation groups
Sort
View
ISCC
2002
IEEE
14 years 15 days ago
A new approach to construct multicast trees in MPLS networks
In this paper1 , we present a new approach to construct multicast trees in MPLS networks. This approach utilizes MPLS LSPs between multicast tree branching node routers in order to...
Ali Boudani, Bernard Cousin
SIGMOD
1996
ACM
97views Database» more  SIGMOD 1996»
13 years 11 months ago
Bifocal Sampling for Skew-Resistant Join Size Estimation
This paper introduces bifocal sampling, a new technique for estimating the size of an equi-join of two relations. Bifocal sampling classi es tuples in each relation into two group...
Sumit Ganguly, Phillip B. Gibbons, Yossi Matias, A...
ECAI
2010
Springer
13 years 8 months ago
Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods
We study the problem of fairly dividing a set of goods amongst a group of agents, when those agents have preferences that are ordinal relations over alternative bundles of goods (r...
Sylvain Bouveret, Ulle Endriss, Jérôm...
GG
2004
Springer
14 years 29 days ago
Embedding in Switching Classes with Skew Gains
Abstract. In the context of graph transformation we look at the operation of switching, which can be viewed as an elegant method for realizing global transformations of (group-labe...
Andrzej Ehrenfeucht, Jurriaan Hage, Tero Harju, Gr...
ICDT
2010
ACM
219views Database» more  ICDT 2010»
14 years 5 months ago
Aggregate Queries for Discrete and Continuous Probabilistic XML
Sources of data uncertainty and imprecision are numerous. A way to handle this uncertainty is to associate probabilistic annotations to data. Many such probabilistic database mode...
Serge Abiteboul, T.-H Hubert Chan, Evgeny Kharlamo...