Sciweavers

18306 search results - page 46 / 3662
» Algorithmics in Exponential Time
Sort
View
ASIACRYPT
2008
Springer
14 years 11 months ago
Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
We study the problem of finding solutions to linear equations modulo an unknown divisor p of a known composite integer N. An important application of this problem is factorization ...
Mathias Herrmann, Alexander May
SPAA
2005
ACM
15 years 3 months ago
Parallelizing time with polynomial circuits
We study the problem of asymptotically reducing the runtime of serial computations with circuits of polynomial size. We give an algorithmic size-depth tradeoff for parallelizing ...
Ryan Williams

Presentation
896views
14 years 7 months ago
Exponential families and simplification of mixture models
Presentation of the exponential families, of the mixtures of such distributions and how to learn it. We then present algorithms to simplify mixture model, using Kullback-Leibler di...
CEC
2007
IEEE
15 years 4 months ago
Improving hypervolume-based multiobjective evolutionary algorithms by using objective reduction methods
— Hypervolume based multiobjective evolutionary algorithms (MOEA) nowadays seem to be the first choice when handling multiobjective optimization problems with many, i.e., at lea...
Dimo Brockhoff, Eckart Zitzler
ANOR
2008
69views more  ANOR 2008»
14 years 10 months ago
Moment characterization of matrix exponential and Markovian arrival processes
This paper provides a general framework for establishing the relation between various moments of matrix exponential and Markovian processes. Based on this framework we present an a...
Levente Bodrog, András Horváth, Mikl...