44651 search results - page 8646 / 8931 » Generalized |
202
click to vote
DEBU
1999
15 years 6 months ago
1999
This paper is a July 1999 snapshot of a "whitepaper" that I've been working on. The purpose of the whitepaper, which I initially drafted in April 1999, was to formu...
147
click to vote
DM
1999
15 years 6 months ago
1999
Abstract. Given a partially ordered set P = (X; P ), a function F which assigns to each x 2 X a set F (x) so that x y in P if and only if F (x) F (y) is called an inclusion represe...
206
Voted
ML
2002
ACM
15 years 6 months ago
2002
ACM
We examine linear program (LP) approaches to boosting and demonstrate their efficient solution using LPBoost, a column generation based simplex method. We formulate the problem as...
145
click to vote
MLQ
2002
15 years 6 months ago
2002
Abstract. In this paper I compare two well studied approaches to topological semantics-the domain-theoretic approach, exemplified by the category of countably based equilogical spa...
172
click to vote
JSYML
1998
15 years 6 months ago
1998
Abstract. After small forcing, any <κ-closed forcing will destroy the supercompactness and even the strong compactness of κ. In a delightful argument, Laver [L78] proved that ...