Steven J. Phillips

Inf. Serv. Use, 2013

2008

Generative and Discriminative Learning with Unknown Labeling Bias.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 21, 2008

2007

Maximum Entropy Density Estimation with Generalized Regularization and an Application to Species Distribution Modeling.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2007

2005

Efficient Multiclass Implementations of L1-Regularized Maximum Entropy

[BibT_eX]

[DOI]

Patrick Haffner

CoRR, 2005

Correcting sample selection bias in maximum entropy density estimation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 18 [Neural Information Processing Systems, 2005

2004

A maximum entropy approach to species distribution modeling.

[BibT_eX]

[DOI]

Proceedings of the Machine Learning, 2004

Performance Guarantees for Regularized Maximum Entropy Density Estimation.

[BibT_eX]

[DOI]

Proceedings of the Learning Theory, 17th Annual Conference on Learning Theory, 2004

2002

Acceleration of K-Means and Related Clustering Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Engineering and Experiments, 4th International Workshop, 2002

2000

Markov Paging.

[BibT_eX]

[DOI]

Anna R. Karlin

Prabhakar Raghavan

SIAM J. Comput., 2000

3D reconstruction of a human heart fascicle using SurfDriver.

[BibT_eX]

[DOI]

Robert J. Rader

Paul S. LaFollette

Proceedings of the Medical Imaging 2000: Image Processing, 2000

Transport Network Architectures in an IP World.

[BibT_eX]

[DOI]

Robert D. Doverspike

Proceedings of the Proceedings IEEE INFOCOM 2000, 2000

1999

Paging Against a Distribution and IP Networking.

[BibT_eX]

[DOI]

Carsten Lund

Nick Reingold

J. Comput. Syst. Sci., 1999

Parallel Speech Recognition.

[BibT_eX]

[DOI]

Anne Rogers

Int. J. Parallel Program., 1999

Approximation Algorithms for Restoration Capacity Planning.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1999

1998

On-Line Load Balancing and Network Flow.

[BibT_eX]

[DOI]

Algorithmica, 1998

1996

On a Question of Erdös on Subsequence Sums.

[BibT_eX]

[DOI]

Don Coppersmith

SIAM J. Discret. Math., 1996

Strongly Competitive Algorithms for Paging with Locality of Reference.

[BibT_eX]

[DOI]

Sandy Irani

Anna R. Karlin

SIAM J. Comput., 1996

A Better Algorithm for an Ancient Scheduling Problem.

[BibT_eX]

[DOI]

David R. Karger

Eric Torng

J. Algorithms, 1996

Biased Random Walks.

[BibT_eX]

[DOI]

Comb., 1996

1995

An Empirical Evaluation of Virtual Circuit Holding Time Policies in IP-Over-ATM Networks.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 1995

Balanced Allocations for Tree-Like Inputs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1995

Adaptive Hodling Policies for IP over ATM Networks.

[BibT_eX]

[DOI]

Carsten Lund

Nick Reingold

Proceedings of the Proceedings IEEE INFOCOM '95, 1995

1994

Non-Clairvoyant Scheduling.

[BibT_eX]

[DOI]

Rajeev Motwani

Eric Torng

Theor. Comput. Sci., 1994

IP over connection-oriented networks and distributional paging

[BibT_eX]

[DOI]

Carsten Lund

Nick Reingold

Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

1993

Theory and applications of online algorithms.

[BibT_eX]

[DOI]

PhD thesis, 1993

Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths.

[BibT_eX]

[DOI]

David R. Karger

Daphne Koller

SIAM J. Comput., 1993

A Well-Characterized Approximation Problem.

[BibT_eX]

[DOI]

Johan Håstad

Shmuel Safra

Inf. Process. Lett., 1993

Online load balancing and network flow.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

1992

Markov Paging (Extended Abstract)

[BibT_eX]

[DOI]

Anna R. Karlin