Sciweavers

3299 search results - page 223 / 660
» A general mathematics of names
Sort
View
CCS
2007
ACM
16 years 24 days ago
Analyzing the vulnerability of superpeer networks against attack
In this paper, we develop an analytical framework to measure the vulnerability of superpeer networks against attack. Two different kinds of attacks namely deterministic and degre...
Bivas Mitra, Fernando Peruani, Sujoy Ghose, Niloy ...
ICANN
2005
Springer
16 years 3 days ago
Training of Support Vector Machines with Mahalanobis Kernels
Abstract. Radial basis function (RBF) kernels are widely used for support vector machines. But for model selection, we need to optimize the kernel parameter and the margin paramete...
Shigeo Abe
OOPSLA
2005
Springer
16 years 3 days ago
CodeQuest: querying source code with datalog
We describe CodeQuest, a system for querying source code. It combines two previous proposals, namely the use of logic programming and database system. Experiments (on projects ran...
Elnar Hajiyev, Mathieu Verbaere, Oege de Moor, Kri...
ATAL
2006
Springer
15 years 10 months ago
On using multi-agent systems in playing board games
Computer programs able to play different kinds of games (aka bots) is a growing area of interest for the computer game industry as the demand for better skilled computerized oppon...
Stefan J. Johansson
181
Voted
CRYPTO
2006
Springer
134views Cryptology» more  CRYPTO 2006»
15 years 10 months ago
Round-Optimal Composable Blind Signatures in the Common Reference String Model
We build concurrently executable blind signatures schemes in the common reference string model, based on general complexity assumptions, and with optimal round complexity. Namely, ...
Marc Fischlin