518 search results - page 58 / 104 » Beating a Random Assignment |
116
Voted
NIPS
2007
15 years 4 months ago
2007
We give a new class of outer bounds on the marginal polytope, and propose a cutting-plane algorithm for efficiently optimizing over these constraints. When combined with a concav...
111
click to vote
SOCRATES
2008
15 years 4 months ago
2008
External representations can be powerful to support learners' collaborative knowledge construction. They can focus learners on aspects which are particularly important for th...
119
Voted
SODA
2008
ACM
15 years 4 months ago
2008
ACM
Given a point set P in the plane, the Delaunay graph with respect to axis-parallel rectangles is a graph defined on the vertex set P, whose two points p, q P are connected by an ...
114
Voted
DLT
2004
15 years 4 months ago
2004
We study the maximum function of any R+-rational formal series S in two commuting variables, which assigns to every integer n N, the maximum coefficient of the monomials of degree...
122
Voted
MASCOTS
2003
15 years 3 months ago
2003
Scalability is the primary challenge to studying large complex network systems with network emulation. This paper studies topology partitioning, assigning disjoint pieces of the n...