451 search results - page 58 / 91 » Some Lower Bounds on Geometric Separability Problems |
ICML
2009
IEEE
15 years 10 months ago
2009
IEEE
Recent approaches to learning structured predictors often require approximate inference for tractability; yet its effects on the learned model are unclear. Meanwhile, most learnin...
WSCG
2004
14 years 11 months ago
2004
One of the most important problems to solve in Solid Modeling is computing boolean operations for solids (union, intersection and difference). In this paper we present a method to...
107
click to vote
PODS
2001
ACM
15 years 9 months ago
2001
ACM
We consider the complexity of join problems, focusing on equijoins, spatial-overlap joins, and set-containment joins. We use a graph pebbling model to characterize these joins com...
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
Graph cut is a popular technique for interactive image segmentation. However, it has certain shortcomings. In particular, graph cut has problems with segmenting thin elongated obj...
103
click to vote
COMBINATORICS
1998
14 years 9 months ago
1998
The aim of this paper is to give a coherent account of the problem of constructing cubic graphs with large girth. There is a well-defined integer µ0(g), the smallest number of v...