4114 search results - page 262 / 823 » Efficient Algorithms for the 2-Center Problems |
158
click to vote
BDA
2006
15 years 8 months ago
2006
We consider a publish/subscribe system for digital libraries which continuously evaluates queries over a large repository containing document descriptions. The subscriptions, the ...
185
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...
209
Voted
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...
201
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 ...
203
click to vote
VLDB
2007
ACM
16 years 1 months 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...