8695 search results - page 344 / 1739 » Making the Complex Simple |
163
click to vote
CSFW
2004
IEEE
15 years 10 months ago
2004
IEEE
Our goal in this paper is to make secure information flow typing more practical. We propose simple and permissive typing rules for array operations in a simple sequential imperati...
173
click to vote
CAV
2006
Springer
15 years 10 months ago
2006
Springer
We describe a formal verification of a recent concurrent list-based set algorithm due to Heller et al. The algorithm is optimistic: the add and remove operations traverse the list ...
172
click to vote
SAS
2000
Springer
15 years 10 months ago
2000
Springer
We present a new representation for possibly infinite sets of possibly infinite trees. This representation makes extensive use of sharing to achieve efficiency. As much as possible...
178
Voted
ACL
2007
15 years 8 months ago
2007
This paper describes our work on building Part-of-Speech (POS) tagger for Bengali. We have use Hidden Markov Model (HMM) and Maximum Entropy (ME) based stochastic taggers. Bengali...
128
click to vote
ACL
2008
15 years 8 months ago
2008
We identify four types of errors that unsupervised induction systems make and study each one in turn. Our contributions include (1) using a meta-model to analyze the incorrect bia...