Sciweavers

16844 search results - page 175 / 3369
» How to Design Programs
Sort
View
ICML
2005
IEEE
16 years 7 months ago
Analysis and extension of spectral methods for nonlinear dimensionality reduction
Many unsupervised algorithms for nonlinear dimensionality reduction, such as locally linear embedding (LLE) and Laplacian eigenmaps, are derived from the spectral decompositions o...
Fei Sha, Lawrence K. Saul
ICFP
2005
ACM
16 years 6 months ago
Qualified types for MLF
MLF is a type system that extends a functional language with impredicative rank-n polymorphism. Type inference remains possible and only in some clearly defined situations, a loca...
Andres Löh, Daan Leijen
EDUTAINMENT
2009
Springer
16 years 1 months ago
Entertaining Education - Using Games-Based and Service-Oriented Learning to Improve STEM Education
This paper addresses the development of a computer game design and development curriculum at the authors’ institution. The basis for curriculum decisions, as well as comparison t...
Jon Preston, Briana Morrison
IFL
2007
Springer
162views Formal Methods» more  IFL 2007»
16 years 20 days ago
Testing Erlang Refactorings with QuickCheck
Abstract. Refactoring is a technique for improving the design of existing programs without changing their behaviour. Wrangler is a tool built at the University of Kent to support E...
Huiqing Li, Simon Thompson
ITICSE
2006
ACM
16 years 14 days ago
WADEIn II: a case for adaptive explanatory visualization
Adaptive explanatory visualization is an attempt to integrate two promising approaches to program visualization: adaptive visualization and explanatory visualization. The goal of ...
Peter Brusilovsky, Tomasz D. Loboda