2880 search results - page 83 / 576 » Approximate Range Searching |
158
click to vote
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...
150
click to vote
WINE
2007
Springer
15 years 9 months ago
2007
Springer
A context in sponsored search is additional information about a query, such as the user’s age, gender or location, that can change an advertisement’s relevance or an advertise...
139
click to vote
WINET
2010
15 years 1 months ago
2010
In this paper we consider how to collect data from sensors deployed in the Euclidean plane in a timeefficient way. We assume that all sensors could adjust their transmission range...
153
click to vote
JMLR
2010
14 years 10 months ago
2010
The FastInf C++ library is designed to perform memory and time efficient approximate inference in large-scale discrete undirected graphical models. The focus of the library is pro...
136
click to vote
ESA
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. We consider approximate nearest neighbor searching in metric spaces of constant doubling dimension. More formally, we are given a set S of n points and an error bound &g...