Sciweavers

4112 search results - page 388 / 823
» Efficient Algorithms for the Spoonerism Problem
Sort
View
ICCAD
1998
IEEE
168views Hardware» more  ICCAD 1998»
15 years 12 months ago
On-line scheduling of hard real-time tasks on variable voltage processor
We consider the problem of scheduling the mixed workload of both sporadic (on-line) and periodic (off-line) tasks on variable voltage processor to optimize power consumption while...
Inki Hong, Miodrag Potkonjak, Mani B. Srivastava
ACISP
2010
Springer
15 years 9 months ago
Security Estimates for Quadratic Field Based Cryptosystems
Abstract. We describe implementations for solving the discrete logarithm problem in the class group of an imaginary quadratic field and in the infrastructure of a real quadratic fi...
Jean-François Biasse, Michael J. Jacobson, ...
UAI
1998
15 years 9 months ago
Learning Mixtures of DAG Models
We describe computationally efficient methods for learning mixtures in which each component is a directed acyclic graphical model (mixtures of DAGs or MDAGs). We argue that simple...
Bo Thiesson, Christopher Meek, David Maxwell Chick...
INTEGRATION
2008
89views more  INTEGRATION 2008»
15 years 7 months ago
Exact ESCT minimization for functions of up to six input variables
In this paper an efficient algorithm for the synthesis and exact minimization of ESCT(Exclusive or Sum of Complex Terms) expressions for Boolean functions of at most six variables...
Dimitrios Voudouris, Marinos Sampson, George K. Pa...
JMIV
2008
268views more  JMIV 2008»
15 years 7 months ago
A Fast Marching Method for the Area Based Affine Distance
In this paper we consider the problem of computing the area-based affine distance for a convex domain in the plane. Since this affine distance satisfies a non-homogeneous Monge-Amp...
Moacyr A. H. B. da Silva, Ralph Teixeira, Sin&eacu...