Sciweavers

6045 search results - page 11 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
JSC
2010
82views more  JSC 2010»
13 years 2 months ago
Linear complete differential resultants and the implicitization of linear DPPEs
The linear complete differential resultant of a finite set of linear ordinary differential polynomials is defined. We study the computation by linear complete differential resulta...
Sonia L. Rueda, J. Rafael Sendra
ICPR
2010
IEEE
13 years 6 months ago
Learning Non-Linear Dynamical Systems by Alignment of Local Linear Models
Abstract—Learning dynamical systems is one of the important problems in many fields. In this paper, we present an algorithm for learning non-linear dynamical systems which works...
Masao Joko, Yoshinobu Kawahara, Takehisa Yairi
TCC
2007
Springer
170views Cryptology» more  TCC 2007»
14 years 1 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...
FOCS
2007
IEEE
14 years 2 months ago
Non-Linear Index Coding Outperforming the Linear Optimum
The following source coding problem was introduced by Birk and Kol: a sender holds a word x ∈ {0, 1}n , and wishes to broadcast a codeword to n receivers, R1, . . . , Rn. The re...
Eyal Lubetzky, Uri Stav