Sciweavers

436 search results - page 44 / 88
» A Note on Negligible Functions
Sort
View
CRYPTO
2009
Springer
119views Cryptology» more  CRYPTO 2009»
15 years 4 months ago
How Risky Is the Random-Oracle Model?
RSA-FDH and many other schemes secure in the Random-Oracle Model (ROM) require a hash function with output size larger than standard sizes. We show that the random-oracle instanti...
Gaëtan Leurent, Phong Q. Nguyen
EMMCVPR
2005
Springer
15 years 3 months ago
Increasing Efficiency of SVM by Adaptively Penalizing Outliers
In this paper, a novel training method is proposed to increase the classification efficiency of support vector machine (SVM). The efficiency of the SVM is determined by the number ...
Yiqiang Zhan, Dinggang Shen
IPL
2007
111views more  IPL 2007»
14 years 9 months ago
Powering requires threshold depth 3
We study the circuit complexity of the powering function, defined as POWm(Z) = Zm for an n-bit integer input Z and an integer exponent m poly(n). Let LTd denote the class of func...
Alexander A. Sherstov
AUTOMATICA
1999
84views more  AUTOMATICA 1999»
14 years 9 months ago
Optimizing the receiver maneuvers for bearings-only tracking
This paper deals with the optimization of the observer trajectory for target motion analysis. The observations are made of estimated bearings. The problem consists in determining ...
Jean-Pierre Le Cadre, S. Laurent-Michel
ACCV
2010
Springer
14 years 4 months ago
A Convex Image Segmentation: Extending Graph Cuts and Closed-Form Matting
Abstract. Image matting and segmentation are two closely related topics that concern extracting the foreground and background of an image. While the methods based on global optimiz...
Youngjin Park, Suk I. Yoo