1012 search results - page 28 / 203 » Segment intersection searching problems in general settings |
107
click to vote
CEC
2010
IEEE
15 years 26 days ago
2010
IEEE
In this paper we present a simple and general new No Free Lunch-like result that applies to revisiting algorithms searching arbitrary problem sets. We begin by unifying the assumpt...
EVOW
2009
Springer
14 years 9 months ago
2009
Springer
Abstract. In this paper we propose a new benchmark problem for dynamic combinatorial optimisation. Unlike most previous benchmarks, we focus primarily on the underlying dynamics of...
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...
JCDL
2004
ACM
15 years 5 months ago
2004
ACM
We propose the idea of an online, user submitted digital library of recreation trails. Digital libraries of trails offer advantages over paper guidebooks in that they are more acc...
ECCV
2006
Springer
16 years 1 months ago
2006
Springer
Bottom-up segmentation based only on low-level cues is a notoriously difficult problem. This difficulty has lead to recent top-down segmentation algorithms that are based on class-...