4112 search results - page 127 / 823 » Efficient Algorithms for the Spoonerism Problem |
259
click to vote
NLP
2000
15 years 8 months ago
2000
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
113
click to vote
FUN
2007
Springer
15 years 8 months ago
2007
Springer
A spreadsheet, especially MS Excel, is probably one of the most popular software applications for personal-computer users and gives us convenient and user-friendly tools for drawin...
148
click to vote
WWW
2008
ACM
16 years 5 months ago
2008
ACM
Motivated by several marketplace applications on rapidly growing online social networks, we study the problem of efficient offline matching algorithms for online exchange markets....
123
click to vote
DCOSS
2007
Springer
15 years 8 months ago
2007
Springer
The exposure of a path p is a measure of the likelihood that an object traveling along p is detected by a network of sensors and it is formally defined as an integral over all poin...
147
click to vote
DAGSTUHL
2004
15 years 5 months ago
2004
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...