4112 search results - page 252 / 823 » Efficient Algorithms for the Spoonerism Problem |
170
click to vote
WAE
2000
15 years 8 months ago
2000
Abstract. In this paper we present a heuristic based on dynamic approximations for improving the well-known Schnorr-Euchner lattice basis reduction algorithm. In particular, the ne...
187
click to vote
NIPS
2008
15 years 8 months ago
2008
We present cutoff averaging, a technique for converting any conservative online learning algorithm into a batch learning algorithm. Most online-to-batch conversion techniques work...
173
click to vote
KDD
2004
ACM
16 years 7 months ago
2004
ACM
Dimension reduction is a critical data preprocessing step for many database and data mining applications, such as efficient storage and retrieval of high-dimensional data. In the ...
182
click to vote
VLDB
2007
ACM
16 years 24 days ago
2007
ACM
The general problem of answering top-k queries can be modeled using lists of data items sorted by their local scores. The most efficient algorithm proposed so far for answering to...
172
click to vote
AI
2006
Springer
15 years 6 months ago
2006
Springer
Starting from some simple observations on a popular selection method in Evolutionary Algorithms (EAs)--tournament selection--we highlight a previously-unknown source of inefficien...