Sciweavers

3677 search results - page 577 / 736
» Is a probabilistic modeling
Sort
View
SODA
2001
ACM
157views Algorithms» more  SODA 2001»
15 years 5 months ago
New approaches to covering and packing problems
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
Aravind Srinivasan
148
Voted
MVA
1996
122views Computer Vision» more  MVA 1996»
15 years 5 months ago
Object Recognition from Range Images Using Superquadric Representations
Segmentation of range images using superquadric entities has been pointed out by a number of researchers as a powerful approach towards object recognition. Problems exist in findi...
Erik R. van Dop, Paul P. L. Regtien
EOR
2010
84views more  EOR 2010»
15 years 4 months ago
The selection efficiency of tournaments
We discuss tournaments in terms of their efficiency as probabilistic mechanisms that select high-quality alternatives ("players") in a noisy environment. We use two crit...
Dmitry Ryvkin
130
Voted
IJISEC
2008
119views more  IJISEC 2008»
15 years 4 months ago
Estimating the maximum information leakage
Preventing improper information leaks is a greatest challenge of the modern society. In this paper we present a technique for measuring the ability of several families of adversari...
Alessandro Aldini, Alessandra Di Pierro
JASIS
2006
108views more  JASIS 2006»
15 years 3 months ago
Fuzzy techniques for trust and reputation management in anonymous peer-to-peer systems
P2P applications are rapidly gaining acceptance among users of Internet-based services, especially because of their capability of exchanging resources while preserving the anonymi...
Roberto Aringhieri, Ernesto Damiani, Sabrina De Ca...