5115 search results - page 581 / 1023 » On Randomized Lanczos Algorithms |
166
click to vote
APPROX
2005
Springer
16 years 8 days ago
2005
Springer
There has been significant interest lately in the task of constructing codes that are testable with a small number of random probes. Ben-Sasson and Sudan show that the repeated te...
167
click to vote
GECCO
2005
Springer
16 years 7 days ago
2005
Springer
This research presents an analysis of the reported successes of the Cartesian Genetic Programming method on a simplified form of the Boolean parity problem. We show the method of...
171
click to vote
ICN
2005
Springer
16 years 7 days ago
2005
Springer
Abstract. Recent developments in computer and communication networks require scheduling decisions to be made under increasingly complex system dynamics. We model and analyze the pr...
165
click to vote
ASPDAC
2004
ACM
16 years 5 days ago
2004
ACM
--Octilinear interconnect is a promising technique to shorten wire lengths. We present two practical heuristic octilinear Steiner tree (OSMT) algorithms in the paper. They are both...
164
click to vote
ICML
2004
IEEE
16 years 5 days ago
2004
IEEE
This paper describes an e cient method for learning the parameters of a Gaussian process (GP). The parameters are learned from multiple tasks which are assumed to have been drawn ...