90 search results - page 18 / 18 » Finding the Most Vital Node of a Shortest Path |
SIGMOD
2009
ACM
14 years 5 months ago
2009
ACM
In this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers...
KDD
2009
ACM
14 years 5 months ago
2009
ACM
Most of recommender systems try to find items that are most relevant to the older choices of a given user. Here we focus on the "surprise me" query: A user may be bored ...
AAAI
1996
13 years 6 months ago
1996
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
SODA
1998
ACM
13 years 6 months ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
EUROSSC
2009
Springer
13 years 9 months ago
2009
Springer
Finding solutions for the current period of climate change or “global warming” is possibly the most serious and pressing challenge faced by scientists and the wider community t...