Sciweavers

1510 search results - page 70 / 302
» Upper Probabilities and Additivity
Sort
View
CIARP
2004
Springer
15 years 1 months ago
New Bounds and Approximations for the Error of Linear Classifiers
In this paper, we derive lower and upper bounds for the probability of error for a linear classifier, where the random vectors representing the underlying classes obey the multivar...
Luís G. Rueda
CRYPTO
2008
Springer
165views Cryptology» more  CRYPTO 2008»
14 years 11 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
MASCOTS
2007
14 years 11 months ago
Stochastic Bounds Applied to the End to End QoS in Communication Systems
—1 End to end QoS of communication systems is essential for users but their performance evaluation is a complex issue. The ion of such systems are usually given by multidimension...
Hind Castel, Lynda Mokdad, Nihal Pekergin
UAI
2003
14 years 11 months ago
Approximate Decomposition: A Method for Bounding and Estimating Probabilistic and Deterministic Queries
In this paper, we introduce a method for approximating the solution to inference and optimization tasks in uncertain and deterministic reasoning. Such tasks are in general intract...
David Larkin
ISMB
1993
14 years 11 months ago
Discovering Sequence Similarity by the Algorithmic Significance Method
The minimal-length encoding approach is applied to define concept of sequence similarity. Asequence is defined to be similar to another sequence or to a set of keywords if it can ...
Aleksandar Milosavljevic