Sciweavers

18306 search results - page 64 / 3662
» Algorithmics in Exponential Time
Sort
View
CIAC
2006
Springer
278views Algorithms» more  CIAC 2006»
15 years 1 months ago
Covering a Set of Points with a Minimum Number of Lines
We consider the minimum line covering problem: given a set S of n points in the plane, we want to find the smallest number l of straight lines needed to cover all n points in S. W...
Magdalene Grantson, Christos Levcopoulos
CHES
2007
Springer
126views Cryptology» more  CHES 2007»
15 years 4 months ago
How to Maximize the Potential of FPGA Resources for Modular Exponentiation
This paper describes a modular exponentiation processing method and circuit architecture that can exhibit the maximum performance of FPGA resources. The modular exponentiation arch...
Daisuke Suzuki
STOC
1990
ACM
96views Algorithms» more  STOC 1990»
15 years 1 months ago
Monotone Circuits for Matching Require Linear Depth
We prove that monotone circuits computing the perfect matching function on n-vertex graphs require (n) depth. This implies an exponential gap between the depth of monotone and non...
Ran Raz, Avi Wigderson
EUROCRYPT
1999
Springer
15 years 2 months ago
An Analysis of Exponentiation Based on Formal Languages
A recoding rule for exponentiation is a method for reducing the cost of the exponentiation ae by reducing the number of required multiplications. If w(e) is the (hamming) weight of...
Luke O'Connor
ICIP
2010
IEEE
14 years 7 months ago
Entropies and cross-entropies of exponential families
Statistical modeling of images plays a crucial role in modern image processing tasks like segmentation, object detection and restoration. Although Gaussian distributions are conve...
Frank Nielsen, Richard Nock