Sciweavers

358 search results - page 63 / 72
» Rank Matrix Factorisation
Sort
View
ICASSP
2009
IEEE
15 years 5 months ago
Maximum-likelihood estimation of autoregressive models with conditional independence constraints
We propose a convex optimization method for maximum likelihood estimation of autoregressive models, subject to conditional independence constraints. This problem is an extension t...
Jitkomut Songsiri, Joachim Dahl, Lieven Vandenberg...
IISWC
2009
IEEE
15 years 5 months ago
Logicalization of communication traces from parallel execution
—Communication traces are integral to performance modeling and analysis of parallel programs. However, execution on a large number of nodes results in a large trace volume that i...
Qiang Xu, Jaspal Subhlok, Rong Zheng, Sara Voss
IMA
2009
Springer
111views Cryptology» more  IMA 2009»
15 years 5 months ago
Geometric Ideas for Cryptographic Equation Solving in Even Characteristic
Abstract. The GeometricXL algorithm is a geometrically invariant version of the XL algorithm that uses polynomials of a much smaller degree than either a standard Groebner basis al...
Sean Murphy, Maura B. Paterson
FOCS
2008
IEEE
15 years 5 months ago
Spherical Cubes and Rounding in High Dimensions
What is the least surface area of a shape that tiles Rd under translations by Zd ? Any such shape must have volume 1 and hence surface area at least that of the volume-1 ball, nam...
Guy Kindler, Ryan O'Donnell, Anup Rao, Avi Wigders...
FOCI
2007
IEEE
15 years 5 months ago
Almost All Learning Machines are Singular
— A learning machine is called singular if its Fisher information matrix is singular. Almost all learning machines used in information processing are singular, for example, layer...
Sumio Watanabe