699 search results - page 80 / 140 » The method of combinatorial telescoping |
100
Voted
COR
2008
15 years 21 days ago
2008
Consider the following heuristic for planar Euclidean instances of the Traveling Salesman Problem (TSP): select a subset of the edges which induces a planar graph, and solve eithe...
83
Voted
CORR
2010
Springer
15 years 20 days ago
2010
Springer
Sparse methods for supervised learning aim at finding good linear predictors from as few variables as possible, i.e., with small cardinality of their supports. This combinatorial ...
DM
2008
15 years 20 days ago
2008
Difference Systems of Sets (DSS) are combinatorial configurations that arise in connection with code synchronization. A method for the construction of DSS from partitions of cycli...
89
Voted
CORR
2006
Springer
15 years 19 days ago
2006
Springer
In this paper, we revisit the enumeration of directed animals using gas models. We show that there exists a natural construction of random directed animals on any directed graph t...
77
Voted
COMBINATORICS
2007
15 years 18 days ago
2007
In this paper, we revisit the enumeration of directed animals using gas models. We show that there exists a natural construction of random directed animals on any directed graph t...