8728 search results - page 380 / 1746 » On Reduct Construction Algorithms |
209
click to vote
SNPD
2003
15 years 8 months ago
2003
The paper discusses simple functional constraint networks and a value propagation method for program construction. Structural synthesis of programs is described as an example of d...
187
click to vote
JSAC
2010
15 years 1 months ago
2010
The prior art construction of sets of balanced codewords by Knuth is attractive for its simplicity and absence of look-up tables, but the redundancy of the balanced codes generated...
178
click to vote
FOCS
1994
IEEE
15 years 11 months ago
1994
IEEE
Sipser and Spielman have introduced a constructive family of asymptotically good linear error-correcting codes--expander codes--together with a simple parallel algorithm that will ...
183
click to vote
ICML
2006
IEEE
16 years 7 months ago
2006
IEEE
In machine learning problems with tens of thousands of features and only dozens or hundreds of independent training examples, dimensionality reduction is essential for good learni...
232
click to vote
STOC
2005
ACM
16 years 7 months ago
2005
ACM
Our main result is a reduction from worst-case lattice problems such as GAPSVP and SIVP to a certain learning problem. This learning problem is a natural extension of the `learnin...