Sciweavers

699 search results - page 46 / 140
» The method of combinatorial telescoping
Sort
View
PPSN
1998
Springer
14 years 22 days ago
Parallel Evolutionary Optimisation with Constraint Propagation
Abstract. This paper describes a parallel model for a distributed memory architecture of a non traditional evolutionary computation method, which integrates constraint propagation ...
Alvaro Ruiz-Andino, Lourdes Araujo, José J....
RSA
2006
96views more  RSA 2006»
13 years 8 months ago
Concentration inequalities for functions of independent variables
Following the entropy method this paper presents general concentration inequalities, which can be applied to combinatorial optimization and empirical processes. The inequalities g...
Andreas Maurer
TCS
2008
13 years 8 months ago
Solving difference equations whose coefficients are not transcendental
We consider a large class of sequences, called admissible sequences, which are defined by systems of (possibly nonlinear) difference equations. A procedure for recursively enumera...
Manuel Kauers
JCT
2011
100views more  JCT 2011»
13 years 3 months ago
On polynomial integrals over the orthogonal group
We consider integrals of type On ua1 11 . . . uan 1nub1 21 . . . ubn 2n du, with respect to the Haar measure on the orthogonal group. We establish several remarkable invariance pro...
Teodor Banica, Benoit Collins, Jean-Marc Schlenker
CVPR
2010
IEEE
14 years 4 months ago
Efficient Piecewise Learning for Conditional Random Fields
Conditional Random Field models have proved effective for several low-level computer vision problems. Inference in these models involves solving a combinatorial optimization probl...
Karteek Alahari, Phil Torr