Sciweavers

8728 search results - page 75 / 1746
» On Reduct Construction Algorithms
Sort
View
AAECC
1991
Springer
90views Algorithms» more  AAECC 1991»
14 years 14 days ago
Polynomial-Time Construction of Spherical Codes
Gilles Lachaud, Jacques Stern
ESA
2010
Springer
133views Algorithms» more  ESA 2010»
13 years 6 months ago
Constructing the R* Consensus Tree of Two Trees in Subcubic Time
Jesper Jansson, Wing-Kin Sung
FOCS
2006
IEEE
14 years 3 months ago
On the Compressibility of NP Instances and Cryptographic Applications
We study compression that preserves the solution to an instance of a problem rather than preserving the instance itself. Our focus is on the compressibility of NP decision problem...
Danny Harnik, Moni Naor
ANTS
2006
Springer
91views Algorithms» more  ANTS 2006»
14 years 21 days ago
Practical Lattice Basis Sampling Reduction
We propose a practical sampling reduction algorithm for lattice bases based on work by Schnorr [1] as well as two even more effective generalizations. We report the empirical behav...
Johannes Buchmann, Christoph Ludwig
AMAST
2006
Springer
14 years 21 days ago
State Space Reduction of Rewrite Theories Using Invisible Transitions
Abstract. State space explosion is the hardest challenge to the effective application of model checking methods. We present a new technique for achieving drastic state space reduct...
Azadeh Farzan, José Meseguer