Sciweavers

9842 search results - page 1818 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
ACIVS
2005
Springer
14 years 3 months ago
Object Recognition Using Local Characterisation and Zernike Moments
Abstract. Even if lots of object invariant descriptors have been proposed in the literature, putting them into practice in order to obtain a robust system face to several perturbat...
Anant Choksuriwong, Hélène Laurent, ...
ACIVS
2005
Springer
14 years 3 months ago
Reduced-Bit, Full Search Block-Matching Algorithms and Their Hardware Realizations
Abstract. The Full Search Block-Matching Motion Estimation (FSBME) algorithm is often employed in video coding for its regular dataflow and straightforward architectures. By iterat...
Vincent M. Dwyer, Shahrukh Agha, Vassilios A. Chou...
ACNS
2005
Springer
85views Cryptology» more  ACNS 2005»
14 years 3 months ago
New Signature Schemes with Coupons and Tight Reduction
Amongst provably secure signature schemes, two distinct classes are of particular interest: the ones with tight reduction (e.g., RSA-PSS), and those which support the use of coupon...
Benoît Chevallier-Mames
CBSE
2005
Springer
14 years 3 months ago
Performance Prediction of J2EE Applications Using Messaging Protocols
Abstract. Predicting the performance of component-based applications is difficult due to the complexity of the underlying component technology. This problem is exacerbated when a m...
Yan Liu, Ian Gorton
CD
2005
Springer
14 years 3 months ago
Infrastructure for Automatic Dynamic Deployment of J2EE Applications in Distributed Environments
Recent studies showed potential for using component frameworks for building flexible adaptible applications for deployment in distributed environments. However this approach is h...
Anatoly Akkerman, Alexander Totok, Vijay Karamchet...
« Prev « First page 1818 / 1969 Last » Next »