6 search results - page 1 / 2 » Better bounds on the union complexity of locally fat objects |
COMPGEOM
2010
ACM
15 years 4 months ago
2010
ACM
We prove that the union complexity of a set of n constantcomplexity locally fat objects (which can be curved and/or non-convex) in the plane is O(λt+2(n) log n), where t is the m...
103
Voted
COMPGEOM
2009
ACM
15 years 6 months ago
2009
ACM
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
102
click to vote
COMGEO
2010
ACM
14 years 11 months ago
2010
ACM
r Numerical Abstractions6 Roberto Bagnaraa , Patricia M. Hillb , Enea Zaffanellaa aDepartment of Mathematics, University of Parma, Italy bSchool of Computing, University of Leeds, ...
113
Voted
DICTA
2008
15 years 1 months ago
2008
Many object categories are better characterized by the shape of their contour than by local appearance properties like texture or color. Multi-local features are designed in order...
107
click to vote
JMLR
2010
14 years 10 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...