Sciweavers

8706 search results - page 1542 / 1742
» Learning Subjective Language
Sort
View
ICALP
2001
Springer
15 years 11 months ago
Approximating the Minimum Spanning Tree Weight in Sublinear Time
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan
IFIP
2001
Springer
15 years 11 months ago
Security Documentation
Effective security management depends upon good risk management, which is itself based upon a reliable risk assessment, involving data collection of all the facets influencing sys...
Lam-for Kwok, Peggy P. K. Fung, Dennis Longley
JAVA
2001
Springer
15 years 11 months ago
A scalable, robust network for parallel computing
CX, a network-based computational exchange, is presented. The system’s design integrates variations of ideas from other researchers, such as work stealing, non-blocking tasks, e...
Peter R. Cappello, Dimitros Mourloukos
ICFP
1999
ACM
15 years 11 months ago
Relating Typability and Expressiveness in Finite-Rank Intersection Type Systems (Extended Abstract)
d Abstract) Assaf J. Kfoury∗ Boston University http://www.cs.bu.edu/˜kfoury Harry G. Mairson† Brandeis University http://www.cs.brandeis.edu/˜mairson Franklyn A. Turbak‡ We...
Assaf J. Kfoury, Harry G. Mairson, Franklyn A. Tur...
LPNMR
1990
Springer
15 years 10 months ago
The meaning of Negative Premises in Transition System Specifications
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...
Roland N. Bol, Jan Friso Groote
« Prev « First page 1542 / 1742 Last » Next »