1566 search results - page 64 / 314 » On a Cone Covering Problem |
203
click to vote
JMLR
2002
15 years 5 months 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...
153
click to vote
STRINGOLOGY
2008
15 years 7 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...
145
click to vote
CCCG
2010
15 years 7 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...
167
click to vote
WWW
2005
ACM
16 years 6 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...
164
click to vote
ICMCS
2008
IEEE
16 years 18 days ago
2008
IEEE
As an important attribute directly influencing the steganographic scheme, the embedding efficiency is defined as the average number of random data bits per one embedding change...