4843 search results - page 441 / 969 » The Shortcut Problem - Complexity and Approximation |
122
click to vote
CORR
2006
Springer
15 years 5 months ago
2006
Springer
We develop a new collaborative filtering (CF) method that combines both previously known users' preferences, i.e. standard CF, as well as product/user attributes, i.e. classi...
146
Voted
IJCV
2006
15 years 5 months ago
2006
Splines play an important role as solutions of various interpolation and approximation problems that minimize special functionals in some smoothness spaces. In this paper, we show ...
133
Voted
CORR
2007
Springer
15 years 5 months ago
2007
Springer
The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems. Formally, given a metric space on n vertices V , with m demand pairs ⊆ V × ...
145
click to vote
JGO
2008
15 years 5 months ago
2008
This article complements the paper [7], where we showed that a compact feasible set of a standard semi-infinite optimization problem can be approximated arbitrarily well by a leve...
139
click to vote
JSCIC
2008
15 years 5 months ago
2008
We study a posteriori error estimates in the energy norm for some parabolic obstacle problems discretized with a Euler implicit time scheme combined with a finite element spatial ...