688 search results - page 123 / 138 » General Partitioning on Random Graphs |
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
SIAMCOMP
2002
13 years 7 months ago
2002
We characterize all limit laws of the quicksort type random variables defined recursively by Xn d = XIn + X n-1-In + Tn when the "toll function" Tn varies and satisfies ...
VISUALIZATION
2005
IEEE
14 years 29 days ago
2005
IEEE
The Multi Triangulation framework (MT) is a very general approach for managing adaptive resolution in triangle meshes. The key idea is arranging mesh fragments at different resolu...
ESA
2004
Springer
14 years 23 days ago
2004
Springer
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
JCT
2010
13 years 5 months ago
2010
An Avoider-Enforcer game is played by two players, called Avoider and Enforcer, on a hypergraph F ⊆ 2X . The players claim previously unoccupied elements of the board X in turns...