Sciweavers

16666 search results - page 2954 / 3334
» Descriptive and Computational Complexity
Sort
View
IANDC
2007
151views more  IANDC 2007»
15 years 6 months ago
Transducer-based analysis of cryptographic protocols
Cryptographic protocols can be divided into (1) protocols where the protocol steps are simple from a computational point of view and can thus be modeled by simple means, for insta...
Ralf Küsters, Thomas Wilke
IDT
2007
83views more  IDT 2007»
15 years 6 months ago
Negotiating flexible agreements by combining distributive and integrative negotiation
This paper presents an approach to automated negotiation between agents which attempts to combine the advantages of a co-operative value adding approach, with the reality that neg...
Quoc Bao Vo, Lin Padgham, Lawrence Cavedon
PPL
2008
101views more  PPL 2008»
15 years 6 months ago
Skeletal Parallel Programming with OCamlP3l 2.0
Parallel programming has proven to be an effective technique to improve the performance of computationally intensive applications. However, writing parallel programs is not easy, ...
Roberto Di Cosmo, Zheng Li, Susanna Pelagatti, Pie...
NPL
2006
130views more  NPL 2006»
15 years 6 months ago
A Fast Feature-based Dimension Reduction Algorithm for Kernel Classifiers
This paper presents a novel dimension reduction algorithm for kernel based classification. In the feature space, the proposed algorithm maximizes the ratio of the squared between-c...
Senjian An, Wanquan Liu, Svetha Venkatesh, Ronny T...
PRL
2008
213views more  PRL 2008»
15 years 6 months ago
Boosting recombined weak classifiers
Boosting is a set of methods for the construction of classifier ensembles. The differential feature of these methods is that they allow to obtain a strong classifier from the comb...
Juan José Rodríguez, Jesús Ma...
« Prev « First page 2954 / 3334 Last » Next »