Sciweavers

2746 search results - page 225 / 550
» Bisubmodular Function Minimization
Sort
View
CCS
2005
ACM
15 years 10 months ago
Untraceable RFID tags via insubvertible encryption
We introduce a new cryptographic primitive, called insubvertible encryption, that produces ciphertexts which can be randomized without the need of any key material. Unlike plain u...
Giuseppe Ateniese, Jan Camenisch, Breno de Medeiro...
COLT
2005
Springer
15 years 10 months ago
Learning Convex Combinations of Continuously Parameterized Basic Kernels
We study the problem of learning a kernel which minimizes a regularization error functional such as that used in regularization networks or support vector machines. We consider thi...
Andreas Argyriou, Charles A. Micchelli, Massimilia...
GECCO
2005
Springer
197views Optimization» more  GECCO 2005»
15 years 10 months ago
Breeding swarms: a GA/PSO hybrid
Abstract. In this paper we propose a novel hybrid (GA/PSO) algorithm, Breeding Swarm, combining the strengths of particle swarm optimization with genetic algorithms. The hybrid alg...
Matthew Settles, Terence Soule
ICDT
2005
ACM
149views Database» more  ICDT 2005»
15 years 10 months ago
Approximately Dominating Representatives
We propose and investigate from the algorithmic standpoint a novel form of fuzzy query called approximately dominating representatives or ADRs. The ADRs of a multidimensional point...
Vladlen Koltun, Christos H. Papadimitriou
ICIC
2005
Springer
15 years 10 months ago
Methods of Decreasing the Number of Support Vectors via k-Mean Clustering
This paper proposes two methods which take advantage of k -mean clustering algorithm to decrease the number of support vectors (SVs) for the training of support vector machine (SVM...
Xiao-Lei Xia, Michael R. Lyu, Tat-Ming Lok, Guang-...