2799 search results - page 319 / 560 » computing 1998 |
125
click to vote
ACL
1998
15 years 5 months ago
1998
In wide-coverage lexicalized grammars many of the elementary structures have substructures in common. This means that in conventional parsing algorithms some of the computation as...
143
click to vote
CCCG
1998
15 years 5 months ago
1998
Given a set P of n points in Rd, a fundamental problem in computational geometry is concerned with finding the smallest shape of some type that encloses all the points of P. Well-...
133
click to vote
NIPS
1998
15 years 5 months ago
1998
Dyadic data refers to a domain with two nite sets of objects in which observations are made for dyads, i.e., pairs with one element from either set. This type of data arises natur...
138
click to vote
UAI
1998
15 years 5 months ago
1998
We present an anytime algorithm which computes policies for decision problems represented as multi-stage influence diagrams. Our algorithm constructs policies incrementally, start...
116
Voted
APAL
1998
15 years 3 months ago
1998
We investigate the relationship of (jumps of) the degrees of splittings of a computably enumerable set and the degree of the set. We prove that there is a high computably enumerab...