794 search results - page 22 / 159 » Improved algorithms for orienteering and related problems |
180
click to vote
SODA
2001
ACM
15 years 7 months ago
2001
ACM
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
184
click to vote
JMLR
2012
13 years 8 months ago
2012
Many real-world problems are inherently hierarchically structured. The use of this structure in an agent’s policy may well be the key to improved scalability and higher performa...
179
click to vote
STOC
2009
ACM
16 years 6 months ago
2009
ACM
Linear programming decoding for low-density parity check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its p...
143
click to vote
CVPR
2005
IEEE
16 years 8 months ago
2005
IEEE
Subspace methods such as PCA, LDA, ICA have become a standard tool to perform visual learning and recognition. In this paper we propose Representational Oriented Component Analysi...
169
click to vote
ISAAC
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We study the problem of maintaining a (1+ )-factor approximation of the diameter of a stream of points under the sliding window model. In one dimension, we give a simple ...