4894 search results - page 522 / 979 » The Guarding Problem - Complexity and Approximation |
178
click to vote
AIPS
2009
15 years 6 months ago
2009
Probabilistic Roadmaps (PRM) are a commonly used class of algorithms for robot navigation tasks where obstacles are present in the environment. We examine the situation where the ...
180
click to vote
ICML
2010
IEEE
15 years 5 months ago
2010
IEEE
We develop an efficient learning framework to construct signal dictionaries for sparse representation by selecting the dictionary columns from multiple candidate bases. By sparse,...
133
Voted
APIN
2008
15 years 5 months ago
2008
This paper presents a data-driven approach for feature selection to address the common problem of dealing with high-dimensional data. This approach is able to handle the real-valu...
130
click to vote
IM
2006
15 years 4 months ago
2006
We consider the problem of computing information theoretic functions such as entropy on a data stream, using sublinear space. Our first result deals with a measure we call the &quo...
125
click to vote
MOR
2006
15 years 4 months ago
2006
This paper provides guidance for operating an assemble-to-order system to maximize expected discounted profit, assuming that a high volume of prospective customers arrive per unit...