Sciweavers

460 search results - page 25 / 92
» A Symmetric Convexity Measure
Sort
View
ICIP
2005
IEEE
14 years 9 months ago
Efficient local reflectional symmetries detection
In this paper, we present a novel framework for efficient multiple reflectional symmetric regions detection in real images. First, we present a fast operator to measure the symmetr...
Tianqiang Yuan, Xiaoou Tang
COMSWARE
2008
IEEE
14 years 2 months ago
Deterministic schemes for key distribution in wireless sensor networks
— In this paper, we propose a new security metric for measuring resilience of a symmetric key distribution scheme in wireless sensor network. A polynomial-based and a novel compl...
Abhishek Gupta, Joy Kuri
IWANN
2005
Springer
14 years 1 months ago
Role of Function Complexity and Network Size in the Generalization Ability of Feedforward Networks
The generalization ability of different sizes architectures with one and two hidden layers trained with backpropagation combined with early stopping have been analyzed. The depend...
Leonardo Franco, José M. Jerez, José...
JC
2008
68views more  JC 2008»
13 years 7 months ago
On the number of minima of a random polynomial
We give an upper bound in O(d(n+1)/2 ) for the number of critical points of a normal random polynomial. The number of minima (resp. maxima) is in O(d(n+1)/2 )Pn, where Pn is the (...
Jean-Pierre Dedieu, Gregorio Malajovich
JCT
2006
100views more  JCT 2006»
13 years 7 months ago
Approximating clique-width and branch-width
We construct a polynomial-time algorithm to approximate the branch-width of certain symmetric submodular functions, and give two applications. The first is to graph "clique-wi...
Sang-il Oum, Paul D. Seymour