Sciweavers

933 search results - page 39 / 187
» Monotone Complexity of a Pair
Sort
View
CDC
2008
IEEE
228views Control Systems» more  CDC 2008»
14 years 2 months ago
Stability analysis for neural networks with time-varying delay
— This paper studies the problem of stability analysis for neural networks (NNs) with a time-varying delay. The activation functions are assumed to be neither monotonic, nor diff...
Xun-Lin Zhu, Guang-Hong Yang
ICDM
2006
IEEE
138views Data Mining» more  ICDM 2006»
14 years 1 months ago
Adaptive Blocking: Learning to Scale Up Record Linkage
Many information integration tasks require computing similarity between pairs of objects. Pairwise similarity computations are particularly important in record linkage systems, as...
Mikhail Bilenko, Beena Kamath, Raymond J. Mooney
SIGECOM
2005
ACM
105views ECommerce» more  SIGECOM 2005»
14 years 1 months ago
Communication complexity of common voting rules
We determine the communication complexity of the common voting rules. The rules (sorted by their communication complexity from low to high) are plurality, plurality with runoff, ...
Vincent Conitzer, Tuomas Sandholm
CIARP
2005
Springer
14 years 1 months ago
Classifier Selection Based on Data Complexity Measures
Tin Kam Ho and Ester Bernardò Mansilla in 2004 proposed to use data complexity measures to determine the domain of competition of the classifiers. They applied different classifie...
Edith Hernández-Reyes, Jesús Ariel C...
SACRYPT
2001
Springer
130views Cryptology» more  SACRYPT 2001»
13 years 12 months ago
On the Complexity of Matsui's Attack
Linear cryptanalysis remains the most powerful attack against DES at this time. Given 243 known plaintext-ciphertext pairs, Matsui expected a complexity of less than 243 DES evalua...
Pascal Junod