illustration of intersecting lines with various shapes at the connecting points signifying algorithms on a green gradient background

Algorithms

Developing efficient algorithms that power faster, smarter, and more reliable computing across diverse applications.

Current selections

Sort by: Most recent

Clear selections

Publication

When Optimal Entropy-Constrained Quantizers Have Only A Finite Number of Codewords

Bradley J. Betts, Philip A. Chou

Int’l Symp. on Information Theory | January 1998

Publication

Maintaining Multiple Motion Model Hypotheses Over Many Views to Recover Matching and Structure

P. H. S. Torr, A. W. Fitzgibbon, A. Zisserman, Andrew Fitzgibbon

Proceedings of the 6th International Conference on Computer Vision, Bombay, India | January 1998

Publication

Algorithm + Strategy = Parallelism

PW Trinder, K Hammond, H-W Loidl, Simon Peyton Jones

Journal of Functional Programming | January 1998, Vol 8: pp. 23-60

Publication

On Analysis of Cloth Drape Range Data

Nebojsa Jojic, Thomas S. Huang

January 1998

Publication

The Decidability of Simultaneous Rigid E-Unification with One Variable

Paliath Narendran, Margus Veanes, Andrei Voronkov, Anatoli Degtyarev, Yuri Gurevich

RTA’98 | January 1998

Publication

Visibility Sorting and Compositing without Splitting for Image Layer Decompositions

John Snyder, Jed Lengyel

January 1998

Publication

Persistent Applications Using Generalized Redo Recovery

David Lomet

January 1998

Publication

Composition: A Way to Make Proofs Harder

Compositionality: The Significant Difference (Proceedings of the COMPOS’97 Symposium), Willem-Paul de Roever, Hans Langmaack, and Amir Pnueli editors. Lecture Notes in Computer Science. | December 1997

Publication

Learning Mixtures of DAG Models

Bo Thiesson, Chris Meek, Max Chickering, David Heckerman

MSR-TR-97-30 | December 1997

Revised May 1998

Publication

Grouping and Duplicate Elimination: Benefits of Early Aggregation

Paul Larson

MSR-TR-97-36 | December 1997

Your Privacy Choices