Sciweavers

2767 search results - page 3 / 554
» Universal Exponentiation Algorithm
Sort
View
STOC
1994
ACM
168views Algorithms» more  STOC 1994»
14 years 2 months ago
Fast algorithms for finding randomized strategies in game trees
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
Daphne Koller, Nimrod Megiddo, Bernhard von Stenge...
FPGA
2004
ACM
121views FPGA» more  FPGA 2004»
14 years 3 months ago
Divide and concatenate: a scalable hardware architecture for universal MAC
We present a cryptographic architecture optimization technique called divide-and-concatenate based on two observations: (i) the area of a multiplier and associated data path decre...
Bo Yang, Ramesh Karri, David A. McGrew
DAGSTUHL
2007
13 years 11 months ago
On the Properties of Moments of Matrix Exponential Distributions and Matrix Exponential Processes
In this paper we provide properties of moments of matrix exponential distributions and joint moments of matrix exponential processes. Based on the provided properties, an algorith...
Levente Bodrog, András Horváth, Mikl...
ARSCOM
2007
115views more  ARSCOM 2007»
13 years 10 months ago
Minimal Universal Bipartite Graphs
A graph U is (induced)-universal for a class of graphs X if every member of X is contained in U as an induced subgraph. We study the problem of finding a universal graph with min...
Vadim V. Lozin, Gábor Rudolf
AAECC
1993
Springer
94views Algorithms» more  AAECC 1993»
14 years 2 months ago
Relations Among Lie Formal Series and Construction of Symplectic Integrators
Symplectic integrators are numerical integration schemes for hamiltonian systems. The integration step is an explicit symplectic map. We find symplectic integrators using universa...
Pierre-Vincent Koseleff