Sciweavers

696 search results - page 11 / 140
» A class of combinatorial identities
Sort
View
JALC
2008
72views more  JALC 2008»
14 years 11 months ago
Maximal Error-Detecting Capabilities of Formal Languages
A combinatorial channel is a set of pairs of words describing all the possible input-output channel situations. We introduce the concept "maximal error-detecting capability&q...
Stavros Konstantinidis, Pedro V. Silva
INFOCOM
2010
IEEE
14 years 10 months ago
Markov Approximation for Combinatorial Network Optimization
—Many important network design problems can be formulated as a combinatorial optimization problem. A large number of such problems, however, cannot readily be tackled by distribu...
Minghua Chen, Soung Chang Liew, Ziyu Shao, Caihong...
SIGECOM
2010
ACM
161views ECommerce» more  SIGECOM 2010»
15 years 4 months ago
Computation and incentives in combinatorial public projects
The Combinatorial Public Projects Problem s an abstraction of resource allocation problems in which agents have preferences over alternatives, and an outcome that is to be collect...
Dave Buchfuhrer, Michael Schapira, Yaron Singer
COMBINATORICS
2000
129views more  COMBINATORICS 2000»
14 years 11 months ago
Combinatorial statistics on type-B analogues of noncrossing partitions and restricted permutations
We define type-B analogues of combinatorial statistics previously studied on noncrossing partitions and show that analogous equidistribution and symmetry properties hold in the ca...
Rodica Simion
MFCS
2005
Springer
15 years 5 months ago
Greedy Approximation via Duality for Packing, Combinatorial Auctions and Routing
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...
Piotr Krysta