We show how variational Bayesian inference can be implemented for very large generalized linear models. Our relaxation is proven to be a convex problem for any log-concave model. ...
The problem of learning a transduction, that is a string-to-string mapping, is a common problem arising in natural language processing and computational biology. Previous methods ...
This paper discusses a general algorithm for the discovery of motif combinations. From a large number of input motifs, discovered by any single motif discovery tool, our algorithm ...
This paper proposes a general framework for searching large distributed repositories. Examples of such repositories include sites with music/video content, distributed digital lib...
We describe a Computer Science General Education course offered at Hope College. This course stressesproblem-solving. It uses traditional concepts of programming, but does it with...