3394 search results - page 99 / 679 » A Space and Time Efficient Algorithm for SimRank Computation |
ICDE
2008
IEEE
14 years 9 months ago
2008
IEEE
This work introduces novel polynomial algorithms for processing top-k queries in uncertain databases under the generally adopted model of x-relations. An x-relation consists of a n...
ESA
2008
Springer
13 years 9 months ago
2008
Springer
In recent years, many speed-up techniques for Dijkstra's algorithm have been developed that make the computation of shortest paths in static road networks a matter of microse...
AI
1998
Springer
14 years 3 days ago
1998
Springer
A variety of hybrid genetic algorithms has been recently proposed to address the vehicle routing problem with time windows (VRPTW), a problem known to be NP-hard. However, very few...
WINE
2010
Springer
13 years 5 months ago
2010
Springer
The Shapley Value is arguably the most important normative solution concept in coalitional games. One of its applications is in the domain of networks, where the Shapley Value is u...
COLING
2010
13 years 2 months ago
2010
In statistical machine translation, decoding without any reordering constraint is an NP-hard problem. Inversion Transduction Grammars (ITGs) exploit linguistic structure and can w...