Sciweavers

155 search results - page 8 / 31
» The Problem with Noise and Small Disjuncts
Sort
View
76
Voted
PAKDD
2000
ACM
100views Data Mining» more  PAKDD 2000»
15 years 3 months ago
Discovery of Relevant Weights by Minimizing Cross-Validation Error
In order to discover relevant weights of neural networks, this paper proposes a novel method to learn a distinct squared penalty factor for each weight as a minimization problem ov...
Kazumi Saito, Ryohei Nakano
105
Voted
FOCS
2004
IEEE
15 years 3 months ago
Worst-Case to Average-Case Reductions Based on Gaussian Measures
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...
Daniele Micciancio, Oded Regev
87
Voted
FOCS
2008
IEEE
15 years 6 months ago
Hardness of Minimizing and Learning DNF Expressions
We study the problem of finding the minimum size DNF formula for a function f : {0, 1}d → {0, 1} given its truth table. We show that unless NP ⊆ DTIME(npoly(log n) ), there i...
Subhash Khot, Rishi Saket
114
Voted
ICIP
2008
IEEE
16 years 1 months ago
Nonconvex compressive sensing and reconstruction of gradient-sparse images: Random vs. tomographic Fourier sampling
Previous compressive sensing papers have considered the example of recovering an image with sparse gradient from a surprisingly small number of samples of its Fourier transform. T...
Rick Chartrand
NIPS
2000
15 years 1 months ago
Analysis of Bit Error Probability of Direct-Sequence CDMA Multiuser Demodulators
We analyze the bit error probability of multiuser demodulators for directsequence binary phase-shift-keying (DS/BPSK) CDMA channel with additive gaussian noise. The problem of mul...
Toshiyuki Tanaka