4112 search results - page 395 / 823 » Efficient Algorithms for the Spoonerism Problem |
323
click to vote
VLDB
2007
ACM
16 years 7 months ago
2007
ACM
We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortes...
167
click to vote
EDBT
2004
ACM
16 years 7 months ago
2004
ACM
Efficient search for nearest neighbors (NN) is a fundamental problem arising in a large variety of applications of vast practical interest. In this paper we propose a novel techniq...
236
Voted
JMLR
2006
15 years 7 months ago
2006
Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision mak...
204
click to vote
WWW
2008
ACM
15 years 7 months ago
2008
ACM
As the Internet continues to play an important role in many business applications, it becomes vital to increase the competitive edge by offering geographically tailored contents t...
227
click to vote
JCM
2007
15 years 7 months ago
2007
—Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s algorithm exist and can handle large networks ...