Sciweavers

169 search results - page 2 / 34
» Matrix Computations Using Quasirandom Sequences
Sort
View
113
Voted
MP
2011
14 years 5 months ago
Implicit solution function of P0 and Z matrix linear complementarity constraints
Abstract. Using the least element solution of the P0 and Z matrix linear complementarity problem (LCP), we define an implicit solution function for linear complementarity constrai...
Xiaojun Chen, Shuhuang Xiang
CORR
2008
Springer
82views Education» more  CORR 2008»
15 years 2 months ago
Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation
Kaltofen has proposed a new approach in (Kaltofen, 1992) for computing matrix determinants without divisions. The algorithm is based on a baby steps/giant steps construction of Kr...
Gilles Villard
TCC
2007
Springer
170views Cryptology» more  TCC 2007»
15 years 8 months ago
Secure Linear Algebra Using Linearly Recurrent Sequences
In this work we present secure two-party protocols for various core problems in linear algebra. Our main result is a protocol to obliviously decide singularity of an encrypted matr...
Eike Kiltz, Payman Mohassel, Enav Weinreb, Matthew...
BMVC
2001
15 years 4 months ago
Graph Matching using Adjacency Matrix Markov Chains
This paper describes a spectral method for graph-matching. We adopt a graphical models viewpoint in which the graph adjacency matrix is taken to represent the transition probabili...
Antonio Robles-Kelly, Edwin R. Hancock
RAID
2004
Springer
15 years 7 months ago
Anomaly Detection Using Layered Networks Based on Eigen Co-occurrence Matrix
Anomaly detection is a promising approach to detecting intruders masquerading as valid users (called masqueraders). It creates a user profile and labels any behavior that deviates...
Mizuki Oka, Yoshihiro Oyama, Hirotake Abe, Kazuhik...