Sciweavers

4342 search results - page 652 / 869
» Improved Algorithms for Optimal Embeddings
Sort
View
FOCS
1999
IEEE
15 years 8 months ago
Boosting and Hard-Core Sets
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
Adam Klivans, Rocco A. Servedio
EGICE
2006
15 years 8 months ago
Combining Two Data Mining Methods for System Identification
System identification is an abductive task which is affected by several kinds of modeling assumptions and measurement errors. Therefore, instead of optimizing values of parameters ...
Sandro Saitta, Benny Raphael, Ian F. C. Smith
FPGA
2000
ACM
128views FPGA» more  FPGA 2000»
15 years 8 months ago
Factoring large numbers with programmable hardware
The fastest known algorithms for factoring large numbers share a core sieving technique. The sieving cores find numbers that are completely factored over a prime base set raised t...
Hea Joung Kim, William H. Mangione-Smith
TCOM
2011
170views more  TCOM 2011»
14 years 11 months ago
On Girth Conditioning for Low-Density Parity-Check Codes
—Low-density parity-check (LDPC) codes are gaining interest for high data rate applications in both terrestrial and spatial communications. They can be designed and studied throu...
Samuele Bandi, Velio Tralli, Andrea Conti, Maddale...
NABIC
2010
14 years 11 months ago
Evolutionary design of edge detector using rule-changing Cellular automata
A new design method for Cellular automata (CA) rules are described. We have already proposed a method for designing the transition rules of two-dimensional 256-state CA for graysca...
Shohei Sato, Hitoshi Kanoh