Sciweavers

1005 search results - page 157 / 201
» On genomic coding theory
Sort
View
ICFP
2009
ACM
14 years 8 months ago
Implementing first-class polymorphic delimited continuations by a type-directed selective CPS-transform
We describe the implementation of first-class polymorphic delimited continuations in the programming language Scala. We use Scala's pluggable typing architecture to implement...
Tiark Rompf, Ingo Maier, Martin Odersky
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
14 years 8 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy
KDD
2007
ACM
132views Data Mining» more  KDD 2007»
14 years 8 months ago
A scalable modular convex solver for regularized risk minimization
A wide variety of machine learning problems can be described as minimizing a regularized risk functional, with different algorithms using different notions of risk and different r...
Choon Hui Teo, Alex J. Smola, S. V. N. Vishwanatha...
CHI
2004
ACM
14 years 8 months ago
Z-Tiles: building blocks for modular, pressure-sensing floorspaces
A new interactive floorspace has been developed which uses modular nodes connected together to create a pressuresensitive area of varying size and shape, giving it the potential t...
Bruce Richardson, Joseph A. Paradiso, Krispin Leyd...
POPL
2008
ACM
14 years 8 months ago
Enhancing modular OO verification with separation logic
Conventional specifications for object-oriented (OO) programs must adhere to behavioral subtyping in support of class inheritance and method overriding. However, this requirement ...
Wei-Ngan Chin, Cristina David, Huu Hai Nguyen, She...