6110 search results - page 380 / 1222 » Approximate Computing |
182
Voted
STACS
2010
Springer
16 years 1 months ago
2010
Springer
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...
178
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
The Relevance Vector Machine (RVM) is a sparse approximate Bayesian kernel method. It provides full predictive distributions for test cases. However, the predictive uncertainties ...
205
click to vote
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
In the mobile facility location problem, which is a variant of the classical Uncapacitated Facility Location and kMedian problems, each facility and client is assigned to a start ...
147
click to vote
COMPUTING
2007
15 years 6 months ago
2007
In this paper, we propose an approach to the computation of more accurate divided differences for the interpolation in the Newton form of the matrix exponential propagator ϕ(hA)v...
161
click to vote
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
This paper analyzes bilateral multi-issue negotiation between selfinterested agents. Specifically, we consider the case where issues are divisible, there are time constraints in ...