1091 search results - page 112 / 219 » Approximation Algorithms for Data Placement Problems |
SARA
2009
Springer
14 years 14 days ago
2009
Springer
Abstract. This article presents two new algorithms whose purpose is to maintain the Max-RPC domain filtering consistency during search with a minimal memory footprint and implemen...
ALT
2008
Springer
14 years 4 months ago
2008
Springer
We propose a new boosting algorithm for bipartite ranking problems. Our boosting algorithm, called SoftRankBoost, is a modification of RankBoost which maintains only smooth distri...
ISAAC
2007
Springer
14 years 2 months ago
2007
Springer
Trajectory data is becoming increasingly available and the size of the trajectories is getting larger. In this paper we study the problem of compressing spatio-temporal trajectorie...
ICALP
2010
Springer
14 years 22 days ago
2010
Springer
The placement of regenerators in optical networks has become an active area of research during the last years. Given a set of lightpaths in a network G and a positive integer d, re...
ICANN
2009
Springer
14 years 16 days ago
2009
Springer
Recurrent neural networks serve as black-box models for nonlinear dynamical systems identification and time series prediction. Training of recurrent networks typically minimizes t...