Sciweavers

7015 search results - page 1272 / 1403
» Approximation algorithms for co-clustering
Sort
View
IJACT
2008
158views more  IJACT 2008»
13 years 9 months ago
Efficient lattice-based signature scheme
: In Crypto 1997, Goldreich, Goldwasser and Halevi (GGH) proposed a lattice analogue of McEliece public key cryptosystem, in which security is related to the hardness of approximat...
Thomas Plantard, Willy Susilo, Khin Than Win, Qion...
IJCV
2008
188views more  IJCV 2008»
13 years 9 months ago
Partial Linear Gaussian Models for Tracking in Image Sequences Using Sequential Monte Carlo Methods
The recent development of Sequential Monte Carlo methods (also called particle filters) has enabled the definition of efficient algorithms for tracking applications in image sequen...
Elise Arnaud, Étienne Mémin
EOR
2006
73views more  EOR 2006»
13 years 9 months ago
Path relinking and GRG for artificial neural networks
Artificial neural networks (ANN) have been widely used for both classification and prediction. This paper is focused on the prediction problem in which an unknown function is appr...
Abdellah El-Fallahi, Rafael Martí, Leon S. ...
FOCM
2006
97views more  FOCM 2006»
13 years 9 months ago
Learning Rates of Least-Square Regularized Regression
This paper considers the regularized learning algorithm associated with the leastsquare loss and reproducing kernel Hilbert spaces. The target is the error analysis for the regres...
Qiang Wu, Yiming Ying, Ding-Xuan Zhou
IJRR
2008
115views more  IJRR 2008»
13 years 9 months ago
Planning High-quality Paths and Corridors Amidst Obstacles
The motion-planning problem, involving the computation of a collision-free path for a moving entity amidst obstacles, is a central problem in fields like Robotics and Game Design....
Ron Wein, Jur P. van den Berg, Dan Halperin
« Prev « First page 1272 / 1403 Last » Next »