5169 search results - page 187 / 1034 » Locality approximation using time |
172
Voted
AAAI
2010
15 years 7 months ago
2010
We present a fast local search algorithm that finds an improved solution (if there is any) in the k-exchange neighborhood of the given solution to an instance of WEIGHTED FEEDBACK...
193
Voted
KDD
2007
ACM
16 years 6 months ago
2007
ACM
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
180
click to vote
ESA
2005
Springer
15 years 11 months ago
2005
Springer
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
162
click to vote
EOR
2007
15 years 6 months ago
2007
This paper investigates, for the first time in the literature, the approximation of minmax (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
191
Voted
PR
2008
15 years 6 months ago
2008
We present an efficient and robust method of locating a set of feature points in an object of interest. From a training set we construct a joint model of the appearance of each fe...