372 search results - page 12 / 75 » time 1996 |
116
Voted
OSDI
1996
ACM
15 years 1 months ago
1996
ACM
This paper describes a mechanism by which an operating system kernel can determine with certainty that it is safe to execute a binary supplied by an untrusted source. The kernel r...
89
Voted
COLING
1996
15 years 1 months ago
1996
In this paper, we describe a new model for word alignment in statistical translation and present experimental results. The idea of the model is to make the alignment probabilities...
107
Voted
STOC
1996
ACM
15 years 4 months ago
1996
ACM
We consider the problem of scheduling n jobs that are released over time on a single machine in order to minimize the total ow time. This problem is well-known to be NPcomplete, a...
122
click to vote
NETWORKS
2006
15 years 11 days ago
2006
Abstract. The Steiner tree problem is to find a shortest subgraph that spans a given set of vertices in a graph. This problem is known to be NP-hard and it is well known that a pol...
DAC
1996
ACM
15 years 4 months ago
1996
ACM
: While delay modeling of gates with a single switching input has received considerable attention, the case of multiple inputs switching in close temporal proximity is just beginni...