1449 search results - page 32 / 290 » Self-Randomized Exponentiation Algorithms |
168
click to vote
ISSAC
1997
Springer
15 years 4 months ago
1997
Springer
Gaussian elimination is the basis for classical algorithms for computing canonical forms of integer matrices. Experimental results have shown that integer Gaussian elimination may...
101
Voted
CDC
2009
IEEE
15 years 5 months ago
2009
IEEE
— A limiting property of the matrix exponential is proven: For a real square matrix, where the log norm of the upper-left n by n block approaches negative infinity in a limiting...
ICML
2009
IEEE
16 years 1 months ago
2009
IEEE
Given a model family and a set of unlabeled examples, one could either label specific examples or state general constraints--both provide information about the desired model. In g...
77
Voted
ESA
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. We study the problem of contention resolution for differentsized jobs on a simple channel. When a job makes a run attempt, it learns only whether the attempt succeeded or...
80
Voted
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...