Sciweavers

699 search results - page 1 / 140
» The method of combinatorial telescoping
Sort
View
JCT
2011
97views more  JCT 2011»
12 years 12 months ago
The method of combinatorial telescoping
We present a method for proving q-series identities by combinatorial telescoping in the sense that one can transform a bijection or classification of combinatorial objects into a ...
William Y. C. Chen, Qing-Hu Hou, Lisa H. Sun
CORR
2010
Springer
98views Education» more  CORR 2010»
13 years 5 months ago
A Fast Approach to Creative Telescoping
Abstract. In this note we reinvestigate the task of computing creative telescoping relations in differential-difference operator algebras. Our approach is based on an ansatz that e...
Christoph Koutschan
JMLR
2012
11 years 7 months ago
Bayesian Quadrature for Ratios
We describe a novel approach to quadrature for ratios of probabilistic integrals, such as are used to compute posterior probabilities. This approach offers performance superior t...
Michael A. Osborne, Roman Garnett, Stephen J. Robe...
PET
2007
Springer
13 years 11 months ago
Pairing-Based Onion Routing
Abstract. This paper presents a novel use of pairing-based cryptography to improve circuit construction in onion routing anonymity networks. Instead of iteratively and interactivel...
Aniket Kate, Gregory M. Zaverucha, Ian Goldberg
CPAIOR
2011
Springer
12 years 8 months ago
Manipulating MDD Relaxations for Combinatorial Optimization
Abstract. We study the application of limited-width MDDs (multivalued decision diagrams) as discrete relaxations for combinatorial optimization problems. These relaxations are used...
David Bergman, Willem Jan van Hoeve, John N. Hooke...