Microsoft Research Blog

English

  1. Large-scale Learning to Rank using Boosted Decision Trees 

    June 2, 1985 | Krysta M. Svore, Christopher J.C. Burges, Chris J.C. Burges, and Krysta M. Svore

    The Web search ranking task has become increasingly important due to the rapid growth of the internet. With the growth of the Web and the number of Web search users, the amount of available training data for learning Web ranking models has also increased. We…

  2. A Zero-one Law for Logic with a Fixed-point Operator 

    April 7, 1985 | Andreas Blass, Yuri Gurevich, and D. Kozen

    The zero-one law, known to hold for first-order logic but not for monadic or even existential monadic second-order logic, is generalized to the extension of first-order logic by the least (or iterative) fixed-point operator. We also show that the problem of deciding, for any pi,…

  3. Secure Communication Using Remote Procedure Calls 

    February 1, 1985 | Andrew Birrell

    Research on encryption-based secure communication protocols has reached a stage where it is feasible to construct end-to-end secure protocols. The design of such a protocol, built as part of a remote procedure call package, is described. The security abstraction presented to users of the package,…

  4. Synchronizing Clocks in the Presence of Faults 

    January 1, 1985 | Leslie Lamport and P. M. Melliar-Smith

    Practical implementation of Byzantine agreement requires synchronized clocks. For an implementation to tolerate Byzantine faults, it needs a clock synchronization algorithm that can tolerate those faults. When I arrived at SRI, there was a general feeling that we could synchronize clocks by just having each…

  5. A Decidable Subclass of the Minimal Goedel Case with Identity 

    December 7, 1984 | W. D. Goldfarb, Yuri Gurevich, and Saharon Shelah

    The minimal Gddel class with identity (MGCI) is the class of closed, prenex quantificational formulas whose prefixes have the form Vx1 Vx2x3 and whose matrices contain arbitrary predicate letters and the identity sign " = ", but contain no function signs or individual constants. The…

  6. Buridan’s Principle 

    October 31, 1984 | Leslie Lamport

    I have observed that the arbiter problem, discussed in [22], occurs in daily life. Perhaps the most common example is when I find myself unable to decide for a fraction of a second whether to stop for a traffic light that just turned yellow or…

  7. On a “Theorem” of Peterson 

    October 10, 1984 | Leslie Lamport

    This three-page note gives an example that appears to contradict a theorem in a TOPLAS article by Gary Peterson. Whether or not it does depends on the interpretation of the statement of the theorem, which is given only informally in English. I draw the moral…