823 search results - page 32 / 165 » Brick partitions of graphs |
273
Voted
ISCA
2002
IEEE
15 years 5 months ago
2002
IEEE
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
179
click to vote
FOCI
2007
IEEE
16 years 12 days 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...
151
click to vote
JGT
2007
15 years 6 months 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...
174
click to vote
ICML
2003
IEEE
16 years 6 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...