Sciweavers

9842 search results - page 1830 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
COLT
2004
Springer
14 years 3 months ago
Performance Guarantees for Regularized Maximum Entropy Density Estimation
Abstract. We consider the problem of estimating an unknown probability distribution from samples using the principle of maximum entropy (maxent). To alleviate overfitting with a v...
Miroslav Dudík, Steven J. Phillips, Robert ...
CP
2004
Springer
14 years 3 months ago
Statistical Regimes Across Constrainedness Regions
Abstract. Much progress has been made in terms of boosting the effectiveness of backtrack style search methods. In addition, during the last decade, a much better understanding of ...
Carla P. Gomes, Cèsar Fernández, Bar...
CRYPTO
2004
Springer
205views Cryptology» more  CRYPTO 2004»
14 years 3 months ago
Constant-Round Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model
In the bare public-key model (BPK in short), each verifier is assumed to have deposited a public key in a file that is accessible by all users at all times. In this model, intro...
Giovanni Di Crescenzo, Giuseppe Persiano, Ivan Vis...
CSL
2004
Springer
14 years 3 months ago
Moving in a Crumbling Network: The Balanced Case
In this paper we continue the study of ‘sabotage modal logic’ SML which was suggested by van Benthem. In this logic one describes the progression along edges of a transition gr...
Philipp Rohde
ECCV
2004
Springer
14 years 3 months ago
Robust Encoding of Local Ordinal Measures: A General Framework of Iris Recognition
Abstract. The randomness of iris pattern makes it one of the most reliable biometric traits. On the other hand, the complex iris image structure and various sources of intra-class ...
Zhenan Sun, Tieniu Tan, Yunhong Wang
« Prev « First page 1830 / 1969 Last » Next »