Philip M. Long

Loading Google Thumbnails...
2009
34Using the doubling dimension to analyze the generalization of learning algorithms. Nader H. Bshouty, Yi Li, Philip M. Long. J. Comput. Syst. Sci. (75): 323-335 (2009). Web SearchBibTeXDownload
2006
33Predicting Electricity Distribution Feeder Failures Using Machine Learning Susceptibility Analysis. Philip Gross, Albert Boulanger, Marta Arias, David L. Waltz, Philip M. Long, Charles Lawson, Roger Anderson, Matthew Koenig, Mark Mastrocinque, William Fairechio, John A. Johnson, Serena Lee, Frank Doherty, Arthur Kressner. AAAI 2006. Cited by 19Web SearchBibTeX
32Editors' Introduction. Marcus Hutter, Frank Stephan, Vladimir Vovk, Thomas Zeugmann. ALT 2006, 1-9. Web SearchBibTeXDownload
31Learnability and the doubling dimension. Yi Li, Philip M. Long. NIPS 2006, 889-896. Web SearchBibTeXDownload
2003
30Reinforcement Learning with Immediate Rewards and Linear Hypotheses. Naoki Abe, Alan W. Biermann, Philip M. Long. Algorithmica (37): 263-293 (2003). Web SearchBibTeXDownload
29On the difficulty of approximately maximizing agreements. Shai Ben-David, Nadav Eiron, Philip M. Long. J. Comput. Syst. Sci. (66): 496-514 (2003). Web SearchBibTeXDownload
28A Theoretical Analysis of Query Selection for Collaborative Filtering. Wee Sun Lee, Wee Sun Lee, Philip M. Long. Machine Learning (51): 283-298 (2003). Web SearchBibTeXDownload
2002
27The Relaxed Online Maximum Margin Algorithm. Yi Li, Philip M. Long. Machine Learning (46): 361-387 (2002). Web SearchBibTeXDownload
2001
26Agnostic Boosting. Shai Ben-David, Philip M. Long, Yishay Mansour. COLT/EuroCOLT 2001, 507-516. Web SearchBibTeXDownload
25A Theoretical Analysis of Query Selection for Collaborative Filtering. Wee Sun Lee, Wee Sun Lee, Philip M. Long. COLT/EuroCOLT 2001, 517-528. Web SearchBibTeXDownload
24The one-inclusion graph algorithm is near-optimal for the prediction model of learning. Yi Li, Philip M. Long, Aravind Srinivasan. IEEE Transactions on Information Theory (47): 1257-1261 (2001). Web SearchBibTeXDownload
23Improved Bounds on the Sample Complexity of Learning. Yi Li, Philip M. Long, Aravind Srinivasan. J. Comput. Syst. Sci. (62): 516-527 (2001). Web SearchBibTeXDownload
2000
22On the Difficulty of Approximately Maximizing Agreements. Shai Ben-David, Nadav Eiron, Philip M. Long. COLT 2000, 266-274. Web SearchBibTeX
21On the Complexity of Function Learning. Peter Auer, Philip M. Long, Wolfgang Maass, Gerhard J. Woeginger. Electronic Colloquium on Computational Complexity (ECCC) (7) (2000). Web SearchBibTeXDownload
20Improved bounds on the sample complexity of learning. Yi Li, Philip M. Long, Aravind Srinivasan. SODA 2000, 309-318. Web SearchBibTeXDownload
1999
19Adaptive Disk Spindown via Optimal Rent-to-Buy in Probabilistic Environments. P. Krishnan, Philip M. Long, Jeffrey Scott Vitter. Algorithmica (23): 31-56 (1999). Web SearchBibTeXDownload
18Associative Reinforcement Learning using Linear Probabilistic Concepts. Naoki Abe, Philip M. Long. ICML 1999, 3-11. Web SearchBibTeX
17Dictionary Selection Using Partial Matching. Dzung T. Hoang, Philip M. Long, Jeffrey Scott Vitter. Inf. Sci. (119): 57-72 (1999). Web SearchBibTeXDownload
16Text compression via alphabet re-representation. Philip M. Long, Apostol Natsev, Jeffrey Scott Vitter. Neural Networks (12): 755-765 (1999). Web SearchBibTeXDownload
15The Relaxed Online Maximum Margin Algorithm. Yi Li, Philip M. Long. NIPS 1999, 498-504. Web SearchBibTeXDownload
1998
14Efficient cost measures for motion estimation at low bit rates. Dzung T. Hoang, Philip M. Long, Jeffrey Scott Vitter. IEEE Trans. Circuits Syst. Video Techn. (8): 488-500 (1998). Web SearchBibTeXDownload
13PAC Learning Axis-aligned Rectangles with Respect to Product Distributions from Multiple-Instance Examples. Philip M. Long, Lei Tan. Machine Learning (30): 7-21 (1998). Web SearchBibTeXDownload
1997
12Text Compression Via Alphabet Re-Representation. Philip M. Long, Apostol Natsev, Jeffrey Scott Vitter. Data Compression Conference 1997, 161-170. Web SearchBibTeXDownload
11Guest Editor's Introduction. Sally A. McKee, Saumya K. Debray, Manuel V. Hermenegildo, Michael J. Maher. Machine Learning (27): 5 (1997). Web SearchBibTeXDownload
1996
10PAC Learning Axis-Aligned Rectangles with Respect to Product Distributions from Multiple-Instance Examples. Philip M. Long, Lei Tan. COLT 1996, 228-234. Web SearchBibTeXDownload
9Efficient Cost Measures for Motion Compensation at Low Bit Rates (Extended Abstract). Dzung T. Hoang, Philip M. Long, Jeffrey Scott Vitter. Data Compression Conference 1996, 102-111. Web SearchBibTeXDownload
1995
8Multiple-Dictionary Coding Using Partial Matching. Dzung T. Hoang, Philip M. Long, Jeffrey Scott Vitter. Data Compression Conference 1995, 272-281. Web SearchBibTeXDownload
7Learning to Make Rent-to-Buy Decisions with Systems Applications. P. Krishnan, Philip M. Long, Jeffrey Scott Vitter. ICML 1995, 233-330. Web SearchBibTeX
6A Generalization of Sauer's Lemma. David Haussler, Philip M. Long. J. Comb. Theory, Ser. A (71): 219-240 (1995). Web SearchBibTeX
5Characterizations of Learnability for Classes of {0, ..., n}-Valued Functions. Shai Ben-David, Nicoḷ Cesa-Bianchi, David Haussler, Philip M. Long. J. Comput. Syst. Sci. (50): 74-86 (1995). Web SearchBibTeXDownload
4On the Complexity of Function Learning. Peter Auer, Philip M. Long, Wolfgang Maass, Gerhard J. Woeginger. Machine Learning (18): 187-230 (1995). Web SearchBibTeXDownload
1994
3Explicit Bit Minimization for Motion-Compensated Video Coding. Dzung T. Hoang, Philip M. Long, Jeffrey Scott Vitter. Data Compression Conference 1994, 175-184. Web SearchBibTeXDownload
1993
2On the Complexity of Function Learning. Peter Auer, Philip M. Long, Wolfgang Maass, Gerhard J. Woeginger. COLT 1993, 392-401. Web SearchBibTeXDownload
1992
1Characterizations of Learnability for Classes of {O, ..., n}-Valued Functions. Shai Ben-David, Nicoḷ Cesa-Bianchi, Philip M. Long. COLT 1992, 333-340. Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research