62 search results - page 7 / 13 » A New Approach to Exact Crossing Minimization |
98
Voted
JMLR
2010
14 years 8 months ago
2010
We extend the well-known BFGS quasi-Newton method and its memory-limited variant LBFGS to the optimization of nonsmooth convex objectives. This is done in a rigorous fashion by ge...
IPL
2007
14 years 9 months ago
2007
A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is sh...
DAM
2010
14 years 7 months ago
2010
An assignment of positive integer weights to the edges of a simple graph G is called irregular if the weighted degrees of the vertices are all different. The irregularity strength,...
103
click to vote
AAAI
2004
14 years 11 months ago
2004
A standard intuition underlying traditional accounts of belief change is the principle of minimal change. In this paper we introduce a novel account of belief change in which the ...
CGF
2008
14 years 9 months ago
2008
The signed distance field for a polygonal model is a useful representation that facilitates efficient computation in many visualization and geometric processing tasks. Often it is...