4894 search results - page 565 / 979 » The Guarding Problem - Complexity and Approximation |
130
click to vote
ICANN
2005
Springer
15 years 10 months ago
2005
Springer
This paper presents a new method for the selection of the two hyperparameters of Least Squares Support Vector Machine (LS-SVM) approximators with Gaussian Kernels. The two hyperpar...
124
click to vote
JSSPP
2005
Springer
15 years 10 months ago
2005
Springer
Our main goal in this paper is to study the scheduling of parallel BSP tasks on clusters of computers. We focus our attention on special characteristics of BSP tasks, which can use...
138
click to vote
COMPGEOM
2004
ACM
15 years 10 months ago
2004
ACM
Models of forest ecosystems are needed to understand how climate and land-use change can impact biodiversity. In this paper we describe an individual-based, spatially-explicit for...
121
click to vote
ACISP
2004
Springer
15 years 10 months ago
2004
Springer
A new type of signature scheme, called NTRUSign, based on solving the approximately closest vector problem in a NTRU lattice was proposed at CT-RSA’03. However no security proof ...
122
click to vote
APPROX
2004
Springer
15 years 10 months ago
2004
Springer
We consider the problem of Simultaneous Source Location – selecting locations for sources in a capacitated graph such that a given set of demands can be satisfied. We give an ex...