7930 search results - page 334 / 1586 » Greedy in Approximation Algorithms |
213
click to vote
UAI
2000
15 years 8 months ago
2000
We consider the problem belief-state monitoring for the purposes of implementing a policy for a partially-observable Markov decision process (POMDP), specifically how one might ap...
173
click to vote
DGCI
2009
Springer
15 years 10 months ago
2009
Springer
The Minimum Length Polygon (MLP) is an interesting first order approximation of a digital contour. For instance, the convexity of the MLP is characteristic of the digital convexit...
172
click to vote
DSD
2008
IEEE
15 years 8 months ago
2008
IEEE
The aim of this work is to present a method for rounding quadratically converging algorithms that improves their performance. This method is able to reduce significantly the numbe...
207
click to vote
GLOBECOM
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—The barrier coverage model was proposed for applications in which sensors are deployed for intrusion detection. In this paper, we study a strong barrier coverage problem...
204
click to vote
ILP
2007
Springer
16 years 25 days ago
2007
Springer
In this chapter, we describe a view of statistical learning in the inductive logic programming setting based on kernel methods. The relational representation of data and background...