1091 search results - page 112 / 219 » Approximation Algorithms for Data Placement Problems |
125
click to vote
SARA
2009
Springer
15 years 6 months 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...
123
Voted
ALT
2008
Springer
15 years 11 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...
122
click to vote
ISAAC
2007
Springer
15 years 8 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...
102
Voted
ICALP
2010
Springer
15 years 7 months 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...
129
Voted
ICANN
2009
Springer
15 years 7 months 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...