Sciweavers

976 search results - page 21 / 196
» Evaluating Adversarial Partitions
Sort
View
EMNLP
2007
15 years 1 months ago
Incremental Generation of Plural Descriptions: Similarity and Partitioning
Approaches to plural reference generation emphasise descriptive brevity, but often lack empirical backing. This paper describes a corpus-based study of plural descriptions, and pr...
Albert Gatt, Kees van Deemter
115
Voted
SEC
2001
15 years 1 months ago
Communication-Efficient Group Key Agreement
Abstract Traditionally, research in secure group key agreement focuses on minimizing the computational overhead for cryptographic operations, and minimizing the communication overh...
Yongdae Kim, Adrian Perrig, Gene Tsudik
CORR
2010
Springer
76views Education» more  CORR 2010»
15 years 15 days ago
Query Strategies for Evading Convex-Inducing Classifiers
Classifiers are often used to detect miscreant activities. We study how an adversary can systematically query a classifier to elicit information that allows the adversary to evade...
Blaine Nelson, Benjamin I. P. Rubinstein, Ling Hua...
136
Voted
PRDC
2006
IEEE
15 years 6 months ago
Fault-Tolerant Partitioning Scheduling Algorithms in Real-Time Multiprocessor Systems
This paper presents the performance analysis of several well-known partitioning scheduling algorithms in real-time and fault-tolerant multiprocessor systems. Both static and dynam...
Hakem Beitollahi, Geert Deconinck
CORR
2008
Springer
159views Education» more  CORR 2008»
15 years 15 days ago
Privacy Preserving ID3 over Horizontally, Vertically and Grid Partitioned Data
We consider privacy preserving decision tree induction via ID3 in the case where the training data is horizontally or vertically distributed. Furthermore, we consider the same pro...
Bart Kuijpers, Vanessa Lemmens, Bart Moelans, Karl...