Sciweavers

8728 search results - page 240 / 1746
» On Reduct Construction Algorithms
Sort
View
AUTOMATICA
2008
139views more  AUTOMATICA 2008»
15 years 6 months ago
Structured low-rank approximation and its applications
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
Ivan Markovsky
FFA
2006
79views more  FFA 2006»
15 years 6 months ago
Lattice-based threshold-changeability for standard CRT secret-sharing schemes
We consider the problem of increasing the threshold parameter of a secret-sharing scheme after the setup (share distribution) phase, without further communication between the deal...
Ron Steinfeld, Josef Pieprzyk, Huaxiong Wang
PAMI
2008
391views more  PAMI 2008»
15 years 6 months ago
Riemannian Manifold Learning
Recently, manifold learning has been widely exploited in pattern recognition, data analysis, and machine learning. This paper presents a novel framework, called Riemannian manifold...
Tong Lin, Hongbin Zha
JCO
1998
136views more  JCO 1998»
15 years 6 months ago
A Greedy Randomized Adaptive Search Procedure for the Feedback Vertex Set Problem
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
Panos M. Pardalos, Tianbing Qian, Mauricio G. C. R...
CORR
2010
Springer
146views Education» more  CORR 2010»
15 years 3 months ago
NLHB : A Non-Linear Hopper Blum Protocol
The Hopper-Blum (HB) protocol, which uses noised linear parities of a shared key for authentication, has been proposed for light-weight applications such as RFID. Recently, algorit...
Mukundan Madhavan, Andrew Thangaraj, Yogesh Sankar...