74 search results - page 10 / 15 » Algorithms for Generating Convex Sets in Acyclic Digraphs |
SIAMJO
2010
14 years 10 months ago
2010
Proximal bundle methods have been shown to be highly successful optimization methods for unconstrained convex problems with discontinuous first derivatives. This naturally leads ...
201
Voted
APDC
1997
15 years 1 months ago
1997
Delaunaytriangulationhas beenmuchusedin suchapplicationsas volumerendering, shape representation, terrain modeling and so on. The main disadvantage of Delaunay triangulationis lar...
96
Voted
VLSID
2008
IEEE
16 years 22 days ago
2008
IEEE
In the automatic design of custom instruction set processors, there can be a very large set of potential custom instructions, from which a few instructions are required to be chos...
89
Voted
VVS
1998
IEEE
15 years 4 months ago
1998
IEEE
A visibility ordering of a set of objects, from a given viewpoint, is a total order on the objects such that if object a obstructs object b, then b precedes a in the ordering. Suc...
136
click to vote
ESA
2011
Springer
14 years 3 days ago
2011
Springer
In this work we study the problem of Bipartite Correlation Clustering (BCC), a natural bipartite counterpart of the well studied Correlation Clustering (CC) problem. Given a bipart...