Sciweavers

8728 search results - page 45 / 1746

» On Reduct Construction Algorithms

25

ESA
2006
Springer

189views Algorithms» more ESA 2006»

Exact and Efficient Construction of Planar Minkowski Sums Using the Convolution Method

14 years 16 days ago

Exact and Efficient Construction of Planar Minkowski Sums Using the Convolution Method

Download www.cs.tau.ac.il

Ron Wein

claim paper

Read More »

19

SODA
2008
ACM

98views Algorithms» more SODA 2008»

Explicit constructions for compressed sensing of sparse signals

13 years 10 months ago

Explicit constructions for compressed sensing of sparse signals

Download people.csail.mit.edu

Piotr Indyk

claim paper

Read More »

33

SODA
1993
ACM

105views Algorithms» more SODA 1993»

Fast Construction of Irreducible Polynomials over Finite Fields

13 years 10 months ago

Fast Construction of Irreducible Polynomials over Finite Fields

Download perso.univ-rennes1.fr

Victor Shoup

claim paper

Read More »

25

ANTS
2004
Springer

91views Algorithms» more ANTS 2004»

Low-Dimensional Lattice Basis Reduction Revisited

14 years 2 months ago

Low-Dimensional Lattice Basis Reduction Revisited

Download perso.ens-lyon.fr

Phong Q. Nguyen, Damien Stehlé

claim paper

Read More »

29

COCO
2010
Springer

125views Algorithms» more COCO 2010»

On the Power of Randomized Reductions and the Checkability of SAT

14 years 24 days ago

On the Power of Randomized Reductions and the Checkability of SAT

Download www.cs.princeton.edu

Mohammad Mahmoody, David Xiao

claim paper

Read More »

« Prev « First page 45 / 1746 Last » Next »