2799 search results - page 222 / 560 » computing 1998 |
125
Voted
ACL
1998
15 years 4 months ago
1998
Maximum entropy framework proved to be expressive and powerful for the statistical language modelling, but it suffers from the computational expensiveness of the model building. T...
141
Voted
CCCG
1998
15 years 4 months ago
1998
In this paper, we study weak {proximity drawings. All known algorithms that compute (weak) proximity drawings produce representations whose area increases exponentiallywith the nu...
112
Voted
WSC
1998
15 years 4 months ago
1998
We present a new technique (RIIPS) for solving rostering problems in the presence of service uncertainty. RIIPS stands for "Rostering by Iterating Integer Programming and Sim...
116
Voted
JVCA
1998
15 years 3 months ago
1998
: Today's computer animators have access to many systems and techniques to author high quality motion. Unfortunately, available techniques typically produce a particular motio...
110
click to vote
JSAC
1998
15 years 3 months ago
1998
Abstract—The excellent bit error rate performance of new iterative decoding algorithms (e.g., turbodecoding) is achieved at the expense of a computationally burdensome decoding p...