696 search results - page 107 / 140 » A class of combinatorial identities |
ISCAS
2006
IEEE
15 years 8 months ago
2006
IEEE
Synchronization in networks with different topolo- is shown that for typical systems only three main scenarios gies is studied. We show that for a large class of oscillators there ...
133
click to vote
STOC
2009
ACM
16 years 2 months ago
2009
ACM
We describe the first algorithm to compute maximum flows in surface-embedded graphs in near-linear time. Specifically, given a graph embedded on a surface of genus g, with two spe...
129
click to vote
STOC
1990
ACM
15 years 6 months ago
1990
ACM
ions (Extended Abstract) Noga Alon Paul Seymour Robin Thomas Let G be an n-vertex graph with nonnegative weights whose sum is 1 assigned to its vertices, and with no minor isomorp...
112
Voted
APPROX
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. Combinatorial property testing deals with the following relaxation of decision problems: Given a fixed property and an input x, one wants to decide whether x satisfies th...
135
click to vote
UAI
1997
15 years 3 months ago
1997
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...