1671 search results - page 85 / 335 » On the Covering Steiner Problem |
87
Voted
ICRA
2005
IEEE
15 years 6 months ago
2005
IEEE
— In this paper we address the problem of generating a motion strategy to find an object in a known 3-D environment as quickly as possible on average. We use a sampling scheme t...
129
click to vote
JMLR
2002
15 years 12 days ago
2002
Recently, sample complexity bounds have been derived for problems involving linear functions such as neural networks and support vector machines. In many of these theoretical stud...
95
Voted
STRINGOLOGY
2008
15 years 2 months ago
2008
Abstract. We study the problem of finding local and global covers as well as seeds in conservative indeterminate strings. An indeterminate string is a sequence T = T[1]T[2] . . . T...
93
Voted
CCCG
2010
15 years 2 months ago
2010
We study the problem of finding optimal covers of polygonal regions using multiple mobile guards. By our definition, a point is covered if, at some time, it lies within the convex...
107
Voted
WWW
2005
ACM
16 years 1 months ago
2005
ACM
We exploit the recently proposed Concept Abduction inference service in Description Logics to solve Concept Covering problems. We propose a framework and polynomial greedy algorit...