5138 search results - page 401 / 1028 » Randomized Algorithms for 3-SAT |
178
click to vote
COMBINATORICA
2007
15 years 6 months ago
2007
A complete partition of a graph G is a partition of its vertex set in which any two distinct classes are connected by an edge. Let cp(G) denote the maximum number of classes in a ...
218
click to vote
INFOCOM
2011
IEEE
14 years 10 months ago
2011
IEEE
—Recent advances in virtualization technology have made it a common practice to consolidate virtual machines(VMs) into a fewer number of servers. An efficient consolidation sche...
165
Voted
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
In this paper we study the following problem: given two source images A and A , and a target image B, can we learn to synthesize a new image B which relates to B in the same way t...
175
click to vote
DCC
2008
IEEE
16 years 6 months ago
2008
IEEE
A system of algebraic equations over a finite field is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an unde...
160
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
Given a k-uniform hypergraph on n vertices, partitioned in k equal parts such that every hyperedge includes one vertex from each part, the k-Dimensional Matching problem asks wheth...