2314 search results - page 52 / 463 » Minimal Partitions of a Graph |
86
Voted
STOC
2004
ACM
16 years 1 months ago
2004
ACM
We give a O( log n)-approximation algorithm for sparsest cut, edge expansion, balanced separator, and graph conductance problems. This improves the O(log n)-approximation of Leig...
117
Voted
FOCI
2007
IEEE
15 years 7 months ago
2007
IEEE
— The Constraint Satisfaction Problem (CSP) is one of the most prominent problems in artificial intelligence, logic, theoretical computer science, engineering and many other are...
96
Voted
JGT
2007
15 years 21 days ago
2007
: Let G be a graph with maximum degree d ≥ 3 and ω(G) ≤ d, where ω(G) is the clique number of the graph G. Let p1 and p2 be two positive integers such that d = p1 + p2. In th...
91
Voted
ICML
2009
IEEE
16 years 1 months ago
2009
IEEE
121
Voted
ICML
2003
IEEE
16 years 1 months ago
2003
IEEE
We present a new method for transductive learning, which can be seen as a transductive version of the k nearest-neighbor classifier. Unlike for many other transductive learning me...