699 search results - page 4 / 140 » The method of combinatorial telescoping |
JMM2
2008
13 years 7 months ago
2008
In this paper we introduce a novel and simple image segmentation schemes that are based on combinations of morphological and statistical operations. Mathematical morphology is very...
WG
2004
Springer
14 years 20 days ago
2004
Springer
It has long been known that the number of spanning trees in circulant graphs with fixed jumps and n nodes satisfies a recurrence relation in n. The proof of this fact was algebra...
STOC
2010
ACM
13 years 11 months ago
2010
ACM
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...
TVLSI
2002
13 years 7 months ago
2002
Gate diffusion input (GDI)--a new technique of low-power digital combinatorial circuit design--is described. This technique allows reducing power consumption, propagation delay, an...
FSTTCS
2009
Springer
14 years 1 months ago
2009
Springer
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...