Sciweavers

501 search results - page 54 / 101
» Rough Sets
Sort
View
CRYPTO
2008
Springer
165views Cryptology» more  CRYPTO 2008»
13 years 10 months ago
Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries
In this work we study the design of secure protocols for linear algebra problems. All current solutions to the problem are either inefficient in terms of communication complexity o...
Payman Mohassel, Enav Weinreb
ICONIP
2009
13 years 6 months ago
Comparing a Cognitive and a Neural Model for Relative Trust Dynamics
Trust dynamics can be modelled in relation to experiences. Both cognitive and neural models for trust dynamics in relation to experiences are available, but were not yet related or...
S. Waqar Jaffry, Jan Treur
BILDMED
2011
245views Algorithms» more  BILDMED 2011»
13 years 17 days ago
Clustering-Based Detection of Anatomical Features on Organic Shapes
Abstract. Robust and accurate automatic detection of anatomical features on organic shapes is a challenging task. Despite a rough similarity, each shape is unique. To cope with thi...
Konrad Sickel, Vojtech Bubnik
ICALP
2007
Springer
14 years 3 months ago
Complexity of Propositional Proofs Under a Promise
Abstract. We study – within the framework of propositional proof complexity – the problem of certifying unsatisfiability of CNF formulas under the promise that any satisfiabl...
Nachum Dershowitz, Iddo Tzameret
RSFDGRC
1999
Springer
194views Data Mining» more  RSFDGRC 1999»
14 years 1 months ago
A Closest Fit Approach to Missing Attribute VAlues in Preterm Birth Data
: In real-life data, in general, many attribute values are missing. Therefore, rule induction requires preprocessing, where missing attribute values are replaced by appropriate val...
Jerzy W. Grzymala-Busse, Witold J. Grzymala-Busse,...