Sciweavers

687 search results - page 52 / 138
» Feature (De)composition in Functional Programming
Sort
View
JMLR
2008
168views more  JMLR 2008»
13 years 8 months ago
Max-margin Classification of Data with Absent Features
We consider the problem of learning classifiers in structured domains, where some objects have a subset of features that are inherently absent due to complex relationships between...
Gal Chechik, Geremy Heitz, Gal Elidan, Pieter Abbe...
GIS
2002
ACM
13 years 8 months ago
Towards an evaluation of quality for names placement methods
The cartographic labeling problem is the problem of placing text on a map. This includes the positioning of the labels, and determining the shape in the case of line and area feat...
Steven van Dijk, Marc J. van Kreveld, Tycho Strijk...
HASKELL
2005
ACM
14 years 2 months ago
Dynamic applications from the ground up
Some Lisp programs such as Emacs, but also the Linux kernel (when fully modularised) are mostly dynamic; i.e., apart from a small static core, the significant functionality is dy...
Don Stewart, Manuel M. T. Chakravarty
PEPM
1994
ACM
14 years 28 days ago
Dictionary-Free Overloading by Partial Evaluation
One of the most novel features in the functional programming language Haskell is the system of type classes used to support a combination of overloading and polymorphism. Current ...
Mark P. Jones
ICFP
2003
ACM
14 years 8 months ago
A theory of aspects
This paper define the semantics of MinAML, an idealized aspect-oriented programming language, by giving a typedirected translation from its user-friendly external language to its ...
David Walker, Steve Zdancewic, Jay Ligatti