579 search results - page 5 / 116 » Intersecting Classes and Prototypes |
ENTCS
2002
13 years 5 months ago
2002
Elf is a general meta-language for the specification and implementation of logical systems in the style of the logical framework LF. Proof search in this framework is based on the...
WAOA
2010
Springer
13 years 3 months ago
2010
Springer
We study approximation solutions for the densest k-subgraph problem (DS-k) on several classes of intersection graphs. We adopt the concept of -quasi elimination orders, introduced ...
APPROX
2009
Springer
14 years 11 days ago
2009
Springer
In 1990, E. Baum gave an elegant polynomial-time algorithm for learning the intersection of two origin-centered halfspaces with respect to any symmetric distribution (i.e., any D s...
FOCM
2011
12 years 9 months ago
2011
By definition, transverse intersections are stable under infinitesimal perturbations. Using persistent homology, we extend this notion to a measure. Given a space of perturbatio...
FSTTCS
1993
Springer
13 years 10 months ago
1993
Springer
This paper will show the usefulness and elegance of strict intersection types for the Lambda Calculus; these are strict in the sense that they are the representatives of equivalen...