% This file was created with JabRef 2.4.2.
% Encoding: MacRoman

@STRING{AAAI = {Proceedings of the National Conference on Artificial Intelligence
	(AAAI)}}

@STRING{ACCV = {Proceedings of the Asian Conference on Computer Vision (ACCV)}}

@STRING{ACL = {Proceedings of the Annual Meeting of the Association for Computational
	Linguistics (ACL)}}

@STRING{ACM-SIGIR = {Conference on Information Retrieval}}

@STRING{AI = {Artificial Intelligence}}

@STRING{AII = {Analogical and Inductive Inference}}

@STRING{AISTAT = {Proceedings of the International Conference on Artificial Intelligence
	and Statistics}}

@STRING{ALT = {Proceedings of the International Workshop on Algorithmic Learning
	Theory (ALT)}}

@STRING{ALT-AII = {International Workshop on Algorithmic Learning Theory and International
	Workshop on Analogical and Inductive Inference}}

@STRING{AMS = {American Mathematical Society}}

@STRING{AMTA = {Association for Machine Translation in the Americas}}

@STRING{ANLP = {Proceedings of ACL Conference on Applied Natural Language Processing}}

@STRING{ARPA = {Proceedings of the ARPA Workshop on Human Language Technology}}

@STRING{ASIAN = {Asian Computing Science Conference}}

@STRING{ASPLOS = {Annual Conference on Architectural Support for Programming Languages
	and Operating Systems}}

@STRING{ASRU = {IEEE Workshop on Automatic Speech Recognition and Understanding}}

@STRING{Benjamin = {Benjamin/Cummings Publishing Company, Inc.}}

@STRING{BUCLD = {Annual Boston University Conference on Language Development}}

@STRING{CACM = {Communications of the ACM}}

@STRING{Cambridge = {Cambridge University Press}}

@STRING{CICLing = {International Conference on Intelligent Text Processing and Computational
	Linguistics}}

@STRING{CIKM = {Proceedings of ACM Conference on Information and Knowledge Management
	(CIKM)}}

@STRING{CISS = {Conference on Information Science and Systems}}

@STRING{CL = {Computational Linguistics}}

@STRING{CLIN = {Computational Linguistics in the Netherlands (CLIN)}}

@STRING{CogSci = {Annual Conference of the Cognitive Science Society}}

@STRING{COLING = {Proceedings the International Conference on Computational Linguistics
	(COLING)}}

@STRING{COLING-ACL = {International Conference on Computational Linguistics and Annual
	Meeting of the Association for Computational Linguistics}}

@STRING{COLT = {Proceedings of Anual Conference on Computational Learning Theory
	(COLT)}}

@STRING{COMPLEX = {Conference on Computational Lexicography and Text Research}}

@STRING{CoNLL = {Proceedings of the Annual Conference on Computational Natural Language
	Learning (CoNLL)}}

@STRING{CoNLL-LLL = {Conference on Computational Language Learning and Learning Language
	in Logic Workshop}}

@STRING{CSL = {Computer Speech and Language}}

@STRING{CVPR = {The IEEE Conference on Computer Vision and Pattern Recognition (CVPR)}}

@STRING{DARPA = {Proceedings of the DARPA Workshop on Speech and Natural Language}}

@STRING{DaWaK = {Proceedings of the 10th international conference on Data Warehousing
	and Knowledge Discovery}}

@STRING{DMKD = {Workshop on Research Issues on Data Mining and Knowledge Discovery}}

@STRING{EACL = {Proceedings of the European Chapter of the ACL (EACL)}}

@STRING{ECAI = {European Conference on Artificial Intelligence}}

@STRING{ECCV = {Proceedings of the European Conference on Computer Vision (ECCV)}}

@STRING{ECIR = {European Conference on Information Retrieval}}

@STRING{ECML = {Proceedings of the European Conference on Machine Learning (ECML)}}

@STRING{EMNLP = {Proceedings of the Conference on Empirical Methods for Natural Language
	Processing (EMNLP)}}

@STRING{EMNLP-CoNLL = {Conference on Empirical Methods for Natural Language Processing -
	Conference on Computational Natural Language Learning}}

@STRING{EMNLP-VLC = {The Joint SIGDAT Conference on Empirical Methods in Natural Language
	Processing and Very Large Corpora}}

@STRING{ESA = {European Symposium Algorithm}}

@STRING{EuroCOLT = {European Conference on Computational Learning Theory}}

@STRING{FCT = {Fundamentals of Computations Theory}}

@STRING{FLAIRS = {International Florida Artificial Intelligence Research Symposium
	Conference}}

@STRING{FOCS = {IEEE Symposium on Foundation of Computer Science}}

@STRING{HLT = {Proceedings of the conference on Human Language Technology}}

@STRING{HLT-EMNLP = {Proceedings of Human Language Technology Conference and Conference
	on Empirical Methods in Natural Language Processing}}

@STRING{HLT-NAACL = {Human Language Technologies - North American Chapter of the Association
	for Computational Linguistics}}

@STRING{IAAI = {Proceedings of the National Conference on Innovative Applications
	of Artificial Intelligence (IAAI)}}

@STRING{ICALP = {The International Colloquium on Automata, Languages, and Programming}}

@STRING{ICASSP = {Proceedings of ICASSP}}

@STRING{ICCI = {Advances in Computing and Information}}

@STRING{ICDM = {IEEE International Conference on Data Mining(ICDM)}}

@STRING{ICGI = {International Colloquium on Grammatical Inference}}

@STRING{ICML = {Proceedings of the International Conference on Machine Learning (ICML)}}

@STRING{ICSLP = {International Conference on Spoken Language Processing}}

@STRING{IFIP = {International Federation for Information Processing}}

@STRING{IJCAI = {Proceedings of the International Joint Conference on Artificial Intelligence
	(IJCAI)}}

@STRING{IJCNLP = {Proceedings of the International Joint Conference on Natural Language
	Processing (IJCNLP)}}

@STRING{IJCNN = {International Joint Conference on Neural Networks}}

@STRING{ILP = {Proceedings of the International Conference Inductive Logic Programming}}

@STRING{InfCtrl = {Information and Control}}

@STRING{IPW = {Proceedings of the International Parsing Workshop}}

@STRING{ISMB = {The International Conference on Intelligent Systems for Molecular
	Biology}}

@STRING{IT = {IEEE Transactions on information theory}}

@STRING{IUI = {International Conference on Intelligent User Interfaces}}

@STRING{IWCS = {International Conference on Computational Semantics}}

@STRING{IWPT = {Proceedings of the International Workshop of Parsing Technology}}

@STRING{JACM = {Journal of the ACM}}

@STRING{JAIR = {Journal of AI Research}}

@STRING{JMLR = {Journal of Machine Learning Research}}

@STRING{JNLE = {Journal for Natural Language Engineering}}

@STRING{KDD = {Proceedings of International Conference on Knowledge Discovery and
	Data Mining (KDD)}}

@STRING{KR = {Proceedings of the International Conference on the Principles of
	Knowledge Representation and Reasoning}}

@STRING{LICS = {IEEE Symposium on Logic in Compute Science}}

@STRING{LREC = {International Conference on Language Resources and Evaluation}}

@STRING{MFCS = {International Symposium on Mathematical Foundations of Computer Science}}

@STRING{MIT = {MIT Press}}

@STRING{ML = {Machine Learning}}

@STRING{MLNLO = {Machine Learning of Natural Language and Ontology}}

@STRING{MM = {IEEE Transactions on Multimedia}}

@STRING{MUC = {Message Understanding Conference}}

@STRING{NAACL = {Proceedings of the Annual Meeting of the North American Association
	of Computational Linguistics (NAACL)}}

@STRING{NAACL-HLT = {North American Chapter of the Association for Computational Linguistics
	- Human Language Technologies}}

@STRING{NIPS = {The Conference on Advances in Neural Information Processing Systems
	(NIPS)}}

@STRING{NLE = {Journal of Natural Language Engineering}}

@STRING{PACLIC = {Pacific Asia Conference on Language, Information and Computation}}

@STRING{PAMI = {IEEE Transactions on Pattern Analysis and Machine Intelligence}}

@STRING{RTE = {Recognising Textual Entailment Challenge}}

@STRING{RTE-NAACL = {Recognising Textual Entailment Challenge - North American Chapter
	of the Association for Computational Linguistics}}

@STRING{SIGDAT = {Proceedings of the Conference on Empirical Methods for Natural Language
	Processing (EMNLP)}}

@STRING{SIGIR = {Proceedings of International Conference on Research and Development
	in Information Retrieval, SIGIR}}

@STRING{SIGKDD = {Conference on Knowledge Discovery and Data Mining}}

@STRING{SIJAD = {SIAM Journal of Algebraic and Discrete Methods}}

@STRING{SIJC = {SIAM Journal of Computing}}

@STRING{SODA = {Symposium on Discrete Algorithms}}

@STRING{STACS = {Annual Symposium on Theoretical Aspects of Computer Science}}

@STRING{STOC = {ACM Symp. of the Theory of Computing}}

@STRING{SWAT = {Scandinavian Workshop on Algorithm Theory}}

@STRING{TAC = {Text Analysis Conference}}

@STRING{TASSP = {IEEE Transactions on Acoustics, speech, and Signal Processing}}

@STRING{TCS = {Theoretical Computer Science}}

@STRING{TMI = {Proceedings of the International Conference on Theoretical and Methodological
	Issues in Machine Translation}}

@STRING{TREC = {Text REtrieval Conference}}

@STRING{UAI = {Proceedings of Uncertainty in Artificial Intelligence (UAI)}}

@STRING{UWOED = {Proceedings of the Annual Conference of the UW Center for the New
	OED and Text Research}}

@STRING{WWW = {The International World Wide Web Conference}}

@INPROCEEDINGS{CannyRe,
  author = {Canny, J. and Reif, J.},
  title = {New Lower Bound Techniques for Robot Motion Planning Problems},
  pages = {49--60},
  crossref = {FOCS28},
  source = {http://theory.lcs.mit.edu/ dmjones/FOCS/focs.bib}
}

@INPROCEEDINGS{Dechter96a,
  author = {Rina Dechter},
  title = {Bucket elimination: A unifying framework for probabilistic inference},
  booktitle = {UAI},
  year = {1996},
  pages = {211-219},
  bibsource = {DBLP, http://dblp.uni-trier.de},
  crossref = {DBLP:conf/uai/1996},
  ee = {http://rome.exp.sis.pitt.edu/UAI/Abstract.asp?articleID=370{\&}proceedingID=12},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@INPROCEEDINGS{LowdDo08a,
  author = {Daniel Lowd and Pedro Domingos},
  title = {Learning Arithmetic Circuits},
  booktitle = {UAI},
  year = {2008},
  pages = {383-392},
  bibsource = {DBLP, http://dblp.uni-trier.de},
  crossref = {DBLP:conf/uai/2008},
  ee = {http://uai2008.cs.helsinki.fi/UAI_camera_ready/lowd.pdf},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@INPROCEEDINGS{BaGh07,
  author = {A. d'Aspremont and F. Bach and L. El Ghaoui},
  title = {Full regularization path for sparse principal component analysis},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {177--184},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{BBlei08,
  author = {J. Boyd-graber and D. Blei},
  title = {Syntactic Topic Models},
  booktitle = NIPS,
  year = {2008}
}

@ARTICLE{Ozveren91,
  author = {C{\"u}neyt M. {\"O}zveren and Alan S. Willsky and Panos J. Antsaklis},
  title = {Stability and Stabilizability of Descrete Event Dynamic Systems},
  journal = jacm,
  year = {1991},
  volume = {38},
  pages = {730-752},
  number = {3},
  month = jul,
  keywords = {Theory of Computation; Algorithms; Design; Languages; Reliability;
	Theory; reliability; self-stabalizing systems; stability; stabilizability;
	state feedback; }
}

@ARTICLE{UresinDu90,
  author = {Aydin {\"U}resin and Michel Dubois},
  title = {Parallel Asynchronous Algorithms for Discrete Data},
  journal = jacm,
  year = {1990},
  volume = {37},
  pages = {588-606},
  number = {3},
  month = jul,
  keywords = {Numerical Computation; Algorithms; Theory; asynchronous algorithms;
	consistent labeling; fixed point; iterative algorithms; synchronization;}
}

@INPROCEEDINGS{BadoiuCl02,
  author = {M. \Badoiu{} and K. L. Clarkson},
  title = {Optimal Core-Sets for Balls},
  booktitle = SODA,
  year = {2002},
  note = {to appear}
}

@INPROCEEDINGS{BadoiuHaIn02,
  author = {M. \Badoiu{} and S. {Har-Peled} and P. Indyk},
  title = {Approximate Clustering via Core-Sets},
  booktitle = STOC,
  year = {2002},
  pages = {250--257},
  url = {http://www.uiuc.edu/~sariel/research/papers/02/coreset/}
}

@INPROCEEDINGS{AimeurBrGa07,
  author = {E. A\"{i}meur and G. Brassard and S. Gambs},
  title = {Quantum clustering algorithms},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {1--8},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{ABDGMPS10,
  author = {A. Abad and L. Bentivogli and I. Dagan and D. Giampiccolo and S.
	Mirkin and E. Pianta and A. Stern},
  title = {A Resource for Investigating the Impact of Anaphora and Coreference
	on Inference.},
  booktitle = {LREC},
  year = {2010},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@ARTICLE{Abadi90,
  author = {Mart{\'\i}n Abadi and Zohar Manna},
  title = {Nonclausal Deduction in First-Order Temporal Logic},
  journal = jacm,
  year = {1990},
  volume = {37},
  pages = {279-317},
  number = {2},
  month = apr,
  keywords = {Logic; Theory; Verification; automated deduction; concurrent-program
	verification; first-order temporal logic; nonclausal resolution;
	theorem proving; }
}

@INPROCEEDINGS{AABRS99,
  author = {Elias Abboud and Nader Agha and Nader H. Bshouty and Nizar Radwan
	and Fathi Saleh},
  title = {Learning threshold functions with small weights using membership
	queries},
  booktitle = COLT,
  year = {1999},
  pages = {318--322},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{Abe97,
  author = {N. Abe},
  title = {Towards Realistic Theories of Learning},
  journal = {New Generation Computing},
  year = {1997},
  volume = {15},
  pages = {3--26},
  number = {1},
  note = {Special issue for AII '94 and ALT '94}
}

@INPROCEEDINGS{Abe93,
  author = {N. Abe},
  title = {On the sample complexity of various learning strategies in the probabilistic
	{PAC} learning paradigms},
  booktitle = {International Workshop on Nonmonotonic and Inductive Logic},
  year = {1993},
  volume = {659},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {89--106},
  publisher = {Springer--Verlag}
}

@INPROCEEDINGS{Abe92,
  author = {N. Abe},
  title = {Preservation of predictability under polynomially sparse variations
	and its applications},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1992},
  pages = {163--174},
  publisher = {IOS Press}
}

@ARTICLE{Abe91,
  author = {N. Abe},
  title = {Learning Commutative Deterministic Finite State Automata in Polynomial
	Time},
  journal = {New Generation Computing},
  year = {1991},
  volume = {8},
  pages = {319--336},
  number = {4},
  note = {First appeared in Proc. First Int. Workshop on Alg. Learning Theory,
	1990}
}

@INPROCEEDINGS{Abe89,
  author = {Naoki Abe},
  title = {Polynomial Learnability of Semilinear Sets (Extended Abstract)},
  booktitle = COLT,
  year = {1989},
  address = {Santa Cruz, Cal.\ }
}

@INPROCEEDINGS{AbeLi96,
  author = {Naoki Abe and Hang Li},
  title = {Learning word association norms using tree cut pair models},
  booktitle = ICML,
  year = {1996},
  pages = {3--11},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{AbeLiNa95,
  author = {N. Abe and H. Li and A. Nakamura},
  title = {On-line learning of binary lexical relations using two-dimensional
	weighted majority algorithms},
  booktitle = ICML,
  year = {1995},
  pages = {3--11},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{AbeLo99,
  author = {Naoki Abe and Philip M. Long},
  title = {Associative reinforcement learning using linear probabilistic concepts},
  booktitle = ICML,
  year = {1999},
  pages = {3--11},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{AbeMa98,
  author = {Naoki Abe and Hiroshi Mamitsuka},
  title = {Query learning strategies using boosting and bagging},
  booktitle = ICML,
  year = {1998},
  pages = {1--9},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@ARTICLE{AbeMa97,
  author = {Naoki Abe and Hiroshi Mamitsuka},
  title = {Predicting protein secondary structure using stochastic tree grammars},
  journal = {Machine Learning},
  year = {1997},
  volume = {29},
  pages = {275--301},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{AbeMa94,
  author = {Naoki Abe and Hiroshi Mamitsuka},
  title = {A new method for predicting protein secondary structures based on
	stochastic tree grammars},
  booktitle = ICML,
  year = {1994},
  pages = {3--11},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{AbeNa99,
  author = {Naoki Abe and Atsuyoshi Nakamura},
  title = {Leaning to optimally schedule internet banner advertisements},
  booktitle = ICML,
  year = {1999},
  pages = {12--21},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{AbeTa93,
  author = {N. Abe and J. Takeuchi},
  title = {The `lob-pass' problem and an on-line learning model of rational
	choice},
  booktitle = COLT,
  year = {1993},
  pages = {422--428},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{AbeTaWa91,
  author = {N. Abe and J. Takeuchi and M. K. Warmuth},
  title = {Polynomial learnability of probabilistic concepts with respect to
	the {K}ullback-{L}eibler divergence},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1991},
  pages = {277--289},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{AbeWa90,
  author = {Abe, N. and M. Warmuth},
  title = {On the computational complexity of approximatingdistributions by
	probabilistic automata},
  booktitle = COLT,
  year = {1990},
  pages = {52--66},
  publisher = {Morgan Kaufmann},
  comment = {Hidden Markov Model}
}

@ARTICLE{AbeWa92b,
  author = {Naoki Abe and Manfred K. Warmuth},
  title = {On the Computational Complexity of Approximating Distributions by
	Probabilistic Automata},
  journal = {Machine Learning},
  year = {1992},
  volume = {9},
  pages = {205--260},
  note = {Special issue for COLT90},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{AbeWa92,
  author = {Abe, Naoki and Osamu Watanabe},
  title = {Polynomially Sparse Variations and Reducibility amongprediction problems},
  journal = {IEICE Trans. Inf. \& Syst.},
  year = {1992},
  volume = {E75-D},
  pages = {449--458},
  number = {4},
  month = Jul,
  comment = {Gives an example to distinguish Turing-reducibility andprediction-preserving
	reducibility}
}

@BOOK{AbelsonSuSu96,
  title = {Structure and interpretation of computer programs},
  publisher = {MIT Press},
  year = {1996},
  author = {H. Abelson and G. J. Sussman and J. Sussman}
}

@ARTICLE{Abiteboul89,
  author = {Serge Abiteboul and Victor Vianu},
  title = {A Transaction-Based Approach to Relational Database Specification},
  journal = jacm,
  year = {1989},
  volume = {36},
  pages = {758-789},
  number = {4},
  month = oct,
  keywords = {Database Theory; Design; Languages; Management; Performance; Theory;
	Verification; dynamic and static constraints; methods; object-oriented
	databases; operational specification; transactional schema; }
}

@INCOLLECTION{Abney96a,
  author = {S. P. Abney},
  title = {Statistical Methods and Linguistics},
  booktitle = {The Balancing Act: Combining Symbolic and Statistical Approaches
	to Language},
  publisher = {MIT Press},
  year = {1996},
  editor = { J. Klavans and P. Resnik }
}

@INCOLLECTION{Abney91,
  author = {S. P. Abney},
  title = {Parsing by Chunks},
  booktitle = {Principle-based parsing: Computation and Psycholinguistics},
  publisher = {Kluwer},
  year = {1991},
  editor = {R. C. Berwick, S. P. Abney and C. Tenny},
  pages = {257--278},
  address = {Dordrecht}
}

@INPROCEEDINGS{Abney02,
  author = {S. P. Abney},
  title = {Bootstrapping},
  booktitle = ACL,
  year = {2002},
  pages = {360--367}
}

@INCOLLECTION{Abney96,
  author = {S. P. Abney},
  title = {Chunk Stylebook},
  publisher = {Working draft},
  year = {1996},
  address = {http://www.sfs.nphil.uni-tuebingen.de/~abney/Papers.html\#96i}
}

@BOOK{AbramowitzSt72,
  title = {{Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical
	Tables}},
  publisher = {Dover},
  year = {1972},
  author = {Milton Abramowitz and Irene A. Stegun},
  pages = {823-824},
  address = {New York, NY},
  paragraph = {24.1.2},
  printing = {9th}
}

@ARTICLE{Abu-Mostafa89,
  author = {Y. S. Abu-Mostafa},
  title = {The {V}apnik-{C}hervonenkis Dimension: Information verses Complexity
	in Learning},
  journal = {Neural Computation},
  year = {1989},
  volume = {1},
  pages = {312--317},
  number = {3}
}

@ARTICLE{Aceto92,
  author = {L. Aceto and M. Hennessy},
  title = {Termination, Deadlock, and Divergence},
  journal = jacm,
  year = {1992},
  volume = {39},
  pages = {147-187},
  number = {1},
  month = jan,
  keywords = {Programming Languages and Methodology; Languages; Theory; }
}

@INPROCEEDINGS{AchananuparpHuSh08,
  author = {P. Achananuparp and X. Hu and X. Shen},
  title = {The {E}valuation of {S}entence {S}imilarity {M}easures},
  booktitle = DaWaK,
  year = {2008},
  pages = {305--316}
}

@INPROCEEDINGS{SenSimEval,
  author = {Palakorn Achananuparp and Xiaohua Hu and Xiajiong Shen},
  title = {The {E}valuation of {S}entence {S}imilarity {M}easures},
  booktitle = DaWaK,
  year = {2008},
  pages = {305--316}
}

@INPROCEEDINGS{Achlioptas01,
  author = {D. Achlioptas},
  title = {Database-friendly random projections},
  booktitle = {PODS},
  year = {2001},
  pages = {274--281},
  annote = {A replacement of JL that uses only -1, 0, 1}
}

@ARTICLE{AckleyHiSe85,
  author = {D. H. Ackley and G. E. Hinton and T. J. Sejnowski},
  title = {A Learning Algorithm for {B}oltzmann Machines},
  journal = {Cognitive Science},
  year = {1985},
  volume = {9},
  pages = {147--169}
}

@INPROCEEDINGS{Adams06,
  author = {Rod Adams},
  title = {Textual Entailment through Extended Lexical Overlap},
  booktitle = {PASCAL Challenges Workshop on Recognizing Textual Entailment},
  year = {2006}
}

@MASTERSTHESIS{Adams90,
  author = {R. T. Adams},
  title = {Inference of {LISP} Programs from Examples},
  school = {MIT EECS Department},
  year = {1990},
  type = {Bachelor's thesis},
  month = jun
}

@ARTICLE{AdlemanBl91,
  author = {L. Adleman and M. Blum},
  title = {Inductive Inference and Unsolvability},
  journal = {J. Symbolic Logic},
  year = {1991},
  volume = {56},
  pages = {891--900},
  number = {3},
  annote = {Was Berkeley EECS TR in 1975}
}

@ARTICLE{AdeRaBr95,
  author = {Hilde Ad{\'{e}} and Luc De Raedt and Maurice Bruynooghe},
  title = {Declarative Bias for Specific-to-General {ILP} Systems},
  journal = {Machine Learning},
  year = {1995},
  volume = {20},
  pages = {119--154},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{AfekHaBr01,
  author = {Y.~Afek and S. {Har-Peled} and A.~{Bremler-Barr}},
  title = {Routing with a Clue},
  journal = {IEEE\slash ACM Transactions on Networking},
  year = {2001},
  volume = {9},
  pages = {693--705},
  number = {6},
  month = dec
}

@INPROCEEDINGS{AgarwalCh07,
  author = {A. Agarwal and S. Chakrabarti},
  title = {Learning random walks to rank nodes in graphs},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {9--16},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INCOLLECTION{Agarwal97,
  author = {P. K. Agarwal},
  title = {Range searching},
  booktitle = {Handbook of Discrete and Computational Geometry},
  publisher = {CRC Press LLC},
  year = {1997},
  editor = {J. E. Goodman and J. O'Rourke},
  chapter = {31},
  pages = {575--598},
  address = {Boca Raton, FL},
  url = {http://www.cs.duke.edu/~pankaj/papers/revised-rs.ps.gz}
}

@INCOLLECTION{Agarwal91,
  author = {P. K. Agarwal},
  title = {Geometric partitioning and its applications},
  booktitle = {Computational Geometry: Papers from the DIMACS Special Year},
  publisher = {American Mathematical Society},
  year = {1991},
  editor = {J. E. Goodman and R. Pollack and W. Steiger},
  pages = {1--37},
  comments = {survey paper --- cuttings, range search},
  key = {xxxx},
  keywords = {random sampling, partition, arrangement, point location}
}

@BOOK{Agarwal91a,
  title = {Intersection and Decomposition Algorithms for Planar Arrangements},
  publisher = {Cambridge University Press},
  year = {1991},
  author = {P. K. Agarwal},
  address = {New York, NY},
  keywords = {arrangement, partition, Davenport-Schinzel sequences},
  url = {http://www.cup.org/titles/catalogue.asp?isbn=0521404460}
}

@ARTICLE{Agarwal90,
  author = {P. K. Agarwal},
  title = {Partitioning arrangements of lines: {II}. {Applications}},
  journal = DCG,
  year = {1990},
  volume = {5},
  pages = {533--573},
  keywords = {random sampling, arrangements, divide-and-conquer}
}

@INPROCEEDINGS{AABV99,
  author = {P. K. Agarwal and L. Arge and G. Brodal and J. S. Vitter},
  title = {I/O-efficient dynamic point location in monotone subdivisions},
  booktitle = SODA,
  year = {1999},
  pages = {11--20}
}

@INPROCEEDINGS{AgarwalArEr00,
  author = {P. K. Agarwal and L. Arge and J. Erickson},
  title = {Indexing Moving Points},
  booktitle = {PODS},
  year = {2000},
  pages = {175--186},
  url = {http://compgeom.cs.uiuc.edu/~jeffe/pubs/kindex.html}
}

@ARTICLE{AAEFV00,
  author = {P. K. Agarwal and L. Arge and J. Erickson and P. G. Franciosa and
	J. S. Vitter},
  title = {Efficient Searching with Linear Constraints},
  journal = {Journal of Computer and System Sciences},
  year = {2000},
  volume = {61},
  pages = {194--216},
  number = {2},
  annote = {{728}}
}

@UNPUBLISHED{AgarwalArGo00,
  author = {P. K. Agarwal and L. Arge and S. Govindarajan},
  title = {{I/O}-Efficient Construction of Well Seperated Pairs Decomposition},
  note = {manuscript},
  year = {2000}
}

@ARTICLE{AACS98,
  author = {P. K. Agarwal and B. Aronov and T. M. Chan and M. Sharir},
  title = {On Levels in Arrangements of Lines, Segments, Planes, and Triangles},
  journal = DCG,
  year = {1998},
  volume = {19},
  pages = {315--331}
}

@ARTICLE{AAHS00,
  author = {P. K. Agarwal and B. Aronov and S. {Har-Peled} and M. Sharir},
  title = {Approximation and Exact Algorithms for Minimum-Width Annuli and Shells},
  journal = DCG,
  year = {2000},
  volume = {24},
  pages = {687--705},
  number = {4},
  url = {http://www.uiuc.edu/~sariel/research/papers/98/min_width_annulus.html}
}

@INPROCEEDINGS{AAHS99,
  author = {P. K. Agarwal and B. Aronov and S. {Har-Peled} and M. Sharir},
  title = {Approximation and Exact Algorithms for Minimum-Width Annuli and Shells},
  booktitle = {SOCG},
  year = {1999},
  pages = {380--389}
}

@ARTICLE{AAOS97,
  author = {P. K. Agarwal and B. Aronov and J. O'Rourke and C. A. Schevon},
  title = {Star Unfolding of a Polytope with Applications},
  journal = SICOMP,
  year = {1997},
  volume = {26},
  pages = {1679--1713},
  keywords = {motion planning, shortest paths, polytopes, diameter, edge sequences,
	unfolding of polytopes}
}

@ARTICLE{AgarwalArSh01,
  author = {P. K. Agarwal and B. Aronov and M. Sharir},
  title = {Exact and Approximation Algorithms for Minimum-Width Cylindrical
	Shells},
  journal = DCG,
  year = {2001},
  volume = {26},
  pages = {307--320},
  number = {3},
  url = {http://www.math.tau.ac.il/~michas/shellqq.ps}
}

@INPROCEEDINGS{AgarwalArSh00,
  author = {P. K. Agarwal and B. Aronov and M. Sharir},
  title = {Exact and Approximation Algorithms for Minimum-Width Cylindrical
	Shells},
  booktitle = SODA,
  year = {2000},
  pages = {510--517},
  url = {http://www.math.tau.ac.il/~michas/shellqq.ps}
}

@ARTICLE{AgarwalArSh97,
  author = {P. K. Agarwal and B. Aronov and M. Sharir},
  title = {Computing Envelopes in Four Dimensions with Applications},
  journal = SICOMP,
  year = {1997},
  volume = {26},
  pages = {1714--1732},
  url = {http://epubs.siam.org/sam-bin/dbq/article/26572}
}

@INPROCEEDINGS{ABBGH99,
  author = {P. K. Agarwal and J. Basch and M. de Berg and L. J. Guibas and J.
	Hershberger},
  title = {Lower Bounds for Kinetic Planar Subdivisions},
  booktitle = {SOCG},
  year = {1999},
  pages = {247--254}
}

@INCOLLECTION{ABGHZ01,
  author = {P. K.~Agarwal and J. Basch and L. J.~Guibas and J. Hershberger and
	L. Zhang},
  title = {Deformable free space tiling for kinetic collision detection},
  booktitle = {Algorithmic and Computational Robotics: New Directions},
  publisher = {A. K. Peters},
  year = {2001},
  editor = {B. R. Donald and K. Lynch and D. Rus},
  pages = {83--96}
}

@INPROCEEDINGS{ABHOSV01,
  author = {P. K. Agarwal and M. de Berg and S. {Har-Peled} and M. H. Overmars
	and M. Sharir and J. Vahrenhold},
  title = {Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions},
  booktitle = {WADS},
  year = {2001},
  editor = {F. Dehne and J. Sack and R. Tamassia},
  volume = {2125},
  series = LNCS,
  pages = {122--134}
}

@ARTICLE{ABHOSV02,
  author = {P. K. Agarwal and M. de Berg and S. {Har-Peled} and M. H. Overmars
	and M. Sharir and J. Vahrenhold},
  title = {Reporting intersecting pairs of convex polytopes in two and three
	dimensions},
  journal = CGTA,
  year = {2002},
  volume = {23},
  pages = {195--207},
  month = {August},
  issue = {2}
}

@ARTICLE{ABMS98,
  author = {P. K. Agarwal and M. de Berg and J. Matou{\v s}ek and O. Schwarzkopf},
  title = {Constructing Levels in Arrangements and Higher Order {Voronoi} Diagrams},
  journal = SICOMP,
  year = {1998},
  volume = {27},
  pages = {654--667},
  url = {http://epubs.siam.org/sam-bin/dbq/article/28184}
}

@INPROCEEDINGS{AgarwalBhSe99,
  author = {P. K. Agarwal and B. Bhattacharya and S. Sen},
  title = {Output-sensitive algorithms for uniform partitions of points},
  booktitle = {ISAAC10},
  year = {1999}
}

@INPROCEEDINGS{AgarwalDe00,
  author = {P. K. Agarwal and P. K. Desikan},
  title = {Approximation algorithms for layered manufacturing},
  booktitle = SODA,
  year = {2000},
  note = {to appear}
}

@UNPUBLISHED{AgarwalDeMu00,
  author = {P. K. Agarwal and P. K. Desikan and T. M. Murali},
  title = {Occlusion culling using exact shadow computations and ray-shooting
	queries},
  note = stSOCG16,
  year = {2000}
}

@ARTICLE{AgarwalEfSh99,
  author = {P. K. Agarwal and A. Efrat and M. Sharir},
  title = {Vertical decomposition of shallow levels in $3$-dimensional arrangements
	and its applications},
  journal = SICOMP,
  year = {1999},
  volume = {29},
  pages = {912--953}
}

@INPROCEEDINGS{AEGH98,
  author = {P. K. Agarwal and D. Eppstein and L. J. Guibas and M. Henzinger},
  title = {Parametric and kinetic minimum spanning trees},
  booktitle = FOCS,
  year = {1998},
  pages = {596--605}
}

@INCOLLECTION{AgarwalEr98,
  author = {P. K. Agarwal and J. Erickson},
  title = {Geometric range searching and its relatives},
  booktitle = {Advances in Discrete and Computational Geometry},
  publisher = {AMS Press},
  year = {1998},
  editor = {B. Chzelle, J. E. Goodman and R. Pollack},
  address = {Providence, RI}
}

@INPROCEEDINGS{AgarwalErGu98,
  author = {P. K. Agarwal and J. Erickson and L. J. Guibas},
  title = {Kinetic {BSP}s for Intersecting Segments and Disjoint Triangles},
  booktitle = SODA,
  year = {1998},
  pages = {107--116},
  nickname = {SODA '98}
}

@UNPUBLISHED{AgarwalFlHa00,
  author = {P. K. Agarwal and E. Flato and D. Halperin},
  title = {Polygon decomposition for efficient construction of Minkowski sums},
  note = stSOCG16,
  year = {2000}
}

@INPROCEEDINGS{AgarwalGaGu02,
  author = {P. K. Agarwal and J. Gao and L. J. Guibas},
  title = {Kinetic medians and $kd$-trees},
  booktitle = ESA,
  year = {2002},
  pages = {5-16},
  url = {http://www.cs.duke.edu/~pankaj/papers/kinetic-kdtree.pdf.gz}
}

@ARTICLE{AGHRS00,
  author = {P. K. Agarwal and L. J. Guibas and S. {Har-Peled} and A. Rabinovitch
	and M. Sharir},
  title = {Penetration Depth of Two Convex Polytopes in 3D},
  journal = {Nordic J. Comput.},
  year = {2000},
  volume = {7},
  pages = {227--240},
  number = {3}
}

@INPROCEEDINGS{AGHRS00a,
  author = {P. K. Agarwal and L. J. Guibas and S. {Har-Peled} and A. Rabinovitch
	and M. Sharir},
  title = {Computing the Penetration Depth of Two Convex Polytopes in 3D},
  booktitle = SWAT,
  year = {2000},
  pages = {328--338}
}

@ARTICLE{AGHV01,
  author = {P. K. Agarwal and L. J. Guibas and J. Hershberger and E. Veach},
  title = {Maintaining the Extent of a Moving Point Set},
  journal = DCG,
  year = {2001},
  volume = {26},
  pages = {353--374},
  number = {3},
  url = {http://graphics.stanford.edu/papers/extent/}
}

@INPROCEEDINGS{AGHV97,
  author = {P. K. Agarwal and L. J. Guibas and J. Hershberger and E. Veach},
  title = {Maintaining the extent of a moving point set},
  booktitle = {WADS},
  year = {1997},
  volume = {1272},
  series = {Lecture Notes Comput. Sci.},
  pages = {31--44},
  publisher = {Springer-Verlag},
  nickname = {WADS '97},
  site = {Halifax, Canada}
}

@INPROCEEDINGS{AGMV97,
  author = {P. K. Agarwal and L. J. Guibas and T. M. Murali and J. S. Vitter},
  title = {Cylindrical Static and Kinetic Binary Space Partitions},
  booktitle = {SOCG},
  year = {1997},
  pages = {39--48}
}

@ARTICLE{AgarwalHaKa02,
  author = {P. K.~Agarwal and S.~Har-Peled and M.~Karia},
  title = {Computing Approximate Shortest Paths on Convex Polytopes},
  journal = ALGORITHMICA,
  year = {2002},
  volume = {33},
  pages = {227--242},
  number = {2}
}

@INPROCEEDINGS{AgarwalHa01,
  author = {P. K. Agarwal and S. {Har-Peled}},
  title = {Maintaining the Approximate Extent Measures of Moving Points},
  booktitle = SODA,
  year = {2001},
  pages = {148--157},
  url = {http://www.uiuc.edu/~sariel/research/papers/00/extent.html}
}

@UNPUBLISHED{AgarwalHa00,
  author = {P. K. Agarwal and S. {Har-Peled}},
  title = {Approximating shortest-path of terrains},
  note = {manuscript},
  year = {2000}
}

@INPROCEEDINGS{AgarwalHaKa00,
  author = {P. K. Agarwal and S. {Har-Peled} and M. Karia},
  title = {Computing Approximate Shortest Paths on Convex Polytopes},
  booktitle = {SOCG},
  year = {2000},
  pages = {270--279},
  url = {http://www.cs.duke.edu/\tildegen{}sariel/papers/99/navigator.html}
}

@UNPUBLISHED{AgarwalHaKa99,
  author = {P. K. Agarwal and S. {Har-Peled} and M. Karia},
  title = {Shortest path --- demo program},
  note = {{\tt http://www.cs} {\tt .duke.edu/\tildegen{}} {\tt {sariel/papers/99/nav/nav.html}}},
  year = {1999}
}

@UNPUBLISHED{AgarwalHaMu00,
  author = {P. K. Agarwal and S. {Har-Peled} and N. Mustafa},
  title = {Curve Simplification Revisited},
  note = {manuscript},
  year = {2000}
}

@INPROCEEDINGS{AHMW02,
  author = {P. K. Agarwal and S. {Har-Peled} and N. Mustafa and Y. Wang},
  title = {Near-Linear Time Approximation Algorithms for Curve Simplification
	in Two and Three dimensions},
  booktitle = ESA,
  year = {2002}
}

@ARTICLE{AHSV97,
  author = {P. K. Agarwal and S. {Har-Peled} and M. Sharir and K. R. Varadarajan},
  title = {Approximate Shortest Paths on a Convex Polytope in Three Dimensions},
  journal = JACM,
  year = {1997},
  volume = {44},
  pages = {567--584}
}

@ARTICLE{AgarwalHaVa03,
  author = {P. K. Agarwal and S. {Har-Peled} and K. R. Varadarajan},
  title = {Approximating Extent Measures of Points},
  journal = JACM,
  year = {2003},
  note = {to appear},
  url = {http://www.uiuc.edu/~sariel/research/papers/01/fitting/}
}

@INCOLLECTION{AKKSW99,
  author = {P. K. Agarwal and L. Knipping and M. van Kreveld and T. Strijk and
	A. Wolf},
  title = {A Simple and Efficient Algorithm for High-Quality Line Labeling},
  booktitle = {Innovations in GIS VII: GeoComputation},
  publisher = {Taylor and Francis},
  year = {1999},
  editor = {P. Atkinson and D. Martin},
  address = {Lonton},
  note = {to appear}
}

@ARTICLE{AgarwalKr94,
  author = {P. K. Agarwal and M. van Kreveld},
  title = {Implicit Point Location in Arrangements of Line Segments, with an
	Application to Motion Planning},
  journal = IJCGA,
  year = {1994},
  volume = {4},
  pages = {369--383},
  keywords = {point location, motion planning, arrangements}
}

@ARTICLE{AgarwalMa95,
  author = {P. K. Agarwal and J. Matou{\v s}ek},
  title = {Dynamic Half-Space Range Reporting and Its Applications},
  journal = {Algorithmica},
  year = {1995},
  volume = {13},
  pages = {325--345},
  keywords = {arrangements, cuttings, range-searching, dynamization}
}

@ARTICLE{AgarwalMa94,
  author = {P. K. Agarwal and J. Matou{\v s}ek},
  title = {On range searching with semialgebraic sets},
  journal = DCG,
  year = {1994},
  volume = {11},
  pages = {393--418}
}

@ARTICLE{AgarwalMaSc98,
  author = {P. K. Agarwal and J. Matou{\v s}ek and O. Schwarzkopf},
  title = {Computing Many Faces in Arrangements of Lines and Segments},
  journal = SICOMP,
  year = {1998},
  volume = {27},
  pages = {491--505},
  number = {2},
  url = {http://epubs.siam.org/sam-bin/dbq/article/26616}
}

@INPROCEEDINGS{AgarwalMaSc94,
  author = {P. K. Agarwal and J. Matou{\v s}ek and O. Schwarzkopf},
  title = {Computing Many Faces in Arrangements of Lines and Segments},
  booktitle = {SOCG},
  year = {1994},
  pages = {76--84},
  url = {ftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1994/1994-39.ps.gz}
}

@ARTICLE{AgarwalMaSu92,
  author = {P. K. Agarwal and J. Matou{\v s}ek and S. Suri},
  title = {Farthest neighbors, maximum spanning trees and related problems in
	higher dimensions},
  journal = CGTA,
  year = {1992},
  volume = {1},
  pages = {189--201},
  number = {4}
}

@ARTICLE{AgarwalPr02,
  author = {P. K. Agarwal and C. M. Procopiuc},
  title = {Exact and Approximation Algorithms for Clustering},
  journal = {Algorithmica},
  year = {2002},
  volume = {33},
  pages = {201--226},
  number = {2},
  url = {http://link.springer.de/link/service/journals/00453/bibs/2033002/20330201.html}
}

@INPROCEEDINGS{AgarwalPr00,
  author = {P. K. Agarwal and C. M. Procopiuc},
  title = {Approximation Algorithms for Projective Clustering},
  booktitle = SODA,
  year = {2000},
  pages = {538--547}
}

@INPROCEEDINGS{AgarwalPr98,
  author = {P. K. Agarwal and C. M. Procopiuc},
  title = {Exact and Approximation Algorithms for Clustering},
  booktitle = SODA,
  year = {1998},
  pages = {658--667},
  nickname = {SODA '98}
}

@INPROCEEDINGS{AgarwalPrVa02,
  author = {P. K. Agarwal and C. M. Procopiuc and K. R. Varadarajan},
  title = {Approximation algorithms for $k$-line center},
  booktitle = ESA,
  year = {2002},
  pages = {54--63},
  url = {http://link.springer.de/link/service/series/0558/bibs/2461/24610054.htm}
}

@INPROCEEDINGS{ASSW03,
  author = {P. K. Agarwal and S.{Har-Peled} and M. Sharir and Y. Wang},
  title = {Hausdorff Distance under Translation for Points, Disks, and Balls},
  booktitle = {SOCG},
  year = {2003},
  pages = {282--291},
  url = {http://www.uiuc.edu/~sariel/research/papers/02/hausdorff/}
}

@ARTICLE{AgarwalScSh96,
  author = {P. K. Agarwal and O. Schwarzkopf and M. Sharir},
  title = {The overlay of lower envelopes and its applications},
  journal = DCG,
  year = {1996},
  volume = {15},
  pages = {1--13},
  url = {http://link.springer.de/link/service/journals/00454/bibs/15n1p1.html}
}

@INCOLLECTION{AgarwalSe99,
  author = {P. K. Agarwal and S. Sen},
  title = {Randomized algorithms for geometric optimization},
  booktitle = {Handbook of Randomized Computation},
  publisher = {Kluwar Academic Press},
  year = {1999},
  editor = {J. Pardalos and S. Rajasekaran and J. Reif and J. Rolim},
  note = {to appear}
}

@INCOLLECTION{AgarwalSh00,
  author = {P.~K. Agarwal and M.~Sharir},
  title = {Arrangements and their applications},
  booktitle = {Handbook of Computational Geometry},
  publisher = {Elsevier Science Publishers B.V. North-Holland},
  year = {2000},
  editor = {J.-R. Sack and J.~Urrutia},
  pages = {49--119},
  address = {Amsterdam},
  url = {http://www.cs.duke.edu/~pankaj/papers/arrangement-survey.ps.gz}
}

@ARTICLE{AgarwalSh00a,
  author = {P. K. Agarwal and M. Sharir},
  title = {Pipes, Cigars, and Kreplach: The Union of Minkowski Sums in Three
	Dimensions},
  journal = DCG,
  year = {2000},
  volume = {24},
  pages = {645--657}
}

@INPROCEEDINGS{AgarwalSh99,
  author = {P. K. Agarwal and M. Sharir},
  title = {Motion planning of a ball amid polyhedral obstacles in three dimensions},
  booktitle = SODA,
  year = {1999},
  pages = {21--30}
}

@INPROCEEDINGS{AgarwalSh99b,
  author = {P. K. Agarwal and M. Sharir},
  title = {Pipes, Cigars, and Kreplach: The Union of Minkowski Sums in Three
	Dimensions},
  booktitle = {SOCG},
  year = {1999},
  pages = {143--153}
}

@ARTICLE{AgarwalSh98,
  author = {P. K. Agarwal and M. Sharir},
  title = {Efficient algorithms for geometric optimization},
  journal = {ACM Comput. Surv.},
  year = {1998},
  volume = {30},
  pages = {412--458},
  url = {http://www.cs.duke.edu/~pankaj/papers/geom-full.ps.gz}
}

@ARTICLE{AgarwalSh96,
  author = {P. K. Agarwal and M. Sharir},
  title = {Efficient Randomized Algorithms for Some Geometric Optimization Problems},
  journal = DCG,
  year = {1996},
  volume = {16},
  pages = {317--337},
  url = {http://link.springer.de/link/service/journals/00454/bibs/16n4p317.html}
}

@ARTICLE{AgarwalSh96a,
  author = {P. K. Agarwal and M. Sharir},
  title = {Ray shooting amidst convex polygons in {2D}},
  journal = JALG,
  year = {1996},
  volume = {21},
  pages = {508--519}
}

@ARTICLE{AgarwalSh90,
  author = {P. K. Agarwal and M. Sharir},
  title = {Red-blue intersection detection algorithms, with applications to
	motion planning and collision detection},
  journal = SICOMP,
  year = {1990},
  volume = {19},
  pages = {297--321},
  number = {2}
}

@ARTICLE{AgarwalShSh89,
  author = {P. K. Agarwal and M. Sharir and P. W. Shor},
  title = {{Sharp upper and lower bounds for the length of general Davenport-Schinzel
	sequences}},
  journal = {J. Combin. Theory. Ser A.},
  year = {1989},
  volume = {52},
  pages = {228--274}
}

@ARTICLE{AgarwalShTo94,
  author = {P. K. Agarwal and M. Sharir and S. Toledo},
  title = {Applications of parametric searching in geometric optimization},
  journal = JALG,
  year = {1994},
  volume = {17},
  pages = {292--318},
  keywords = {parametric search}
}

@INPROCEEDINGS{AgarwalShWe97,
  author = {P. K. Agarwal and M. Sharir and E. Welzl},
  title = {The Discrete $2$-Center Problem},
  booktitle = {SOCG},
  year = {1997},
  pages = {147--155}
}

@ARTICLE{AgarwalSu98,
  author = {P. K. Agarwal and S. Suri},
  title = {Surface Approximation and Geometric Partitions},
  journal = SICOMP,
  year = {1998},
  volume = {27},
  pages = {1016--1035},
  number = {4}
}

@ARTICLE{ABOSY89,
  author = {A. Aggarwal and H. Booth and J. O'Rourke and S. Suri and C. K. Yap},
  title = {Finding minimal convex nested polygons},
  journal = {Inform. Comput.},
  year = {1989},
  volume = {83},
  pages = {98--110},
  number = {1},
  month = oct,
  keywords = {packing, visibility, convex polygons, extremal figures}
}

@ARTICLE{AGSS89,
  author = {A. Aggarwal and L. J. Guibas and J. Saxe and P. W. Shor},
  title = {A linear-time algorithm for computing the {Voronoi} diagram of a
	convex polygon},
  journal = DCG,
  year = {1989},
  volume = {4},
  pages = {591--604},
  number = {6},
  keywords = {convex polygons, Voronoi diagram}
}

@ARTICLE{AggarwalVi88,
  author = {A. Aggarwal and J. S. Vitter},
  title = {The input/output complexity of sorting and related problems},
  journal = {Commun. ACM},
  year = {1988},
  volume = {31},
  pages = {1116--1127}
}

@INPROCEEDINGS{AWYPP99,
  author = {C. C. Aggarwal and J. L. Wolf and P. S. Yu and C. Procopiuc and J.
	S. Park},
  title = {Fast algorithms for projected clustering},
  booktitle = {SIGMOD},
  year = {1999},
  pages = {61--72}
}

@MISC{AgirreAnMaHo01,
  author = {E. Agirre and O. Ansa and D. Martinez and E. Hovy},
  title = {Enriching WordNet concepts with topic signatures},
  year = {2001},
  address = {Pittsburg},
  booktitle = {NAACL - Worshop on WordNet and Other Lexical Resources: Applications,
	Extensions and Customizations}
}

@INPROCEEDINGS{AgirreLo09,
  author = {Agirre, Eneko and Lopez de Lacalle, Oier},
  title = {Supervised Domain Adaption for {WSD}},
  booktitle = ACL,
  year = {2009},
  pages = {42--50},
  address = {Athens, Greece},
  month = {March},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/E09-1006}
}

@BOOK{Agresti90,
  title = {Categorical Data Analysis},
  publisher = {John Wiley \& Sons},
  year = {1990},
  author = {Alan Agresti}
}

@ARTICLE{Aha91,
  author = {David W. Aha and Dennis Kibler and M. K. Albert},
  title = {Instance-Based learning Algorithms},
  journal = {Machine Learning},
  year = {1991},
  volume = {6},
  pages = {37-66}
}

@ARTICLE{AhaKiAl91,
  author = {David W. Aha and Dennis Kibler and Marc K. Albert},
  title = {Instance-Based Learning Algorithms},
  journal = {Machine Learning},
  year = {1991},
  volume = {6},
  pages = {37--66},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{ALLM94,
  author = {W. {Aha, David} and Stephanie Lapointe and Charles X. Ling and Stan
	Matwin},
  title = {Learning recursive relations with randomly selected small training
	sets},
  booktitle = ICML,
  year = {1994},
  pages = {12--18},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{AHHHL99,
  author = {Y. Aharoni and D. Halperin and I. Hanniel and S. {Har-Peled} and
	C. Linhart},
  title = {On-line Zone Construction in Arrangements of Lines in the Plane},
  booktitle = {Workshop on Algorithm Engineering},
  year = {1999},
  pages = {139--153},
  html = {http://www.cs.duke.edu/ sariel/papers/99/zone.html},
  nickname = {WAE '99}
}

@TECHREPORT{Ahmad88,
  author = {S. Ahmad},
  title = {A Study of Scaling and Generalization in Neural Networks},
  institution = {University of Illinois at Urbana-Champaign},
  year = {1988},
  number = {UIUCDCS-R-88-1454},
  month = sep,
  comment = {UILU-ENG-88-1759.}
}

@ARTICLE{AhnCoCoFr88,
  author = {Ahn, S., and A. Cooper and G. Cornuejols and A. Frieze},
  title = {Probabilistic Analysis of a Relaxation for the $K$-Median Problem},
  journal = {Mathematics of Operations Research},
  year = {1988},
  volume = {13},
  pages = {1--31},
  month = Feb
}

@INPROCEEDINGS{AhoSeUl86,
  author = {A. V. Aho and R. Sethi and J. D. Ullman},
  title = {Compilers: Principles, Techniques, and Tools},
  booktitle = {Addison-Wesley Publishing Company, Reading, MA},
  year = {1986},
  timestamp = {2007.01.26}
}

@ARTICLE{Ahuja90,
  author = {Ravindra K. Ahuja and Kurt Mehlhorn and James B. Orlin and Robert
	E. Tarjan},
  title = {Faster Algorithms for the Shortest Path Problem},
  journal = jacm,
  year = {1990},
  volume = {37},
  pages = {213-223},
  number = {2},
  month = apr,
  keywords = {Data Structure and Algorithms; Algorithms; Design; Theory; heap; priority
	queue; shortest paths; }
}

@INPROCEEDINGS{AielloMi91,
  author = {Aiello, William and Milena Mihail},
  title = {Learning the Fourier Spectrum of Probabilistic Lists and Trees},
  booktitle = SODA,
  year = {1991},
  month = {Jan},
  organization = {ACM},
  note = {To appear},
  comment = {Learning with respect to the uniform distribution, probabilistic decision
	lists and mu-decision trees}
}

@ARTICLE{Aissen99,
  author = {J. Aissen},
  title = {Markedness and Subject Choice in Optimality Theory},
  journal = {Natural Language and Linguistic Theory},
  year = {1999},
  volume = {17},
  pages = {673-711}
}

@PHDTHESIS{Aizenstein93,
  author = {H. Aizenstein},
  title = {On the Learnability of Disjunctive Normal Form Formulas and Decision
	Trees.},
  school = {Dept of Computer Science, University of Illinois at Urbana-Champaign},
  year = {1993},
  note = {Technical report UIUCDCS-R-93-1813, June, 1993, Urbana, Illinois.}
}

@INPROCEEDINGS{AizensteinHePi92,
  author = {Aizenstein, H. and L. Hellerstein and L. Pitt},
  title = {Read-Thrice {DNF} is Hard to Learn with Membership and Equivalence
	Queries},
  booktitle = FOCS,
  year = {1992},
  number = {33},
  pages = {523--532},
  address = {Pittsburgh, Pennsylvania}
}

@ARTICLE{AizensteinPi95,
  author = {Howard Aizenstein and Leonard Pitt},
  title = {On The Learnability Of Disjunctive Normal Form Formulas},
  journal = {Machine Learning},
  year = {1995},
  volume = {19},
  pages = {183--208},
  publisher = {Kluwer Academic Publishers, Boston}
}

@UNPUBLISHED{AizensteinPi93,
  author = {Aizenstein, H. and L. Pitt},
  title = {{DNF} cannot be learned by greedily collecting prime implicants},
  note = {Unpublished},
  year = {1993}
}

@INPROCEEDINGS{AizensteinPi92,
  author = {Aizenstein, H. and L. Pitt},
  title = {Exact Learning of Read-$k$ Disjoint {DNF} and Not-So-Disjoint {DNF}},
  booktitle = COLT,
  year = {1992},
  pages = {71--76},
  address = {Pittsburgh, Pennsylvania},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{AizensteinPi91,
  author = {Aizenstein, H. and L. Pitt},
  title = {Exact Learning of Read-Twice {DNF} Formulas},
  booktitle = FOCS,
  year = {1991},
  number = {32},
  pages = {170--179},
  address = {San Juan}
}

@INPROCEEDINGS{AjtaiKoSz83,
  author = {M. Ajtai and J. Koml{\'o}s and E. Szemer{\'e}di},
  title = {An {$O(n \log n)$} Sorting Network},
  booktitle = STOC,
  year = {1983},
  pages = {1--9}
}

@INPROCEEDINGS{Akaho93,
  author = {S. Akaho},
  title = {Regularization learning of neural networks for generalization},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1993},
  volume = {743},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {99--110},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Akhmatova05,
  author = {E. Akhmatova},
  title = {Textual Entailment Resolution via Atomic Propositions},
  booktitle = RTE,
  year = {2005}
}

@INPROCEEDINGS{AkkusG96,
  author = {Aynur Akku{\,s} and H. Altay G{\"u}venir},
  title = {{K} nearest neighbor classification on feature projections},
  booktitle = ICML,
  year = {1996},
  pages = {12--19},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{AkutsuTa93,
  author = {T. Akutsu and A. Takasu},
  title = {On {PAC} learnability of functional dependencies},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1993},
  volume = {743},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {229--239},
  publisher = {Springer-Verlag}
}

@ARTICLE{AlbersHe99,
  author = {Susanne Albers and Monika R. Henzinger},
  title = {Exploring Unknown Environments},
  journal = {{SIAM} J. Comput.},
  year = {1999},
  volume = {29},
  pages = {1164--1188},
  number = {4}
}

@INPROCEEDINGS{AlbrechtHw07,
  author = {Albrecht, Joshua and Hwa, Rebecca},
  title = {Regression for Sentence-Level MT Evaluation with Pseudo References},
  booktitle = ACL,
  year = {2007},
  pages = {296--303},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1038}
}

@INPROCEEDINGS{AlbrechtHw07a,
  author = {Albrecht, Joshua and Hwa, Rebecca},
  title = {A Re-examination of Machine Learning Approaches for Sentence-Level
	MT Evaluation},
  booktitle = ACL,
  year = {2007},
  pages = {880--887},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1111}
}

@BOOK{Alcalay90,
  title = {The Complete Hebrew-English Dictionary},
  publisher = {Massada},
  year = {1990},
  author = {R. Alcalay}
}

@INPROCEEDINGS{AldousVa90,
  author = {D. Aldous and U. Vazirani},
  title = {A {Markovian} extension of {V}aliant's learning model},
  booktitle = FOCS,
  year = {1990},
  pages = {392--396},
  publisher = {IEEE Computer Society Press, Los Alamitos, CA}
}

@INPROCEEDINGS{ALMS98,
  author = {L. Aleksandrov and M. Lanthier and A. Maheshwari and J.-R. Sack},
  title = {An {$\epsilon$}-Approximation Algorithm for Weighted Shortest Paths
	on Polyhedral Surfaces},
  booktitle = SWAT,
  year = {1998},
  volume = {1432},
  series = {Lecture Notes Comput. Sci.},
  pages = {11--22},
  publisher = {Springer-Verlag},
  nickname = {SWAT '98},
  site = {Stockholm}
}

@INPROCEEDINGS{AleliunasKaLiLoRa79,
  author = {Aleliunas, Romas and Richard M. Karp and Richard J. Lipton and Laszlo
	Lov\'asz and Charles Rackoff},
  title = {Random Walks, Universal Traversal Sequences, and the Complexity of
	Maze Problems},
  booktitle = FOCS,
  year = {1979},
  pages = {218--223},
  address = {San Juan, Puerto Rico},
  month = Oct
}

@INPROCEEDINGS{AlerBoIs98,
  author = {Ricardo Aler and Daniel Borrajo and Pedro Isasi},
  title = {Genetic programming and deductive-inductive learning: a multi-strategy
	approach},
  booktitle = ICML,
  year = {1998},
  pages = {10--18},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@ARTICLE{AlevizosBoPr90,
  author = {Alevizos and J. D. Boissonnat and F. P. Preparata},
  title = {{An optimal algorithm for the boundary of a cell in a union of rays}},
  journal = {Algorithmica},
  year = {1990},
  volume = {5},
  pages = {573--590}
}

@INPROCEEDINGS{AlexDuKe07,
  author = {Alex, Beatrice and Dubey, Amit and Keller, Frank},
  title = {Using Foreign Inclusion Detection to Improve Parsing Performance},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {151--160},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1016}
}

@INPROCEEDINGS{AlexanderRo90,
  author = {R. Alexander and N. Rowe},
  title = {Path Planning by Optimal-Path-Map Construction for Homogeneous-Cost
	Two-Dimensional Regions},
  booktitle = {IEEE International Conference Robotics Automation},
  year = {1990}
}

@ARTICLE{AliPa96,
  author = {Kamal M. Ali and Michael J. Pazzani},
  title = {Error Reduction through Learning Multiple Descriptions},
  journal = {Machine Learning},
  year = {1996},
  volume = {24},
  pages = {173--202},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INBOOK{AliPa95,
  chapter = {10},
  pages = {183--199},
  title = {Reducing the small disjuncts problem by learning probabilistic concept
	descriptions},
  publisher = {MIT Press},
  year = {1995},
  author = {Kamal M. Ali and Michael J. Pazzani},
  volume = {III: Selecting Good Models},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@BOOK{Allen95,
  title = {Natural Language Understanding},
  publisher = Benjamin,
  year = {1995},
  author = {James Allen},
  edition = {second}
}

@BOOK{Allen94,
  title = {Natural Language Understanding},
  publisher = {The Benjamin/Cummings Publishing Company},
  year = {1994},
  author = {Allen, J.}
}

@BOOK{Allen87,
  title = {Natural Language Understanding},
  publisher = Benjamin,
  year = {1987},
  author = {James Allen}
}

@INPROCEEDINGS{Allenberg99,
  author = {Chamy Allenberg},
  title = {Individual sequence prediction - upper bounds and application for
	complexity},
  booktitle = COLT,
  year = {1999},
  pages = {233--242},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{Allender92,
  author = {Eric Allender and Lane A. Hemachandra},
  title = {Lower Bounds for the Low Hierarchy},
  journal = jacm,
  year = {1992},
  volume = {39},
  pages = {234-251},
  number = {1},
  month = jan,
  keywords = {Theory of Computation; Theory; low hierarchy; lower bounds; sparse
	sets; }
}

@ARTICLE{Allender89,
  author = {Eric W. Allender},
  title = {P-Uniform Circuit Complexity},
  journal = jacm,
  year = {1989},
  volume = {36},
  pages = {912-928},
  number = {4},
  month = oct,
  keywords = {Theory of Computation; Theory; alternating Turing machine; auxiliary
	pushdown automata; circuit complexity; exponential time; NC; P; precomposition;
	PSPACE; sparse sets; tally sets; uniformity; }
}

@INPROCEEDINGS{AlmuallimAkKa95,
  author = {Hussein Almuallim and Yasuhiro Akiba and Shigeo Kaneda},
  title = {On handling tree-structured attributes in decision tree learning},
  booktitle = ICML,
  year = {1995},
  pages = {12--20},
  publisher = {Morgan Kaufmann}
}

@INBOOK{AAYK97,
  chapter = {18},
  pages = {323--336},
  title = {Learning verb translation rules from ambiguous examples and a large
	semantic hierarchy},
  publisher = {MIT Press},
  year = {1997},
  author = {Hussein Almuallim and Yasuhiro Akiba and Takefumi Yamazaki and Shigeo
	Kaneda},
  volume = {IV: Making Learning Systems Practical},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@ARTICLE{Alon85,
  author = {N. Alon},
  title = {{Hypergraphs with high chromatic numbers}},
  journal = {Graphs and Combinatorics},
  year = {1985},
  volume = {1},
  pages = {387--389}
}

@INPROCEEDINGS{ABCH93,
  author = {Noga Alon and Shai Ben-David and Nicol\`{o} Cesa-Bianchi and David
	Haussler},
  title = {Scale-sensitive dimensions, uniform convergence, and learnability},
  booktitle = FOCS,
  year = {1993},
  pages = {292--301},
  publisher = {IEEE Computer Society Press, Los Alamitos, CA}
}

@ARTICLE{ABCH97,
  author = {N. Alon and S. Ben-David and N. {Cesa-Bianchi} and D. Haussler},
  title = {Scale-sensitive dimensions, uniform convergence, and learnability},
  journal = JACM,
  year = {1997},
  volume = {44},
  pages = {615--631},
  number = {4}
}

@ARTICLE{AlonBo87,
  author = {N. Alon and R. B. Boppana},
  title = {The Monotone Circuit Complexity of Boolean Functions},
  journal = {Combinatorica},
  year = {1987},
  volume = {7},
  pages = {1--22}
}

@INPROCEEDINGS{ADPR00,
  author = {N. Alon and S. Dar and M. Parnas and D. Ron},
  title = {Testing of Clustering},
  booktitle = FOCS,
  year = {2000},
  pages = {240--250},
  annote = {{614}}
}

@ARTICLE{Alon91,
  author = {Noga Alon and A. K. Dewdney and Teunis J. Ott},
  title = {Efficient Simulation of Finite Automata by Neural Nets},
  journal = jacm,
  year = {1991},
  volume = {38},
  pages = {495-514},
  number = {2},
  month = apr,
  keywords = {Theory of Computation; Neural Nets; Finite Automata; Mealy machines;}
}

@ARTICLE{AKMM02,
  author = {N.~Alon and G.~Kalai and J.~Matou{\v s}ek and R.~Meshulam},
  title = {Transversal numbers for hypergraphs arising in geometry},
  journal = {Adv. Appl. Math.},
  year = {2002},
  volume = {29},
  pages = {79--101},
  url = {http://www.math.tau.ac.il/~nogaa/PDFS/akmm6.pdf}
}

@ARTICLE{AlonKrSu98,
  author = {N. Alon and M. Krivelevich and B. Sudakov},
  title = {Coloring Graphs with Sparse Neighborhoods},
  journal = {J. Comb. Theo. Ser. B},
  year = {1998},
  volume = {77},
  number = {73--82},
  url = {http://www.math.princeton.edu/~bsudakov/sparse.pdf}
}

@UNPUBLISHED{ALPS00,
  author = {N. Alon and H. Last and R. Pinchasi and M. Sharir},
  title = {On the complexity of arrangements of circles in the plane},
  note = {manuscript},
  year = {2000}
}

@BOOK{AlonSp00,
  title = {The probabilistic method},
  publisher = {Wiley Inter-Science},
  year = {2000},
  author = {N. Alon and J. H. Spencer},
  edition = {2nd}
}

@INPROCEEDINGS{AlspectorAl89,
  author = {J. Alspector and R. B. Allen},
  title = {Performance of a Stochastic Learning Chip},
  booktitle = NIPS,
  year = {1989},
  pages = {748--760}
}

@ARTICLE{AltGo95,
  author = {H. Alt and M. Godau},
  title = {Computing the {Fr\'echet} distance between two polygonal curves},
  journal = IJCGA,
  year = {1995},
  volume = {5},
  pages = {75--91}
}

@INCOLLECTION{AltGu00,
  author = {H. Alt and L. J. Guibas},
  title = {Discrete Geometric Shapes: {Matching}, Interpolation, and Approximation},
  booktitle = {Handbook of Computational Geometry},
  publisher = {Elsevier Science Publishers B. V. North-Holland},
  year = {2000},
  editor = {J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia},
  pages = {121--153},
  address = {Amsterdam},
  annote = {Chapter 3 of su-hcg-00}
}

@INPROCEEDINGS{AltKnWe01,
  author = {H. Alt and C. Knauer and C. Wenk},
  title = {Bounding the {Fr\'echet} distance by the Hausdorff distance},
  booktitle = {EWCG},
  year = {2001},
  pages = {166--169}
}

@INPROCEEDINGS{AltKnWe01a,
  author = {H. Alt and C. Knauer and C. Wenk},
  title = {Matching polygonal curves with respect to the {Fr\'echet} distance},
  booktitle = STACS,
  year = {2001},
  pages = {63--74}
}

@INPROCEEDINGS{AlthausKaKo04,
  author = {Ernst Althaus and Nikiforos Karamanis and Alexander Koller},
  title = {Computing locally coherent discourses},
  booktitle = ACL,
  year = {2004},
  location = {Barcelona}
}

@MASTERSTHESIS{Amakawa91,
  author = {K. Amakawa},
  title = {Self-learning reaching motion of a multi-joint arm using a trial-and-error
	heuristic and a neural network},
  school = {UC Santa Cruz},
  year = {1991}
}

@ARTICLE{Amari95,
  author = {S. Amari},
  title = {The {EM} algorithm and Information geometry in neural network learning},
  journal = {Neural Computation},
  year = {1995},
  volume = {7},
  pages = {13--18},
  number = {1},
  month = jan
}

@TECHREPORT{Amari94,
  author = {S. Amari},
  title = {Information Geometry of the {EM} and {em} Algorithms for Neural Networks},
  institution = {University of Tokyo},
  year = {1994},
  number = {METR 94-4},
  address = {Tokyo},
  note = {To appear in {\em Neural Networks}.}
}

@ARTICLE{Amari91,
  author = {S. Amari},
  title = {Mathematical Theory of Neural Learning},
  journal = {New Generation Computing},
  year = {1991},
  volume = {8},
  pages = {281--294},
  number = {4}
}

@ARTICLE{AmariFuSh92,
  author = {S. Amari and N. Fujita and S. Shinomoto},
  title = {Four Types of Learning Curves},
  journal = {Neural Computation},
  year = {1992},
  volume = {4},
  pages = {605--618},
  number = {4}
}

@INPROCEEDINGS{Ambainis96,
  author = {Andris Ambainis},
  title = {Probabilistic and team {PFIN}-type learning: general properties},
  booktitle = COLT,
  year = {1996},
  pages = {157--168},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{Ambainis95,
  author = {Andris Ambainis},
  title = {Application of {K}olmogorov complexity to inductive inference with
	limited memory},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1995},
  pages = {313--318},
  publisher = {Springer-Verlag}
}

@INCOLLECTION{Ambainis95a,
  author = {A. Ambainis},
  title = {Optimization problem in inductive inference},
  booktitle = {Algorithmic Learning for Knowledge-Based Systems},
  publisher = {Springer--Verlag},
  year = {1995},
  volume = {961},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {96--107}
}

@INPROCEEDINGS{Ambainis95b,
  author = {Andris Ambainis},
  title = {The power of procrastination in inductive inference: how it depends
	on used ordinal notations},
  booktitle = EuroCOLT,
  year = {1995},
  pages = {99--111},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{AACFKLSS97,
  author = {Andris Ambainis and Kalvis Aps{\=i}tis and Cristian Calude and R{\=u}si{\c
	n}{\v s} Freivalds and Marek Karpinski and Tomas Larfeldt and Iveta
	Sala and Juris Smotrovs},
  title = {Effects of {K}olmogorov complexity present in inductive inference
	as well},
  booktitle = ALT,
  year = {1997},
  volume = {1316},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {244--259},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{AAFGS97,
  author = {Andris Ambainis and Kalvis Aps{\=i}tis and R{\=u}si{\c n}{\v s} Freivalds
	and William Gasarch and Carl H. Smith},
  title = {Team learning as a game},
  booktitle = ALT,
  year = {1997},
  volume = {1316},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {2--17},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{ADFK97,
  author = {Andris Ambainis and Richard Desper and Martin Farach and Sampath
	Kannan},
  title = {Nearly tight bounds on the learnability of evolution},
  booktitle = FOCS,
  year = {1997},
  pages = {524--533},
  publisher = {IEEE Computer Society Press, Los Alamitos, CA}
}

@ARTICLE{AmbainisFrSm99,
  author = {Andris Ambainis and Rusins Freivalds and Carl H. Smith},
  title = {Inductive Inference with Procrastination: Back to Definitions},
  journal = {Fundamenta Informaticae},
  year = {1999},
  volume = {40},
  pages = {1--16}
}

@INPROCEEDINGS{AmbainisFr96,
  author = {Andris Ambainis and R{\=u}si{\c n}s Freivalds},
  title = {transformations that preserve learnability},
  booktitle = ALT,
  year = {1996},
  volume = {1160},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {299--311},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{AmbainisFrSm96,
  author = {Andris Ambainis and R{\=u}si{\c n}s Freivalds and Carl H. Smith},
  title = {General Inductive Inference Types Based on Linearly-Ordered Sets},
  booktitle = STACS,
  year = {1996},
  volume = {1046},
  series = {Lecture Notes in Computer Science},
  pages = {243--253},
  publisher = {Springer-Verlag}
}

@ARTICLE{AmbainisJaSh99,
  author = {Andris Ambainis and Sanjay Jain and Arun Sharma},
  title = {Ordinal mind change complexity of language identification},
  journal = {Theoret. Comput. Sci.},
  year = {1999},
  volume = {220},
  pages = {323--343},
  number = {2},
  comment = {first in EuroColt '97}
}

@INPROCEEDINGS{AmbainisSm94,
  author = {A. Ambainis and J. Smotrovs},
  title = {Enumerable classes of total recursive functions: complexity of inductive
	inference},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1994},
  pages = {10--25},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{AmentaBe98,
  author = {N. Amenta and M. Bern},
  title = {Surface reconsruction by {Voronoi} filtering},
  booktitle = {SOCG},
  year = {1998},
  pages = {39--48},
  site = {Minneapolis}
}

@INPROCEEDINGS{ACDL00,
  author = {N. Amenta and S. Choi and T. Dey and N. Leekha},
  title = {A simple algorithm for homeomorphic surface reconstruction},
  booktitle = {SOCG},
  year = {2000},
  pages = {213--222}
}

@INPROCEEDINGS{AmentaKo00,
  author = {N. Amenta and R. Kolluri},
  title = {Accurate and efficient unions of balls},
  booktitle = {SOCG},
  year = {2000},
  pages = {119--128}
}

@INPROCEEDINGS{Ameur95,
  author = {Foued Ameur},
  title = {A space-bounded learning algorithm for axis-parallel rectangles},
  booktitle = EuroCOLT,
  year = {1995},
  pages = {313--321},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{AFHH94,
  author = {F. Ameur and P. Fischer and K. U. H{\"o}ffgen and F. Meyer auf der
	Heide},
  title = {Trial and Error: a New Approach to Space-bounded Learning},
  booktitle = EuroCOLT,
  year = {1994},
  volume = {New Series Number 53},
  series = {The Institute of Mathematics and its Applications Conference Series},
  pages = {133--144},
  address = {Oxford},
  publisher = {Oxford University Press},
  isbn = {0 19 853492 2}
}

@INPROCEEDINGS{AEIS99,
  author = {A. Amir and A. Efrat and P. Indyk and H. Samet},
  title = {Efficient Algorithms and Regular Data Structures for Dilation, Location
	and Proximity Problems},
  booktitle = FOCS,
  year = {1999},
  pages = {160--170},
  nickname = {FOCS '99}
}

@INPROCEEDINGS{AFSU07,
  author = {Y. Amit and M. Fink and N. Srebro and S. Ullman},
  title = {Uncovering shared structures in multiclass classification},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {17--24},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{AmothCuTa99,
  author = {Thomas R. Amoth and Paul Cull and Prasad Tadepalli},
  title = {Exact learning of unordered tree patterns from queries},
  booktitle = COLT,
  year = {1999},
  pages = {323--332},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{AmothCuTa98,
  author = {Thomas R. Amoth and Paul Cull and Prasad Tadepalli},
  title = {Exact learning of tree patterns from queries and counterexamples},
  booktitle = COLT,
  year = {1998},
  pages = {175--186},
  publisher = {ACM Press, New York, NY}
}

@MASTERSTHESIS{Amsterdam88,
  author = {Amsterdam, Jonathan},
  title = {The Valiant Learning Model: Extensions and Assessment},
  school = {MIT Department of Electrical Engineering and Computer Science},
  year = {1988},
  month = Jan
}

@INPROCEEDINGS{Amsterdam88b,
  author = {Amsterdam, Jonathan},
  title = {Some Philosophical Problems with Formal Learning Theory},
  booktitle = AAAI,
  year = {1988},
  pages = {580--584},
  address = {Saint Paul, Minn.},
  month = {aug},
  organization = {American Association for Artificial Intelligence},
  comment = {A philosophical attack on computational learning theory}
}

@INPROCEEDINGS{Amsterdam88c,
  author = {Amsterdam, J.},
  title = {Extending the {V}aliant Learning Model},
  booktitle = {International Workshop on Machine Learning},
  year = {1988},
  pages = {364--375},
  month = Jun,
  tag = {TOC-display}
}

@INPROCEEDINGS{AnandKa93,
  author = {T. Anand and G. Kahn},
  title = {Opportunity Explorer: Navigating Large Databases Using Knowledge
	Discovery Templates},
  booktitle = {Workshop on Knowledge Discovery in Databases},
  year = {1993}
}

@INPROCEEDINGS{AndersonDoWe02,
  author = {C. R. Anderson and P. Domingos and D. S. Weld},
  title = {Relational {Markov} Models and their Application to Adaptive Web
	Navigation},
  booktitle = KDD,
  year = {2002},
  keywords = {Web Log, Web Usage Mining, User Modeling, Markov Models, Adaptive
	Web Sites},
  location = {Edmonton, Alberta, Canada}
}

@INPROCEEDINGS{Anderson99,
  author = {John R. Anderson},
  title = {{ACT-R} and learning},
  booktitle = ICML,
  year = {1999},
  pages = {522},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@ARTICLE{AndersonMa92,
  author = {John R. Anderson and Michael Matessa},
  title = {Explorations of an Incremental, Bayesian Algorithm for Categorization},
  journal = {Machine Learning},
  year = {1992},
  volume = {9},
  pages = {275--308},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{AMRT96,
  author = {A. Andersson and P. B. Miltersen and S. Riis and M. Thorup},
  title = {Static dictionaries on $AC^0$ RAMs: Query time $\Theta(\sqrt{\log
	n/ \log \log n})$ is necessary and sufficient},
  journal = FOCS_1996,
  year = {1996},
  pages = {441--450}
}

@INPROCEEDINGS{AndoZh07,
  author = {R. Ando and T. Zhang},
  title = {Two-view feature generation model for semi-supervised learning},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {25--32},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@ARTICLE{AndoZh05,
  author = {Rie Kubota Ando and Tong Zhang},
  title = {A Framework for Learning Predictive Structures from Multiple Tasks
	and Unlabeled Data},
  journal = {J. Mach. Learn. Res.},
  year = {2005},
  volume = {6},
  pages = {1817--1853},
  address = {Cambridge, MA, USA},
  issn = {1533-7928},
  publisher = {MIT Press}
}

@TECHREPORT{Andreae85,
  author = {Andreae, Peter Merrett},
  title = {Justified Generalization: Acquiring Procedures from Examples},
  institution = {MIT Artificial Intelligence Laboratory},
  year = {1985},
  number = {AI-TR-834},
  month = Jan,
  comment = {Ph.D. thesis. Examines traces of a correct procedure (physical motion
	procedure) to infer loops, etc.}
}

@INPROCEEDINGS{AndreevskaiaLiBe05,
  author = {A. Andreevskaia and Z. Li and S. Bergler},
  title = {Can Shallow Predicate Argument Structures Determine Entailment?},
  booktitle = RTE,
  year = {2005}
}

@INPROCEEDINGS{AndrewGa07,
  author = {G. Andrew and J. Gao},
  title = {Scalable training of {L1}-regularized log-linear models},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {33--40},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@ARTICLE{Andrews63,
  author = {G. E. Andrews},
  title = {{A lower bound for the volume of strictly convex bodies with many
	boundary lattice points}},
  journal = {Trans. Amer. Math. Soc.},
  year = {1963},
  volume = {106},
  pages = {270--279}
}

@INPROCEEDINGS{AAHSW98,
  author = {A. Andrzejak and B. Aronov and S. {Har-Peled} and R. Seidel and E.
	Welzl},
  title = {{Results on $k$-sets and $j$-facets via continuous motion arguments}},
  booktitle = {SOCG},
  year = {1998},
  pages = {192--199}
}

@INPROCEEDINGS{AGBS98,
  author = {Cosimo Anglano and Attilio Giordana and Giuseppe Lo Bello and Lorenza
	Saitta},
  title = {An experimental evaluation of coevolutive concept learning},
  booktitle = ICML,
  year = {1998},
  pages = {19--27},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@TECHREPORT{Angluin94,
  author = {Dana Angluin},
  title = {Exact learning of {$\mu$}-{DNF} formulas with malicious membership
	queries},
  institution = {Yale University},
  year = {1994},
  number = {YALEU/DCS/TR-1020},
  month = mar
}

@INPROCEEDINGS{Angluin92,
  author = {D. Angluin},
  title = {Computational learning theory: survey and selected bibliography},
  booktitle = STOC,
  year = {1992},
  pages = {351--369},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{Angluin90,
  author = {D. Angluin},
  title = {Negative results for equivalence queries},
  journal = {Machine Learning},
  year = {1990},
  volume = {5},
  pages = {121--150},
  annote = {Was Yale University TR YALEU/DCS/RR-648},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{Angluin89,
  author = {D. Angluin},
  title = {Equivalence queries and approximate fingerprints},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1989},
  pages = {134--145},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@TECHREPORT{Angluin89a,
  author = {D. Angluin},
  title = {Using queries to identify $\mu$-formulas},
  institution = {Yale University, YALE/DCS/RR-694},
  year = {1989}
}

@TECHREPORT{Angluin88,
  author = {D. Angluin},
  title = {Equivalence Queries and {DNF} formulas},
  institution = {Yale University Department of Computer Science},
  year = {1988},
  number = {YALEU/DCS/RR-659},
  month = nov
}

@TECHREPORT{Angluin88a,
  author = {D. Angluin},
  title = {Identifying languages from stochastic examples},
  institution = {Yale University, Dept. of Computer Science},
  year = {1988},
  number = {YALEU/ DCS/RR-614},
  address = {New Haven, CT}
}

@INPROCEEDINGS{Angluin88b,
  author = {D. Angluin},
  title = {Learning with hints},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1988},
  pages = {167--181},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{Angluin88c,
  author = {D. Angluin},
  title = {Queries and Concept Learning},
  journal = {Machine Learning},
  year = {1988},
  volume = {2},
  pages = {319--342},
  number = {4},
  month = apr,
  annote = {Preliminary version appeared as YALE/DCS/RR-479.},
  publisher = {Kluwer Academic Publishers, Boston}
}

@TECHREPORT{Angluin88d,
  author = {D. Angluin},
  title = {Requests for hints that return no hints},
  institution = {Yale University, YALE/DCS/RR-647},
  year = {1988}
}

@TECHREPORT{Angluin87,
  author = {D. Angluin},
  title = {Debugging a {DAG} Efficiently},
  institution = {Yale University},
  year = {1987},
  number = {591}
}

@TECHREPORT{Angluin87a,
  author = {D. Angluin},
  title = {Learning $k$-Bounded Context-Free Grammars},
  institution = {Department of Computer Science, Yale University},
  year = {1987},
  number = {YALEU/ DCS/RR-557},
  month = aug
}

@UNPUBLISHED{Angluin87b,
  author = {Angluin, D.},
  title = {A Note on Diversity},
  note = {Unpublished},
  month = Dec,
  year = {1987}
}

@TECHREPORT{Angluin87c,
  author = {D. Angluin},
  title = {Learning propositional {H}orn sentences with hints},
  institution = {Department of Computer Science, Yale University},
  year = {1987},
  number = {YALEU/DCS/RR-590},
  month = dec
}

@TECHREPORT{Angluin87d,
  author = {Angluin, D.},
  title = {Learning $k$-Term {DNF} Formulas Using Queries and Counterexamples},
  institution = {Yale University Department of Computer Science},
  year = {1987},
  number = {YALEU/DCS/RR-559},
  month = Aug
}

@ARTICLE{Angluin87e,
  author = {D. Angluin},
  title = {Learning Regular Sets from Queries and Counterexamples},
  journal = {Inform. Comput.},
  year = {1987},
  volume = {75},
  pages = {87--106},
  number = {2},
  month = nov,
  comment = {Learning regular sets from a teacher who answers membership queries,
	and responds to false conjectures with counterexamples. Based on
	Gold's approach. Also learning context-free languages from teacher.
	Was Yale TR YALEU/DCS/TR-464}
}

@TECHREPORT{Angluin86,
  author = {Angluin, Dana},
  title = {Types of queries for concept learning},
  institution = {Yale University Department of Computer Science},
  year = {1986},
  number = {YALEU/DCS/TR-479},
  month = Jun,
  comment = {Surveys kinds of learning possible with equivalence, membership, subset,
	superset, and disjointness queries, and with random samplying.}
}

@ARTICLE{Angluin82,
  author = {D. Angluin},
  title = {Inference of Reversible Languages},
  journal = {J. ACM},
  year = {1982},
  volume = {29},
  pages = {741--765},
  number = {3},
  month = jul
}

@ARTICLE{Angluin82a,
  author = {D. Angluin},
  title = {A note on the number of queries needed to identify regular languages},
  journal = {Inform. Control},
  year = {1982},
  volume = {51},
  pages = {76--87}
}

@ARTICLE{Angluin81,
  author = {Angluin, D.},
  title = {A note on the number of queries needed to identify regular languages},
  journal = {Information and Control},
  year = {1981},
  volume = {51},
  pages = {76--87}
}

@ARTICLE{Angluin80,
  author = {Angluin, Dana},
  title = {Inductive Inference of Formal Languages from Positive Data},
  journal = InfCtrl,
  year = {1980},
  volume = {45},
  pages = {117--135},
  number = {2},
  month = May,
  comment = {Can be done iff each language Li contains a finite subset Ti such
	that Ti is a subset of Li and if i!=j and Ti is a subset of Lj, then
	Lj is not a proper subset of Li; and Ti is computable from i.}
}

@ARTICLE{Angluin80a,
  author = {D. Angluin},
  title = {Finding Patterns Common to a Set of Strings},
  journal = {J. of Comput. Syst. Sci.},
  year = {1980},
  volume = {21},
  pages = {46--62}
}

@ARTICLE{Angluin78,
  author = {D. Angluin},
  title = {On the Complexity of Minimum Inference of Regular Sets},
  journal = {Inform. Control},
  year = {1978},
  volume = {39},
  pages = {337--350},
  number = {3}
}

@PHDTHESIS{Angluin76,
  author = {D. Angluin},
  title = {An Application of the Theory of Computational Complexity to the Study
	of Inductive Inference},
  school = {Electrical Engineering and Computer Science Department, University
	of California, Berkeley},
  year = {1976}
}

@INPROCEEDINGS{ABFRV88,
  author = {D. Angluin and L. Birnbaum and J. Feldman and R. Rivest and L. Valiant},
  title = {Summary of the panel discussion},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1988},
  pages = {398--401},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{AngluinCs97,
  author = {Dana Angluin and Mikl{\'o}s Cs{\H u}r{\"o}s},
  title = {Learning {M}arkov chains with variable length memory from noisy output},
  booktitle = COLT,
  year = {1997},
  pages = {298--308},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{AngluinFrPi92,
  author = {D. Angluin and M. Frazier and L. Pitt},
  title = {Learning conjunctions of {H}orn clauses},
  journal = {Machine Learning},
  year = {1992},
  volume = {9},
  pages = {147--164},
  annote = {Earlier version in FOCS 1990 conference},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{AngluinFrPi90,
  author = {Angluin, D. and Michael Frazier and Leonard Pitt},
  title = {Learning Conjunctions of {H}orn Clauses},
  booktitle = FOCS,
  year = {1990},
  pages = {186--192},
  address = {St. Louis, Missouri},
  month = Oct,
  publisher = {IEEE}
}

@ARTICLE{AngluinGaSm89,
  author = {D. Angluin and W. Gasarch and C. Smith},
  title = {Training sequences},
  journal = {Theoret. Comput. Sci.},
  year = {1989},
  volume = {66},
  pages = {255--272},
  annote = {University of Maryland, CS-TR-1894, UMIACS-TR-87-37, 1987},
  comment = {Shows how to learn hard total functions by being taught relevant other
	functions first.}
}

@ARTICLE{AngluinHeKa93,
  author = {Dana Angluin and Lisa Hellerstein and Marek Karpinski},
  title = {Learning Read-Once Formulas with Queries},
  journal = jacm,
  year = {1993},
  volume = {40},
  pages = {185-210},
  number = {1},
  month = jan,
  keywords = {Machine Learning; Algorithms; Design; Theory; equivalence queries;
	exact identification; interpolation; membership queries; u-formulas;
	mu-formulas; polynomial-time learning; read-once formulas; }
}

@ARTICLE{AngluinKh95,
  author = {Dana Angluin and Michael Kharitonov},
  title = {When won't membership queries help?},
  journal = {J. of Comput. Syst. Sci.},
  year = {1995},
  volume = {50},
  pages = {336--355},
  number = {2},
  note = {Earlier version appeared in 23rd STOC, 1991}
}

@INPROCEEDINGS{AngluinKh91,
  author = {Angluin, D. and M. Kharitonov},
  title = {When Won't Membership Queries Help?},
  booktitle = STOC,
  year = {1991},
  pages = {444--454},
  address = {New Orleans, Louisiana},
  month = May
}

@INPROCEEDINGS{AngluinKr97,
  author = {Dana Angluin and M{\=a}rti{\c n}{\v s} Krikis},
  title = {Teachers, Learners and Black Boxes},
  booktitle = COLT,
  year = {1997},
  pages = {285--297},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{AKST97,
  author = {Dana Angluin and M{\=a}rti{\c n}{\v s} Krikis and Robert H. Sloan
	and Gy{\"o}rgy Tur{\'a}n},
  title = {Malicious omissions and errors in answers to membership queries},
  journal = {Machine Learning},
  year = {1997},
  volume = {28},
  pages = {211--255},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{AngluinKr94,
  author = {D. Angluin and M. Kri{\c k}is},
  title = {Learning with malicious membership queries and exceptions},
  booktitle = COLT,
  year = {1994},
  pages = {57--66},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{AngluinLa88,
  author = {D. Angluin and P. Laird},
  title = {Learning from noisy examples},
  journal = {Machine Learning},
  year = {1988},
  volume = {2},
  pages = {343--370},
  number = {4},
  annote = {Preliminary version appeared as YALE/DCS/RR-478.},
  comment = {Error model assumes random error rate < 1/2 in classifications provided
	for examples. Algorithm tries to minimize number of examples which
	are misclassified by chosen hypothesis.},
  publisher = {Kluwer Academic Publishers, Boston}
}

@TECHREPORT{AngluinLa86,
  author = {Angluin, D. and P. D. Laird},
  title = {Identifying k-CNF formulas from noisy examples},
  institution = {Yale University Department of Computer Science},
  year = {1986},
  number = {YALEU/DCS/TR-478},
  month = Jun,
  comment = {Error model assumes random error rate < 1/2 in classificationsprovided
	for examples. Algorithm tries to minimize number of examples which
	are misclassified by chosen hypothesis.Published as AngluinLa88.}
}

@ARTICLE{AngluinSl94,
  author = {Dana Angluin and Donna K. Slonim},
  title = {Randomly Fallible Teachers: Learning Monotone {DNF} with an Incomplete
	Membership Oracle},
  journal = {Machine Learning},
  year = {1994},
  volume = {14},
  pages = {7--26},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{AngluinSl91,
  author = {Angluin, D. and D. K. Slonim},
  title = {Learning Monotone {DNF} with an Incomplete Membership Oracle},
  booktitle = COLT,
  year = {1991},
  pages = {139--146},
  publisher = {Morgan Kaufmann},
  note = {(To appear in {\em Machine Learning}.)},
  tag = {TOC-display}
}

@INCOLLECTION{AngluinSm87,
  author = {D. Angluin and C. Smith},
  title = {Inductive Inference},
  booktitle = {Encyclopedia of Artificial Intelligence},
  publisher = {J. Wiley and Sons, New York},
  year = {1987},
  pages = {409--418}
}

@ARTICLE{AngluinSm83,
  author = {Angluin, D. and Carl H. Smith},
  title = {Inductive Inference: Theory and Methods},
  journal = {Computing Surveys},
  year = {1983},
  volume = {15},
  pages = {237--269},
  number = {3},
  month = Sep,
  comment = {Comprehensive survey of inductive inference a la Gold [Go67].}
}

@ARTICLE{AngluinVa79,
  author = {Angluin, D. and L. G. Valiant},
  title = {Fast probabilistic algorithms for {H}amiltonian circuits and matchings},
  journal = {Journal of Computer and System Sciences},
  year = {1979},
  volume = {18},
  pages = {155--193},
  number = {2},
  month = Apr,
  comment = {States nice form of Chernoff bounds.}
}

@INPROCEEDINGS{AFPS92,
  author = {S. Anoulova and P. Fischer and S. P{\"o}lt and H. U. Simon},
  title = {{PAB}-decisions for {B}oolean and real-valued features},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1992},
  pages = {353--362},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{AnoulovaP94,
  author = {S. Anoulova and S. P{\"o}lt},
  title = {Using {K}ullback-{L}eibler Divergence in Learning Theory},
  booktitle = EuroCOLT,
  year = {1994},
  volume = {New Series Number 53},
  series = {The Institute of Mathematics and its Applications Conference Series},
  pages = {145--156},
  address = {Oxford},
  publisher = {Oxford University Press},
  isbn = {0 19 853492 2}
}

@INPROCEEDINGS{AnthonyBa95,
  author = {Martin Anthony and Peter Bartlett},
  title = {Function learning from interpolation},
  booktitle = EuroCOLT,
  year = {1995},
  pages = {211--221},
  publisher = {Springer-Verlag}
}

@BOOK{AnthonyBa99,
  title = {Neural Network Learning: Theoretical Foundations},
  publisher = {Cambridge},
  year = {1999},
  author = {M.~Anthony and P. L. Bartlett}
}

@BOOK{AnthonyBi92,
  title = {Computational Learning Theory},
  publisher = {Cambridge University Press},
  year = {1992},
  author = {M. Anthony and N. Biggs},
  series = {Cambridge Tracts in Theoretical Computer Science (30)}
}

@INPROCEEDINGS{AnthonyBiSh90,
  author = {M. Anthony and N. Biggs and J. Shawe-Taylor},
  title = {The learnability of formal concepts},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1990},
  pages = {246--257},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{ABCS92,
  author = {M. Anthony and G. Brightwell and D. Cohen and J. Shawe-Taylor},
  title = {On exact specification by examples},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1992},
  pages = {311--318},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{AnthonyHo93,
  author = {M. Anthony and S. Holden},
  title = {On the power of polynomial discriminators and radial basis function
	networks},
  booktitle = COLT,
  year = {1993},
  pages = {158--164},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{AnthonyHo98,
  author = {Martin Anthony and Sean B. Holden},
  title = {Cross-validation for binary classification by real-valued functions:
	theoretical analysis},
  booktitle = COLT,
  year = {1998},
  pages = {218--229},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{AnthonySh94,
  author = {M. Anthony and J. Shawe-Taylor},
  title = {Valid Generalisation of Functions from Close Approximations on a
	Sample},
  booktitle = EuroCOLT,
  year = {1994},
  volume = {New Series Number 53},
  series = {The Institute of Mathematics and its Applications Conference Series},
  pages = {94--108},
  address = {Oxford},
  publisher = {Oxford University Press},
  isbn = {0 19 853492 2}
}

@TECHREPORT{AnthonySh90,
  author = {M. Anthony and J. {Shawe-Taylor}},
  title = {A result of {V}apnik with applications},
  institution = {University of London},
  year = {1990},
  number = {CSD-TR-628},
  address = {Surrey, England}
}

@INPROCEEDINGS{Antos99,
  author = {Andr{\'a}s Antos},
  title = {Lower Bounds on the Rate of Convergence of Nonparametric Pattern
	Recognition},
  booktitle = EuroCOLT,
  year = {1999},
  volume = {1572},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {241--252},
  publisher = {Springer-Verlag}
}

@ARTICLE{AntosLu98,
  author = {Andr{\'a}s Antos and G{\'a}bor Lugosi},
  title = {Strong minimax lower bounds for learning},
  journal = {Machine Learning},
  year = {1998},
  volume = {30},
  pages = {31--56},
  note = {Earlier version in COLT96},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INBOOK{ACHS94,
  chapter = {1},
  pages = {3--14},
  title = {Bayes decisions in a neural network-{PAC} setting},
  publisher = {MIT Press},
  year = {1994},
  author = {Svetlana Anulova and Jorge R. Cuellar and Klaus-U. H{\"o}ffgen and
	Hans-U. Simon},
  booktitle = {Computational Learning Theory and Natural Learning Systems II: Intersections
	Between Theory and Experiment}
}

@ARTICLE{ApolloniGe00,
  author = {B. Apolloni and C. Gentile},
  title = {{P}-sufficient statistics for {PAC} learning $k$-term-{DNF} formulas
	through enumeration},
  journal = {Theoret. Comput. Sci.},
  year = {2000},
  volume = {230},
  pages = {1--37},
  number = {1-2}
}

@INPROCEEDINGS{AHBIT93,
  author = {D. Appelt and J. Hobbs and J. Bear and D. Israel and M. Tyson},
  title = {{FASTUS}: A Finite-State Processor for Information Extraction From
	Real-World Text},
  booktitle = IJCAI,
  year = {1993}
}

@INPROCEEDINGS{Appelt90,
  author = {Appelt, D. E.},
  title = {A theory of Abduction based on model preserence},
  booktitle = {AAAI Spring Symposium on {A}utomated {A}bduction},
  year = {1990},
  pages = {67--71}
}

@ARTICLE{AAFHS99,
  author = {Kalvis Apsitis and Setsuo Arikawa and Rusins Freivalds and Eiju Hirowatari
	and Carl H. Smith},
  title = {On the inductive inference of recursive real-valued functions},
  journal = {Theoret. Comput. Sci.},
  year = {1999},
  volume = {219},
  pages = {3--17},
  number = {1/2}
}

@INPROCEEDINGS{ApsitisFrSm94,
  author = {K. Apsitis and R. Freivalds and C. Smith},
  title = {Choosing a learning team: a topological approach},
  booktitle = STOC,
  year = {1994},
  page = {283-289}
}

@INPROCEEDINGS{Aps94,
  author = {K. Aps{\= i}tis},
  title = {Derived sets and inductive inference},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1994},
  pages = {26--39},
  publisher = {Springer-Verlag}
}

@INCOLLECTION{Aps95,
  author = {Kalvis Aps{\=i}tis},
  title = {Topological Considerations in Composing Teams of Learning Machines},
  booktitle = {Algorithmic Learning for Knowledge-Based Systems},
  publisher = {Springer--Verlag},
  year = {1995},
  volume = {961},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {146--154}
}

@INPROCEEDINGS{AFSS98,
  author = {K. Aps{\=i}tis and R. Freivalds and R. Simanovskis and J. Smotrovs},
  title = {Closedness Properties in {EX}-identification of Recursive Functions},
  booktitle = ALT,
  year = {1998},
  volume = {1501},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {46--60},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{ApsFrSm97,
  author = {Kalvis Aps{\=i}tis and R{\=u}si{\c n}{\v s} Freivalds and Carl H.
	Smith},
  title = {Asymmetric Team Learning},
  booktitle = COLT,
  year = {1997},
  pages = {90--95},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{ApsFrSm95,
  author = {Kalvis Aps{\=i}tis and R{\=u}si{\c n}{\v s} Freivalds and Carl H.
	Smith},
  title = {On the inductive inference of real valued functions},
  booktitle = COLT,
  year = {1995},
  pages = {170--177},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{Apte-et-al94,
  author = {C. Apte and F. Damerau and S. Weiss},
  title = {Towards language independent automated learning of text categorization
	models},
  booktitle = ACM-SIGIR,
  year = {1994}
}

@INPROCEEDINGS{ApteDaWe94,
  author = {C. Apte and F. Damerau and S. Weiss},
  title = {Towards language independent automated learning of text categorization
	models},
  booktitle = ACM-SIGIR,
  year = {1994}
}

@INPROCEEDINGS{ALRS92,
  author = {S. Ar and R. J. Lipton and R. Rubinfeld and M. Sudan},
  title = {Reconstructing algebraic functions from mixed data},
  booktitle = FOCS,
  year = {1992},
  pages = {503--512},
  publisher = {IEEE Computer Society Press, Los Alamitos, CA}
}

@ARTICLE{ArapostathisMa90,
  author = {A. Arapostathis and S. I. Marcus},
  title = {Analysis of an Identification Algorithm Arising in the Adaptive Estimation
	of Markov Chains},
  journal = {Math. Control Signals Systems},
  year = {1990},
  volume = {3},
  pages = {1--29}
}

@ARTICLE{ArgamonDaKr99,
  author = {S. Argamon and I. Dagan and Y. Krymolowski},
  title = {A Memory-Based Approach to Learning Shallow Natural Language Patterns},
  journal = {Journal of Experimental and Theoretical Artificial Intelligence,
	special issue on memory-based learning},
  year = {1999},
  volume = {10},
  pages = {1--22}
}

@INPROCEEDINGS{ArgamonDaKr98,
  author = {S. Argamon and I. Dagan and Y. Krymolowski},
  title = {A memory-based approach to learning shallow natural language patterns},
  booktitle = COLING-ACL,
  year = {1998}
}

@ARTICLE{Argamon-EngelsonDaKr99,
  author = {Shlomo Argamon-Engelson and Ido Dagan and Yuval Krymolowsky},
  title = {A memory-based approach to learning shallow natural-language patterns},
  journal = {Journal of Experimental and Theoretical Artificial Intelligence},
  year = {1999},
  volume = {11},
  pages = {369--390}
}

@INPROCEEDINGS{ArgyriouEvPo,
  author = {Andreas Argyriou and Theodoros Evgeniou and Massimiliano Pontil},
  title = {Convex Multi-task feature learning},
  booktitle = {Machine Learning},
  url = {http://www.springerlink.com/content/161105027v344n03/}
}

@INPROCEEDINGS{ArgyriouEvPo07,
  author = {Andreas Argyriou and Theodoros Evgeniou and Massimiliano Pontil},
  title = {Multi-task feature learning},
  booktitle = NIPS,
  year = {2007},
  publisher = {MIT Press}
}

@INPROCEEDINGS{AKMMSS92,
  author = {Setsuo Arikawa and Satoru Kuhara and Satoru Miyano and Yasuhito Mukouchi
	and Ayumi Shinohara and Takeshi Shinohara},
  title = {A Machine Discovery from Amino Acid Sequences by Decision Trees over
	Regular Patterns},
  booktitle = {International Conference on Fifth Generation Computer Systems},
  year = {1992},
  pages = {618--625},
  address = {Burke, VA, USA},
  publisher = {IOS Press},
  isbn = {90-5199-099-5}
}

@ARTICLE{ArikawaRi97,
  author = {S. Arikawa and M. M. Richter},
  title = {Preface},
  journal = {New Generation Computing},
  year = {1997},
  volume = {15},
  pages = {1--2},
  number = {1},
  note = {Special issue for AII '94 and ALT '94}
}

@INPROCEEDINGS{ASMS93,
  author = {Setsuo Arikawa and Takeshi Shinohara and Satoru Miyano and Ayumi
	Shinohara},
  title = {More About Learning Elementary Formal Systems},
  booktitle = {International Workshop on Nonmonotonic and Inductive Logic},
  year = {1993},
  volume = {659},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {107--117},
  publisher = {Springer Verlag},
  isbn = {3-540-56433-0}
}

@INPROCEEDINGS{ArikawaShYa89,
  author = {S. Arikawa and T. Shinohara and A. Yamamoto},
  title = {Elementary formal system as a unifying framework for language learning},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1989},
  pages = {312--327},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{Arima92,
  author = {J. Arima},
  title = {A logical analysis of relevance in analogy},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1992},
  pages = {255--265},
  publisher = {IOS Press}
}

@INPROCEEDINGS{ArimaSa93,
  author = {J. Arima and H. Sawamura},
  title = {Reformulation of explanation by linear logic - toward logic for explanation},
  booktitle = {International Workshop on Analogical and Inductive Inference and
	International Workshop on Algorithmic Learning Theory},
  year = {1993},
  volume = {744},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {45--57},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Arimura97,
  author = {Arimura, H.},
  title = {Learning Acyclic First-order {Horn} Sentences from Entailment},
  booktitle = {International Conference on Algorithmic Learning Theory},
  year = {1997},
  publisher = {Springer-verlag},
  note = {LNAI 1316}
}

@ARTICLE{ArimuraHi99,
  author = {Hiroki Arimura and Kouichi Hirata},
  title = {Learning of first-order formulas and inductive logic programming},
  journal = {Journal of Japanese Society for Artificial Intelligence},
  year = {1999},
  volume = {14},
  pages = {790--799},
  number = {5}
}

@ARTICLE{ArimuraIsSh97,
  author = {Hiroki Arimura and Hiroki Ishizaka and Takeshi Shinohara},
  title = {Learning unions of tree patterns using queries},
  journal = {Theoret. Comput. Sci.},
  year = {1997},
  volume = {185},
  pages = {47--62},
  number = {1},
  note = {Special issue for ALT '95}
}

@INPROCEEDINGS{ArimuraIsSh92,
  author = {H. Arimura and H. Ishizaka and T. Shinohara},
  title = {Polynomial time inference of a subclass of context-free transformations},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1992},
  pages = {136--143},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{ArimuraShOt93,
  author = {H. Arimura and T. Shinohara and S. Otsuki},
  title = {A polynomial time algorithm for finding finite unions of tree pattern
	languages},
  booktitle = {International Workshop on Nonmonotonic and Inductive Logic},
  year = {1993},
  volume = {659},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {118--131},
  publisher = {Springer--Verlag}
}

@INPROCEEDINGS{ArimuraShOt92,
  author = {H. Arimura and T. Shinohara and S. Otsuki},
  title = {Polynomial time inference of unions of tree pattern languages},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1992},
  pages = {105--114},
  publisher = {IOS Press}
}

@INPROCEEDINGS{AWFA98,
  author = {H. Arimura and A. Wataki and R. Fujino and S. Arikawa},
  title = {A Fast Algorithm for Discovering Optimal String Patterns in Large
	Text Databases},
  booktitle = ALT,
  year = {1998},
  volume = {1501},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {247--261},
  publisher = {Springer-Verlag}
}

@ARTICLE{AHKMN95,
  author = {E. M. Arkin and D. Halperin and K. Kedem and J. S.B. Mitchell and
	N. Naor},
  title = {{Arrangements of segments that share endpoints: Single face results}},
  journal = DCG,
  year = {1995},
  volume = {13},
  pages = {257--270}
}

@ARTICLE{Arkin91,
  author = {E. M. Arkin and C. H. Papadimitriou and M. Yannakakis},
  title = {Modularity of Cycles and Paths in Graphs},
  journal = jacm,
  year = {1991},
  volume = {38},
  pages = {255-274},
  number = {2},
  month = apr,
  keywords = {Combinatorics and Graph Theory; Algorithms; Theory; algorithms; cycles
	and paths; graphs; modularity; }
}

@INPROCEEDINGS{Armstrong74,
  author = {Armstrong, W. W.},
  title = {Dependency Structures of Database Relationships},
  booktitle = IFIP,
  year = {1974},
  pages = {580--583},
  publisher = {North Holland, Amsterdam}
}

@ARTICLE{ArnoldJa97,
  author = {O. Arnold and K. P. Jantke},
  title = {Inductive Program Synthesis for Therapy Plan Generation},
  journal = {New Generation Computing},
  year = {1997},
  volume = {15},
  pages = {27--58},
  number = {1},
  note = {Special issue for AII '94 and ALT '94}
}

@INPROCEEDINGS{ArnoldJa94,
  author = {O. Arnold and K. P. Jantke},
  title = {Therapy plan generation as program synthesis},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1994},
  pages = {40--55},
  publisher = {Springer-Verlag}
}

@ARTICLE{AEGS92,
  author = {B. Aronov and H. Edelsbrunner and L. J. Guibas and M. Sharir},
  title = {{The number of edges of many faces in a line segment arrangement}},
  journal = {Combinatorica},
  year = {1992},
  volume = {12},
  pages = {261--274}
}

@INPROCEEDINGS{AronovFo97,
  author = {B. Aronov and S. Fortune},
  title = {Average-Case Ray Shooting and Minimum Weight Triangulations},
  booktitle = {SOCG},
  year = {1997},
  pages = {203--211},
  url = {http://doi.acm.org/10.1145/262839.262972}
}

@UNPUBLISHED{AronovSh96,
  author = {B. Aronov and M. Sharir},
  title = {{The common exterior of convex polygons in the plane}},
  note = {to appear in {\em CGTA}},
  year = {1996}
}

@ARTICLE{Arora98,
  author = {S. Arora},
  title = {Polynomial time approximation schemes for Euclidean TSP and other
	geometric problems},
  journal = JACM,
  year = {1998},
  volume = {45},
  pages = {753--782},
  number = {5},
  month = {Sep},
  publisher = {ACM}
}

@INPROCEEDINGS{AroraRaRa98,
  author = {S. Arora and P. Raghavan and S. Rao},
  title = {Approximation schemes for {Euclidean} $k$-median and related problems},
  booktitle = STOC,
  year = {1998},
  pages = {106--113}
}

@INPROCEEDINGS{ArriagaVe99,
  author = {R. I. Arriaga and S. Vempala},
  title = {An algorithmic theory of learning: Robust Concepts and Random Projection},
  booktitle = FOCS,
  year = {1999},
  pages = {616--623},
  place = {New York}
}

@ARTICLE{ArvindVi00,
  author = {V. Arvind and N. V. Vinodchandran},
  title = {Exact learning via teaching assistants},
  journal = {Theoret. Comput. Sci.},
  year = {2000},
  volume = {241},
  pages = {51--81},
  number = {1-2},
  note = {Special issue for ALT '96}
}

@INPROCEEDINGS{ArvindVi97,
  author = {V. Arvind and N. V. Vinodchandran},
  title = {Exact learning via teaching assistants},
  booktitle = ALT,
  year = {1997},
  volume = {1316},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {291--306},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{ArvindVi96,
  author = {V. Arvind and N. V. Vinodchandran},
  title = {The complexity of exactly learning algebraic concepts},
  booktitle = ALT,
  year = {1996},
  volume = {1160},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {100--112},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{AryaMa02,
  author = {S. Arya and T. Malamatos},
  title = {Linear-size approximate {Voronoi} diagrams},
  booktitle = SODA,
  year = {2002},
  note = {to appear}
}

@INPROCEEDINGS{AryaMaMo02,
  author = {S. Arya and T. Malamatos and D. M. Mount},
  title = {Space-efficient approximate {Voronoi} diagrams},
  booktitle = STOC,
  year = {2002},
  note = {to appear}
}

@INPROCEEDINGS{AryaMo95,
  author = {S. Arya and David M. Mount},
  title = {Approximate Range Searching},
  booktitle = {SOCG},
  year = {1995},
  pages = {172--181},
  keywords = {quadtrees, box decomposition trees}
}

@ARTICLE{AMNSW98,
  author = {S. Arya and D. M. Mount and N. S. Netanyahu and R. Silverman and
	A. Y. Wu},
  title = {An optimal algorithm for approximate nearest neighbor searching fixed
	dimensions},
  journal = JACM,
  year = {1998},
  volume = {45},
  number = {6},
  annote = {459}
}

@ARTICLE{ANTH96,
  author = {Minoru Asada and Shoichi Noda and Sukoya Tawaratsumida and Koh Hosoda},
  title = {Purposive Behavior Acquisition for a Real Robot by Vision-Based Reinforcement
	Learning},
  journal = {Machine Learning},
  year = {1996},
  volume = {23},
  pages = {279--303},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{ABCGST99,
  author = {T. Asano and M. de Berg and O. Cheong and L. J. Guibas and J. Snoeyink
	and H. Tamaki},
  title = {Spanning Trees Crossing Few Barriers},
  booktitle = {SOCG},
  year = {1999},
  pages = {41--48}
}

@ARTICLE{AsanoGuTo94,
  author = {T. Asano and L. J. Guibas and T. Tokuyama},
  title = {Walking on an arrangement topologically},
  journal = IJCGA,
  year = {1994},
  volume = {4},
  pages = {123--151}
}

@INPROCEEDINGS{AsharafMuSh07,
  author = {S. Asharaf and M. Murty and S. Shevade},
  title = {Multiclass core vector machine},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {41--48},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{Asker94,
  author = {L. Asker},
  title = {Improving accuracy of incorrect domain theories},
  booktitle = ICML,
  year = {1994},
  pages = {19--27},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{AskerMa97,
  author = {Lars Asker and Richard Maclin},
  title = {Feature engineering and classifier selection: {A} case study in {V}enusian
	volcano detection},
  booktitle = ICML,
  year = {1997},
  pages = {3--11},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{Aslam00,
  author = {Javed A. Aslam},
  title = {Improving Algorithms for Boosting},
  booktitle = COLT,
  year = {2000},
  pages = {200--207},
  publisher = {Morgan Kaufmann, San Francisco}
}

@MASTERSTHESIS{Aslam92,
  author = {J. A. Aslam},
  title = {Inferring Graphs from Walks},
  school = {Massachusetts Institute of Technology},
  year = {1992},
  month = jan
}

@INPROCEEDINGS{AslamDe95,
  author = {J. A. Aslam and S. E. Decatur},
  title = {Specification and simulation of statistical query algorithms for
	efficiency and noise tolerance},
  booktitle = COLT,
  year = {1995},
  pages = {437--446},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{AslamDe93,
  author = {Aslam, J. A. and S. E. Decatur},
  title = {General Bounds on Statistical Query Learning and {PAC} Learning with
	Noise via Hypothesis Boosting},
  booktitle = FOCS,
  year = {1993},
  pages = {282--291},
  month = Nov
}

@ARTICLE{AslamDh93,
  author = {Aslam, Javed A. and Aditi Dhagat},
  title = {On-line Algorithms for 2-coloring Hypergraphs via Chip Games},
  journal = {Theoretical Computer Science},
  year = {1993},
  volume = {112},
  pages = {355--369},
  number = {2},
  month = May
}

@INPROCEEDINGS{AslamDh91,
  author = {Aslam, Javed A. and Aditi Dhagat},
  title = {Searching in the Presence of Linearly Bounded Errors},
  booktitle = STOC,
  year = {1991},
  pages = {486--493},
  month = May
}

@INPROCEEDINGS{AslamRi90,
  author = {Aslam, Javed A. and Ronald L. Rivest},
  title = {Inferring Graphs from Walks},
  booktitle = COLT,
  year = {1990},
  pages = {359--370},
  publisher = {Morgan Kaufmann},
  tag = {TOC-display}
}

@INPROCEEDINGS{AspnesBeFuRu91,
  author = {Aspnes, James and Richard Beigel and Merrick Furst and Steven Rudich},
  title = {The expressive power of polynomials},
  booktitle = FOCS,
  year = {1982},
  pages = {402--409},
  month = May
}

@ARTICLE{Assouad83,
  author = {P. Assouad},
  title = {Densit{\'e} et Dimension},
  journal = {Ann. Inst. Fourier},
  year = {1983},
  pages = {233--282},
  address = {Grenoble},
  comment = {In French. Survey of properties of VC classes.}
}

@MISC{AsuncionNe07,
  author = {A. Asuncion and D.J. Newman},
  title = {{UCI} Machine Learning Repository},
  year = {2007},
  institution = {University of California, Irvine, School of Information and Computer
	Sciences},
  url = {http://www.ics.uci.edu/$\sim$mlearn/{MLR}epository.html}
}

@ARTICLE{Atallah85,
  author = {M. J. Atallah},
  title = {Some dynamic computational geometry problems},
  journal = {Comput. Math. Appl.},
  year = {1985},
  volume = {11},
  pages = {1171--1181}
}

@ARTICLE{Atallah91,
  author = {Mikhail J. Atallah and Danny Z. Chen and Hubert Wagener},
  title = {An Optimal Parallel Algorithm for the Visibility of a Simple Polygon
	from a Point},
  journal = jacm,
  year = {1991},
  volume = {38},
  pages = {516-533},
  number = {3},
  month = jul,
  keywords = {Computational Geometry; Algorithms; Theory; computational geometry;
	intersections of polygonal chains; parallel computational complexity;
	simple polygons; visible regions; }
}

@INCOLLECTION{Atkeson89,
  author = {C. G. Atkeson},
  title = {Learning Arm Kinematics and Dynamics},
  booktitle = {Annual Review of Neuroscience},
  publisher = {Annual Reviews},
  year = {1989},
  volume = {12},
  pages = {157--183}
}

@INPROCEEDINGS{AtkesonSc97,
  author = {Christopher G. Atkeson and Stefan Schaal},
  title = {Robot learning from demonstration},
  booktitle = ICML,
  year = {1997},
  pages = {12--20},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{Atlanta92,
  author = {Atlanta Consulting, Int'l, Inc.},
  title = {Enhanced {T}echnology {T}akes {S}potlight},
  journal = {Bobbin},
  year = {1992},
  volume = {October},
  pages = {54-56}
}

@UNPUBLISHED{AttaliBo01,
  author = {D. Attali and J. D. Boissonnat},
  title = {Complexity of the {Delaunay} triangulation of points on a smooth
	surface},
  note = {\href{http://www-sop.inria.fr/prisme/personnel/boissonnat/papers.html}{http://www-sop.inria.fr/prisme/personnel/boissonnat/papers.html}},
  year = {2001}
}

@INPROCEEDINGS{ADSCC07,
  author = {Attardi, Giuseppe and Dell'Orletta, Felice and Simi, Maria and Chanev,
	Atanas and Ciaramita, Massimiliano},
  title = {Multilingual Dependency Parsing and Domain Adaptation using {DeSR}},
  booktitle = {CoNLL Shared Task Session of EMNLP-CoNLL},
  year = {2007},
  pages = {1112--1118},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1119}
}

@ARTICLE{Attiya90,
  author = {Hagit Attiya and Amotz Bar-Noy and Danny Dolev and David Peleg and
	R{\"u}diger Reishuk},
  title = {Renaming in an Asynchronous Environment},
  journal = jacm,
  year = {1990},
  volume = {37},
  pages = {524-548},
  number = {3},
  month = jul,
  keywords = {Distributed Computing; Algorithms; Reliability; asynchrony; asynchronous
	environment; lower bounds; processor renaming; symmetry breaking;
	unreliable systems; }
}

@INPROCEEDINGS{Auer00,
  author = {Peter Auer},
  title = {An Improved On-line Algorithm for Learning Linear Evaluation Functions},
  booktitle = COLT,
  year = {2000},
  pages = {118--125},
  publisher = {Morgan Kaufmann, San Francisco}
}

@INPROCEEDINGS{Auer97,
  author = {Peter Auer},
  title = {On learning from multi-instance examples: Empirical evaluation of
	a theoretical approach},
  booktitle = ICML,
  year = {1997},
  pages = {21--29},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{Auer97a,
  author = {Peter Auer},
  title = {Learning nested differences in the presence of malicious noise},
  journal = {Theoret. Comput. Sci.},
  year = {1997},
  volume = {185},
  pages = {159--175},
  number = {1},
  note = {Special issue for ALT '95}
}

@INPROCEEDINGS{Auer93,
  author = {P. Auer},
  title = {On-line learning of rectangles in noisy environments},
  booktitle = COLT,
  year = {1993},
  pages = {253--261},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{AuerCe98,
  author = {Peter Auer and Nicol\`{o} Cesa-Bianchi},
  title = {On-line learning with malicious noise and the closure algorithm},
  journal = {Annals of Mathematics and Artificial Intelligence},
  year = {1998},
  volume = {23},
  pages = {83--99},
  number = {1/2},
  note = {Special issue for AII '94 and ALT '94}
}

@INPROCEEDINGS{ACFS95,
  author = {Peter Auer and Nicol{\`o} Cesa-Bianchi and Yoav Freund and Robert
	E. Schapire},
  title = {Gambling in a rigged casino: the adversarial multi-armed bandit problem},
  booktitle = FOCS,
  year = {1995},
  pages = {322--331},
  publisher = {IEEE Computer Society Press, Los Alamitos, CA}
}

@INPROCEEDINGS{AuerGe00,
  author = {Peter Auer and Claudio Gentile},
  title = {Adaptive and Self-Confident On-Line Learning Algorithms},
  booktitle = COLT,
  year = {2000},
  pages = {107--117},
  publisher = {Morgan Kaufmann, San Francisco}
}

@TECHREPORT{AuerHeWa96,
  author = {P. Auer and M. Herbster and M. K. Warmuth},
  title = {Exponentially many local minima for single neurons},
  institution = {Univ. of Calif.Computer Research Lab},
  year = {1996},
  number = {UCSC-CRL-96-1},
  address = {Santa Cruz, CA},
  note = {In preparation}
}

@INPROCEEDINGS{AuerHoMa95,
  author = {Peter Auer and Robert C. Holte and Wolfgang Maass},
  title = {Theory and applications of agnostic {PAC}-learning with small decision
	trees},
  booktitle = ICML,
  year = {1995},
  pages = {21--29},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{AKMW96,
  author = {Peter Auer and Stephen Kwek and Wolfgang Maass and Manfred K. Warmuth},
  title = {Learning of depth two neural networks with constant fan-in at the
	hidden nodes},
  booktitle = COLT,
  year = {1996},
  pages = {333--343},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{AuerLo94,
  author = {P. Auer and P. Long},
  title = {Simulating Access to hidden information while learning},
  booktitle = STOC,
  year = {1994},
  pages = {263--272}
}

@ARTICLE{AuerLo99,
  author = {Peter Auer and Philip M. Long},
  title = {Structural Results About On-line Learning Models With and Without
	Queries},
  journal = {Machine Learning},
  year = {1999},
  volume = {36},
  pages = {147--181},
  number = {3},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{ALMW95,
  author = {P. Auer and P. M. Long and W. Maass and G. J. Woeginger},
  title = {On the complexity of function learning},
  journal = {Machine Learning},
  year = {1995},
  volume = {18},
  pages = {187--230},
  number = {2/3},
  annote = {First appeared in 6th COLT, 1993},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{AuerWa95,
  author = {Peter Auer and Manfred Warmuth},
  title = {Tracking the best disjunction},
  booktitle = FOCS,
  year = {1995},
  pages = {312--321},
  publisher = {IEEE Computer Society Press, Los Alamitos, CA}
}

@ARTICLE{Aurenhammer91,
  author = {F. Aurenhammer},
  title = {Voronoi diagrams: A survey of a fundamental geometric data structure},
  journal = {ACM Comput. Surv.},
  year = {1991},
  volume = {23},
  pages = {345--405},
  keywords = {survey paper, Voronoi diagrams, Delaunay triangulations, arrangements,
	hyperplanes, plane sweep, divide-and-conquer, parallel computation,
	minimum spanning trees, cluster analysis, motion planning}
}

@INCOLLECTION{AurenhammerKl00,
  author = {F. Aurenhammer and R. Klein},
  title = {Voronoi Diagrams},
  booktitle = {Handbook of Computational Geometry},
  publisher = {Elsevier Science Publishers B. V. North-Holland},
  year = {2000},
  editor = {J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia},
  pages = {201--290},
  address = {Amsterdam},
  annote = {Chapter 5 of su-hcg-00},
  url = {http://wwwpi6.fernuni-hagen.de/Publikationen/tr198.pdf}
}

@BOOK{ACGKMP99,
  title = {Complexity and approximation},
  year = {1999},
  author = {G. Ausiello and P. Crescenzi and G. Gambosi and V. Kann and A. Marchetti-Spaccamela
	and M. Protasi},
  address = {Berlin},
  publusher = {Springer-Verlag}
}

@ARTICLE{Authorless93,
  author = {Authorless},
  title = {Erratum to Discovery},
  journal = {Machine Learning},
  year = {1993},
  volume = {13},
  pages = {153--153},
  note = {This is a correction to the article {\em Discovery by minimal length
	encoding: A case study in molecular evolution}, by Aleksandar Milosavljevic
	and Jerzy Jurka, which appeared in volume 12, number 1,2,3 of {\em
	Machine Learning}},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Authorless90,
  author = {Authorless},
  title = {Errata to Extending},
  journal = {Machine Learning},
  year = {1990},
  volume = {5},
  pages = {229--229},
  note = {This is a correction to the article {\em Extending domain theories:
	two case studies in student Modeling}, by D.~Slemman, et al., which
	appeared in volume 5, number 1, of {\em Machine Learning}},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Authorless89,
  author = {Authorless},
  title = {Erratum one},
  journal = {Machine Learning},
  year = {1989},
  volume = {3},
  pages = {377--377},
  note = {This is a correction to the article {\em Learning to Predict by the
	method of temporal differences}, by Richard Sutton, which appeared
	in volume 3, number 1, of {\em Machine Learning}.},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{ABBBDDDGEFJLMMNNPSSCW87,
  author = {A. Averbuch and L. Bahl and R. Bakis and P. Brown and G. Dagget and
	S. Das and K. Davies and S. De Gennaro and P. deSouza and E. Epstein
	and D. Fraleigh and F. Jelinek and B. Lewis and R. Mercer and J.
	Moorhead and A. Nadas and D. Nahamoo and M. Picheny and G. Shichman
	and P. Spinelli and D. Van Compernolle and H. Wilkens},
  title = {Experiments with the Tangora 20,000 word speeech recognizer},
  booktitle = ICASSP,
  year = {1987}
}

@INPROCEEDINGS{Averbuch87,
  author = {A. Averbuch and L. Bahl and R. Bakis and P. Brown and G. Dagget and
	S. Das and K. Davies and S. De Gennaro and P. deSouza and E. Epstein
	and D. Fraleigh and F. Jelinek and B. Lewis and R. Mercer and J.
	Moorhead and A. Nadas and D. Nahamoo and M. Picheny and G. Shichman
	and P. Spinelli and D. Van Compernolle and H. Wilkens},
  title = {Experiments with the Tangora 20,000 word speeech recognizer},
  booktitle = ICASSP,
  year = {1987}
}

@ARTICLE{ABRS99,
  author = {Baruch Awerbuch and Margrit Betke and Ronald L. Rivest and Mona Singh},
  title = {Piecemeal Graph Exploration by a Mobile Robot},
  journal = {Inform. Comput.},
  year = {1999},
  volume = {152},
  pages = {155--172},
  number = {2},
  comment = {first in COLT '95}
}

@ARTICLE{Awerbuch90,
  author = {Baruch Awerbuch and Oded Goldreich and David Peleg and Ronen Vainish},
  title = {A Trade-Off between Information and Communication in Broadcast Protocols},
  journal = jacm,
  year = {1990},
  volume = {37},
  pages = {238-256},
  number = {2},
  month = apr,
  keywords = {Distributed Computing; Algorithms; Theory; broadcast; lower bounds;
	resource trade-offs; }
}

@INPROCEEDINGS{AwerbuchKo98,
  author = {Baruch Awerbuch and Stephen G. Kobourov},
  title = {Polylogarithmic-overhead piecemeal graph exploration},
  booktitle = COLT,
  year = {1998},
  pages = {280--286},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{Azran07,
  author = {A. Azran},
  title = {The rendezvous algorithm: multiclass semi-supervised learning with
	{Markov} random walks},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {49--56},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INCOLLECTION{Baader02,
  author = {F. Baader},
  title = {Basic Description Logics},
  booktitle = {The Description Logic Handbook},
  publisher = {Cambridge University Press},
  year = {2002},
  editor = {F. Baader and D. Calvanese and D. McGuinness and D. Nardi and P.
	Patel-Schneider},
  pages = {47-100},
  address = {Cambridge}
}

@BOOK{BCMNP03,
  title = {Description Logic Handbook},
  publisher = Cambridge,
  year = {2003},
  author = {F. Baader and D. Calvanese and D. McGuinness and D. Nardi and P.
	Patel-Schneider}
}

@INPROCEEDINGS{BaaderK98,
  author = {F. Baader and R. K{\"u}sters},
  title = {Computing the least common subsumer and the most specific concept
	in the presence of cyclic $\mathcal{ALN}$-concept descriptions},
  booktitle = {Annual German Conference on Artificial Intelligence},
  year = {1998},
  editor = {O.~Herzog and A.~G{\"u}nter},
  volume = {1504},
  pages = {129--140},
  address = {Bremen, Germany},
  publisher = {Springer--Verlag},
  url = {citeseer.nj.nec.com/article/baader98computing.html}
}

@INPROCEEDINGS{BJKKBM07,
  author = {R. Babaria and S. Jagarlapudi and K. Kumar and S. Kaveri and C. Bhattacharyya
	and M. Murty},
  title = {Focussed crawling with scalable ordinal regression solvers},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {57--64},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{BHSM07,
  author = {Babych, Bogdan and Hartley, Anthony and Sharoff, Serge and Mudraya,
	Olga},
  title = {Assisting Translators in Indirect Lexical Transfer},
  booktitle = ACL,
  year = {2007},
  pages = {136--143},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1018}
}

@ARTICLE{Baccelli90,
  author = {Fran{\c{c}}ois Baccelli and Zhen Liu},
  title = {On the Execution of Parallel Programs on Multiprocessor Systems --
	A Queuing Theory Approach},
  journal = jacm,
  year = {1990},
  volume = {37},
  pages = {373-414},
  number = {2},
  month = apr,
  keywords = {System Modeling and Analysis; Design; Parallelism; Performance; Theory;
	associated random variables; ergodic theory; multiprogramming and
	multitasking; performance evaluation; response times; stability condition;
	stachastic ordering; task graph; waiting times; }
}

@ARTICLE{Baccelli89,
  author = {Fran{\c{c}}ois Baccelli and William A. Massey and Don Towsley},
  title = {Acyclic Fork-Join Queueing Networks},
  journal = jacm,
  year = {1989},
  volume = {36},
  pages = {615-642},
  number = {3},
  month = jul,
  keywords = {System Modeling and Analysis; Design; Parallelism; Performance; Theory;
	Verification; associated random variables; ergodic theory; multiprogramming
	and multitasking; performance evaluation; precedence graph; stability
	condition; stochastic ordering; }
}

@BOOK{Bacchus90,
  title = {Representing and Reasoning With Probabilistic Knowledge: ALogical
	Approach to Probabilities},
  publisher = {MIT Press},
  year = {1990},
  author = {Bacchus, Fahiem}
}

@INPROCEEDINGS{BacchusGrHaKo92,
  author = {Bacchus, Fahiem and Adam Grove and Joseph Y. Halpern and Daphne Koller},
  title = {From Statistics to Beliefs},
  booktitle = AAAI,
  year = {1992},
  pages = {602--608}
}

@PHDTHESIS{Bachrach92,
  author = {J. R. Bachrach},
  title = {Connectionist Modeling and Control of Finite-State Environments},
  school = {University of Massachusetts},
  year = {1992},
  month = feb
}

@INPROCEEDINGS{BachrachFiSh99,
  author = {Ran Bachrach and Shai Fine and Eli Shamir},
  title = {Query by Committee, Linear Separation and Random Walks},
  booktitle = EuroCOLT,
  year = {1999},
  volume = {1572},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {34--49},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Baeza-YatesTi07,
  author = {R. Baeza-Yates and A. Tiberi},
  title = {Extracting {S}emantic {R}elations from {Q}uery {L}ogs},
  booktitle = KDD,
  year = {2007},
  pages = {76--85}
}

@INPROCEEDINGS{SemRelQLog,
  author = {Ricardo Baeza-Yates and Alessandro Tiberi},
  title = {Extracting {S}emantic {R}elations from {Q}uery {L}ogs},
  booktitle = KDD,
  year = {2007},
  pages = {76--85}
}

@ARTICLE{BahlJeMe83,
  author = {Bahl, Lalit R. and Frederick Jelinek and Robert L. Mercer},
  title = {A Maximum Likelihood Approach to Continuous Speech Recognition},
  journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence},
  year = {1983},
  volume = {PAMI-5},
  pages = {179--190},
  number = {2},
  month = Mar,
  comment = {Describes Markov modeling and analysis techniques.}
}

@INPROCEEDINGS{Bai94,
  author = {S. Bai},
  title = {A Calculus for logical clustering},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1994},
  pages = {56--63},
  publisher = {Springer-Verlag}
}

@INBOOK{BaileyEl95,
  chapter = {18},
  pages = {345--359},
  title = {Cross-validation and modal theories},
  publisher = {MIT Press},
  year = {1995},
  author = {Timothy L. Bailey and Charles Elkan},
  volume = {III: Selecting Good Models},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@ARTICLE{BaileyEl95a,
  author = {Timothy L. Bailey and Charles Elkan},
  title = {Unsupervised learning of multiple motifs in biopolymers using expectation
	maximization},
  journal = {Machine Learning},
  year = {1995},
  volume = {21},
  pages = {51--80},
  number = {1/2},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INCOLLECTION{BWYLLs),
  author = {R. Baillargeon and D. Wu and S. Yuan and J. Li and Y. Luo},
  title = {Young infants expectations about self-propelled objects},
  booktitle = {The origins of object knowledge},
  publisher = {Oxford University Press},
  year = {(in press)},
  editor = {B. Hood and L. Santos},
  address = {Oxford}
}

@INCOLLECTION{Bainbridge77,
  author = {E. S. Bainbridge},
  title = {The fundamental duality of system theory},
  booktitle = {Systems: Approaches, Theories, Applications},
  publisher = {D. Reidel Publishing Company},
  year = {1977},
  editor = {W. E. Hartnett},
  pages = {45--61}
}

@INPROCEEDINGS{Baird95,
  author = {Leemon Baird},
  title = {Residual algorithms: reinforcement learning with function approximation},
  booktitle = ICML,
  year = {1995},
  pages = {30--37},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{Balaban95,
  author = {I. J. Balaban},
  title = {An Optimal Algorithm for Finding Segment Intersections},
  booktitle = {SOCG},
  year = {1995},
  pages = {211--219}
}

@ARTICLE{Balas91,
  author = {Egon Balas and Donald Miller and Joseph Pekny and Paolo Toth},
  title = {A Parallel Shortest Augmenting Path Algorithm for the Assignment
	Problem},
  journal = jacm,
  year = {1991},
  volume = {38},
  pages = {985-1004},
  number = {4},
  month = oct,
  keywords = {Operations Research; Algorithms; Experimentation; Performance; assignment;
	matching; shortest augmenting paths; traveling salesman problem;}
}

@INPROCEEDINGS{BCGS99,
  author = {Jose L. Balcazar and Jorge Castro and David Guijarro and Hans-Ulrich
	Simon},
  title = {The Consistency Dimension and Distribution-Dependent Learning from
	Queries},
  booktitle = ALT,
  year = {1999},
  volume = {1720},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {77--92},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{BDGW93,
  author = {J. L. Balc{\' a}zar and J. D{\' i}az and R. Gavald{\` a} and O. Watanabe},
  title = {A note on the query complexity of learning {DFA}},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1993},
  volume = {743},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {53--62},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{BalcazarBuHe95,
  author = {Jos{\'e} L. Balc{\'a}zar and Harry Buhrman and Montserrat Hermo},
  title = {Learnability of {K}olmogorov-easy circuit expressions via queries},
  booktitle = EuroCOLT,
  year = {1995},
  pages = {112--124},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{BalcazarCaGu00,
  author = {Jose Luis Balc{\'a}zar and Jorge Castro and David Guijarro},
  title = {Abstract Combinatorial Characterizations of Exact Learning via Queries},
  booktitle = COLT,
  year = {2000},
  pages = {248--254},
  publisher = {Morgan Kaufmann, San Francisco}
}

@INPROCEEDINGS{BDGW94,
  author = {J. L. Balc{\'a}zar and J. D{\'i}az and R. Gavald{\`a} and O. Watanabe},
  title = {An optimal parallel algorithm for learning {DFA}},
  booktitle = COLT,
  year = {1994},
  pages = {208--217},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{BaligaCa96,
  author = {Ganesh Baliga and John Case},
  title = {Learnability: Admissible, Co-Finite, and Hypersimple Languages},
  journal = {J. Comput. Syst. Sci.},
  year = {1996},
  volume = {53},
  pages = {26--32},
  number = {1},
  note = {First appeared in ICALP '93}
}

@INPROCEEDINGS{BaligaCa94,
  author = {G. Baliga and J. Case},
  title = {Learning with higher order additional information},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1994},
  pages = {64--75},
  publisher = {Springer-Verlag}
}

@ARTICLE{BaligaCaJa99,
  author = {G. Baliga and J. Case and S. Jain},
  title = {The synthesis of language learners},
  journal = {Inform. Comput.},
  year = {1999},
  volume = {152},
  pages = {16--43},
  number = {1}
}

@ARTICLE{BaligaCaJa95,
  author = {Ganesh Baliga and John Case and Sanjay Jain},
  title = {Language learning with some negative information},
  journal = {J. of Comput. Syst. Sci.},
  year = {1995},
  volume = {51},
  pages = {273--285},
  number = {2},
  annote = {Was in LNCS 665--STACS 1993}
}

@ARTICLE{BCJS94,
  author = {G. Baliga and J. Case and S. Jain and M. Suraj},
  title = {Machine Learning of Higher Order Programs},
  journal = {J. Symbolic Logic},
  year = {1994},
  volume = {59--2},
  pages = {486--500},
  annote = {Was in {\sl Proceedings of the Logical Foundations of Computer Science},
	Tver, Russia, LNCS 620 in 1992}
}

@ARTICLE{BaligaJaSh97,
  author = {Ganesh Baliga and Sanjay Jain and Arun Sharma},
  title = {Learning from Multiple Sources of Inaccurate Data},
  journal = {{SIAM} J. Comput.},
  year = {1997},
  volume = {26},
  pages = {961--990},
  number = {4}
}

@INPROCEEDINGS{BaligaJaSh92,
  author = {G. Baliga and S. Jain and A. Sharma},
  title = {Learning from Multiple Sources of Inaccurate Data},
  booktitle = AII,
  year = {1992},
  pages = {108--128},
  publisher = {Springer Verlag},
  note = {In Lecture Notes in AI 642. Was Univ of Del TR-91-14}
}

@INPROCEEDINGS{BaligaCaJa96,
  author = {Ganesh R. Baliga and John Case and Sanjay Jain},
  title = {Synthesizing enumeration techniques for language learning},
  booktitle = COLT,
  year = {1996},
  pages = {169--180},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{BalogB91,
  author = {A. Balog and I. B{\'a}r{\'a}ny},
  title = {{On the convex hull of the integer points in a disc}},
  booktitle = {SOCG},
  year = {1991},
  pages = {162--165}
}

@INPROCEEDINGS{BalujaCa95,
  author = {Shumeet Baluja and Rich Caruana},
  title = {Removing the genetics from the standard genetic algorithm},
  booktitle = ICML,
  year = {1995},
  pages = {38--46},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{BalujaDa97,
  author = {Shumeet Baluja and Scott Davies},
  title = {Using optimal dependency-trees for combinatorial optimization: Learning
	the structure of the search space},
  booktitle = ICML,
  year = {1997},
  pages = {30--38},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{Bambos91,
  author = {Nicholas Bambos and Jean Walrand},
  title = {On Stability and Performance of Parallel Processing Systems},
  journal = jacm,
  year = {1991},
  volume = {38},
  pages = {429-452},
  number = {2},
  month = apr,
  keywords = {System Modeling and Analysis; Design; Performance; Theory; database
	concurrency control; parallel processing; queuing networks; queuing
	theory; stability theory; subadditive ergodic theory; }
}

@INPROCEEDINGS{BVBHI96,
  author = {Cesar Bandera and Francisco J. Vico and Jose M. Bravo and Mance E.
	Harmon and Leemon C. Baird III},
  title = {Residual {Q}-learning applied to visual attention},
  booktitle = ICML,
  year = {1996},
  pages = {20--27},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{BanerjeePe03,
  author = {Banerjee, S. and Pedersen, T.},
  title = {The Design, Implementation, and Use of the {N}gram {S}tatistic {P}ackage},
  booktitle = CICLing,
  year = {2003},
  pages = {370-381}
}

@INPROCEEDINGS{BanerjeePe02,
  author = {S. Banerjee and T. Pedersen},
  title = {An Adapted Lesk Algorithm for Word Sense Disambiguation using WordNet},
  booktitle = CICLing,
  year = {2002},
  pages = {136--145},
  address = {Mexico City, USA},
  month = {Februray 17 - Februray 23}
}

@INBOOK{Banerji97,
  chapter = {1},
  pages = {3--15},
  title = {Initializing neural networks using decision trees},
  publisher = {MIT Press},
  year = {1997},
  author = {Arunava Banerji},
  volume = {IV: Making Learning Systems Practical},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@INBOOK{Banerji94,
  chapter = {2},
  pages = {25--47},
  title = {Learning theoretical terms},
  publisher = {MIT Press},
  year = {1994},
  author = {Ranan B. Banerji},
  volume = {I: Constraints and Prospects},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@INPROCEEDINGS{Banerji88,
  author = {R. B. Banerji},
  title = {Learning theories in a subset of a polyadic logic},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1988},
  pages = {267--278},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{Banerji85,
  author = {R. B. Banerji},
  title = {The Logic of Learning: a Basis for Pattern Recognition and for Improvement
	of Performance},
  journal = {Advances in Computers},
  year = {1985},
  volume = {24},
  pages = {177--216}
}

@INPROCEEDINGS{BangaloreHaKa07,
  author = {Bangalore, Srinivas and Haffner, Patrick and Kanthak, Stephan},
  title = {Statistical Machine Translation through Global Lexical Selection
	and Sentence Reconstruction},
  booktitle = ACL,
  year = {2007},
  pages = {152--159},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1020}
}

@INPROCEEDINGS{BCSBE07,
  author = {M. Banko and M. Cafarella and M. Soderland and M. Broadhead and O.
	Etzioni},
  title = {Open Information Extraction from the Web},
  booktitle = IJCAI,
  year = {2007},
  pages = {2670--2676}
}

@INPROCEEDINGS{BCSBE07a,
  author = {Michele Banko and Michael J. Cafarella and Stephen Soderland and
	Matthew Broadhead and Oren Etzioni},
  title = {Open Information Extraction from the Web},
  booktitle = {Proceedings of IJCAI-07},
  year = {2007},
  pages = {2670-2676},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@INPROCEEDINGS{BankoEt08,
  author = {Banko, Michele and Etzioni, Oren},
  title = {The Tradeoffs Between Open and Traditional Relation Extraction},
  booktitle = {ACL-HLT},
  year = {2008},
  pages = {28--36},
  address = {Columbus, Ohio},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P08/P08-1004}
}

@INPROCEEDINGS{BankoEt08_short,
  author = {M. Banko and O. Etzioni},
  title = {{The Tradeoffs Between Open and Traditional Relation Extraction}},
  booktitle = {ACL-HLT},
  year = {2008},
  pages = {28--36},
  url = {http://www.aclweb.org/anthology/P/P08/P08-1004}
}

@INPROCEEDINGS{BankoEt08a,
  author = {Banko, M. and Etzioni, O.},
  title = {The Tradeoffs Between Open and Traditional Relation Extraction},
  booktitle = {ACL-HLT},
  year = {2008},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@INPROCEEDINGS{BarWe07,
  author = {A. {Bar Hillel} and D. Weinshall},
  title = {Learning distance function by coding similarity},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {65--72},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{BarHaimDaGrSh07,
  author = {Bar-Haim, Roy and Dagan, Ido and Greental, Iddo and Shnarch, Eyal},
  title = {Semantic Inference at the Lexical-Syntactic Level},
  booktitle = AAAI,
  year = {2007},
  address = {Vancouver},
  month = {July},
  publisher = {AAAI}
}

@INPROCEEDINGS{BDGS07,
  author = {Bar-Haim, R. and Dagan, I. and Greental, I. and Shnarch, E.},
  title = {Semantic Inference at the Lexical-Syntactic Level},
  booktitle = {The National Conference On Artificial Intelligence},
  year = {2007},
  volume = {22},
  number = {1},
  pages = {871}
}

@INPROCEEDINGS{BarHaimDaGrSzFr07,
  author = {Bar-Haim, Roy and Dagan, Ido and Greental, Iddo and Szpektor, Idan
	and Friedman, Moshe},
  title = {Semantic Inference at the Lexical-Syntactic Level for Textual Entailment
	Recognition},
  booktitle = {ACL-PASCAL Workshop on Textual Entailment and Paraphrasing},
  year = {2007},
  pages = {131--136},
  address = {Prague},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/W/W07/W07-1422}
}

@INPROCEEDINGS{BDGSF07,
  author = {Bar-Haim, R. and Dagan, I. and Greental, I. and Szpektor, I. and
	Friedman, M.},
  title = {Semantic Inference at the Lexical-Syntactic Level for Textual Entailment
	Recognition},
  booktitle = {ACL-PASCAL Workshop on Textual Entailment and Paraphrasing},
  year = {2007},
  pages = {131--136},
  address = {Prague},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/W/W07/W07-1422}
}

@INPROCEEDINGS{BarHaimSzGl05,
  author = {Bar-Haim, R. and Szpecktor, I. and Glickman, O.},
  title = {Definition and Analysis of Intermediate Entailment Levels},
  booktitle = {ACL Workshop on Empirical Modeling of Semantic Equivalence and Entailment},
  year = {2005},
  pages = {55--60},
  address = {Ann Arbor, Michigan},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/W/W05/W05-1210}
}

@ARTICLE{Bareiss91,
  author = {Ray Bareiss},
  title = {A Reply to Reich's Book Review of Exemplar-Based Knowledge Acquisition},
  journal = {Machine Learning},
  year = {1991},
  volume = {6},
  pages = {105--106},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{BareissPoMu89,
  author = {Ray Bareiss and Bruce W. Porter and Kenneth S. Murray},
  title = {Supporting Start-to-Finish Development of Knowledge Bases},
  journal = {Machine Learning},
  year = {1989},
  volume = {4},
  pages = {259--283},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{BCGMT96,
  author = {G. Barequet and B. Chazelle and L. J. Guibas and J. S.B. Mitchell
	and A. Tal},
  title = {{BOXTREE}: {A} Hierarchical Representation for Surfaces in {3D}},
  journal = {Comput. Graph. Forum},
  year = {1996},
  volume = {15},
  pages = {C387--C396, C484},
  number = {3},
  note = {Proc.\ Eurographics'96}
}

@ARTICLE{BarequetHa01,
  author = {G. Barequet and S. {Har-Peled}},
  title = {Efficiently Approximating the Minimum-Volume Bounding Box of a Point
	Set in Three Dimensions},
  journal = {J. Algorithms},
  year = {2001},
  volume = {38},
  pages = {91--109},
  issue = {1},
  url = {http://www.uiuc.edu/~sariel/research/papers/98/bbox.html}
}

@INPROCEEDINGS{BarequetHa99,
  author = {G. Barequet and S. {Har-Peled}},
  title = {Efficiently Approximating the Minimum-Volume Bounding Box of a Point
	Set in Three Dimensions},
  booktitle = SODA,
  year = {1999},
  pages = {82--91}
}

@INPROCEEDINGS{BarequetHa99a,
  author = {G. Barequet and S. {Har-Peled}},
  title = {Some Variants of Polygon Containment and Minimum Hausdorff Distance
	under Translation are {\sc3sum}-Hard},
  booktitle = SODA,
  year = {1999},
  pages = {S862--863}
}

@INPROCEEDINGS{BACFFGHHIKo07,
  author = {Barker, K. and Agashe, B. and Chaw, S. and Fan, J. and Friedland,
	N. and Glass, M. and Hobbs, J. and Hovy, E. and Israel, D. and Kim,
	D.S. and others},
  title = {{Learning by Reading: A Prototype System, Performance Baseline and
	Lessons Learned}},
  booktitle = AAAI,
  year = {2007},
  volume = {22},
  pages = {280},
  address = {Menlo Park, CA},
  publisher = {AAAI Press}
}

@INPROCEEDINGS{BarkerEtAl07,
  author = {Barker, K. and Agashe, B. and Chaw, S. and Fan, J. and Friedland,
	N. and Glass, M. and Hobbs, J. and Hovy, E. and Israel, D. and Kim,
	D.S. and others},
  title = {{Learning by Reading: A Prototype System, Performance Baseline and
	Lessons Learned}},
  booktitle = AAAI,
  year = {2007},
  volume = {22},
  pages = {280},
  address = {Menlo Park, CA},
  publisher = {AAAI Press}
}

@MASTERSTHESIS{Barland92,
  author = {I. Barland},
  title = {Some ideas on learning with directional feedback},
  school = {UC Santa Cruz},
  year = {1992},
  month = jun
}

@ARTICLE{BarnardJo05,
  author = {K. Barnard and M. Johnson},
  title = {Word sense disambiguation with pictures},
  journal = AI,
  year = {2005},
  volume = {167},
  pages = {13--30},
  number = {1-2},
  month = {Sept}
}

@ARTICLE{BarnesHu86,
  author = {J. Barnes and P. Hut},
  title = {A hierarchical {$O(n \log n)$} force-calculation algorithm},
  journal = {Nature},
  year = {1986},
  volume = {324},
  pages = {446--449},
  number = {4},
  month = dec
}

@ARTICLE{BGKNP96,
  author = {C. Baroglio and A. Giordana and M. Kaiser and M. Nuttin and R. Piola},
  title = {Learning Controllers for Industrial Robots},
  journal = {Machine Learning},
  year = {1996},
  volume = {23},
  pages = {221--249},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{BaroniLe10,
  author = {M. Baroni and A. Lenci},
  title = {Distributional Memory: A General Framework for Corpus-based Semantics},
  journal = CL,
  year = {2010},
  volume = {36},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@INPROCEEDINGS{BarronClHa93,
  author = {A. Barron and B. Clarke and D. Haussler},
  title = {Information bounds for the risk of Bayesian predictions and the redundancy
	of universal codes},
  booktitle = {International Symposium on Information Theory},
  year = {1993},
  month = jan
}

@INPROCEEDINGS{Barron97,
  author = {Andrew R. Barron},
  title = {Information theory in probability, statistics, learning, and neural
	nets},
  booktitle = COLT,
  year = {1997},
  pages = {1},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{Barron94,
  author = {Andrew R. Barron},
  title = {Approximation and estimation bounds for artificial neural networks},
  journal = {Machine Learning},
  year = {1994},
  volume = {14},
  pages = {115--133},
  number = {1},
  annote = {Earlier version in COLT 1991},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{Barthelemy07,
  author = {Barthelemy, Francois},
  title = {Using Mazurkiewicz Trace Languages for Partition-Based Morphology},
  booktitle = ACL,
  year = {2007},
  pages = {928--935},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1117}
}

@ARTICLE{Bartlett52,
  author = {Bartlett, M. S.},
  title = {The Statistical Significance of Odd Bits of Information},
  journal = {Biometrika},
  year = {1952},
  volume = {39},
  pages = {228--237},
  comment = {Variation on likelihood measure proposed.}
}

@INPROCEEDINGS{Bartlett93,
  author = {P. Bartlett},
  title = {Lower bounds on the {V}apnik-{C}hervonenkis dimension of multi-layer
	threshold networks},
  booktitle = COLT,
  year = {1993},
  pages = {144--150},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{BartlettLiLu97,
  author = {Peter Bartlett and Tam{\'a}s Linder and G{\'a}bor Lugosi},
  title = {A minimax lower bound for empirical quantizer design},
  booktitle = EuroCOLT,
  year = {1997},
  pages = {210--222},
  publisher = {Springer-Verlag}
}

@INBOOK{BartlettSh98,
  chapter = {Generalization Performance of Support Vector Machines and other Pattern
	Classifiers},
  title = {Advances in Kernel Methods --- Support Vector Learning},
  publisher = {MIT Press},
  year = {1998},
  author = {P. Bartlett and J. {Shawe-Taylor}}
}

@INPROCEEDINGS{Bartlett92,
  author = {P. L. Bartlett},
  title = {Learning with a slowly changing distribution},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1992},
  pages = {243--252},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{BartlettBa00,
  author = {Peter L. Bartlett and Jonathan Baxter},
  title = {Estimation and Approximation Bounds for Gradient-Based Reinforcement
	Learning},
  booktitle = COLT,
  year = {2000},
  pages = {133--141},
  publisher = {Morgan Kaufmann, San Francisco}
}

@INPROCEEDINGS{BartlettBe99,
  author = {Peter L. Bartlett and Shai Ben-David},
  title = {Hardness Results for Neural Network Approximation Problems},
  booktitle = EuroCOLT,
  year = {1999},
  volume = {1572},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {50--62},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{BartlettBeKu96,
  author = {Peter L. Bartlett and Shai Ben-David and Sanjeev R. Kulkarni},
  title = {Learning changing concepts by exploiting the structure of change},
  booktitle = COLT,
  year = {1996},
  pages = {131--139},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{BartlettBoLu00,
  author = {Peter L. Bartlett and St{\'e}phane Boucheron and G{\'a}bor Lugosi},
  title = {Model Selection and Error Estimation},
  booktitle = COLT,
  year = {2000},
  pages = {286--297},
  publisher = {Morgan Kaufmann, San Francisco}
}

@INPROCEEDINGS{BartlettFiH94,
  author = {P. L. Bartlett and P. Fischer and K.-U. H{\"o}ffgen},
  title = {Exploiting random walks for learning},
  booktitle = COLT,
  year = {1994},
  pages = {318--327},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{BartlettLo95,
  author = {Peter L. Bartlett and Philip M. Long},
  title = {More theorems about scale-sensitive dimensions and learning},
  booktitle = COLT,
  year = {1995},
  pages = {392--401},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{BartlettLoWi94,
  author = {P. L. Bartlett and P. M. Long and R. C. Williamson},
  title = {Fat-shattering and the learnability of real-valued functions},
  booktitle = COLT,
  year = {1994},
  pages = {299--310},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{BartlettWi91,
  author = {P. L. Bartlett and R. C. Williamson},
  title = {Investigating the distribution assumptions in the {PAC} learning
	model},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1991},
  pages = {24--32},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@TECHREPORT{Bartak98,
  author = {Roman Bart{\'a}k},
  title = {Constructive Negation in {CLP(H)}},
  institution = {Charles University},
  year = {1998},
  number = {No. 98/6},
  month = {July}
}

@INPROCEEDINGS{BarveLo96,
  author = {Rakesh D. Barve and Philip M. Long},
  title = {On the complexity of learning from drifting distributions},
  booktitle = COLT,
  year = {1996},
  pages = {122--130},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{Barzdin77,
  author = {J. M. Barzdin},
  title = {Inductive Inference of Automata, Functions and Programs},
  booktitle = AMS,
  year = {1977},
  pages = {107--122},
  annote = {Was also in Int. Math. Congress in 1974}
}

@ARTICLE{Barzdin74a,
  author = {J. M. Barzdin},
  title = {Limiting synthesis of t numbers},
  journal = {Latvijas Valsts Univ. Zimatm. Raksti},
  year = {1974},
  volume = {210},
  pages = {112--116}
}

@INPROCEEDINGS{Barzdin74b,
  author = {J. M. Barzdin},
  title = {On synthesizing programs given by examples},
  booktitle = {Lecture Notes in Computer Science 5},
  year = {1974},
  pages = {53--63},
  publisher = {Springer-Verlag}
}

@INCOLLECTION{Barzdin74c,
  author = {J. M. Barzdin},
  title = {Two Theorems on the Limiting Synthesis of Functions},
  booktitle = {Theory of Algorithms and Programs},
  publisher = {Latvian State University, Riga},
  year = {1974},
  volume = {1},
  pages = {82--88},
  note = {In Russian}
}

@ARTICLE{Barzdin71,
  author = {J. M. Barzdin},
  title = {Prognostication of automata and functions},
  journal = {Information Processing},
  year = {1971},
  volume = {1},
  pages = {81--84}
}

@ARTICLE{Barzdin70,
  author = {J. M. Barzdin},
  title = {On decoding automata in the absence of an upper bound on the number
	of states},
  journal = {Dokl. Akad. Nauk. SSSR},
  year = {1970},
  pages = {1048--1051},
  vol = {190}
}

@ARTICLE{BarzdinFr74,
  author = {J. M. Barzdin and R. Freivalds},
  title = {Prediction and limiting synthesis of recursively enumerable classes
	of functions},
  journal = {Latvijas Valsts Univ. Zimatm. Raksti},
  year = {1974},
  volume = {210},
  pages = {101--111}
}

@ARTICLE{BarzdinFr72,
  author = {J. M. Barzdin and R. V. Frievald},
  title = {On the prediction of general recursive functions},
  journal = {Soviet Mathematics Doklady},
  year = {1972},
  volume = {13},
  pages = {1224--1228},
  comment = {Introduces the on-line mistake bound learning model (although in a
	Gold-style framework)}
}

@INCOLLECTION{BarzdinKiPo74,
  author = {J. M. Barzdin and E. B. Kinber and K. M. Podnieks},
  title = {Concerning synthesis and prediction of functions},
  booktitle = {Theory of Algorithms and Programs},
  publisher = {Latvian State University, Riga},
  year = {1974},
  volume = {1},
  pages = {117--128}
}

@INPROCEEDINGS{BarzdinPo73,
  author = {J. M. Barzdin and K. M. Podnieks},
  title = {Towards a theory of inductive inference},
  booktitle = MFCS,
  year = {1973},
  pages = {9--15},
  publisher = {Math. Inst. of the Slovak Academy of Sciences}
}

@INPROCEEDINGS{BarzdinsBa93,
  author = {J. Barzdins and G. Barzdins},
  title = {Towards efficient inductive synthesis: {R}apid construction of local
	regularities},
  booktitle = {International Workshop on Nonmonotonic and Inductive Logic},
  year = {1993},
  volume = {659},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {132--140},
  publisher = {Springer--Verlag}
}

@INPROCEEDINGS{Barzdinv94,
  author = {J. Barzdin{\v s}},
  title = {Towards efficient inductive synthesis from input/output examples},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1994},
  pages = {1},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{BarzilayLa06,
  author = {R. Barzilay and M. Lapata},
  title = {{Aggregation via Set Partitioning for Natural Language Generation}},
  booktitle = HLT-NAACL,
  year = {2006},
  month = {June}
}

@INPROCEEDINGS{BarzilyLa06,
  author = {Regina Barzilay and Mirella Lapata},
  title = {Aggregation via set partitioning for natural language generation},
  booktitle = NAACL,
  year = {2006},
  pages = {359--366},
  publisher = {ACL},
  location = {New York, New York}
}

@INPROCEEDINGS{BarzilayLa05,
  author = {Regina Barzilay and Mirella Lapata},
  title = {Modeling local coherence: an entity-based approach},
  booktitle = ACL,
  year = {2005}
}

@INPROCEEDINGS{BarzilayLe04,
  author = {Regina Barzilay and Lillian Lee},
  title = {Catching the drift: probabilistic content models, with applications
	to generation and summarization},
  booktitle = HLT-NAACL,
  year = {2004},
  pages = {113-120}
}

@INPROCEEDINGS{BarsilayMc01,
  author = {R. Barzilay and K. R. McKeown},
  title = {Extracting Paraphrases from a Parallel Corpus},
  booktitle = EACL,
  year = {2001}
}

@INPROCEEDINGS{BDIZ97,
  author = {J. Basch and H. Devarajan and P. Indyk and L. Zhang},
  title = {Probabilistic Analysis for Combinatorial Functions of Moving Points},
  booktitle = {SOCG},
  year = {1997},
  pages = {442--444}
}

@ARTICLE{BaschGuHe99,
  author = {J. Basch and L. J. Guibas and J. Hershberger},
  title = {Data Structures for Mobile Data},
  journal = JALG,
  year = {1999},
  volume = {31},
  pages = {1--28},
  number = {1},
  url = {http://graphics.stanford.edu/~jbasch/publications/kinetic/}
}

@INPROCEEDINGS{BaschGuHe97,
  author = {J. Basch and L. J. Guibas and J. Hershberger},
  title = {Data Structures for Mobile Data},
  booktitle = SODA,
  year = {1997},
  pages = {747--756},
  url = {http://graphics.stanford.edu/~jbasch/publications/kinetic/}
}

@INPROCEEDINGS{BaschGuRa97,
  author = {J. Basch and L. J. Guibas and G. Ramkumar},
  title = {Sweeping Lines and Line Segments with a Heap},
  booktitle = {SOCG},
  year = {1997},
  pages = {469--472}
}

@ARTICLE{BaschGuRa03,
  author = {J. Basch and L. J. Guibas and G. D. Ramkumar},
  title = {Reporting red-blue intersections between two sets of connected line
	segments},
  journal = ALGORITHMICA,
  year = {2003},
  volume = {35},
  pages = {1--20},
  url = {http://link.springer-ny.com/link/service/journals/00453/contents/02/0967/}
}

@INPROCEEDINGS{BaschGuRa96a,
  author = {J. Basch and L. J. Guibas and G. D. Ramkumar},
  title = {Reporting red-blue intersections between two sets of connected line
	segments},
  booktitle = ESA,
  year = {1996},
  volume = {1136},
  series = {Lecture Notes Comput. Sci.},
  pages = {302--319},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{BGSZ97,
  author = {J. Basch and L. J. Guibas and C. Silverstein and L. Zhang},
  title = {A practical evaluation of kinetic data structures},
  booktitle = {SOCG},
  year = {1997},
  pages = {388--390}
}

@UNPUBLISHED{Basri94,
  author = {R. Basri},
  note = {Private Communication},
  year = {1994},
  comment = {Character recognition via polynomial eplainable classes}
}

@ARTICLE{BasuPoRo96,
  author = {S. Basu and R. Pollack and M.-F. Roy},
  title = {On the combinatorial and algebraic complexity of quantifier elimination},
  journal = JACM,
  year = {1996},
  volume = {43},
  pages = {1002--1045}
}

@ARTICLE{BasyeDeVi97,
  author = {Kenneth Basye and Thomas Dean and Jeffrey Scott Vitter},
  title = {Coping with uncertainty in map learning},
  journal = {Machine Learning},
  year = {1997},
  volume = {29},
  pages = {65--88},
  note = {Earlier versions in IJCAI89 and Brown Univ. TR-89-27},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Battiti89,
  author = {Roberto Battiti},
  title = {Accelerated Backpropagation Learning: Two Optimization Methods},
  journal = {Complex Systems},
  year = {1989},
  volume = {3},
  pages = {331--342},
  number = {4},
  month = Aug,
  comment = {Gets one order of magnitude improvement over ordinarybackpropagation
	using variable step size and a versionof the conjugate gradient method.}
}

@ARTICLE{BauerKo99,
  author = {Eric Bauer and Ron Kohavi},
  title = {An Empirical Comparison of Voting Classification Algorithms: {B}agging,
	Boosting, and Variants},
  journal = {Machine Learning},
  year = {1999},
  volume = {36},
  pages = {105--139},
  number = {1/2},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{Baum96,
  author = {Baum, E.},
  title = {Toward a model of Mind as a Laissez-Faire Economy of Idiots},
  booktitle = ML,
  year = {1996}
}

@ARTICLE{Baum90,
  author = {E. Baum},
  title = {A polynomial time algorithm that learns two hidden net units},
  journal = {Neural Computation},
  year = {1990},
  volume = {2},
  pages = {510--522}
}

@ARTICLE{BaumHa89,
  author = {E. Baum and D. Haussler},
  title = {What Size Net Gives Valid Generalization?},
  journal = {Neural Computation},
  year = {1989},
  volume = {1},
  pages = {151--160},
  number = {1},
  annote = {Also in {\sl Advances in Neural Information Processing Sytstems I}
	in 1989},
  comment = {VC-dimension arguments}
}

@INPROCEEDINGS{BaumWi88,
  author = {E. Baum and F. Wilczek},
  title = {Supervised Learning of Probability Distributions by Neural Networks},
  booktitle = NIPS,
  year = {1988},
  editor = {D. Z. Anderson},
  pages = {52--61},
  address = {New York},
  publisher = {American Insitute of Physics}
}

@ARTICLE{Baum99,
  author = {Eric B. Baum},
  title = {Toward a Model of Intelligence as an Economy of Agents},
  journal = {Machine Learning},
  year = {1999},
  volume = {35},
  pages = {155--185},
  number = {2},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INBOOK{Baum94,
  chapter = {14},
  pages = {415--442},
  title = {When are k-nearest neighbor and backpropagation accurate for feasible-sized
	sets of examples?},
  publisher = {MIT Press},
  year = {1994},
  author = {Eric. B. Baum},
  volume = {I: Constraints and Prospects},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@ARTICLE{Baum91,
  author = {Baum, E. B.},
  title = {Neural Net algorithms that learn in polynomial time from examples
	and queries},
  journal = {IEEE Transactions on Neural Networks},
  year = {1991},
  volume = {2},
  pages = {5--19},
  number = {1},
  month = Jan
}

@ARTICLE{Baum90a,
  author = {Baum, Eric B.},
  title = {On Learning a Union of Half Spaces},
  journal = {Journal of Complexity},
  year = {1990},
  volume = {6},
  pages = {67--101},
  number = {1},
  month = Mar
}

@ARTICLE{Baum90b,
  author = {E. B. Baum},
  title = {The Perceptron Algorithm is Fast for Nonmalicious Distributions},
  journal = {Neural Computation},
  year = {1990},
  volume = {2},
  pages = {248--260}
}

@INPROCEEDINGS{Baum90c,
  author = {E. B. Baum},
  title = {Polynomial time algorithms for learning neural nets},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1990},
  pages = {258--272},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{BaumBoGa95,
  author = {Eric B. Baum and Dan Boneh and Charles Garrett},
  title = {On genetic algorithms},
  booktitle = COLT,
  year = {1995},
  pages = {230--239},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{BaumHa89a,
  author = {Baum, E. B. and D. Haussler},
  title = {What Size Net Gives Valid Generalization?},
  booktitle = NIPS,
  year = {1989},
  pages = {81--90},
  publisher = {Morgan Kaufmann},
  comment = {VC-dimension arguments}
}

@ARTICLE{BaumMoWi88,
  author = {Baum, E. B. and J. Moody and F. Wilczek},
  title = {Internal Representations fo Associative Memory},
  journal = {Biological Cybernetics},
  year = {1988},
  volume = {59},
  pages = {217--228}
}

@ARTICLE{Baum72,
  author = {L. E. Baum},
  title = {An inequality and an associated maximization technique in statistical
	estimation of probabilistic functions of a Markov process},
  journal = {Inequalities},
  year = {1972},
  volume = {3:1-8}
}

@ARTICLE{BaumEa67,
  author = {Baum, Leonard E. and J. A. Eagon},
  title = {An Inequality with Applications to Statistical Estimation for Probabilistic
	Functions of Markov Processes and to a Model for Ecology},
  journal = {Bulletin of the American Mathematical Society},
  year = {1967},
  volume = {73},
  pages = {360--363},
  comment = {Gives a technique for maximizing a polynomial with nonnegative coefficients
	and homogeneous of degree d.}
}

@INCOLLECTION{BavinGr97,
  author = {E. L. Bavin and C. Growcott},
  title = {Infants of 24-30 months understand verb frames},
  booktitle = {New Directions in Language Development and Disorders},
  publisher = {Kluwer Academic Press},
  year = {1997},
  editor = {Perkins and Howard},
  pages = {169-177},
  address = {New York}
}

@INCOLLECTION{Baxter97,
  author = {J. Baxter},
  title = {Theoretical Models of Learning to Learn},
  booktitle = {Learning to Learn},
  publisher = {Kluwer Academic Publishers},
  year = {1997},
  editor = {T. Mitchell and S. Thrun}
}

@ARTICLE{Baxter97a,
  author = {Jonathan Baxter},
  title = {A {B}ayesian/information theoretic model of learning to learn via
	multiple task sampling},
  journal = {Machine Learning},
  year = {1997},
  volume = {28},
  pages = {7--39},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{Baxter97b,
  author = {Jonathan Baxter},
  title = {The canonical distortion measure for vector quantization and function
	approximation},
  booktitle = ICML,
  year = {1997},
  pages = {39--47},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{Baxter96,
  author = {Jonathan Baxter},
  title = {A {B}ayesian/information theoretic model of bias learning},
  booktitle = COLT,
  year = {1996},
  pages = {77--88},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{Baxter95,
  author = {Jonathan Baxter},
  title = {Learning internal representations},
  booktitle = COLT,
  year = {1995},
  pages = {311--320},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{BaxterBa97,
  author = {Jonathan Baxter and Peter Bartlett},
  title = {A result relating convex $n$-widths to covering numbers with some
	applications to neural networks},
  booktitle = EuroCOLT,
  year = {1997},
  pages = {251--259},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{BaxterTrWe98,
  author = {Jonathan Baxter and Andrew Trigdell and Lex Weaver},
  title = {KnightCap: a chess program that learns by combining {TD}($\lambda$)
	with game-tree search},
  booktitle = ICML,
  year = {1998},
  pages = {28--36},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{BaxterOl96,
  author = {Rohan A. Baxter and Jonathan J. Oliver},
  title = {The kindest cut: minimum message length segmentation},
  booktitle = ALT,
  year = {1996},
  volume = {1160},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {83--90},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Bay98,
  author = {Stephen D. Bay},
  title = {Combining nearest neighbor classifiers through multiple feature subsets},
  booktitle = ICML,
  year = {1998},
  pages = {37--45},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@ARTICLE{BayraktarSaAk98,
  author = {M. Bayraktar and B. Say and V. Akman},
  title = {An Analysis of English Punctuation: The Special Case of Comma},
  journal = {International Journal of Corpus Linguistics},
  year = {1998},
  volume = {3(1)},
  pages = {33-57}
}

@INPROCEEDINGS{Beale88,
  author = {Andrew D. Beale},
  title = {Lexicon and grammar in probabilistic tagging of written English},
  booktitle = ANLP,
  year = {1988}
}

@ARTICLE{Beame89,
  author = {Paul Beame and Johan Hastad},
  title = {Optimal Bounds for Decision Problems on the {CRCW} {PRAM}},
  journal = jacm,
  year = {1989},
  volume = {36},
  pages = {643-670},
  number = {3},
  month = jul,
  keywords = {Theory of Computation; Theory; Verification; concurrent-write; lower
	bounds; parallel random-access machines; parity; sorting; }
}

@ARTICLE{BearCoEb87,
  author = {Mark F. Bear and Leon N. Cooper and Ford F. Ebner},
  title = {A Physiological Basis for a Theory of Synapse Modification},
  journal = {Science},
  year = {1987},
  volume = {237},
  pages = {42--48},
  month = {Jul 3},
  comment = {Proposes that change in weight w_ij from i to j goes as d(w_ij)/dt
	= \phi(a_i,avg(a_i)) a_j where \phi is negative below (say) avg(a_i)**2,
	and positive above it.}
}

@ARTICLE{Beaudry92,
  author = {M. Beaudry and P. McKenzie and D. Th{\'e}rien},
  title = {The Membership Problem in Aperiodic Transformation Monoids},
  journal = jacm,
  year = {1992},
  volume = {39},
  pages = {599-616},
  number = {3},
  month = jul,
  keywords = {Theory of Computation; }
}

@TECHREPORT{Beaver87,
  author = {D. Beaver},
  title = {Polynomially Sized Boolean Circuits are not Learnable},
  institution = {Aiken Computation Laboratory, Harvard University},
  year = {1987},
  number = {TR-13-87},
  month = dec
}

@INPROCEEDINGS{BKSS90,
  author = {N. Beckmann and H.-P. Kriegel and R. Schneider and B. Seeger},
  title = {The {R$^*$}-tree: {An} efficient and robust access method for points
	and rectangles},
  booktitle = {SIGMOD},
  year = {1990},
  pages = {322--331}
}

@INPROCEEDINGS{BKSS90a,
  author = {N. Beckmann and H.-P. Kriegel and R. Schneider and B. Seeger},
  title = {The {R}{$^*$}-tree: An efficient and robust access method for points
	and rectangles},
  booktitle = {ACM SIGMOD International Conference on Management of Data},
  year = {1990},
  pages = {322--331}
}

@ARTICLE{BeefermanBeLa99,
  author = {Doug Beeferman and Adam Berger and John D. Lafferty},
  title = {Statistical Models for Text Segmentation},
  journal = {Machine Learning},
  year = {1999},
  volume = {34},
  pages = {177--210},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{BBMN02,
  author = {L. van der Beek and G. Bouma and R. Malouf and G. van Noord},
  title = {The Alpino Dependency Treebank},
  booktitle = CLIN,
  year = {2002},
  timestamp = {2007.01.26}
}

@PHDTHESIS{Beer89,
  author = {Randall Dean Beer},
  title = {Intelligence as Adaptive Behavior: An Experiment in Computational
	Neuroethology},
  school = {Case Western Reserve University},
  year = {1989},
  month = Aug,
  comment = {Simulates a cockroach using specially-designed neuralcircuitry}
}

@ARTICLE{Beeri89,
  author = {Catriel Beeri and Phillip A. Bernstein and Nathan Goodman},
  title = {A Model for Concurrency in Nested Transaction Systems},
  journal = jacm,
  year = {1989},
  volume = {36},
  pages = {230-269},
  number = {2},
  month = apr,
  keywords = {Datbase Theory; Algorithms; Correctness; Verification; computational
	forest; concurrency control; nested transactions; serializability;}
}

@ARTICLE{BeeriDoFaSt84,
  author = {Beeri, C. and M. Dowd and R. Fagin and R. Statman},
  title = {On the Structure of {A}rmstrong Relations for Functional Dependencies},
  journal = JACM,
  year = {1984},
  volume = {31},
  pages = {30--46},
  number = {1}
}

@INPROCEEDINGS{BeimelGeKu98,
  author = {Amos Beimel and Felix Geller and Eyal Kushilevitz},
  title = {The query complexity of finding local minima in the lattice},
  booktitle = COLT,
  year = {1998},
  pages = {294--302},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{BeimelKu98,
  author = {Amos Beimel and Eyal Kushilevitz},
  title = {Learning Boxes in High Dimension},
  journal = {Algorithmica},
  year = {1998},
  volume = {22},
  pages = {76--90},
  number = {1/2},
  comment = {first in EuroColt '97}
}

@ARTICLE{BelewFo88,
  author = {Richard K. Belew and Stephanie Forrest},
  title = {Learning and Programming in Classifier Systems},
  journal = {Machine Learning},
  year = {1988},
  volume = {3},
  pages = {193--223},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{BellareDrMc09,
  author = {K. Bellare and G. Druck and A. McCallum},
  title = {Alternating Projections for Learning with Expectation Constraints},
  booktitle = UAI,
  year = {2009}
}

@INPROCEEDINGS{Bellare92,
  author = {M. Bellare},
  title = {A technique for upper bounding the spectral norm with applications
	to learning},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1992},
  pages = {62--70},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{BellareMi92,
  author = {Mihir Bellare and Silvio Micali},
  title = {How to Sign Given any Trapdoor Permutation},
  journal = jacm,
  year = {1992},
  volume = {39},
  pages = {214-233},
  number = {1},
  month = jan,
  keywords = {Theory of Computation; Algorithms; Security; Theory; cryptography;
	digital signatures; randomness; trapdoor functions; }
}

@ARTICLE{Ben-AmramGa92,
  author = {Amir M. Ben-Amram and Zvi Galil},
  title = {On Pointers versus Addresses},
  journal = jacm,
  year = {1992},
  volume = {39},
  pages = {617-648},
  number = {3},
  month = jul,
  keywords = {Theory of Computation; Algorithms; Theory; incompressibility; random
	access memory; pointer structures; }
}

@ARTICLE{Ben-David95,
  author = {Arie Ben-David},
  title = {Monotonicity maintenance in information-theoretic machine learning
	algorithms},
  journal = {Machine Learning},
  year = {1995},
  volume = {19},
  pages = {29--43},
  number = {1},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Ben-DavidMa95,
  author = {Arie Ben-David and Janice Mandel},
  title = {(Research Note) Classification Accuracy: Machine Learning vs. Explicit
	Knowledge Acquisition},
  journal = {Machine Learning},
  year = {1995},
  volume = {18},
  pages = {109--114},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Ben-DavidMa95a,
  author = {Ben-David, A. and J. Mandel},
  title = {Classification Accuracy: {M}achin {L}earning vs. {E}xplicit {K}nowledge},
  journal = {Machine Learning},
  year = {1995},
  volume = {18},
  pages = {109--114},
  number = {1}
}

@ARTICLE{Ben-David98,
  author = {Shai Ben-David},
  title = {Can Finite Samples Detect Singularities of Real-Valued Functions?},
  journal = {Algorithmica},
  year = {1998},
  volume = {22},
  pages = {3--17},
  number = {1/2},
  comment = {first in 24th STOC '92}
}

@TECHREPORT{Ben-DavidBe91,
  author = {Ben-David, Shai and Gyora M. Benedek},
  title = {Measurability Constraints on PAC Learnability},
  institution = {Technion, Haifa},
  year = {1991},
  comment = {The year listed here may be incorrect.}
}

@TECHREPORT{Ben-DavidBe91a,
  author = {S. Ben-David and G. M. Benedek},
  title = {Measurability Constraints on {PAC} Learnability},
  institution = {Technion, Haifa},
  year = {1991},
  comment = {The year listed here may be incorrect.}
}

@INPROCEEDINGS{Ben-DavidBeMa89,
  author = {S. Ben-David and G. M. Benedek and Y. Mansour},
  title = {A parametrization scheme for classifying models of learnability},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1989},
  pages = {285--302},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{Ben-DavidBeMa89a,
  author = {Ben-David, Shai and Gyora M. Benedek and Yishay Mansour},
  title = {A Parametrization Scheme for Classifying Models of Learnability},
  booktitle = COLT,
  year = {1989},
  pages = {285--302},
  publisher = {Morgan Kaufmann},
  tag = {TOC-display}
}

@INPROCEEDINGS{Ben-DavidCeLo92,
  author = {S. Ben-David and N. Cesa-Bianchi and P. M. Long},
  title = {Characterizations of learnability for classes of $\{ 0,\dots ,n \}$-valued
	functions},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1992},
  pages = {333--340},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{Ben-DavidDi94,
  author = {S. Ben-David and E. Dichterman},
  title = {Learnability with restricted focus of attention guarantees noise-tolerance},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1994},
  pages = {248--259},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Ben-DavidDi93,
  author = {S. Ben-David and E. Dichterman},
  title = {Learning with restricted focus of attention},
  booktitle = COLT,
  year = {1993},
  pages = {287--296},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{Ben-DavidEiKu95,
  author = {Shai Ben-David and Nadav Eiron and Eyal Kushilevitz},
  title = {On self-directed learning},
  booktitle = COLT,
  year = {1995},
  pages = {136--143},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{Ben-DavidEiLo00,
  author = {Shai Ben-David and Nadav Eiron and Philip M. Long},
  title = {On the Difficulty of Approximately Maximizing Agreements},
  booktitle = COLT,
  year = {2000},
  pages = {266--274},
  publisher = {Morgan Kaufmann, San Francisco}
}

@INPROCEEDINGS{Ben-DavidEiSi00,
  author = {Shai Ben-David and Nadav Eiron and Hans Ulrich Simon},
  title = {The Complexity of Densest Region Detection},
  booktitle = COLT,
  year = {2000},
  pages = {255--265},
  publisher = {Morgan Kaufmann, San Francisco}
}

@INPROCEEDINGS{Ben-DavidGu95,
  author = {Shai Ben-David and Leonid Gurvits},
  title = {A note on {VC}-dimension and measure of sets of reals},
  booktitle = COLT,
  year = {1995},
  pages = {454--462},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{Ben-DavidItKu90,
  author = {S. Ben-David and A. Itai and E. Kushilevitz},
  title = {Learning by distances},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1990},
  pages = {232--245},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{Ben-DavidJa93,
  author = {S. Ben-David and M. Jacovi},
  title = {On learning in the limit and non-uniform $(\epsilon , \delta )$-
	learning},
  booktitle = COLT,
  year = {1993},
  pages = {209--217},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{Ben-DavidKuMa97,
  author = {Shai Ben-David and Eyal Kushilevitz and Yishay Mansour},
  title = {Online learning versus offline learning},
  journal = {Machine Learning},
  year = {1997},
  volume = {29},
  pages = {45--63},
  note = {Earlier version in EUROCOLT95},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Ben-DavidLi97,
  author = {Shai Ben-David and Michael Lindenbaum},
  title = {Learning Distributions by Their Density Levels: {A} Paradigm for
	Learning without a Teacher},
  journal = {J. Comput. Syst. Sci.},
  year = {1997},
  volume = {55},
  pages = {171--182},
  number = {1},
  note = {First appeared in EuroCOLT '95}
}

@INPROCEEDINGS{Ben-DavidLi93,
  author = {S. Ben-David and M. Lindenbaum},
  title = {Localization vs. identification of semi-algebraic sets},
  booktitle = COLT,
  year = {1993},
  pages = {327--336},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{BenDavidEiSi02,
  author = {S. Ben-David and N. Eiron U. H. Simon},
  title = {Limitations of Learning via Embeddings in Euclidean Half-Spaces},
  journal = {JMLR},
  year = {2002}
}

@ARTICLE{BCHL95,
  author = {S. {Ben-David} and N. {Cesa-Bianchi} and D. Haussler and P. Long},
  title = {Characterizations of Learnability for Classes of ${0,...,n}$- valued
	Functions},
  journal = JCSS,
  year = {1995},
  volume = {50},
  pages = {74--86},
  number = {1}
}

@BOOK{Bench-Capon90,
  title = {Knowledge Representation: An Approach to ArtificialIntelligence},
  publisher = {Academic Press},
  year = {1990},
  author = {Bench-Capon, T.J.M},
  comment = {Q336.B46}
}

@INPROCEEDINGS{BenderSl94,
  author = {Michael A. Bender and Donna K. Slonim},
  title = {The power of team exploration: two robots can learn unlabeled directed
	graphs},
  booktitle = FOCS,
  year = {1994},
  pages = {75--85},
  publisher = {IEEE Computer Society Press, Los Alamitos, CA}
}

@ARTICLE{BenedekIt91,
  author = {G. Benedek and A. Itai},
  title = {Learnability with respect to Fixed Distributions},
  journal = {Theoret. Comput. Sci.},
  year = {1991},
  volume = {86},
  pages = {377--389},
  number = {2},
  annote = {Was in COLT88 and was Technion-Israel Institute of Technology TR
	468 in 1987}
}

@UNPUBLISHED{Benedek88,
  author = {Benedek, Gyora M.},
  title = {Ph.D. dissertation, in preparation},
  note = {(To appear.)},
  year = {1988}
}

@INPROCEEDINGS{BenedekIt92,
  author = {G. M. Benedek and A. Itai},
  title = {Dominating distributions and learnability},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1992},
  pages = {253--264},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{BenedekIt88,
  author = {G. M. Benedek and A. Itai},
  title = {Learnability by fixed distributions},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1988},
  pages = {80--90},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{BenedekIt88a,
  author = {Benedek, Gyora M. and Alon Itai},
  title = {Nonuniform Learnability},
  booktitle = ICALP,
  year = {1988},
  pages = {82--92},
  month = Jul
}

@ARTICLE{BennettDe96,
  author = {Scott W. Bennett and Gerald F. DeJong},
  title = {Real-World Robotics: Learning to Plan for Robust Execution},
  journal = {Machine Learning},
  year = {1996},
  volume = {23},
  pages = {121--161},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{BVIG91,
  author = {Chakib Bennis and Jean-Marc V{\'e}zien and G{\'e}rard Igl{\'e}sias
	and Andr{\'e} Gagalowicz},
  title = {Piecewise surface flattening for non-distorted texture mapping},
  booktitle = {SIGGRAPH},
  year = {1991},
  editor = {Thomas W. Sederberg},
  volume = {25},
  pages = {237--246},
  url = {citeseer.nj.nec.com/bennis91piecewise.html}
}

@INPROCEEDINGS{BensleyHi09,
  author = {J. Bensley and A. Hickl},
  title = {Application of {LCC}'s {GROUNDHOG} {S}ystem for {RTE}-4},
  booktitle = TAC,
  year = {2009}
}

@INPROCEEDINGS{Hickl,
  author = {Jeremy Bensley and Andrew Hickl},
  title = {Application of {LCC}'s {GROUNDHOG} {S}ystem for {RTE}-4},
  booktitle = TAC,
  year = {2009}
}

@INPROCEEDINGS{Benson95,
  author = {Scott Benson},
  title = {Inductive learning of reactive action models},
  booktitle = ICML,
  year = {1995},
  pages = {47--54},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{BDDGM09,
  author = {L. Bentivogli and I. Dagan and H. T. Dang and D. Giampiccolo and
	B. Magnini},
  title = {The Fifth {PASCAL} Recognizing Textual Entailment Challenge},
  booktitle = TAC,
  year = {2009},
  pages = {14--24}
}

@ARTICLE{BKST78,
  author = {J. L. Bentley and H. T. Kung and M. Schkolnick and C. D. Thompson},
  title = {On the average number of maxima in a set of vectors and applications},
  journal = JACM,
  year = {1978},
  volume = {25},
  pages = {536--543}
}

@ARTICLE{BentleyOt79,
  author = {J. L. Bentley and T. A. Ottmann},
  title = {Algorithms for reporting and counting geometric intersections},
  journal = {IEEE Trans. Comput.},
  year = {1979},
  volume = {C-28},
  pages = {643--647},
  number = {9},
  month = sep
}

@ARTICLE{BentleySa80,
  author = {J. L. Bentley and J. B. Saxe},
  title = {Decomposable Searching Problems I: Static-to-Dynamic Transformation},
  journal = JALG,
  year = {1980},
  volume = {1},
  pages = {301-358},
  number = {4}
}

@INPROCEEDINGS{BBBKK97,
  author = {S. Berchtold and C. B{\"o}hm and B. Barunm{\"u}ller and D. A. Keim
	and H.-P. Kriegel},
  title = {Fast parallel similarity search in multimedia databases},
  booktitle = {SIGMOD},
  year = {1997},
  pages = {1--12}
}

@INPROCEEDINGS{BergBi95,
  author = {Jan van den Berg and Jan C. Bioch},
  title = {Some theorems concerning the free energy of (un)constrained stochastic
	{H}opfield neural networks},
  booktitle = EuroCOLT,
  year = {1995},
  pages = {298--312},
  publisher = {Springer-Verlag}
}

@ARTICLE{BBBRW98,
  author = {M. de Berg and P. Bose and D. Bremner and S. Ramaswami and G. Wilfong},
  title = {Computing Constrained Minimum-Width Annuli of Point Sets},
  journal = {Comput. Aided Design},
  year = {1998},
  volume = {30},
  pages = {267--275},
  number = {4}
}

@ARTICLE{BCDKT98,
  author = {M. de~Berg and Otfried Cheong and O. Devillers and M. van Kreveld
	and M. Teillaud},
  title = {Computing the Maximum Overlap of Two Convex Polygons Under Translations},
  journal = TCS,
  year = {1998},
  volume = {31},
  pages = {613--628},
  url = {http://link.springer-ny.com/link/service/journals/00224/bibs/31n5p613.html}
}

@ARTICLE{BergDoSc95,
  author = {M. de Berg and K. Dobrindt and O. Schwarzkopf},
  title = {On lazy randomized incremental construction},
  journal = DCG,
  year = {1995},
  volume = {14},
  pages = {261--286},
  url = {http://www.inria.fr/rrrt/rr-2262.html}
}

@INPROCEEDINGS{BKSV97,
  author = {M. de Berg and M. J. Katz and A. F. van der Stappen and J. Vleugels},
  title = {Realistic Input Models for Geometric Algorithms},
  booktitle = {SOCG},
  year = {1997},
  pages = {294--303}
}

@BOOK{BKOS00,
  title = {Computational Geometry: Algorithms and Applications},
  publisher = {Springer-Verlag},
  year = {2000},
  author = {M. de Berg and M. van Kreveld and M. H. Overmars and O. Schwarzkopf},
  edition = {2nd},
  url = {http://www.cs.uu.nl/geobook/}
}

@ARTICLE{BergOvSc94,
  author = {M. de Berg and M. H. Overmars and O. Schwarzkopf},
  title = {Computing and verifying depth orders},
  journal = SICOMP,
  year = {1994},
  volume = {23},
  pages = {437--446}
}

@ARTICLE{BergSc95,
  author = {M. de Berg and O. Schwarzkopf},
  title = {Cuttings and applications},
  journal = IJCGA,
  year = {1995},
  volume = {5},
  pages = {343--355},
  annote = {267},
  keywords = {cuttings, random sampling, segment intersection counting, Hopcroft's
	problem, point location}
}

@INPROCEEDINGS{BBTV97,
  author = {Francesco Bergadano and Nader H. Bshouty and Christino Tamon and
	Stefano Varricchio},
  title = {On learning branching programs and small depth circuits},
  booktitle = EuroCOLT,
  year = {1997},
  pages = {150--161},
  publisher = {Springer-Verlag}
}

@BOOK{BergadanoGu96,
  title = {Inductive Logic Programming},
  publisher = {MIT Press},
  year = {1996},
  author = {F. Bergadano and D. Gunetti}
}

@ARTICLE{BMMZ92,
  author = {F. Bergadano and S. Matwin and R. S. Michalski and J. Zhang},
  title = {Learning Two-Tiered Descriptions of Flexible Concepts: The {POSEIDON}
	System},
  journal = {Machine Learning},
  year = {1992},
  volume = {8},
  pages = {5--43},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{BergadanoSa89,
  author = {F. Bergadano and L. Saitta},
  title = {On the error probabilty of boolean concept descriptions},
  booktitle = {European Working Session on Learning},
  year = {1989},
  pages = {25--35}
}

@ARTICLE{BergadanoVa96,
  author = {Francesco Bergadano and Stefano Varricchio},
  title = {Learning Behaviors of Automata from Multiplicity and Equivalence
	Queries},
  journal = {{SIAM} J. Comput.},
  year = {1996},
  volume = {25},
  pages = {1268--1280},
  number = {6}
}

@INPROCEEDINGS{BergadanoVa95,
  author = {F. Bergadano and S. Varricchio},
  title = {Learning behaviors of automata from shortest counterexamples},
  booktitle = EuroCOLT,
  year = {1995},
  pages = {380--391},
  publisher = {Springer-Verlag}
}

@BOOK{Berge89,
  title = {Hypergraphs},
  publisher = {North Holland},
  year = {1989},
  author = {C. Berge},
  address = {Amsterdam}
}

@INPROCEEDINGS{BergerLa99,
  author = {A. Berger and J. Lafferty},
  title = {Information {R}etrieval as {S}tatistical {T}ranslation},
  booktitle = SIGIR,
  year = {1999},
  pages = {222--229}
}

@INPROCEEDINGS{IRtranslate,
  author = {Adam Berger and John Lafferty},
  title = {Information {R}etrieval as {S}tatistical {T}ranslation},
  booktitle = SIGIR,
  year = {1999},
  pages = {222--229}
}

@INPROCEEDINGS{BergerPr98,
  author = {A. Berger and H. Printz},
  title = {Recognition performance of a large-scale dependency-grammar language
	model},
  booktitle = {International Conference on Spoken Language Processing (ICSLP'98)},
  year = {1998},
  address = {Sydney, Australia}
}

@ARTICLE{BergerDpDp96,
  author = {Adam L. Berger and Stephen A. Della Pietra and Vincent J. Della Pietra},
  title = {A Maximum Entropy Approach to Natural Language Processing},
  journal = {Computational Linguistics},
  year = {1996},
  volume = {22(1)},
  pages = {39-71}
}

@ARTICLE{BergerPiPi96,
  author = {Adam L. Berger and Stephen A. Della Pietra and Vincent J. Della Pietra},
  title = {A Maximum Entropy Approach to Natural Language Processing},
  journal = {Computational Linguistics},
  year = {1996},
  volume = {22(1)},
  pages = {39-71}
}

@ARTICLE{Berger91,
  author = {Bonnie Berger and John Rompel},
  title = {Simulating ($\log^{c}n$)-Wise Independence in {NC}},
  journal = jacm,
  year = {1991},
  volume = {38},
  pages = {1026-1046},
  number = {4},
  month = oct,
  keywords = {Theory of Computation; Algorithms; Theory; discrepancy; removing randomness;}
}

@INPROCEEDINGS{BergerRoSh89,
  author = {B. Berger and J. Rompel and P. W. Shor},
  title = {Efficient {NC} algorithms for set cover with applications to learning
	and geometry},
  booktitle = FOCS,
  year = {1989},
  pages = {54--59},
  publisher = {IEEE Computer Society Press, Los Alamitos, CA}
}

@ARTICLE{BergerPa78,
  author = {J. Berger and C. Pair},
  title = {Inference for Regular Bilanguages},
  journal = {J. of Comput. Syst. Sci.},
  year = {1978},
  volume = {16},
  pages = {100--122}
}

@INPROCEEDINGS{Berggren93,
  author = {U. Berggren},
  title = {Linear time deterministic learning of $k$-term {DNF}},
  booktitle = COLT,
  year = {1993},
  pages = {37--40},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{BergsmaKo07,
  author = {Bergsma, S. and Kondrak, G.},
  title = {Alignment-Based Discriminative String Similarity},
  booktitle = ACL,
  year = {2007},
  pages = {656--663},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1083}
}

@INPROCEEDINGS{BergsmaWa07,
  author = {Bergsma, Shane and Wang, Qin Iris},
  title = {Learning Noun Phrase Query Segmentation},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {819--826},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1086}
}

@ARTICLE{Bergstra90,
  author = {J. A. Bergstra and J. Heering and P. Klint},
  title = {Module Algebra},
  journal = jacm,
  year = {1990},
  volume = {37},
  pages = {335-372},
  number = {2},
  month = apr,
  keywords = {Programming Languages and Methodology; Languages; Theory; abstraction;
	algebraic specification module; Craig interpolation lemma; export;
	first-order specification module; information hiding; module algebra;
	module composition; module expression; renaming; signature; signature
	expression; union of modules; visible signature; }
}

@TECHREPORT{BerlinerGo84,
  author = {Berliner, Hans and Gordon Goetsch},
  title = {A Quantitative Study of Search Methods and the Effect of Constraint
	Satisfaction},
  institution = {CMU Computer Science Department},
  year = {1984},
  number = {CMU-CS-84-147},
  month = Jul,
  comment = {Empirical comparative study of search heuristics for Superpuzz, a
	card solitaire game.}
}

@INPROCEEDINGS{BermanRo87,
  author = {P. Berman and R. Roos},
  title = {Learning one-counter languages in polynomial time},
  booktitle = FOCS,
  year = {1987},
  pages = {61--67},
  publisher = {IEEE Computer Society Press, Los Alamitos, CA}
}

@INCOLLECTION{BernEp97,
  author = {M. Bern and D. Eppstein},
  title = {Approximation algorithms for geometric problems},
  booktitle = {Approximationg Algorithms for {NP}-Hard Problems},
  publisher = {PWS Publishing Company},
  year = {1997},
  editor = {D. S. Hochbaum},
  pages = {296--345}
}

@ARTICLE{BernEpGi94,
  author = {M. Bern and D. Eppstein and J. Gilbert},
  title = {Provably good mesh generation},
  journal = {J. Comput. Syst. Sci.},
  year = {1994},
  volume = {48},
  pages = {384--409}
}

@INPROCEEDINGS{Bernstein92,
  author = {E. J. Bernstein},
  title = {Absolute error bounds for learning linear functions online},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1992},
  pages = {160--163},
  publisher = {ACM Press, New York, NY}
}

@BOOK{BerryFr85,
  title = {Bandit Problems--Sequential Allocation of Experiments},
  publisher = {Chapman and Hall},
  year = {1985},
  author = {D. A. Berry and B. Fristedt},
  address = {New York}
}

@INPROCEEDINGS{BCMP92,
  author = {A. Bertoni and P. Campadelli and A. Morpurgo and S. Panizza},
  title = {Polynomial uniform convergence and polynomial-sample learnability},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1992},
  pages = {265--271},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{BertsimasGaTs99,
  author = {Dimitris Bertsimas and David Gamarnik and John N. Tsitsiklis},
  title = {Estimation of Time-Varying Parameters in Statistical Models: {A}n
	Optimization Approach},
  journal = {Machine Learning},
  year = {1999},
  volume = {35},
  pages = {225--245},
  number = {3},
  comment = {first in 10th COLT '97},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{Berwick86,
  author = {R. Berwick},
  title = {Learning from positive-only examples},
  booktitle = {Machine Learning},
  year = {1986},
  pages = {625--645},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{Berwick87,
  author = {Berwick, Robert C.},
  title = {Language Learning by Automata Induction},
  journal = {Machine Learning},
  year = {1987},
  volume = {2},
  pages = {9--38},
  month = {Jul 3},
  tag = {TOC-display}
}

@ARTICLE{BerwickPi87,
  author = {Robert C. Berwick and Sam Pilato},
  title = {Learning Syntax by Automata Induction},
  journal = {Machine Learning},
  year = {1987},
  volume = {2},
  pages = {9--38},
  publisher = {Kluwer Academic Publishers, Boston}
}

@UNPUBLISHED{BBKS01,
  author = {S. Bespamyatnikh and B. Bhattacharya and D. Kirkpatrick and M. Segal},
  title = {Mobile Facility Location},
  note = {appeared in Dial M for mibility},
  year = {2001},
  annote = {{613}}
}

@INPROCEEDINGS{BespamyatnikhSe97,
  author = {S. Bespamyatnikh and M. Segal},
  title = {Covering a set of points by two axis-parallel boxes},
  booktitle = {CCCG},
  year = {1997},
  pages = {33--38}
}

@UNPUBLISHED{Bespamyatnikh01,
  author = {S. N. Bespamyatnikh},
  title = {An optimal morphing between polylines},
  note = {Submitted to IJCGA},
  year = {2001}
}

@INPROCEEDINGS{Bespamyatnikh98,
  author = {S. N. Bespamyatnikh},
  title = {An efficient algorithm for the three-dimensional diameter problem},
  booktitle = SODA,
  year = {1998},
  pages = {136--147}
}

@MASTERSTHESIS{Betke92,
  author = {Margrit Betke},
  title = {Algorithms for Exploring an Unknown Graph},
  school = {MIT Department of Electrical Engineering and Computer Science},
  year = {1992},
  month = Feb,
  note = {(Published as MIT Laboratory for Computer Science Technical Report
	MIT/LCS/TR-536 (March, 1992))}
}

@ARTICLE{BetkeRiSi95,
  author = {Margrit Betke and Ronald L. Rivest and Mona Singh},
  title = {Piecemeal learning of an unknown environment},
  journal = {Machine Learning},
  year = {1995},
  volume = {18},
  pages = {231--254},
  number = {2/3},
  annote = {Earlier version appeared in 6th COLT, 1993},
  publisher = {Kluwer Academic Publishers, Boston}
}

@BOOK{Bezdek92,
  title = {Fuzzy models for pattern recognition},
  publisher = {IEEE Press},
  year = {1992},
  author = {J. C. Bezdek},
  address = {Washington, DC}
}

@INPROCEEDINGS{BhagatPaHo07,
  author = {Bhagat, Rahul and Pantel, Patrick and Hovy, Eduard},
  title = {{LEDIR}: An Unsupervised Algorithm for Learning Directionality of
	Inference Rules},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {161--170},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1017}
}

@INBOOK{BhansaliHa97,
  chapter = {17},
  pages = {303--321},
  title = {What makes derivational analogy work: an experience report using
	{APU}},
  publisher = {MIT Press},
  year = {1997},
  author = {Sanjay Bhansali and Mehdi T. Harandi},
  volume = {IV: Making Learning Systems Practical},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@ARTICLE{BhansaliHa93,
  author = {Sanjay Bhansali and Mehdi T. Harandi},
  title = {Synthesis of {UNIX} Programs Using Derivational Analogy},
  journal = {Machine Learning},
  year = {1993},
  volume = {10},
  pages = {7--55},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{BhatnagarMo94,
  author = {Neeraj Bhatnagar and Jack Mostow},
  title = {On-line learning from search failures},
  journal = {Machine Learning},
  year = {1994},
  volume = {15},
  pages = {69--117},
  number = {1},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{BhattacharyaBhCh07,
  author = {S. Bhattacharya and C. Bhattacharyya and N. Chandra},
  title = {Structural alignment based kernels for protein structure classification},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {73--80},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{BibelTh94,
  author = {W. Bibel and M. Thielscher},
  title = {Deductive plan generation},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1994},
  pages = {2--5},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Bick07,
  author = {Bick, Eckhard},
  title = {Hybrid Ways to Improve Domain Independence in an {ML} Dependency
	Parser},
  booktitle = {CoNLL Shared Task Session of EMNLP-CoNLL},
  year = {2007},
  pages = {1119--1123},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1120}
}

@INPROCEEDINGS{BickelBrSc07,
  author = {S. Bickel and M. Br\"{u}eckner and T. Scheffer},
  title = {Discriminative learning for differing training and test distributions},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {81--88},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{BidyukDe06,
  author = {Bozhena Bidyuk and Rina Dechter},
  title = {An Anytime Scheme for Bounding Posterior Beliefs},
  booktitle = AAAI,
  year = {2006}
}

@ARTICLE{Biermann78,
  author = {A. W. Biermann},
  title = {The inference of regular {LISP} programs from examples},
  journal = {IEEE Trans. on Systems, Man, and Cybernetics},
  year = {1978},
  volume = {SMC-8},
  pages = {585--600}
}

@ARTICLE{Biermann72,
  author = {A. W. Biermann},
  title = {On the inference of Turing machines from sample computations},
  journal = {Art. Int.},
  year = {1972},
  volume = {3},
  pages = {181--198},
  annote = {Was Stanford University TR-241 in 1971}
}

@ARTICLE{BiermannBaPe75,
  author = {A. W. Biermann and R. I. Baum and F. E. Petry},
  title = {Speeding up the synthesis of programs from traces},
  journal = {IEEE Trans. on Computers},
  year = {1975},
  volume = {C-24},
  pages = {122--136}
}

@ARTICLE{BiermannFe72,
  author = {A. W. Biermann and J. Feldman},
  title = {On the Synthesis of Finite-State Machines from Samples of Their Behavior},
  journal = {IEEE Trans. Computers},
  year = {1972},
  volume = {21},
  pages = {592--597}
}

@INCOLLECTION{BiermannFe72a,
  author = {A. W. Biermann and J. A. Feldman},
  title = {A survey of results in grammatical inference},
  booktitle = {Frontiers of Pattern Recognition},
  publisher = {Academic Press, N. Y.},
  year = {1972},
  editor = {S. Watanabe},
  pages = {31--54}
}

@ARTICLE{BiermannKr76,
  author = {A. W. Biermann and R. Krishnaswamy},
  title = {Constructing programs from example computations},
  journal = {IEEE Trans. on Software Engineering},
  year = {1976},
  volume = {SE-2},
  pages = {141--153}
}

@INPROCEEDINGS{BiermannSm77,
  author = {A. W. Biermann and D. R. Smith},
  title = {The hierarchical synthesis of {LISP} scanning functions},
  booktitle = {Information Processing},
  year = {1977},
  pages = {41--45},
  publisher = {North-Holland, Amsterdam}
}

@ARTICLE{BFRS85,
  author = {Axel Biewer and Christian Feneyrol and Johannea Ritzke and Erwin
	Stegentritt},
  title = {ASCOF -- A modular multilevel system for French-German translation},
  journal = CL,
  year = {1985},
  volume = {11},
  number = {2--3}
}

@ARTICLE{Biewer85,
  author = {Axel Biewer and Christian Feneyrol and Johannea Ritzke and Erwin
	Stegentritt},
  title = {ASCOF -- A modular multilevel system for French-German translation},
  journal = CL,
  year = {1985},
  volume = {11},
  number = {2--3}
}

@ARTICLE{Bikel04,
  author = {D. Bikel},
  title = {Intricacies of {Collins'} Parsing Model},
  journal = {Computational Linguistics},
  year = {2004},
  volume = {30},
  pages = {479--511},
  number = {4},
  month = Dec
}

@ARTICLE{BikelScWe99,
  author = {Daniel M. Bikel and Richard Schwartz and Ralph M. Weischedel},
  title = {An Algorithm that Learns What's in a Name},
  journal = {Machine Learning},
  year = {1999},
  volume = {34},
  pages = {211--231},
  number = {1-3},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Bilardi89,
  author = {G. Bilardi and F. P. Preparata},
  title = {Size-Time Complexity of Boolean Networks for Prefix Computations},
  journal = jacm,
  year = {1989},
  volume = {36},
  pages = {362-382},
  number = {2},
  month = apr,
  keywords = {Theory of Computation; Algorithms; Theory; Boolean networks; parallel
	computation; prefix computation; semigroups; size-time trade-offs;}
}

@BOOK{Billingsley86,
  title = {Probability and Measure},
  publisher = {Wiley},
  year = {1986},
  author = {Patrick Billingsley},
  address = {New York, NY},
  note = {Second Edition}
}

@ARTICLE{Billionnet92,
  author = {A. Billionnet and M. C. Costa and A. Sutter},
  title = {An Efficient Algorithm for a Task Allocation Problem},
  journal = jacm,
  year = {1992},
  volume = {39},
  pages = {502-518},
  number = {3},
  month = jul,
  keywords = {Operations Research; Algorithms; Design; Measurement; Performance;
	branch-and-bound algorithm; interprocessor communication; Lagrangian
	relaxation; quadratic 0-1 optimization; task allocation; }
}

@INPROCEEDINGS{BillsusPa98,
  author = {Daniel Billsus and Michael J. Pazzani},
  title = {Learning collaborative information filters},
  booktitle = ICML,
  year = {1998},
  pages = {46--54},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@MISC{Bilmes98,
  author = {Jeff A. Bilmes},
  title = {A Gentle Tutorial of the EM Algorithm and its Application to Parameter
	Estimation for Gaussian Mixture and Hidden Markov Models},
  year = {1998}
}

@ARTICLE{BKRK97,
  author = {John Binder and Daphne Koller and Stuart Russell and Keiji Kanazawa},
  title = {Adaptive probabilistic networks with hidden variables},
  journal = {Machine Learning},
  year = {1997},
  volume = {29},
  pages = {213--244},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{BirgeMa93,
  author = {L. Birge and P. Massart},
  title = {Rates of convergence for minimum contrast estimators},
  journal = {Probability Theory and Related Fields},
  year = {1993},
  volume = {97},
  pages = {113--150}
}

@INPROCEEDINGS{Birkendorf97,
  author = {Andreas Birkendorf},
  title = {On fast and simple algorithms for finding maximal subarrays and applications
	in learning theory},
  booktitle = EuroCOLT,
  year = {1997},
  pages = {198--209},
  publisher = {Springer-Verlag}
}

@ARTICLE{BDJKS98,
  author = {Andreas Birkendorf and Eli Dichterman and Jeffrey Jackson and Norbert
	Klasner and Hans Ulrich Simon},
  title = {On restricted-focus-of-attention learnability of {B}oolean functions},
  journal = {Machine Learning},
  year = {1998},
  volume = {30},
  pages = {89--123},
  note = {Earlier version in COLT '96},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{BKKS00,
  author = {Andreas Birkendorf and Norbert Klasner and Christian Kuhlmann and
	Hans Ulrich Simon},
  title = {Structural Results about Exact Learning with Unspecified Attribute
	Values},
  journal = {J. of Comput. Syst. Sci.},
  year = {2000},
  volume = {60},
  pages = {258--277},
  number = {2},
  note = {Special Issue for COLT '98}
}

@ARTICLE{BirkendorfSi98,
  author = {Andreas Birkendorf and Hans-Ulrich Simon},
  title = {Using Computational Learning Strategies as a Tool for Combinatorial
	Optimization},
  journal = {Annals of Mathematics and Artificial Intelligence},
  year = {1998},
  volume = {22},
  pages = {237--257},
  number = {3/4}
}

@ARTICLE{Birnbaum91,
  author = {Birnbaum, L.},
  title = {Response to Nilsson's "Logic and Artificial Intelligence"},
  journal = {Artificial Intelligence},
  year = {1991},
  volume = {47},
  pages = {57-79}
}

@BOOK{Bishop96,
  title = {Neural networks for pattern recognition},
  publisher = {Oxford University Press},
  year = {1996},
  author = {C. M. Bishop},
  address = {Oxford, UK},
  isbn = {0-19-853849-9},
  timestamp = {2007.01.26}
}

@INPROCEEDINGS{BJLMMR93,
  author = {Ezra Black and Fred Jelinek and John Lafferty and David Magerman
	and Robert Mercer and Salim Roukos},
  title = {Towards history-based grammars: using richer models for probabilistic
	parsing},
  booktitle = ACL,
  year = {1993},
  pages = {31--37}
}

@INPROCEEDINGS{Black93,
  author = {Ezra Black and Fred Jelinek and John Lafferty and David Magerman
	and Robert Mercer and Salim Roukos},
  title = {Towards history-based grammars: using richer models for probabilistic
	parsing},
  booktitle = ACL,
  year = {1993},
  pages = {31--37}
}

@INPROCEEDINGS{BJLMR92,
  author = {Ezra Black and Fred Jelinek and John Lafferty and Robert Mercer and
	Salim Roukos},
  title = {Decision tree models applied to the labeling of text with parts-of-speech},
  booktitle = DARPA,
  year = {1992}
}

@INPROCEEDINGS{Black92,
  author = {Ezra Black and Fred Jelinek and John Lafferty and Robert Mercer and
	Salim Roukos},
  title = {Decision tree models applied to the labeling of text with parts-of-speech},
  booktitle = DARPA,
  year = {1992}
}

@INPROCEEDINGS{BlackmoreMi95,
  author = {Justine Blackmore and Risto Miikkulainen},
  title = {Visualizing high-dimensional structure with the incremental grid-growing
	neural network},
  booktitle = ICML,
  year = {1995},
  pages = {55--63},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{BWMS95,
  author = {Kim L. Blackmore and Robert C. Williamson and Iven M. Y. Mareels
	and William A. Sethares},
  title = {Online learning via congregational gradient descent},
  booktitle = COLT,
  year = {1995},
  pages = {265--272},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{BlanzieriKa96,
  author = {E. Blanzieri and P. Katenkamp},
  title = {Learning radial basis function networks on-line},
  booktitle = ICML,
  year = {1996},
  pages = {37--45},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{BlanzieriRi99,
  author = {Enrico Blanzieri and Francesco Ricci},
  title = {A minimum risk metric for nearest neighbor classification},
  booktitle = ICML,
  year = {1999},
  pages = {22--31},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INCOLLECTION{BleiLa09a,
  author = {D. Blei and J. Lafferty},
  title = {Topic Models},
  booktitle = {Text Mining: Theory and Applications},
  publisher = {Taylor and Francis},
  year = {2009},
  editor = {A. Srivastava and M. Sahami}
}

@INPROCEEDINGS{BleiLa09,
  author = {D. Blei and J. Lafferty},
  title = {Visualizing Topics with Multi-Word Expressions},
  booktitle = {http://arxiv.org/abs/0907.1013},
  year = {2009}
}

@INPROCEEDINGS{BleiMo01,
  author = {D. Blei and P. Moreno},
  title = {Topic segmentation with an aspect hidden Markov model},
  booktitle = ACM-SIGIR,
  year = {2001}
}

@ARTICLE{BleiNgJo03,
  author = {D. Blei and A. Ng and M. Jordan},
  title = {Latent Dirichlet Allocation},
  journal = JMLR,
  year = {2003}
}

@INPROCEEDINGS{BlitzerDrPe07,
  author = {Blitzer, John and Dredze, Mark and Pereira, Fernando},
  title = {Biographies, Bollywood, Boom-boxes and Blenders: Domain Adaptation
	for Sentiment Classification},
  booktitle = ACL,
  year = {2007},
  pages = {440--447},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1056}
}

@INPROCEEDINGS{BlitzerMcPe06,
  author = {John Blitzer and Ryan McDonald and Fernando Pereira},
  title = {Domain Adaptation with Structural Correspondence Learning},
  booktitle = SIGDAT,
  year = {2006},
  address = {Sydney, Australia}
}

@INPROCEEDINGS{BlockeelRaRa98,
  author = {Hendrik Blockeel and Luc De Raedt and Jan Ramon},
  title = {Top-down induction of clustering trees},
  booktitle = ICML,
  year = {1998},
  pages = {55--63},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@ARTICLE{Bloom,
  author = {Burton H. Bloom},
  title = {Space/{T}ime trade-offs in {H}ash {C}oding with allowable errors},
  journal = {Communications of the ACM},
  year = {1970},
  volume = {13},
  pages = {422--426},
  number = {7}
}

@ARTICLE{Bloom70,
  author = {B. H. Bloom},
  title = {Space/{T}ime trade-offs in {H}ash {C}oding with allowable errors},
  journal = {Communications of the ACM},
  year = {1970},
  volume = {13},
  pages = {422--426},
  number = {7}
}

@ARTICLE{Bloom91,
  author = {Stephen L. Bloom and Zolt{\'a}n {\'E}sik},
  title = {{F}loyd-{H}oare Logic in Iteration Theories},
  journal = jacm,
  year = {1991},
  volume = {38},
  pages = {887-934},
  number = {4},
  month = oct,
  keywords = {Logic; Algorithms; Theory; correction assertions; Hoare logic; }
}

@ARTICLE{Blum97,
  author = {Avrim Blum},
  title = {Empirical Support for Winnow and Weighted-Majority Algorithms: Results
	on a Calendar Scheduling Domain},
  journal = {Machine Learning},
  year = {1997},
  volume = {26},
  pages = {5--23},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{Blum95,
  author = {A. Blum},
  title = {Empirical support for {W}innow and weighted-majority based algorithms:
	results on a calendar scheduling domain},
  booktitle = ICML,
  year = {1995},
  pages = {64--72},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{Blum92,
  author = {Blum, A.},
  title = {Learning {B}oolean Functions in an Infinite Attribute Space},
  journal = {Machine Learning},
  year = {1992},
  volume = {9},
  pages = {373--386},
  number = {4}
}

@INPROCEEDINGS{Blum90,
  author = {Blum, A.},
  title = {Learning Boolean Functions in an Infinite Attribute Space},
  booktitle = STOC,
  year = {1990},
  address = {Baltimore, Maryland},
  month = May,
  tag = {TOC-display}
}

@INPROCEEDINGS{Blum90a,
  author = {Blum, A.},
  title = {Separating {PAC} and Mistake-Bound Learning Models over the {B}oolean
	Domain},
  booktitle = COLT,
  year = {1990},
  publisher = {Morgan Kaufmann},
  note = {To appear in 1990 COLT proceding},
  tag = {TOC-display}
}

@ARTICLE{Blum90b,
  author = {A. Blum},
  title = {Separating {PAC} and Mistake-Bound Learning Models over the Boolean
	Domain},
  journal = {Proc. 31th Annu. IEEE Sympos. Found. Comput. Sci.},
  year = {1990}
}

@INPROCEEDINGS{Blum90c,
  author = {Blum, A.},
  title = {Separating Distribution-Free and Mistake-Bound Learning Modelsover
	the {B}oolean Domain},
  booktitle = FOCS,
  year = {1990},
  volume = {I},
  pages = {211-218},
  publisher = {IEEE},
  tag = {TOC-display}
}

@MASTERSTHESIS{Blum89,
  author = {Blum, A.},
  title = {On the Computational Complexity of Training Simple Neural Networks},
  school = {MIT Department of Electrical Engineering and Computer Science},
  year = {1989},
  month = May,
  note = {(Published as Laboratory for Computer Science Technical Report MIT/LCS/TR-445
	(May, 1989))}
}

@ARTICLE{BlumBu00,
  author = {Avrim Blum and Carl Burch},
  title = {On-line Learning and the Metrical Task System Problem},
  journal = {Machine Learning},
  year = {2000},
  volume = {39},
  pages = {35--58},
  number = {1},
  comment = {first in 10th COLT '97},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{BlumCh93,
  author = {A. Blum and P. Chalasani},
  title = {An on-line algorithm for improving performance in navigation.},
  booktitle = FOCS,
  year = {1993},
  pages = {2--11},
  publisher = {IEEE Computer Society Press, Los Alamitos, CA}
}

@INPROCEEDINGS{BlumCh92,
  author = {A. Blum and P. Chalasani},
  title = {Learning switching concepts},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1992},
  pages = {231--242},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{BCGS95,
  author = {Avrim Blum and Prasad Chalasani and Sally A. Goldman and Donna K.
	Slonim},
  title = {Learning with unreliable boundary queries},
  booktitle = COLT,
  year = {1995},
  pages = {98--107},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{BlumChJa93,
  author = {A. Blum and P. Chalasani and J. Jackson},
  title = {On learning embedded symmetric concepts},
  booktitle = COLT,
  year = {1993},
  pages = {337--346},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{BFKV98,
  author = {Avrim Blum and Alan M. Frieze and Ravi Kannan and Santosh Vempala},
  title = {A Polynomial-Time Algorithm for Learning Noisy Linear Threshold Functions},
  journal = {Algorithmica},
  year = {1998},
  volume = {22},
  pages = {35--52},
  number = {1/2}
}

@INPROCEEDINGS{BFJKMR94,
  author = {A. Blum and M. Furst and J. Jackson and M. Kearns and Y. Mansour
	and S. Rudich},
  title = {Weakly Learning {DNF} and Characterizing Statistical Query Learning
	Using Fourier Analysis},
  booktitle = STOC,
  year = {1994}
}

@ARTICLE{BlumHeLi95,
  author = {Avrim Blum and Lisa Hellerstein and Nick Littlestone},
  title = {Learning in the presence of finitely or infinitely many irrelevant
	attributes},
  journal = {J. of Comput. Syst. Sci.},
  year = {1995},
  volume = {50},
  pages = {32--40},
  number = {1},
  note = {Earlier version in 4th COLT, 1991}
}

@INPROCEEDINGS{BlumHeLi91,
  author = {Blum, A. and L. Hellerstein and N. Littlestone},
  title = {Learning in the Presence of Finitely or Infinitely Many Irrelevant
	Attribute},
  booktitle = COLT,
  year = {1991},
  pages = {155--166}
}

@ARTICLE{BlumKa99,
  author = {Avrim Blum and Adam Kalai},
  title = {Universal Portfolios With and Without Transaction Costs},
  journal = {Machine Learning},
  year = {1999},
  volume = {35},
  pages = {193--205},
  number = {3},
  comment = {first in 10th COLT '97},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{BlumKa98,
  author = {Avrim Blum and Adam Kalai},
  title = {A note on learning from multiple-instance examples},
  journal = {Machine Learning},
  year = {1998},
  volume = {30},
  pages = {23--29},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{BlumKaLa99,
  author = {Avrim Blum and Adam Kalai and John Langford},
  title = {Beating the hold-out: bounds for k-fold and progressive cross-validation},
  booktitle = COLT,
  year = {1999},
  pages = {203--208},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{BlumKa97,
  author = {Avrim Blum and Ravidran Kannan},
  title = {Learning an Intersection of a Constant Number of Halfspaces over
	a Uniform Distribution},
  journal = {J. Comput. Syst. Sci.},
  year = {1997},
  volume = {54},
  pages = {371--380},
  number = {2},
  note = {First appeared in FOCS '93}
}

@INPROCEEDINGS{BlumMi98,
  author = {A. Blum and T. Mitchell},
  title = {Combining Labeled and Unlabeled Data with Co-training},
  booktitle = COLT,
  year = {1998},
  pages = {92--100}
}

@INPROCEEDINGS{BlumRaSc91,
  author = {Blum, A. and Raghavan, Prabhakar and Schieber, Baruch},
  title = {Navigating in Unfamiliar Geometric Terrain},
  booktitle = STOC,
  year = {1991},
  pages = {494-504},
  publisher = {ACM}
}

@INCOLLECTION{BlumRi89,
  author = {Blum, A. and Ronald L. Rivest},
  title = {Training a 3-node neural net is {NP-Complete}},
  booktitle = NIPS,
  publisher = {Morgan Kaufmann},
  year = {1989},
  editor = {Daid S. Touretzky},
  pages = {494--501},
  tag = {TOC-display}
}

@ARTICLE{BlumRu95,
  author = {Avrim Blum and Stephen Rudich},
  title = {Fast learning of k-term {DNF} formulas with queries},
  journal = {J. of Comput. Syst. Sci.},
  year = {1995},
  volume = {51},
  pages = {367--373},
  number = {3}
}

@INPROCEEDINGS{BlumRu92,
  author = {Blum, A. and S. Rudich},
  title = {Fast Learning of $k$-term {DNF} Formulas with Queries},
  booktitle = STOC,
  year = {1992},
  pages = {382--389},
  publisher = {ACM}
}

@INPROCEEDINGS{BlumSi90,
  author = {Blum, A. and M. Singh},
  title = {Learning Functions of $k$ Terms},
  booktitle = COLT,
  year = {1990},
  pages = {144--153},
  publisher = {Morgan Kaufmann},
  tag = {TOC-display}
}

@ARTICLE{Blum89a,
  author = {E. K. Blum},
  title = {Approximation of Boolean functions by sigmoidal networks: Part {I}:
	{XOR} and other two-variable functions},
  journal = {Neural Computation},
  year = {1989},
  volume = {1},
  pages = {532--540},
  month = feb
}

@ARTICLE{BlumBl75,
  author = {Blum, Lenore and Manuel Blum},
  title = {Toward a Mathematical Theory of Inductive Inference},
  journal = InfCtrl,
  year = {1975},
  volume = {28},
  pages = {125--155},
  number = {2},
  month = Jun,
  comment = {Recursion-theoretic, a la Gold [Go67].}
}

@INPROCEEDINGS{Blum97a,
  author = {Manuel Blum},
  title = {Program Error Detection/Correction: {T}urning {PAC} Learning into
	{PERFECT} Learning},
  booktitle = ALT,
  year = {1997},
  volume = {1316},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {1--1},
  publisher = {Springer-Verlag}
}

@ARTICLE{BEHW89,
  author = {Anselm Blumer and Andrzej Ehrenfeucht and David Haussler and Manfred
	K. Warmuth},
  title = {Learnability and the {V}apnik-{C}hervonenkis Dimension},
  journal = jacm,
  year = {1989},
  volume = {36},
  pages = {929-965},
  number = {4},
  month = oct,
  keywords = {Theory of Computation; Algorithms; Theory; Verification; capacity;
	learnability theory; learning from examples; Occam's razor; PAC learning;
	sample complexity; Vapnik-Chervonenkis classes; Vapnik-Chervonenkis
	dimension; }
}

@ARTICLE{BEHW87,
  author = {A. Blumer and A. Ehrenfeucht and D. Haussler and M. K. Warmuth},
  title = {Occam's Razor},
  journal = {Inform. Proc. Lett.},
  year = {1987},
  volume = {24},
  pages = {377--380},
  month = apr,
  annote = {Was UCSC Computer Science Laboratory CRL-86-2},
  comment = {Defines `Occam-algorithm' which may produce a hypothesis of complexity
	$n^c m^\alpha$ for fixed $c$ and $\alpha < 1$, and shows that Occam-algorithms
	need only polynomially many samples.}
}

@INPROCEEDINGS{BEHW86,
  author = {Blumer, A. and A. Ehrenfeucht and D. Haussler and M. K. Warmuth},
  title = {Classifying Learnable Geometric Concepts with the {V}apnik-{C}hervonenkis
	Dimension},
  booktitle = STOC,
  year = {1986},
  pages = {273--282},
  address = {Berkeley, California},
  month = May,
  comment = {Shows equivalence between finite VC dimension and learnability of
	geometric concepts.}
}

@ARTICLE{BlumerLi89,
  author = {A. Blumer and N. Littlestone},
  title = {Learning Faster than Promised by the {V}apnik-{C}hervonenkis Dimension},
  journal = {Discrete Applied Mathematics},
  year = {1989},
  volume = {24},
  pages = {47--53},
  annote = {Was also in First Montreal Conference on Combinatorics and Computer
	Science, University of Montreal, 1987}
}

@ARTICLE{BoardPi89,
  author = {R. A. Board and L. Pitt},
  title = {Semi-Supervised Learning},
  journal = {Machine Learning},
  year = {1989},
  volume = {4},
  pages = {41--65},
  number = {1},
  annote = {Univ. of Illinois TR-87-1372 in 1987},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{BoardPi92,
  author = {R. Board and L. Pitt},
  title = {On the Necessity of {O}ccam Algorithms},
  journal = {Theoret. Comput. Sci.},
  year = {1992},
  volume = {100},
  pages = {157--184},
  annote = {Was Univ of Illinois at Urbana TR-89-1544 in 1989 and in STOC90}
}

@INPROCEEDINGS{Bod07,
  author = {Bod, Rens},
  title = {Is the End of Supervised Parsing in Sight?},
  booktitle = ACL,
  year = {2007},
  pages = {400--407},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1051}
}

@INPROCEEDINGS{Bod93,
  author = {Rens Bod},
  title = {Using annotated corpus as a stochastic grammar},
  booktitle = EACL,
  year = {1993}
}

@ARTICLE{BGKL90,
  author = {H.~L.~Bodlaender and P.~Gritzmann and V.~Klee and J. van Leeuwen},
  title = {The computational complexity of norm-maximization},
  journal = {Combinatorica},
  year = {1990},
  volume = {10},
  pages = {203--225}
}

@ARTICLE{BohanecBr94,
  author = {Marko Bohanec and Ivan Bratko},
  title = {Trading accuracy for simplicity in decision trees},
  journal = {Machine Learning},
  year = {1994},
  volume = {15},
  pages = {223--250},
  number = {3},
  publisher = {Kluwer Academic Publishers, Boston}
}

@UNPUBLISHED{BoissonnatMa01,
  author = {J.-D. Boissonnat and G. Malandain},
  title = {Computing the diameter of a point set},
  note = {submitted to SoCG 2001 applied track and rejected},
  year = {2001},
  annote = {{699}}
}

@BOOK{BoissonnatYv98,
  title = {Algorithmic Geometry},
  publisher = {Cambridge University Press},
  year = {1998},
  author = {J.-D. Boissonnat and M. Yvinec},
  address = {UK},
  note = {Translated by H. Br{\"o}nnimann},
  url = {http://www.inria.fr/prisme/personnel/yvinec/livre.html}
}

@INPROCEEDINGS{BoledaScBa07,
  author = {Boleda, Gemma and Schulte im Walde, Sabine and Badia, Toni},
  title = {Modelling Polysemy in Adjective Classes by Multi-Label Classification},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {171--180},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1018}
}

@INPROCEEDINGS{BEPST08,
  author = {Kurt Bollacker and Colin Evans and Praveen Paritosh and Tim Sturge
	and Jamie Taylor},
  title = {Freebase: A Collaboratively Created Graph Database for Structuring
	Human Knowledge},
  booktitle = {Proceedings of SIGMOD-08},
  year = {2008},
  pages = {1247--1250},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@INPROCEEDINGS{BollackerGh98,
  author = {Kurt D. Bollacker and Joydeep Ghosh},
  title = {A supra-classifier architecture for scalable knowledge reuse},
  booktitle = ICML,
  year = {1998},
  pages = {64--72},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@BOOK{Bollobas98,
  title = {Modern Graph Theory},
  publisher = {Springer-Verlag},
  year = {1998},
  author = {B. Bollobas}
}

@ARTICLE{Bollobas90,
  author = {B{\'e}la Bollob{\'a}s and Andrei Z. Broder and Istvan Simon},
  title = {The Cost Distribution of Clustering in Random Probing},
  journal = jacm,
  year = {1990},
  volume = {37},
  pages = {224-237},
  number = {2},
  month = apr,
  keywords = {Data Structure and Algorithms; Algorithms; Theory; clustering; hashing;
	open addressing; random probing; uniform hashing; }
}

@INPROCEEDINGS{Boneh95,
  author = {Dan Boneh},
  title = {Learning using group representations},
  booktitle = COLT,
  year = {1995},
  pages = {418--426},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{BonehLi93,
  author = {D. Boneh and R. Lipton},
  title = {Amplification of weak learning under the uniform distribution},
  booktitle = COLT,
  year = {1993},
  pages = {347--351},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{BonetGe98,
  author = {Blai Bonet and H{\'e}ctor Geffner},
  title = {Learning sorting and decision trees with {POMDP}s},
  booktitle = ICML,
  year = {1998},
  pages = {73--81},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@BOOK{Bongard70,
  title = {Pattern Recognition},
  publisher = {Spartan Books},
  year = {1970},
  author = {Bongard, M.}
}

@INPROCEEDINGS{Bonissone91,
  author = {Bonissone, P. Piero},
  title = {Approximate Reasoning Systems: A Personal Perspective},
  year = {1991},
  journal = {Proceedings of AAAI-91}
}

@INPROCEEDINGS{BontempiBiBe99,
  author = {Gianluca Bontempi and Mauro Birattari and Hugues Bersini},
  title = {Local learning for iterated time series prediction},
  booktitle = ICML,
  year = {1999},
  pages = {32--38},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@ARTICLE{Booker88,
  author = {Lashon B. Booker},
  title = {Classifier Systems that Learn Internal World Models},
  journal = {Machine Learning},
  year = {1988},
  volume = {3},
  pages = {161--192},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{BooseGa89,
  author = {John H. Boose and Brian R. Gaines},
  title = {Knowledge Acquisition for Knowledge-Based Systems: Notes on the State-of-the-Art},
  journal = {Machine Learning},
  year = {1989},
  volume = {4},
  pages = {377--394},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{BBGW07,
  author = {A. Bordes and L. Bottou and P. Gallinari and J. Weston},
  title = {Solving multiclass support vector machines with {LaRank}},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {89--96},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@ARTICLE{BorgidaPa94,
  author = {Alexander Borgida and Peter F. Patel-Schneider},
  title = {A Semantics and Complete Algorithm for Subsumption in the {CLASSIC}
	Description Logic},
  journal = {Journal of Artificial Intelligence Research},
  year = {1994},
  volume = {1},
  pages = {277-308}
}

@UNPUBLISHED{Borman2004a,
  author = {S. Borman},
  title = {The Expectation Maximization Algorithm -- A short tutorial},
  note = {Introduces the Expectation Maximization (EM) algorithm and fleshes
	out the basic mathematical results, inclusing a proof of convergence.
	The Generalized EM algorithm is also introduced.},
  month = Jul,
  year = {2004},
  key = {Expectation Maximization Algorithm, EM}
}

@ARTICLE{Borodin92,
  author = {Allan Borodin and Nathan Linial and Michael E. Saks},
  title = {An Optimal On-Line Algorithm for Metrical Task System},
  journal = jacm,
  year = {1992},
  volume = {39},
  pages = {745-763},
  number = {4},
  month = oct,
  keywords = {Analysis of Algorithms; Algorithms; Performance; Theory; competitive
	analysis; on-line algorithms; }
}

@INPROCEEDINGS{BorodinOsRa99,
  author = {A. Borodin and R. Ostrovsky and Y. Rabani},
  title = {Subquadratic Approximation Algorithms For clustering Problems in
	High Dimensional Spaces},
  booktitle = STOC,
  year = {1999},
  pages = {312--321}
}

@ARTICLE{BorosCrHa90,
  author = {E. Boros and Y. Crama and P. L. Hammer},
  title = {Polynomial-time inference of all valid implications for {H}orn and
	related formulae},
  journal = {Annals of Mathematics and Artificial Intelligence},
  year = {1990},
  volume = {1},
  pages = {21--32}
}

@INPROCEEDINGS{BorosIbMa97,
  author = {Endre Boros and Toshihide Ibaraki and Kazuhisa Makino},
  title = {Monotone extensions of {B}oolean data sets},
  booktitle = ALT,
  year = {1997},
  volume = {1316},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {161--175},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{BosMa06,
  author = {Johan Bos and Katja Markert},
  title = {When logical inference helps determining textual entailment (and
	when it doesn't)},
  booktitle = {PASCAL Challenges Workshop on Recognizing Textual Entailment},
  year = {2006}
}

@INPROCEEDINGS{BosMa05,
  author = {Johan Bos and Katja Markert},
  title = {When logical inference helps determining textual entailment (and
	when it doesn't)},
  booktitle = {PASCAL Challenges Workshop on Recognizing Textual Entailment},
  year = {2005}
}

@INPROCEEDINGS{Bosch99,
  author = {Antal van den Bosch},
  title = {Instance-family abstraction in memory-based language learning},
  booktitle = ICML,
  year = {1999},
  pages = {39--48},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{BoscheeWeZa05,
  author = {Elizabeth Boschee and Ralph Weischedel and Alex Zamanian},
  title = {Automatic Information Extraction},
  booktitle = {Proceedings of the International Conference on Intelligence Analysis},
  year = {2005},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@INPROCEEDINGS{BoserGuVa92,
  author = {B. E. Boser and I. M. Guyon and V. N. Vapnik},
  title = {A training algorithm for optimal margin classifiers},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1992},
  pages = {144--152},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{Bostrom96,
  author = {Henrik Bostr{\"o}m},
  title = {Theory-guided induction of logic programs by inference of regular
	languages},
  booktitle = ICML,
  year = {1996},
  pages = {46--53},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{BottaGiPi97,
  author = {M. Botta and A. Giordana and R. Piola},
  title = {{FONN}: Combining First Order Logic with Connectionist Learning},
  booktitle = {ICML97},
  year = {1997},
  pages = {46-56},
  publisher = MK
}

@ARTICLE{BottaPi00,
  author = {Marco Botta and Roberto Piola},
  title = {Refining Numerical Constants in First Order Logic Theories},
  journal = {Machine Learning},
  year = {2000},
  volume = {38},
  pages = {109--131},
  number = {1/2},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{BLGK07,
  author = {Bouchard, Alexandre and Liang, Percy and Griffiths, Thomas and Klein,
	Dan},
  title = {A Probabilistic Approach to Diachronic Phonology},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {887--896},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1093}
}

@UNPUBLISHED{Boucheron88,
  author = {St\'ephane Boucheron},
  title = {Learnability from positive examples in the {V}aliant framework},
  note = {Unpublished manuscript},
  year = {1988}
}

@INPROCEEDINGS{BoucheronSa88,
  author = {S. Boucheron and J. Sallantin},
  title = {Some remarks about space-complexity of learning, and circuit complexity
	of recognizing},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1988},
  pages = {125--138},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{BoultonWa73,
  author = {Boulton, D. M. and C. S. Wallace},
  title = {An information measure for hierarchic classification},
  journal = {The Computer Journal},
  year = {1973},
  volume = {16},
  pages = {254--261},
  number = {3},
  month = Aug
}

@ARTICLE{BoultonWa75,
  author = {Boulton, D. M. and C. S. Wallace},
  title = {An information measure for single-link classification},
  journal = {The Computer Journal},
  year = {1973},
  volume = {18},
  pages = {236--238},
  number = {3},
  month = Aug
}

@INPROCEEDINGS{Bourigault92,
  author = {Didier Bourigault},
  title = {Surface grammatical analysis for the extraction of terminological
	noun phrases},
  booktitle = COLING,
  year = {1992},
  pages = {977-981}
}

@INPROCEEDINGS{BoutilierDe96,
  author = {Craig Boutilier and Richard Dearden},
  title = {Approximating value trees in structured dynamic programming},
  booktitle = ICML,
  year = {1996},
  pages = {54--62},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{Boyan99,
  author = {Justin A. Boyan},
  title = {Least-squares temporal difference learning},
  booktitle = ICML,
  year = {1999},
  pages = {49--56},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{BoyanMo96,
  author = {Justin A. Boyan and Andrew W. Moore},
  title = {Learning evaluation functions for large acyclic domains},
  booktitle = ICML,
  year = {1996},
  pages = {63--70},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{Boyar89,
  author = {Joan Boyar},
  title = {Inferring Sequences Produced by Pseudo-Random Number Generators},
  journal = jacm,
  year = {1989},
  volume = {36},
  pages = {129-141},
  number = {1},
  month = jan,
  keywords = {Theory of Computation; Algorithms; Security; cryptography; inductive
	inference; linear congruential method; }
}

@INPROCEEDINGS{Boyd-GraberBlZh07,
  author = {Boyd-Graber, Jordan and Blei, David and Zhu, Xiaojin},
  title = {A Topic Model for Word Sense Disambiguation},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {1024--1033},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1109}
}

@ARTICLE{Brachman85,
  author = {Brachman, R.},
  title = {I lied about the trees},
  journal = {The AI Magazine},
  year = {1985},
  volume = {6}
}

@ARTICLE{Brachman83,
  author = {Brachman, R.},
  title = {What IS-A is and Isn't: An Analysis of Taxonomic Links in Semantic
	Networks},
  journal = {IEEE Computer},
  year = {1983},
  volume = {16},
  pages = {30--36},
  number = {10}
}

@ARTICLE{BrachmanFiLe83,
  author = {Brachman, R. and R. E. Fikes and H. J. Levesque},
  title = {KRYPTON: A Functional Approach to KnowledgeRepresentation},
  journal = {IEEE Computer},
  year = {1983},
  volume = {16},
  pages = {67--73},
  number = {10}
}

@INPROCEEDINGS{BrachmanLe84,
  author = {Brachman, R. and H. Levesque},
  title = {The Tractability of Subsumption in FrameBased DescriptionLanguages},
  booktitle = AAAI,
  year = {1984},
  pages = {34--37}
}

@ARTICLE{BrachmanSc85,
  author = {Brachman, R. and J. G. Scmolze},
  title = {An overview of th KL-ONE Knowledge RepresentationSystem},
  journal = {Cognitive Science},
  year = {1985},
  volume = {9},
  pages = {171--216},
  number = {2}
}

@ARTICLE{Brachman93,
  author = {R. Brachman and P. Selfridge and L. Terveen and B. Altman and A.
	Borgida and F. Halper and T. Kirk and A. Lazar and D. Mc{Guinness}
	and L. Resnick},
  title = {Integrated support for data archeology},
  journal = {International Journal of Intelligent and Cooperative Information
	Systems},
  year = {1993}
}

@INPROCEEDINGS{BradleyFa98,
  author = {Paul S. Bradley and Usama M. Fayyad},
  title = {Refining initial points for {K}-{M}eans clustering},
  booktitle = ICML,
  year = {1998},
  pages = {91--99},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{BradleyMa98,
  author = {Paul S. Bradley and Olvi L. Mangasarian},
  title = {Feature selection via concave minimization and support vector machines},
  booktitle = ICML,
  year = {1998},
  pages = {82--90},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@ARTICLE{BradtkeBa96,
  author = {Steven J. Bradtke and Andrew G. Barto},
  title = {Linear least-squares algorithms for temporal difference learning},
  journal = {Machine Learning},
  year = {1996},
  volume = {22},
  pages = {33--57},
  number = {1/2/3},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{BradyRaSl89,
  author = {M. L. Brady and R. Raghavan and J. Slawny},
  title = {Back Propagation Fails to Separate Where Perceptrons Succeed},
  journal = {IEEE Transactions On Circuits and Systems},
  year = {1989},
  volume = {36},
  pages = {665--674},
  number = {5},
  month = may,
  annote = {A variety of example of local minima in square bp one and multi layer
	and success of p-trons}
}

@BOOK{Braitenberg84,
  title = {Vehicles -- Experiments in Synthetic Psychology},
  publisher = {MIT Press},
  year = {1984},
  author = {Valentino Braitenberg}
}

@INPROCEEDINGS{BDLB06,
  author = {Bramsen, P. and Deshpande, P. and Lee, Y. K. and Barzilay, R.},
  title = {Inducing Temporal Graphs},
  booktitle = EMNLP,
  year = {2006},
  pages = {189--198},
  address = {Sydney, Australia},
  month = {July},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/W/W06/W06-1623}
}

@INPROCEEDINGS{BCZB09,
  author = {Branavan, S.R.K. and Chen, H. and Zettlemoyer, L. and Barzilay, R.},
  title = {Reinforcement Learning for Mapping Instructions to Actions},
  booktitle = ACL,
  year = {2009},
  pages = {82--90},
  address = {Suntec, Singapore},
  month = {August},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P09/P09-1010}
}

@INPROCEEDINGS{BranavanDeBa07,
  author = {Branavan, S. R. K. and Deshpande, Pawan and Barzilay, Regina},
  title = {Generating a Table-of-Contents},
  booktitle = ACL,
  year = {2007},
  pages = {544--551},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1069}
}

@INPROCEEDINGS{Brand02,
  author = {M.E. Brand},
  title = {Incremental Singular Value Decomposition of Uncertain Data with Missing
	Values},
  booktitle = ECCV,
  year = {2002},
  volume = {2350},
  series = LNCS,
  pages = {707--720}
}

@ARTICLE{BrandmanHeOr90,
  author = {Brandman, Y. and J. Hennessy and A. Orlitsky},
  title = {A spectral lower bound technique for the size of decision trees and
	two level circuits},
  journal = {IEEE Transactions on Computers},
  year = {1990},
  volume = {39},
  pages = {282--287},
  number = {2}
}

@INPROCEEDINGS{Branting07,
  author = {Branting, L. Karl},
  title = {Inducing Search Keys for Name Filtering},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {906--914},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1095}
}

@INPROCEEDINGS{BPXOD07,
  author = {Brants, Thorsten and Popat, Ashok C. and Xu, Peng and Och, Franz
	J. and Dean, Jeffrey},
  title = {Large Language Models in Machine Translation},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {858--867},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1090}
}

@ARTICLE{Bratko94,
  author = {Ivan Bratko},
  title = {Machine learning and qualitative reasoning},
  journal = {Machine Learning},
  year = {1994},
  volume = {14},
  pages = {305--312},
  number = {3},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{BrayerFu77,
  author = {J. M. Brayer and K. S. Fu},
  title = {A note on the k-tail method of tree grammar inference},
  journal = {IEEE Trans. on Systems, Man, and Cybernetics},
  year = {1977},
  volume = {SMC-7},
  pages = {293--300}
}

@INPROCEEDINGS{Brazdil92,
  author = {P. Brazdil},
  title = {Learning in multi-agent environments},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1992},
  pages = {5--34},
  publisher = {IOS Press}
}

@ARTICLE{Breese91,
  author = {John S. Breese},
  title = {Construction of belief and decision networks},
  journal = {Computational Intelligence},
  year = {1991},
  volume = {8},
  pages = {624-647}
}

@INPROCEEDINGS{BrefeldSc06,
  author = {Brefeld, U. and Scheffer, T.},
  title = {Semi-supervised learning for structured output variables},
  booktitle = ICML,
  year = {2006}
}

@ARTICLE{Breiman99,
  author = {Leo Breiman},
  title = {Pasting Small Votes for Classification in Large Databases and On-Line},
  journal = {Machine Learning},
  year = {1999},
  volume = {36},
  pages = {85--103},
  number = {1/2},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Breiman96,
  author = {L. Breiman},
  title = {Bagging Predictors},
  journal = {Machine Learning},
  year = {1996},
  volume = {24},
  pages = {123--140},
  number = {2}
}

@ARTICLE{Breiman96a,
  author = {Leo Breiman},
  title = {Technical Note: Some Properties of Splitting Criteria},
  journal = {Machine Learning},
  year = {1996},
  volume = {24},
  pages = {41--47},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Breiman96b,
  author = {Leo Breiman},
  title = {Stacked Regressions},
  journal = {Machine Learning},
  year = {1996},
  volume = {24},
  pages = {49--64},
  publisher = {Kluwer Academic Publishers, Boston}
}

@BOOK{BFOS84,
  title = {Classification and Regression Trees},
  publisher = {Wadsworth International Group},
  year = {1984},
  author = {L. Breiman and J. H. Friedman and R. A. Olshen and C. J. Stone},
  comment = {Review of procedures for inferring decision trees from data.}
}

@INPROCEEDINGS{Bremler-BarrAfHa99,
  author = {A. {Bremler-Barr} and Y. Afek and S. {Har-Peled}},
  title = {Routing with a Clue},
  booktitle = {Annual Conference on Data Communication},
  year = {1999},
  pages = {203--214},
  nickname = {SIGCOMM '99}
}

@INPROCEEDINGS{Brennan87,
  author = {Suzan Brennan and Marylin Friedman and Carl Pollard},
  title = {A centering approach to pronouns},
  booktitle = ACL,
  year = {1987}
}

@INPROCEEDINGS{BrennanFrPo87,
  author = {Suzan Brennan and Marylin Friedman and Carl Pollard},
  title = {A centering approach to pronouns},
  booktitle = ACL,
  year = {1987}
}

@ARTICLE{Brent99,
  author = {Michael R. Brent},
  title = {An Efficient, Probabilistically Sound Algorithm for Segmentation
	and Word Discovery},
  journal = {Machine Learning},
  year = {1999},
  volume = {34},
  pages = {71--105},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{Brent91,
  author = {Michael R. Brent},
  title = {Automatic acquisition of subcategorization frames from untagged text},
  booktitle = ACL,
  year = {1991}
}

@BOOK{Bresnan82,
  title = {The mental representation of grammatical relations},
  publisher = {MIT Press},
  year = {1982},
  author = {J. Bresnan},
  address = {Cambridge MA}
}

@UNPUBLISHED{Brieden02,
  author = {A.~Brieden},
  title = {On geometric optimization problems likely not contained in APX},
  note = {to appear},
  year = {2002}
}

@INPROCEEDINGS{BGKKLS98,
  author = {A. Brieden and P. Gritzmann and R. Kannan and V. Klee and L. Lovsz
	and M. Simonovits},
  title = {Approximation of Diameters: Randomization Doesn't Help},
  booktitle = FOCS,
  year = {1998},
  pages = {244--251},
  note = {Note: They show that under an oracle model approximating any of the
	diameters of a convex body can not be done to better than $O(n /\log{n})$,
	where $n$ is the dimensions}
}

@INCOLLECTION{BriedenGrKl00,
  author = {A. Brieden and P. Gritzmann and V. Klee},
  title = {Inapproximability of some geometric and quadratic optimization problems},
  booktitle = {Approximation and Complexity in Numerical Optimization: Continuous
	and Discrete Problems},
  publisher = {Kluwer},
  year = {2000},
  editor = {P. M. Pardalos},
  pages = {96--115}
}

@ARTICLE{Briggs90,
  author = {David A. Briggs},
  title = {A Correction of the Termination Conditions of the {H}enschen-{N}aqvi
	Technique},
  journal = jacm,
  year = {1990},
  volume = {37},
  pages = {712-719},
  number = {4},
  month = oct,
  keywords = {Database Theory; Algorithms; Languages; Theory; cyclic relations;
	logic and databases; logic program compilation; recursively defined
	relations; }
}

@INCOLLECTION{Brill97,
  author = {E. Brill},
  title = {Unsupervised Learning of Disambiguation Rules for Part of Speech
	Tagging},
  booktitle = {Natural Language Processing Using Very Large Corpora},
  publisher = {Kluwer Academic Press},
  year = {1997}
}

@ARTICLE{Brill95,
  author = {E. Brill},
  title = {Transformation-Based Error-Driven Learning and Natural Language Processing:
	A Case Study in Part of Speech tagging},
  journal = CL,
  year = {1995},
  volume = {21},
  pages = {543--565},
  number = {4}
}

@INPROCEEDINGS{Brill93,
  author = {Eric Brill},
  title = {Automatic grammar induction and parsing free text: A transformation-based
	approach},
  booktitle = ACL,
  year = {1993}
}

@INPROCEEDINGS{Brill92,
  author = {Eric Brill},
  title = {A simple rule-based part of speech tagger},
  booktitle = DARPA,
  year = {1992}
}

@INPROCEEDINGS{BMMS90,
  author = {Eric Brill and David Magerman and Mitchell P. Marcus and Beatrice
	Santorini},
  title = {Deducing linguistic structure from the statistics of large corpora},
  booktitle = {DARPA Speech and Natural Language Workshop},
  year = {1990},
  month = {June}
}

@INPROCEEDINGS{Brill90,
  author = {Eric Brill and David Magerman and Mitchell P. Marcus and Beatrice
	Santorini},
  title = {Deducing linguistic structure from the statistics of large corpora},
  booktitle = {DARPA Speech and Natural Language Workshop},
  year = {1990},
  month = {June}
}

@INPROCEEDINGS{BrillRe94,
  author = {E. Brill and P. Resnik},
  title = {A Rule-Based Approach to Prepositional Phrase Attachment Disambiguation},
  booktitle = COLING,
  year = {1994}
}

@ARTICLE{Briscoe93,
  author = {Ted Briscoe and John Carroll},
  title = {Generalized probabilistic {LR} parsing of natural language corpora
	with unification-based grammars},
  journal = CL,
  year = {1993},
  volume = {19},
  pages = {25--60},
  number = {1}
}

@ARTICLE{BriscoeCa93,
  author = {Ted Briscoe and John Carroll},
  title = {Generalized probabilistic {LR} parsing of natural language corpora
	with unification-based grammars},
  journal = CL,
  year = {1993},
  volume = {19},
  pages = {25--60},
  number = {1}
}

@INPROCEEDINGS{Brockett07,
  author = {C. Brockett},
  title = {ALIGNING THE {RTE} 2006 CORPUS},
  booktitle = {Technical Report MSR-TR-2007-77, Microsoft Research},
  year = {2007}
}

@INPROCEEDINGS{BrodalJa00,
  author = {G. Brodal and R. Jacob},
  title = {Dynamic Planar Convex Hull with Optimal Query Time and $O(\log n\cdot\log\log
	n)$ Update Time},
  booktitle = SWAT,
  year = {2000},
  pages = {57--70}
}

@INPROCEEDINGS{BrodalJa02,
  author = {G. S. Brodal and R. Jacob},
  title = {Dynamic Planar Convex Hull},
  booktitle = FOCS,
  year = {2002},
  note = {to appear}
}

@INPROCEEDINGS{Broder97,
  author = {A. Z. Broder},
  title = {On the resemblance and containment of documents},
  booktitle = {Compression Complexity Sequences},
  year = {1997},
  pages = {21--29}
}

@INPROCEEDINGS{BrodieDe99,
  author = {Mark Brodie and Gerald DeJong},
  title = {Learning to ride a bicycle using iterated phantom induction},
  booktitle = ICML,
  year = {1999},
  pages = {57--66},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{Brodley95,
  author = {Carla E. Brodley},
  title = {Automatic selection of split criterion during tree growing based
	on node location},
  booktitle = ICML,
  year = {1995},
  pages = {73--80},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{Brodley95a,
  author = {Carla E. Brodley},
  title = {Recursive automatic bias selection for classifier construction},
  journal = {Machine Learning},
  year = {1995},
  volume = {20},
  pages = {63--94},
  number = {1/2},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{BrodleyUt95,
  author = {Carla E. Brodley and Paul E. Utgoff},
  title = {Multivariate decision trees},
  journal = {Machine Learning},
  year = {1995},
  volume = {19},
  pages = {45--77},
  number = {1},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{Brody07,
  author = {Brody, Samuel},
  title = {Clustering Clauses for High-Level Relation Detection: An Information-theoretic
	Approach},
  booktitle = ACL,
  year = {2007},
  pages = {448--455},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1057}
}

@ARTICLE{BronshteynIv76,
  author = {E. M. Bronshteyn and L. D. Ivanov},
  title = {The Approximation of Convex Sets by Polyhedra},
  journal = {Siberian Math. J.},
  year = {1976},
  volume = {16},
  pages = {852--853}
}

@INPROCEEDINGS{Brooks91,
  author = {R. Brooks},
  title = {The role of learning in autonomous robots},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1991},
  pages = {5--10},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{Brooks91a,
  author = {Brooks, R. A.},
  title = {Intelligence without representation},
  journal = {Artificial Intelligence},
  year = {1991},
  volume = {47},
  pages = {139-159},
  comment = {Argues in favor of the reactive approach. No clean division between
	perception and reasoning in the real world. The problems are not
	so "hard" as the abstract problems may be due to constraints put
	by the perceptions modules}
}

@ARTICLE{Brooks91b,
  author = {Rodney A. Brooks},
  title = {New Approaches to Robotics},
  journal = {Science},
  year = {1991},
  volume = {253},
  pages = {1227--1232},
  number = {5025},
  month = Sep
}

@INPROCEEDINGS{BrooksMa90,
  author = {Brooks, Rodney A. and Pattie Maes},
  title = {Learning to Coordinate Behaviors},
  booktitle = AAAI,
  year = {1990},
  address = {Boston, MA},
  month = Jul,
  comment = {to appear},
  tag = {TOC-display}
}

@INPROCEEDINGS{BHKMSH93,
  author = {M. P. Brown and R. Hughey and A. Krogh and I. S. Mian and K. Sj{\"o}lander
	and D. Haussler},
  title = {Using {D}irichlet Mixture Priors to Derive Hidden {M}arkov Models
	for Protein Families},
  booktitle = {International Conference on Intelligent Systems for Molecular Biology},
  year = {1993},
  editor = {L. Hunter and D. Searls and J. Shavlik},
  pages = {47--55},
  address = {Menlo Park, CA},
  month = jul,
  publisher = {AAAI/MIT Press},
  annotate = {Washington conference}
}

@ARTICLE{BCDDJMR90,
  author = {Brown, P. and Cocke, J. and Della Pietra, S. and Della Pietra, V.
	and Jelinek, F. and Mercer, R.L. and Roossin, P.S.},
  title = {A statistical approach to language translation},
  journal = CL,
  year = {1990},
  volume = {16},
  pages = {79--85},
  number = {2}
}

@ARTICLE{Brown90,
  author = {Brown, P. and Cocke, J. and Della Pietra, S. and Della Pietra, V.
	and Jelinek, F. and Mercer, R.L. and Roossin, P.S.},
  title = {A statistical approach to language translation},
  journal = CL,
  year = {1990},
  volume = {16},
  pages = {79--85},
  number = {2}
}

@INPROCEEDINGS{BCDDJMR88,
  author = {Brown, P. and Cocke, J. and Della Pietra, S. and Della Pietra, V.
	and Jelinek, F. and Mercer, R.L. and Roossin, P.S.},
  title = {A statistical approach to language translation},
  booktitle = COLING,
  year = {1988}
}

@INPROCEEDINGS{Brown88,
  author = {Brown, P. and Cocke, J. and Della Pietra, S. and Della Pietra, V.
	and Jelinek, F. and Mercer, R.L. and Roossin, P.S.},
  title = {A statistical approach to language translation},
  booktitle = COLING,
  year = {1988}
}

@INPROCEEDINGS{Brown91b,
  author = {P. Brown and J. Lai and R. Mercer},
  title = {Aligning sentences in parallel corpora},
  booktitle = ACL,
  year = {1991}
}

@INPROCEEDINGS{BrownLaMe91,
  author = {P. Brown and J. Lai and R. Mercer},
  title = {Aligning sentences in parallel corpora},
  booktitle = ACL,
  year = {1991}
}

@INPROCEEDINGS{BPPLM92,
  author = {P. Brown and S. Della Pietra and V.Della Pietra and J. Lafferty and
	R. Mercer},
  title = {Analysis, statistical transfer, and synthesis in machine translation},
  booktitle = TMI,
  year = {1992},
  pages = {83--100}
}

@INPROCEEDINGS{Brown92b,
  author = {P. Brown and S. Della Pietra and V.Della Pietra and J. Lafferty and
	R. Mercer},
  title = {Analysis, statistical transfer, and synthesis in machine translation},
  booktitle = TMI,
  year = {1992},
  pages = {83--100}
}

@ARTICLE{BPPM93,
  author = {Peter Brown and Stephen Della Pietra and Vincent Della Pietra and
	Robert Mercer},
  title = {The mathematics of statistical machine translation: parameter estimation},
  journal = CL,
  year = {1993},
  volume = {19},
  pages = {263--311},
  number = {2}
}

@INPROCEEDINGS{BPPM93a,
  author = {Peter Brown and Stephen Della Pietra and Vincent Della Pietra and
	Robert Mercer},
  title = {But dictionaries are data too},
  booktitle = ARPA,
  year = {1993},
  pages = {202--205}
}

@ARTICLE{Brown93,
  author = {Peter Brown and Stephen Della Pietra and Vincent Della Pietra and
	Robert Mercer},
  title = {The mathematics of statistical machine translation: parameter estimation},
  journal = CL,
  year = {1993},
  volume = {19},
  pages = {263--311},
  number = {2}
}

@INPROCEEDINGS{Brown93b,
  author = {Peter Brown and Stephen Della Pietra and Vincent Della Pietra and
	Robert Mercer},
  title = {But dictionaries are data too},
  booktitle = ARPA,
  year = {1993},
  pages = {202--205}
}

@INPROCEEDINGS{BPPM91,
  author = {P. Brown and S. Della Pietra and V. Della Pietra and R. Mercer},
  title = {Word sense disambiguation using statistical methods},
  booktitle = ACL,
  year = {1991},
  pages = {264--270}
}

@INPROCEEDINGS{Brown91,
  author = {P. Brown and S. Della Pietra and V. Della Pietra and R. Mercer},
  title = {Word sense disambiguation using statistical methods},
  booktitle = ACL,
  year = {1991},
  pages = {264--270}
}

@ARTICLE{BPLM92,
  author = {P. Brown and V. Della Pietra and P. deSouza and J. Lai and R. Mercer},
  title = {Class-based n-gram models of natural language},
  journal = CL,
  year = {1992},
  volume = {18},
  pages = {467--479},
  number = {4}
}

@ARTICLE{Brown92,
  author = {P. Brown and V. Della Pietra and P. deSouza and J. Lai and R. Mercer},
  title = {Class-based n-gram models of natural language},
  journal = CL,
  year = {1992},
  volume = {18},
  pages = {467--479},
  number = {4}
}

@INPROCEEDINGS{BrownPiPiMe91,
  author = {P. F. Brown and S. A. D. Pietra and V. J. D. Pietra and R. L. Mercer},
  title = {Word Sense Disambiguation Using Statistical Methods},
  booktitle = ACL,
  year = {1991}
}

@ARTICLE{BPdLM92,
  author = {P. F. Brown and V. J. Della Pietra and P. V. deSouza and J. C. Lai
	and R. L. Mercer},
  title = {Class-{B}ased n-gram {M}odels of {N}atural {L}anguage},
  journal = {Computational Linguistics},
  year = {1992},
  volume = {18},
  pages = {467--479},
  number = {4}
}

@ARTICLE{BrownNgrams,
  author = {Peter F. Brown and Vincent J. Della Pietra and Peter V. deSouza and
	Jenifer C. Lai and Robert L. Mercer},
  title = {Class-{B}ased n-gram {M}odels of {N}atural {L}anguage},
  journal = {Computational Linguistics},
  year = {1992},
  volume = {18},
  pages = {467--479},
  number = {4}
}

@ARTICLE{BrownPiDeLaMe92,
  author = {P. F. Brown and V. J. D. Pietra and P. V. DeSouza and J. C. Lai and
	R. L. Mercer},
  title = {Class-based n-gram models of natural language},
  journal = CL,
  year = {1992},
  volume = {18},
  pages = {467-479},
  number = {4}
}

@BOOK{Brown73,
  title = {A First Language},
  publisher = {Harvard University Press},
  year = {1973},
  author = {R. Brown},
  address = {Cambridge, MA}
}

@ARTICLE{Bruck90,
  author = {Bruck, J.},
  title = {Harmonic analysis of polynomial threshold functions},
  journal = {SIAM J. on Disc. Math},
  year = {1990},
  volume = {3},
  pages = {168--177},
  number = {2},
  month = May
}

@INPROCEEDINGS{BruckSm90,
  author = {Bruck, J. and R. Smolensky},
  title = {Polynomial threshold functions, {$AC^0$} functions and spectral norms},
  booktitle = FOCS,
  year = {1990},
  pages = {632--641},
  month = Oct
}

@ARTICLE{Brunak91,
  author = {Brunak, S. and Engelbrecht, J. and Knudsen, S.},
  title = {Prediction of Human m{RNA} Donor and Acceptor Sitesfrom the {DNA}
	Sequence},
  journal = {Journal of Molecular Biology},
  year = {1991},
  volume = {220},
  pages = {49--65}
}

@INPROCEEDINGS{BrunkPa95,
  author = {Clifford Brunk and Michael Pazzani},
  title = {A lexically based semantic bias for theory revision},
  booktitle = ICML,
  year = {1995},
  pages = {81--89},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{BMSS07,
  author = {B. Bryan and H. McMahan and C. Schafer and J. Schneider},
  title = {Efficiently computing minimax expected-size confidence regions},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {97--104},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@ARTICLE{Bryant91,
  author = {Randal E. Bryant},
  title = {A Methodology for Hardware Verification Based on Logic Simulation},
  journal = jacm,
  year = {1991},
  volume = {38},
  pages = {299-328},
  number = {2},
  month = apr,
  keywords = {Computer Systems; Theory; Verification; hardware verification; logic
	simulation; ternary simulation; }
}

@ARTICLE{Brzozowski89,
  author = {J. A. Brzozowski and C.-J. Seger},
  title = {A Unified Framework for Race Analysis of Asynchronous Networks},
  journal = jacm,
  year = {1989},
  volume = {36},
  pages = {20-45},
  number = {1},
  month = jan,
  keywords = {Computer Systems; Algorithms; Design; Theory; Verification; asynchronous
	circuits; races; switch-level models; ternary simulation; }
}

@INPROCEEDINGS{BronnimannBuPi98,
  author = {H. Br{\"o}nnimann and C. Burnikel and S. Pion},
  title = {Interval Arithmetic Yields Efficient Dynamic Filters for Computational
	Geometry},
  booktitle = {SOCG},
  year = {1998},
  pages = {165--174}
}

@ARTICLE{BronnimannGo95,
  author = {H. Br{\"o}nnimann and M. T. Goodrich},
  title = {Almost Optimal Set Covers in Finite {VC}-Dimension},
  journal = DCG,
  year = {1995},
  volume = {14},
  pages = {263--279}
}

@INPROCEEDINGS{Brazma94,
  author = {A. Br{\= a}zma},
  title = {Efficient algorithm for learning simple regular expressions from
	noisy examples},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1994},
  pages = {260--271},
  publisher = {Springer-Verlag}
}

@ARTICLE{BrazmaCe97,
  author = {A. Br{\= a}zma and {\v C}er{\= a}ns},
  title = {Noise-tolerant Efficient Inductive Synthesis of Regular Expressions
	from Good Examples},
  journal = {New Generation Computing},
  year = {1997},
  volume = {15},
  pages = {105--140},
  number = {1},
  note = {Special issue for AII '94 and ALT '94}
}

@INPROCEEDINGS{BrazmaCe94,
  author = {A. Br{\= a}zma and {\v C}er{\= a}ns},
  title = {Efficient learning of regular expressions from good examples},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1994},
  pages = {76--90},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{BJVU98,
  author = {A. Br{\= a}zma and I. Jonassen and J. Vilo and E. Ukkonen},
  title = {Pattern discovery in biosequences},
  booktitle = {International Workshop on Algorithmic Learning},
  year = {1998},
  volume = {1433},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {257--270},
  publisher = {Springer-Verlag}
}

@INBOOK{Brazma97,
  chapter = {19},
  pages = {337--352},
  title = {Efficient learning of regular expressions from approximate examples},
  publisher = {MIT Press},
  year = {1997},
  author = {Alvis Br{\=a}zma},
  volume = {IV: Making Learning Systems Practical},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@INPROCEEDINGS{Brazma95,
  author = {Alvis Br{\=a}zma},
  title = {Learning of regular expressions by pattern matching},
  booktitle = EuroCOLT,
  year = {1995},
  pages = {392--403},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Brazma93,
  author = {A. Br{\=a}zma},
  title = {Efficient identification of regular expressions from representative
	examples},
  booktitle = COLT,
  year = {1993},
  pages = {236--242},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{BshoutyBs94,
  author = {D. Bshouty and N. H. Bshouty},
  title = {On learning arithmetic read-once formulas with exponentiation},
  booktitle = COLT,
  year = {1994},
  pages = {311--317},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{BHHK94,
  author = {N. Bshouty and T. Hancock and L. Hellerstein and M. Karpinski},
  title = {An algorithm to learn read-once threshold formulas, and transformations
	between learning models},
  journal = {Computational Complexity},
  year = {1994},
  volume = {4},
  pages = {37--61}
}

@UNPUBLISHED{BshoutyHaHeKa91,
  author = {Bshouty, Nader and Lisa Hellerstein and T. Hancock and Marek Karpinski},
  title = {Read-once threshold formulas, justifying assignments,and transformations},
  note = {To appear in the Journal of Complexity Theory, 93},
  month = Dec,
  year = {1991}
}

@INPROCEEDINGS{BshoutyTa95,
  author = {Nader Bshouty and Christino Tamon},
  title = {On the {F}ourier spectrum of monotone functions},
  booktitle = STOC,
  year = {1995},
  pages = {219--228},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{Bshouty97,
  author = {Nader H. Bshouty},
  title = {Exact Learning of Formulas in Parallel},
  journal = {Machine Learning},
  year = {1997},
  volume = {26},
  pages = {25--41},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Bshouty95,
  author = {Bshouty, N. H.},
  title = {Exact Learning via the Monotone Theory},
  journal = {Information and Computation},
  year = {1995},
  volume = {123},
  pages = {146-153},
  number = {1}
}

@INPROCEEDINGS{Bshouty95a,
  author = {Nader H. Bshouty},
  title = {A note on learning multivariate polynomials under the uniform distribution},
  booktitle = COLT,
  year = {1995},
  pages = {79--82},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{Bshouty95b,
  author = {Nader H. Bshouty},
  title = {Simple learning algorithms using divide and conquer},
  booktitle = COLT,
  year = {1995},
  pages = {447--453},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{Bshouty93,
  author = {Bshouty, N. H.},
  title = {Exact Learning via the Monotone Theory},
  booktitle = FOCS,
  year = {1993},
  pages = {302--311},
  address = {Palo Alto, CA.}
}

@ARTICLE{Bshouty93a,
  author = {Nader H. Bshouty},
  title = {On the Complexity of Functions for Random Access Machines},
  journal = jacm,
  year = {1993},
  volume = {40},
  pages = {211-223},
  number = {2},
  month = apr,
  keywords = {Analysis of Algorithms; Algorithms; Theory; Verification; greatest
	common divisor; indirect addressing; random access machine; sorting;}
}

@INPROCEEDINGS{BCDH95,
  author = {Nader H. Bshouty and Zhixiang Chen and Scott E. Decatur and Steven
	Homer},
  title = {On the learnability of {$Z_N$}-{DNF} formulas},
  booktitle = COLT,
  year = {1995},
  pages = {198--205},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{BshoutyChHo94,
  author = {Nader H. Bshouty and Zhixiang Chen and Steve Homer},
  title = {On learning discretized geometric concepts},
  booktitle = FOCS,
  year = {1994},
  pages = {54--63},
  publisher = {IEEE Computer Society Press, Los Alamitos, CA}
}

@INPROCEEDINGS{BshoutyCl92,
  author = {N. H. Bshouty and R. Cleve},
  title = {On the exact learning of formulas in parallel},
  booktitle = FOCS,
  year = {1992},
  pages = {513--522},
  publisher = {IEEE Computer Society Press, Los Alamitos, CA}
}

@INPROCEEDINGS{BCKT94,
  author = {N. H. Bshouty and R. Cleve and S. Kannan and C. Tamon},
  title = {Oracles and queries that are sufficient for exact learning},
  booktitle = COLT,
  year = {1994},
  pages = {130--139},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{BshoutyEiKu99,
  author = {Nader H. Bshouty and Nadav Eiron and Eyal Kushilevitz},
  title = {{PAC} Learning with Nasty Noise},
  booktitle = ALT,
  year = {1999},
  volume = {1720},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {206--218},
  publisher = {Springer-Verlag}
}

@ARTICLE{BGGM98,
  author = {Nader H. Bshouty and Paul W. Goldberg and Sally A. Goldman and H.
	David Mathias},
  title = {Exact Learning of Discretized Geometric Concepts},
  journal = {{SIAM} J. Comput.},
  year = {1998},
  volume = {28},
  pages = {674--699},
  number = {2}
}

@ARTICLE{BGHM96,
  author = {Nader H. Bshouty and Sally A. Goldman and Thomas R. Hancock and Sleiman
	Matar},
  title = {Asking questions to minimize errors},
  journal = {J. of Comput. Syst. Sci.},
  year = {1996},
  volume = {52},
  pages = {268--286},
  number = {2},
  note = {Earlier version in 6th COLT, 1993}
}

@INPROCEEDINGS{BshoutyGoMa95,
  author = {Nader H. Bshouty and Sally A. Goldman and David H. Mathias},
  title = {Noise-tolerant parallel learning of geometric concepts},
  booktitle = COLT,
  year = {1995},
  pages = {345--352},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{BGMST96,
  author = {N. H. Bshouty and S. A. Goldman and H. D. Mathias and S. Suri and
	H. Tamaki},
  title = {Noise-Tolerant Distribution-Free Learning of General Geometric Concepts},
  booktitle = STOC,
  year = {1996},
  pages = {151--160},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{BshoutyHaHe92,
  author = {N. H. Bshouty and T. R. Hancock and L. Hellerstein},
  title = {Learning arithmetic read-once formulas},
  booktitle = STOC,
  year = {1992},
  pages = {370--381},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{BshoutyHaHe92a,
  author = {N. H. Bshouty and T. R. Hancock and L. Hellerstein},
  title = {Learning {B}oolean read-once formulas with arbitrary symmetric and
	constant fan-in gates},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1992},
  pages = {1--15},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{BshoutyHe96,
  author = {Nader H. Bshouty and Lisa Hellerstein},
  title = {Attribute-efficient learning in query and mistake-bound models},
  booktitle = COLT,
  year = {1996},
  pages = {235--243},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{BshoutyJa99,
  author = {Nader H. Bshouty and Jeffrey C. Jackson},
  title = {Learning {DNF} over the Uniform Distribution Using a Quantum Example
	Oracle},
  journal = {{SIAM} J. Comput.},
  year = {1999},
  volume = {28},
  pages = {1136--1153},
  number = {3},
  notes = {first in COLT '95}
}

@INPROCEEDINGS{BshoutyJaTa99,
  author = {Nader H. Bshouty and Jeffrey C. Jackson and Christino Tamon},
  title = {More efficient {PAC}-learning of {DNF} with membership queries under
	the uniform distribution},
  booktitle = COLT,
  year = {1999},
  pages = {286--295},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{BshoutyJaTa99a,
  author = {Nader H. Bshouty and Jeffrey C. Jackson and Christino Tamon},
  title = {Uniform-distribution attribute noise learnability},
  booktitle = COLT,
  year = {1999},
  pages = {75--80},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{BshoutyMa95,
  author = {Nader H. Bshouty and Yishay Mansour},
  title = {Simple learning algorithms for decision trees and multivariate polynomials},
  booktitle = FOCS,
  year = {1995},
  pages = {304--311},
  publisher = {IEEE Computer Society Press, Los Alamitos, CA}
}

@ARTICLE{BshoutyTaWi98,
  author = {Nader H. Bshouty and Christino Tamon and David K. Wilson},
  title = {Learning Matrix Functions over Rings},
  journal = {Algorithmica},
  year = {1998},
  volume = {22},
  pages = {91--111},
  number = {1/2},
  comment = {first in EuroColt '97}
}

@INPROCEEDINGS{BshoutyTaWi96,
  author = {Nader H. Bshouty and Christino Tamon and David K. Wilson},
  title = {On learning width two branching programs},
  booktitle = COLT,
  year = {1996},
  pages = {224--227},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{BshoutyTaWi95,
  author = {Nader H. Bshouty and Christino Tamon and David K. Wilson},
  title = {On learning decision trees with large output domains},
  booktitle = COLT,
  year = {1995},
  pages = {190--197},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{BshoutyWi99,
  author = {Nader H. Bshouty and David K. Wilson},
  title = {On learning in the presence of unspecified attribute values},
  booktitle = COLT,
  year = {1999},
  pages = {81--87},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{Buchanan89,
  author = {Bruce G. Buchanan},
  title = {Can Machine Learning Offer Anything to Expert Systems?},
  journal = {Machine Learning},
  year = {1989},
  volume = {4},
  pages = {251--254},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{BuchholzVeDa99,
  author = {S. Buchholz and J. Veenstra and W. Daelemans},
  title = {Cascaded Grammatical Relation Assignment},
  booktitle = EMNLP-VLC,
  year = {1999},
  month = Jun
}

@INPROCEEDINGS{BVD99,
  author = {S. Buchholz and J. Veenstra and W. Daelemans},
  title = {Cascaded Grammatical Relation Assignment},
  booktitle = EMNLP-VLC,
  year = {1999},
  month = Jun
}

@INPROCEEDINGS{BuckleySaAl94,
  author = {C. Buckley and G. Salton and J. Allan},
  title = {The effect of adding relevance information in a relevance feedback
	environment},
  booktitle = ACM-SIGIR,
  year = {1994},
  pages = {292--301},
  publisher = {Springer-Verlag}
}

@ARTICLE{BudanitskyHirst06,
  author = {A. Budanitsky and G. Hirst},
  title = {Evaluating Wordnet-based Measures of Lexical Semantic Relatedness},
  journal = {Computational Linguistics},
  year = {2006},
  volume = {32},
  pages = {13-47},
  number = {1}
}

@INPROCEEDINGS{Budanitsky2,
  author = {Alexander Budanitsky and Graeme Hirst},
  title = {Semantic distance in WordNet: An experimental, application-oriented
	evaluation of five measures},
  booktitle = {Workshop on WordNet and Other Lexical Resources, Second meeting of
	the North American Chapter of the Association for Computational Linguistics},
  year = {2001},
  pages = {29--34},
  address = {Pittsburgh PA},
  month = {June}
}

@INPROCEEDINGS{BudanitskyHirst01,
  author = {A. Budanitsky and G. Hirst},
  title = {Semantic Distance in WordNet: An Experimenal, Application-oriented
	Evaluation of Five Measures},
  booktitle = {NAACL - Workshop on WordNet and Other Lexical Resources},
  year = {2001}
}

@INCOLLECTION{Buehler70,
  author = {Buehler, Robert J.},
  title = {Measuring Information and Uncertainty},
  booktitle = {Foundations of Statistical Inference},
  publisher = {Holt, Rinehard, and Winston},
  year = {1970},
  editor = {V. P. Godambe and D. A. Sprott},
  comment = {General study of payoff functions that encourage honesty for someone
	making probabilistic predictions (e.g. a weatherman).}
}

@INPROCEEDINGS{BuescherKu91,
  author = {K. Buescher and P. R. Kumar},
  title = {Simultaneous learning of concepts and simultaneous estimation of
	probabilities},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1991},
  pages = {33--42},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{BuescherKu92,
  author = {K. L. Buescher and P. R. Kumar},
  title = {Learning stochastic functions by smooth simultaneous estimation},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1992},
  pages = {272--279},
  publisher = {ACM Press, New York, NY}
}

@PHDTHESIS{Buitelaar98,
  author = {P. Buitelaar},
  title = {CoreLex: Systematic Polysemy and Underspecification},
  school = {Computer Science Department, Brandeis University},
  year = {1998},
  month = {Feb}
}

@INPROCEEDINGS{BultmanMa91,
  author = {W. J. Bultman and W. Maass},
  title = {Fast identification of geometric objects with membership queries},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1991},
  pages = {337--353},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@TECHREPORT{BundySi81,
  author = {A. Bundy and B. Silver},
  title = {A critical survey of rule learning programs},
  institution = {Edinburgh Univ. Dept. of AI, No. 169},
  year = {1981}
}

@INPROCEEDINGS{BunescuMo07,
  author = {R. Bunescu and R. Mooney},
  title = {Multiple instance learning for sparse positive bags},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {105--112},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{BunescuMo07a,
  author = {Bunescu, Razvan and Mooney, Raymond},
  title = {Learning to Extract Relations from the Web using Minimal Supervision},
  booktitle = ACL,
  year = {2007},
  pages = {576--583},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1073}
}

@INPROCEEDINGS{BunescuMo07b,
  author = {Bunescu, Razvan and Mooney, Raymond},
  title = {Learning to Extract Relations from the Web using Minimal Supervision},
  booktitle = {ACL},
  year = {2007},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@INPROCEEDINGS{BunescuPa06,
  author = {R. Bunescu and M. Pasca},
  title = {Using Encyclopedic Knowledge for Named Entity Disambiguation },
  booktitle = EACL,
  year = {2006},
  url = {http://www.cs.utexas.edu/~ml/publication/paper.cgi?paper=encyc-eacl-06.ps.gz}
}

@INPROCEEDINGS{BunescuPa06a,
  author = {R. Bunescu and M. Pasca},
  title = {Using Encyclopedic Knowledge for Named Entity Disambiguation },
  booktitle = {EACL},
  year = {2006},
  owner = {dxquang},
  timestamp = {2010.12.12},
  url = {http://www.cs.utexas.edu/~ml/publication/paper.cgi?paper=encyc-eacl-06.ps.gz}
}

@INPROCEEDINGS{BunescuMo05,
  author = {Razvan C. Bunescu and Raymond J. Mooney},
  title = {A shortest path dependency kernel for relation extraction},
  booktitle = {Proceedings of HLT/EMNLP-05},
  year = {2005},
  pages = {724--731},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@INPROCEEDINGS{Buntine89,
  author = {W. Buntine},
  title = {A Critique of the {V}aliant Model},
  booktitle = IJCAI,
  year = {1989},
  pages = {837--842}
}

@ARTICLE{BuntineNi92,
  author = {Wray Buntine and Tim Niblett},
  title = {A Further Comparison of Splitting Rules for Decision-Tree Induction},
  journal = {Machine Learning},
  year = {1992},
  volume = {8},
  pages = {75--85},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Buntine94,
  author = {Wray L. Buntine},
  title = {Operations for Learning with Graphical Models},
  journal = {Journal of Artificial Intelligence Research},
  year = {1994},
  volume = {2},
  pages = {159-225},
  url = {citeseer.ist.psu.edu/6938.html}
}

@PHDTHESIS{Buntine90,
  author = {W. L. Buntine},
  title = {A Theory of Learning Classification Rules},
  school = {University of Technology, Sydney},
  year = {1990}
}

@INPROCEEDINGS{Burago94,
  author = {A. Burago},
  title = {Learning structurally reversible context-free grammars from queries
	and counterexamples in polynomial time},
  booktitle = COLT,
  year = {1994},
  pages = {140--146},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{BurchardtFr05,
  author = {A. Burchardt and A. Frank},
  title = {Approaching Textual Entailment with LFG and FrameNet Frames},
  booktitle = RTE,
  year = {2005}
}

@INPROCEEDINGS{BFJMT99,
  author = {Wolfram Burgard and Dieter Fox and Hauke Jans and Christian Matenar
	and Sebastian Thrun},
  title = {Sonar-based mapping with mobile robots using {EM}},
  booktitle = ICML,
  year = {1999},
  pages = {67--76},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INCOLLECTION{Burge98,
  author = {Burge, C},
  title = {Modeling Dependencies in pre-m{RNA} Splicing Signals},
  booktitle = {Computational Methods in Molecular Biology},
  publisher = {Elsevier-Science B.V.},
  year = {1998},
  editor = {Salzberg, S.L. and Searls, D.B. and Kasif, S.},
  pages = {129--164}
}

@ARTICLE{BurgeKarlin98,
  author = {Burge, C. and Karlin, S.},
  title = {Finding the Genes in Genomic {DNA}},
  journal = {Current Opinion in Structural Biology},
  year = {1998},
  volume = {8},
  pages = {346--354}
}

@ARTICLE{BurgeKarlin97,
  author = {Burge, C. and Karlin, S.},
  title = {Prediction of Complete Gene Structures in Human Genomic {DNA}},
  journal = {Journal of Molecular Biology},
  year = {1997},
  volume = {268},
  pages = {78--94}
}

@INPROCEEDINGS{Burges96,
  author = {Chris J. C. Burges},
  title = {Simplified support vector decision rules},
  booktitle = ICML,
  year = {1996},
  pages = {71--77},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{BASFPCA98,
  author = {Michael C. Burl and Lars Asker and Padhraic Smyth and Usama Fayyad
	and Pietro Perona and Larry Crumpler and Jayne AubeIe},
  title = {Learning to recognize volcanoes on {V}enus},
  journal = {Machine Learning},
  year = {1998},
  volume = {30},
  pages = {165--194},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{BurnsPo00,
  author = {Brendan Davis Burns and Andrea Pohoreckyj-Danyluk},
  title = {Feature Selection vs Theory Reformulation: {A} Study of Genetic Refinement
	of Knowledge-based Neural Networks},
  journal = {Machine Learning},
  year = {2000},
  volume = {38},
  pages = {89--107},
  number = {1/2},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{BursetGuigo96,
  author = {Burset, M. and Guigo, R.},
  title = {Evaluation of Gene Structure Prediction Programs},
  journal = {Genomics},
  year = {1996},
  volume = {34},
  pages = {353--367}
}

@INPROCEEDINGS{BusseOrBu07,
  author = {L. Busse and P. Orbanz and J. Buhmann},
  title = {Cluster analysis of heterogeneous rank data},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {113--120},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{Butt03,
  author = {M. Butt},
  title = {The Light Verb Jungle},
  booktitle = {Harvard Working Paper in Linguistics},
  year = {2003},
  volume = {9},
  pages = {1-49}
}

@INPROCEEDINGS{Bylander97,
  author = {Tom Bylander},
  title = {The Binary Exponentiated Gradient Algorithm for Learning Linear Functions},
  booktitle = COLT,
  year = {1997},
  pages = {184--192},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{Bylander97a,
  author = {Tom Bylander},
  title = {Learning Probabilistically Consistent Linear Threshold Functions},
  booktitle = COLT,
  year = {1997},
  pages = {62--71},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{Bylander94,
  author = {T. Bylander},
  title = {Learning linear threshold functions in the presence of classification
	noise},
  booktitle = COLT,
  year = {1994},
  pages = {340--347},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{Bylander93,
  author = {T. Bylander},
  title = {Polynomial learnability of linear threshold approximations},
  booktitle = COLT,
  year = {1993},
  pages = {297--302},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{BohringerDoHa99,
  author = {K.-F. B{\"o}hringer and B. Donald and D. Halperin},
  title = {The Area Bisectors of a Polygon and Force Equilibria in Programmable
	Vector Fields},
  journal = DCG,
  year = {1999},
  volume = {22},
  pages = {269--285},
  number = {2}
}

@INPROCEEDINGS{BohringerDoHa97,
  author = {K.-F. B{\"o}hringer and B. Donald and D. Halperin},
  title = {The Area Bisectors of a Polygon and Force Equilibria in Programmable
	Vector Fields},
  booktitle = {SOCG},
  year = {1997},
  pages = {457--459}
}

@INPROCEEDINGS{BuningLe96,
  author = {Hans Kleine B{\"u}ning and Theodor Lettmann},
  title = {Learning a representation for optimizable formulas},
  booktitle = ALT,
  year = {1996},
  volume = {1160},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {51--58},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{BBAS93,
  author = {J{\=a}nis B{\=a}rzdi{\c n}{\u s} and Guntis B{\=a}rzdi{\c n}{\u s}
	and Kalvis Aps{\=i}tis and U{\u g}is Sarkans},
  title = {Towards efficient inductive synthesis of expressions from input/output
	examples},
  booktitle = {International Workshop on Analogical and Inductive Inference and
	International Workshop on Algorithmic Learning Theory},
  year = {1993},
  volume = {744},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {59--72},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{BarzdicFrSm97,
  author = {J{\=a}nis B{\=a}rzdi{\c n}{\u s} and R{\=u}si{\c n}s Freivalds and
	Carl H. Smith},
  title = {Learning formulae from elementary facts},
  booktitle = EuroCOLT,
  year = {1997},
  pages = {272--285},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{BarzdicFrSm96,
  author = {J{\=a}nis B{\=a}rzdi{\c n}{\u s} and R{\=u}si{\c n}s Freivalds and
	Carl H. Smith},
  title = {Learning with Confidence},
  booktitle = STACS,
  year = {1996},
  volume = {1046},
  series = {Lecture Notes in Computer Science},
  pages = {207--218},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{BarzdicSa96,
  author = {J{\=a}nis B{\=a}rzdi{\c n}{\v s} and U{\v g}is Sarkans},
  title = {Incorporating hypothetical knowledge into the process of inductive
	synthesis},
  booktitle = ALT,
  year = {1996},
  volume = {1160},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {156--168},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{CMSM99,
  author = {Igor V. Cadez and Christine E. McLaren and Padhraic Smyth and Geoffrey
	J. McLachlan},
  title = {Hierarchical models for screening iron deficiency anemia},
  booktitle = ICML,
  year = {1999},
  pages = {77--86},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{CaiLeTe07,
  author = {Cai, Junfu and Lee, Wee Sun and Teh, Yee Whye},
  title = {Improving Word Sense Disambiguation Using Topic Features},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {1015--1023},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1108}
}

@INPROCEEDINGS{CaliffMo99,
  author = {M. Califf and R. Mooney},
  title = {Relational Learning of Pattern-Match Rules for Information Extraction},
  booktitle = AAAI,
  year = {1999}
}

@PHDTHESIS{Callahan95,
  author = {P. B. Callahan},
  title = {Dealing with higher dimensions: the well-separated pair decomposition
	and its applications},
  school = {Dept. Comput. Sci., Johns Hopkins University},
  year = {1995},
  type = {Ph.{D}. Thesis},
  address = {Baltimore, Maryland},
  keywords = {doctoral thesis}
}

@INPROCEEDINGS{CallahanKo95,
  author = {P. B. Callahan and S. R. Kosaraju},
  title = {Algorithms for Dynamic Closest-Pair and {$n$}-Body Potential Fields},
  booktitle = SODA,
  year = {1995},
  pages = {263--272},
  keywords = {dynamic algorithms, closest pair, all nearest neighbors, fast multipole
	method}
}

@ARTICLE{CallahanKo95a,
  author = {P. B. Callahan and S. R. Kosaraju},
  title = {A decomposition of multidimensional point sets with applications
	to $k$-nearest-neighbors and $n$-body potential fields},
  journal = JACM,
  year = {1995},
  volume = {42},
  pages = {67--90}
}

@INPROCEEDINGS{CallahanKo93,
  author = {P. B. Callahan and S. R. Kosaraju},
  title = {Faster Algorithms for Some Geometric Graph Problems in Higher Dimensions},
  booktitle = SODA,
  year = {1993},
  pages = {291--300},
  keywords = {optimization, minimum spanning trees, spanner, well-separated pair
	decomposition}
}

@INPROCEEDINGS{Cameron97,
  author = {S. Cameron},
  title = {Enhancing gjk: Computing minimum and penetration distance between
	convex polyhedra},
  booktitle = {International Conference Robotics Automation},
  year = {1997},
  pages = {3112--3117}
}

@BOOK{Campbell90,
  title = {The Improbable Machine},
  publisher = {Simon \& Schuster},
  year = {1990},
  author = {Jeremy Campbell}
}

@INPROCEEDINGS{CanisiusSp07,
  author = {Canisius, Sander and Sporleder, Caroline},
  title = {Bootstrapping Information Extraction from Field Books},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {827--836},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1087}
}

@INPROCEEDINGS{CanisiusTj07,
  author = {Canisius, Sander and Tjong Kim Sang, Erik},
  title = {A Constraint Satisfaction Approach to Dependency Parsing},
  booktitle = {CoNLL Shared Task Session of EMNLP-CoNLL},
  year = {2007},
  pages = {1124--1128},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1121}
}

@PHDTHESIS{Cannon92,
  author = {D.~J. Cannon},
  title = {Point-And-Direct Telerobotics: Object Level Strategic Supervisory
	Control in Unstructured Interactive Human-Machine System Environments},
  school = {Stanford Mechanical Engineering},
  year = {1992}
}

@INPROCEEDINGS{CannyRe87,
  author = {J. Canny and J. H. Reif},
  title = {New lower bound techniques for robot motion planning problems},
  booktitle = FOCS,
  year = {1987},
  pages = {49--60}
}

@INPROCEEDINGS{CSSYC07,
  author = {B. Cao and D. Shen and J. Sun and Q. Yang and Z. Chen},
  title = {Feature selection in kernel space},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {121--128},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{CQLTL07,
  author = {Z. Cao and T. Qin and T. Liu and M. Tsai and H. Li},
  title = {Learning to rank: from pairwise approach to listwise approach},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {129--136},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@ARTICLE{CarbonaraSl99,
  author = {Leonardo Carbonara and Derek Sleeman},
  title = {Effective and Efficient Knowledge Base Refinement},
  journal = {Machine Learning},
  year = {1999},
  volume = {37},
  pages = {143--181},
  number = {2},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{CarbonaraSl96,
  author = {Leonardo Carbonara and Derek Sleeman},
  title = {Improving the efficiency of knowledge base refinement},
  booktitle = ICML,
  year = {1996},
  pages = {78--86},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{Carbonell92,
  author = {Jaime Carbonell},
  title = {Machine Learning: {A} Maturing Field},
  journal = {Machine Learning},
  year = {1992},
  volume = {9},
  pages = {5--7},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{CarbonellYaCo00,
  author = {Jaime Carbonell and Yiming Yang and William Cohen},
  title = {Special Issue of Machine Learning on Information Retrieval Introduction},
  journal = {Machine Learning},
  year = {2000},
  volume = {39},
  pages = {99--101},
  number = {2/3},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{Carbonell88,
  author = {Carbonell, J. G. and Brown, R. D.},
  title = {Anaphora resolution: A multi strategy approach},
  booktitle = COLING,
  year = {1988}
}

@INPROCEEDINGS{CarbonellBr88,
  author = {Carbonell, J. G. and Brown, R. D.},
  title = {Anaphora resolution: A multi strategy approach},
  booktitle = COLING,
  year = {1988}
}

@INPROCEEDINGS{CarbonellGi87,
  author = {J. G. Carbonell and Y. Gil},
  title = {Learning by Experimentation},
  booktitle = {International Workshop on Machine},
  year = {1987},
  pages = {256--266},
  month = jun,
  publisher = {Morgan Kaufmann}
}

@INCOLLECTION{Cardie96,
  author = {Cardie, C.},
  title = {Embedded Machine Learning Systems for natural language processing:
	A general framework},
  booktitle = {Connetionist, Statistics and Symbolic Approaches to Learning for
	natural language processing, {L}ecture {N}otes in {A}rtificial {I}ntelligence},
  publisher = {Springer},
  year = {1996},
  editor = {S. Wertment and E. Riloff and G. Scheler},
  pages = {315--328}
}

@PHDTHESIS{Cardie94,
  author = {Cardie, C.},
  title = {Domain Specific Knowledge Acquisition for Conceptual sentence analysis},
  school = {Dept of Computer Science, University of Massachusetts},
  year = {1994},
  note = {Technical report CMPSCI-94-74, 1994}
}

@INPROCEEDINGS{CardieHo97,
  author = {Claire Cardie and Nicholas Howe},
  title = {Improving minority class prediction using case-specific feature weights},
  booktitle = ICML,
  year = {1997},
  pages = {57--65},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{CardieMaPi99,
  author = {Claire Cardie and Scott Mardis and David Pierce},
  title = {Combining error-driven pruning and classification for partial parsing},
  booktitle = ICML,
  year = {1999},
  pages = {87--96},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{CardiePi98,
  author = {Cardie, C. and D. Pierce},
  title = {Error-Driven Pruning of {T}reebanks grammars for Base Noun Phrase
	Identification},
  booktitle = ACL,
  year = {1998},
  pages = {218--224}
}

@INPROCEEDINGS{CYTT92,
  author = {M. Carignan and Y. Yang and N. Magnenat Thalmann and D. Thalmann},
  title = {Dressing Animated Actors with Complex Deformable Clothes},
  booktitle = {ACM SIGGRAPH},
  year = {1992},
  pages = {99-104}
}

@TECHREPORT{CCRR99,
  author = {Andrew J. Carlson and Chad M. Cumby and Jeff L. Rosen and Dan Roth},
  title = {The {SNoW} Learning Architecture},
  institution = {UIUC Computer Science Department},
  year = {1999},
  number = {UIUCDCS-R-99-2101},
  month = {May},
  owner = {dxquang},
  timestamp = {2010.12.12},
  url = {http://l2r.cs.uiuc.edu/~danr/Papers/CCRR99.pdf}
}

@INCOLLECTION{Carlson98,
  author = {G. Carlson},
  title = {Thematic roles and the individuation of events},
  booktitle = {Events and Grammar},
  publisher = {Kluwer},
  year = {1998},
  editor = {S. D. Rothstein},
  pages = {35-51},
  address = {Dordrecht}
}

@BOOK{Carpenter92,
  title = {The Logic of Typed Feature Structures},
  publisher = {Cambridge University Press},
  year = {1992},
  author = {Bob Carpenter},
  address = {Cambridge, England}
}

@INPROCEEDINGS{CarpuatWu07,
  author = {Carpuat, Marine and Wu, Dekai},
  title = {Improving Statistical Machine Translation Using Word Sense Disambiguation},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {61--72},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1007}
}

@INPROCEEDINGS{CarrascoOn94,
  author = {R. Carrasco and J. Oncina},
  title = {Learning stochastic regular grammars by means of a state merging
	method},
  booktitle = ICGI,
  year = {1994},
  volume = {862},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {139--150},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{CarrascoOnCa98,
  author = {R. C. Carrasco and J. Oncina and J. Calera},
  title = {Stochastic inference of regular tree languages},
  booktitle = {International Workshop on Algorithmic Learning},
  year = {1998},
  volume = {1433},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {187--198},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Carreras07,
  author = {Carreras, Xavier},
  title = {Experiments with a Higher-Order Projective Dependency Parser},
  booktitle = {CoNLL Shared Task Session of EMNLP-CoNLL},
  year = {2007},
  pages = {957--961},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1101}
}

@INPROCEEDINGS{CarrerasM05,
  author = {X. Carreras and L. M\`{a}rquez},
  title = {Introduction to the {CoNLL}-2005 Shared Task: Semantic Role Labeling},
  booktitle = CoNLL,
  year = {2005},
  pages = {152--164},
  address = {Ann Arbor, Michigan},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/W/W05/W05-0620}
}

@INPROCEEDINGS{CarrerasM04,
  author = {X. Carreras and L. M\`{a}rquez},
  title = {Introduction to the {CoNLL}-2004 Shared Tasks: Semantic Role Labeling},
  booktitle = CoNLL,
  year = {2004},
  pages = {89--97},
  publisher = {Boston, MA, USA}
}

@INPROCEEDINGS{CarrerasM04a,
  author = {X. Carreras and L. M\`{a}rquez},
  title = {Online Learning via Global Feedback for Phrase Recognition},
  booktitle = NIPS,
  year = {2004},
  publisher = {MIT Press}
}

@ARTICLE{Caruana97,
  author = {Rich Caruana},
  title = {Multitask learning},
  journal = {Machine Learning},
  year = {1997},
  volume = {28},
  pages = {41--75},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{Caruana96,
  author = {Rich Caruana},
  title = {Algorithms and applications for multitask learning},
  booktitle = ICML,
  year = {1996},
  pages = {87--95},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{CaruanaFr94,
  author = {Rich Caruana and Dayne Freitag},
  title = {Greedy attribute selection},
  booktitle = ICML,
  year = {1994},
  pages = {28--36},
  publisher = {Morgan Kaufmann}
}

@UNPUBLISHED{Cary01,
  author = {M. Cary},
  title = {Towards optimal $\epsilon$-approximate nearest neighbor algorithms
	in constant dimnesions},
  note = {from web page},
  year = {2001},
  annote = {{691}}
}

@ARTICLE{Case99,
  author = {John Case},
  title = {The Power of Vacillation in Language Learning},
  journal = {{SIAM} J. Comput.},
  year = {1999},
  volume = {28},
  pages = {1941--1969},
  number = {6}
}

@ARTICLE{Case94,
  author = {J. Case},
  title = {Infinitary Self-Reference in Learning Theory},
  journal = {J. of Experimental and Theoret. Artif. Intell.},
  year = {1994},
  volume = {6},
  pages = {3--36},
  number = {1},
  note = {Special issue for AII '92},
  comment = {Supersedes University of Delaware TR-93-15}
}

@INPROCEEDINGS{Case88,
  author = {J. Case},
  title = {The power of vacillation},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1988},
  pages = {196--205},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@INCOLLECTION{Case86,
  author = {J. Case},
  title = {Learning Machines},
  booktitle = {Language Learning and Concept Acquisition},
  publisher = {Ablex Publishing Company},
  year = {1986}
}

@ARTICLE{Case82,
  author = {J. Case},
  title = {Problems in Inductive Inference},
  journal = {Bulletin of the European Association for Theoretical Computer Science},
  year = {1982},
  volume = {18},
  pages = {117--118}
}

@ARTICLE{Case74,
  author = {J. Case},
  title = {Periodicity in generations of automata},
  journal = {Math. Syst. Theory},
  year = {1974},
  volume = {8},
  pages = {15--32}
}

@ARTICLE{CaseChJa92,
  author = {J. Case and K. J. Chen and S. Jain},
  title = {Strong Separation of Learning Classes},
  journal = {J. of Experimental and Theoret. Artif. Intell.},
  year = {1992},
  volume = {4},
  pages = {281--293},
  annote = {Was in {\sl Analogical and Inductive Inference, International Workshop
	AII'92}, Dagstuhl Castle, Germany. Lecture Note in AI 642, October
	1992}
}

@INPROCEEDINGS{CaseChJa99,
  author = {John Case and Keh-Jiann Chen and Sanjay Jain},
  title = {Costs of General Purpose Learning},
  booktitle = STACS,
  year = {1999},
  volume = {1563},
  series = {Lecture Notes in Computer Science},
  pages = {424--433},
  publisher = {Springer-Verlag}
}

@UNPUBLISHED{CaseCh86,
  author = {J. Case and H. Chi},
  title = {Machine Learning of Nearly Minimal Size Grammars},
  note = {Unpublished Manuscript},
  year = {1986}
}

@ARTICLE{CaseFu83,
  author = {J. Case and M. Fulk},
  title = {Solution to inductive inference problem {P3}},
  journal = {Bulletin of the European Association for Theoretical Computer Science},
  year = {1983},
  volume = {19},
  pages = {8}
}

@ARTICLE{CaseFu99,
  author = {J. Case and M. A. Fulk},
  title = {Maximal machine learnable classes},
  journal = {J. of Comput. Syst. Sci.},
  year = {1999},
  volume = {58},
  pages = {211--214},
  number = {1}
}

@INPROCEEDINGS{CaseJa98,
  author = {J. Case and S. Jain},
  title = {Synthesizing Learners Tolerating Computable Noisy Data},
  booktitle = ALT,
  year = {1998},
  volume = {1501},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {205--219},
  publisher = {Springer-Verlag}
}

@ARTICLE{CJLZ99,
  author = {J. Case and S. Jain and S. Lange and T. Zeugmann},
  title = {Incremental concept learning for bounded data mining},
  journal = {Inform. Comput.},
  year = {1999},
  volume = {152},
  pages = {74--110},
  number = {1}
}

@ARTICLE{CaseJaMa94,
  author = {J. Case and S. Jain and S. Ngo Manguelle},
  title = {Refinements of Inductive Inference by Popperian and Reliable Machines},
  journal = {Kybernetika},
  year = {1994},
  volume = {30--1},
  pages = {23--52}
}

@ARTICLE{CJOSS00,
  author = {John Case and Sanjay Jain and Matthias Ott and Arun Sharma and Frank
	Stephan},
  title = {Robust Learning Aided by Context},
  journal = {J. of Comput. Syst. Sci.},
  year = {2000},
  volume = {60},
  pages = {234--257},
  number = {2},
  note = {Special Issue for COLT '98}
}

@INPROCEEDINGS{CaseJaSh97,
  author = {John Case and Sanjay Jain and Arun Sharma},
  title = {Synthesizing noise-tolerant language learners},
  booktitle = ALT,
  year = {1997},
  volume = {1316},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {228--243},
  publisher = {Springer-Verlag}
}

@ARTICLE{CaseJaSh95,
  author = {J. Case and S. Jain and A. Sharma},
  title = {Complexity Issues for Vacillatory Function Identification},
  journal = {Inform. Comput.},
  year = {1995},
  volume = {116},
  annote = {Earlier version in {\it Proceedings, Foundations of Software Technology
	and Theoretical Computer Science, Eleventh Conference, New Delhi,
	India. Lecture Notes in Computer Science 560 } in 1991},
  comment = {Supersedes {U}niversity of {D} TR 92-10}
}

@INPROCEEDINGS{CaseJaSh95a,
  author = {John Case and Sanjay Jain and Arun Sharma},
  title = {Machine induction without revolutionary paradigm shifts},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1995},
  pages = {153--168},
  publisher = {Springer-Verlag}
}

@ARTICLE{CaseJaSh94,
  author = {John Case and Sanjay Jain and Arun Sharma},
  title = {Vacillatory learning of nearly-minimal size grammars},
  journal = {J. of Comput. Syst. Sci.},
  year = {1994},
  volume = {49},
  pages = {189--207},
  number = {2}
}

@ARTICLE{CaseJaSh92,
  author = {J. Case and S. Jain and A. Sharma},
  title = {On Learning Limiting Programs},
  journal = {Internat. J. of Found. of Comput. Sci.},
  year = {1992},
  volume = {3},
  pages = {93--115},
  number = {1},
  annote = {Was in COLT92 and was University of Deleware TR 92-05}
}

@INPROCEEDINGS{CaseJaSh90,
  author = {J. Case and S. Jain and A. Sharma},
  title = {Anomalous Learning Helps Succinctness},
  booktitle = {Workshop on Algorithmic Learning Theory},
  year = {1990},
  pages = {282--288},
  month = oct,
  publisher = {Japanese Society for Artificial Intelligence},
  annote = {Was Tech Report 93-01 from Univ. of Deleware in 1993}
}

@ARTICLE{CaseJaSt00,
  author = {John Case and Sanjay Jain and Frank Stephan},
  title = {Vacillatory and {BC} learning on noisy data},
  journal = {Theoret. Comput. Sci.},
  year = {2000},
  volume = {241},
  pages = {115--141},
  number = {1-2},
  note = {Special issue for ALT '96}
}

@INPROCEEDINGS{CaseJaSu97,
  author = {John Case and Sanjay Jain and Mandayam Suraj},
  title = {Control structures in hypothesis spaces: the influence on learning},
  booktitle = EuroCOLT,
  year = {1997},
  pages = {286--300},
  publisher = {Springer-Verlag}
}

@ARTICLE{CKKK97,
  author = {John Case and Susanne Kaufmann and Efim B. Kinber and Martin Kummer},
  title = {Learning Recursive Functions from Approximations},
  journal = {J. Comput. Syst. Sci.},
  year = {1997},
  volume = {55},
  pages = {183--196},
  number = {1},
  note = {First appeared in EuroCOLT '95}
}

@INPROCEEDINGS{CKSS97,
  author = {John Case and Efim B. Kinber and Arun Sharma and Frank Stephan},
  title = {On the Classification of Computable Languages},
  booktitle = STACS,
  year = {1997},
  volume = {1200},
  series = {Lecture Notes in Computer Science},
  pages = {225--236},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{CaseLy82,
  author = {J. Case and C. Lynes},
  title = {Inductive inference and language identification},
  booktitle = ICALP,
  year = {1982},
  pages = {107--115},
  publisher = {Springer Verlag}
}

@INPROCEEDINGS{CaseLy82a,
  author = {J. Case and C. Lynes},
  title = {Machine Inductive Inference and Language Identification},
  booktitle = ICALP,
  year = {1982},
  volume = {140},
  pages = {107--115},
  publisher = {Springer-Verlag, Berlin}
}

@INPROCEEDINGS{CaseMaJa93,
  author = {J. Case and S. Mandayam and S. Jain},
  title = {Not-So-Nearly-Minimal-Size Program Inference},
  booktitle = {Workshop on Algorithmic Learning Theory},
  year = {1993},
  month = oct,
  publisher = {Japanese Society for Artificial Intelligence},
  note = {To Appear}
}

@TECHREPORT{CaseNg79,
  author = {J. Case and S. Ngo-Manguelle},
  title = {Refinements of inductive inference by Popperian machines},
  institution = {SUNY Buffalo, Dept. of Computer Science},
  year = {1979},
  number = {152}
}

@INPROCEEDINGS{COSS98,
  author = {J. Case and M. Ott and A. Sharma and F. Stephan},
  title = {Learning to Win Process-Control Games Watching Game-Masters},
  booktitle = ALT,
  year = {1998},
  volume = {1501},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {31--45},
  publisher = {Springer-Verlag}
}

@ARTICLE{CaseSm83,
  author = {J. Case and C. Smith},
  title = {Comparison of Identification Criteria for Machine Inductive Inference},
  journal = {Theoret. Comput. Sci.},
  year = {1983},
  volume = {25},
  pages = {193--220},
  annote = {Was in STOC78}
}

@BOOK{CasellaBe90,
  title = {Introduction to Statistical Inference},
  publisher = {The Wadworth \& Brooks/Cole Publishing Company},
  year = {1990},
  author = {Casella, G. and Berger, R. L.},
  comment = {Good elementary text book}
}

@ARTICLE{CBCFFSW95,
  author = {M. C. Caselli and E. Bates and P. Casadio and J. Fenson and L. Fenson
	and L. Sanderl and J. Weir},
  title = {A cross-linguistic study of early lexical development},
  journal = {Cognitive Development},
  year = {1995},
  volume = {10},
  pages = {159-199}
}

@INPROCEEDINGS{Castellanos98,
  author = {Antonio Castellanos},
  title = {Approximate learning of random subsequential transducers},
  booktitle = {International Workshop on Algorithmic Learning},
  year = {1998},
  volume = {1433},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {67--78},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{CastilloGuHa96,
  author = {E. Castillo and J. Guti{\'e}rrez and A. S. Hadi},
  title = {Goal Oriented Symbolic Propagation in Bayesian Networks},
  booktitle = AAAI,
  year = {1996},
  pages = {1263-1268}
}

@ARTICLE{CGHS97,
  author = {E. Castillo and J. Guti{\'e}rrez and A. S. Hadi and C. Solares},
  title = {Symbolic propagation and sensitivity analysis in Gaussian Bayesian
	networks with application to damage assessment},
  journal = {AI in Engineering},
  year = {1997},
  volume = {11},
  pages = {173-181},
  number = {2},
  bibsource = {DBLP, http://dblp.uni-trier.de},
  ee = {http://dx.doi.org/10.1016/S0954-1810(96)00030-1}
}

@INPROCEEDINGS{CastilloGuHa96a,
  author = {Enrique Castillo and Jos{\'e} Manuel Guti{\'e}rrez and Ali S. Hadi},
  title = {Goal Oriented Symbolic Propagation in Bayesian Networks},
  booktitle = {AAAI/IAAI, Vol. 2},
  year = {1996},
  pages = {1263-1268},
  bibsource = {DBLP, http://dblp.uni-trier.de},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@ARTICLE{CastilloHaSo97,
  author = {Enrque Castillo and Ali S. Hadi and Cristina Solares},
  title = {Learning and Updating of Uncertainty in Dirichlet Models},
  journal = {Machine Learning},
  year = {1997},
  volume = {26},
  pages = {43--63},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{CastroBa95,
  author = {Jorge Castro and Jos{\'e} L. Balc{\'a}zar},
  title = {Simple {PAC} learning of simple decision lists},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1995},
  pages = {239--248},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{CastroGuLa97,
  author = {Jorge Castro and David Guijarro and Victor Lavin},
  title = {Learning nearly monotone $k$-term {DNF}},
  booktitle = EuroCOLT,
  year = {1997},
  pages = {162--170},
  publisher = {Springer-Verlag}
}

@ARTICLE{Castellani89,
  author = {Ilaria Catellani and Matthew Hennessy},
  title = {Distributed Bisimulations},
  journal = jacm,
  year = {1989},
  volume = {36},
  pages = {887-911},
  number = {4},
  month = oct,
  keywords = {Programming Languages and Methodology; Theory; Verification; algebraic;
	concurrent processes; noninterleaving; observational equivalence;}
}

@INPROCEEDINGS{CazzantiGu07,
  author = {L. Cazzanti and M. Gupta},
  title = {Local similarity discriminant analysis},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {137--144},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@ARTICLE{Cedrone92,
  author = {L. Cedrone},
  title = {Primed {F}or {B}last-{O}ff},
  journal = {Bobbin},
  year = {1992},
  volume = {March},
  pages = {43-48}
}

@BOOK{CensorZe97,
  title = {Parallel Optimization --- Theory, Algorithms, and Applications},
  publisher = {Oxford University Press},
  year = {1997},
  author = {Y. Censor and S. A. Zenios}
}

@ARTICLE{CenzerMo98,
  author = {Douglas A. Cenzer and William R. Moser},
  title = {A Good Oracle Is Hard to Beat},
  journal = {Algorithmica},
  year = {1998},
  volume = {22},
  pages = {18--34},
  number = {1/2}
}

@INPROCEEDINGS{CenzerMo95,
  author = {Douglas A. Cenzer and William R. Moser},
  title = {Inductive inference of functions on the rationals},
  booktitle = COLT,
  year = {1995},
  pages = {178--181},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{Cesa-Bianchi97,
  author = {Nicol{\`o} Cesa-Bianchi},
  title = {Analysis of two gradient-based algorithms for on-line regression},
  booktitle = COLT,
  year = {1997},
  pages = {163--170},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{Cesa-Bianchi90,
  author = {N. Cesa-Bianchi},
  title = {Learning the Distribution in the Extended {PAC} Model},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1990},
  pages = {236--246},
  organization = {Japanese Society for Artificial Intelligence}
}

@INPROCEEDINGS{Cesa-BianchiFi98,
  author = {Nicol{\`o} Cesa-Bianchi and Paul Fischer},
  title = {Finite-time regret bounds for the multiarmed bandit problem},
  booktitle = ICML,
  year = {1998},
  pages = {100--108},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{CFSS97,
  author = {Nicol{\`o} Cesa-Bianchi and Paul Fischer and Eli Shamir and Hans
	Ulrich Simon},
  title = {Randomized hypotheses and minimum disagreement hypotheses for learning
	with noise},
  booktitle = EuroCOLT,
  year = {1997},
  pages = {119--133},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{CBFHHSW95,
  author = {N.~Cesa-Bianchi and Y.~Freund and D.~P. Helmbold and D.~Haussler
	and R.~E. Schapire and M.~K. Warmuth},
  title = {How to use expert advice},
  booktitle = STOC,
  year = {1995},
  pages = {382--391}
}

@ARTICLE{CBFHHSW97,
  author = {N.~Cesa-Bianchi and Y.~Freund and D.~P. Helmbold and D.~Haussler
	and R.~E. Schapire and M.~K. Warmuth},
  title = {How to use expert advice},
  journal = JACM,
  year = {1994},
  volume = {44},
  pages = {427--485},
  number = {3}
}

@INPROCEEDINGS{CBFHW94,
  author = {N. Cesa-Bianchi and Y. Freund and D. P. Helmbold and M. Warmuth},
  title = {On-line Prediction and Conversion Strategies},
  booktitle = EuroCOLT,
  year = {1994},
  volume = {New Series Number 53},
  series = {The Institute of Mathematics and its Applications Conference Series},
  pages = {205--216},
  address = {Oxford},
  publisher = {Oxford University Press},
  isbn = {0 19 853492 2}
}

@ARTICLE{CFHW96,
  author = {Nicolo Cesa-Bianchi and Yoav Freund and David P. Helmbold and Manfred
	K. Warmuth},
  title = {On-line Prediction and Conversion Strategies},
  journal = {Machine Learning},
  year = {1996},
  volume = {25},
  pages = {71--110},
  note = {An extended abstract appeared in {\em EuroColt `93}},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Cesa-BianchiHePa98,
  author = {Nicol{\`o} Cesa-Bianchi and David P. Helmbold and Sandra Panizza},
  title = {On {B}ayes Methods for On-Line {B}oolean Prediction},
  journal = {Algorithmica},
  year = {1998},
  volume = {22},
  pages = {112--137},
  number = {1/2},
  comment = {first in 9th COLT '96}
}

@ARTICLE{Cesa-BianchiKrWa94,
  author = {N. Cesa-Bianchi and A. Krogh and M. K. Warmuth},
  title = {Bounds on approximate steepest descent for likelihood maximization
	in exponential families},
  journal = {{\em IEEE Transaction on Information Processing}},
  year = {1994},
  volume = {40},
  pages = {1215--1220},
  number = {4},
  month = jul
}

@INPROCEEDINGS{Cesa-BianchiLoWa93,
  author = {N. Cesa-Bianchi and P. Long and M. Warmuth},
  title = {Worst-case quadratic loss bounds for a generalization of the {W}idrow-{H}off
	rule},
  booktitle = COLT,
  year = {1993},
  pages = {429--438},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{Cesa-BianchiLoWa95,
  author = {N. Cesa-Bianchi and P. Long and M. K. Warmuth},
  title = {Worst-case quadratic loss bounds for on-line prediction of linear
	functions by gradient descent},
  journal = {IEEE Transactions on Neural Networks},
  year = {1995},
  note = {To appear. An extended abstract appeared in COLT '93.}
}

@INPROCEEDINGS{Cesa-BianchiLu99,
  author = {Nicol{\`o} Cesa-Bianchi and G{\'a}bor Lugosi},
  title = {Minimax regret under log loss for general classes of experts},
  booktitle = COLT,
  year = {1999},
  pages = {12--18},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{Cesa-BianchiLu98,
  author = {Nicol{\`o} Cesa-Bianchi and G{\'a}bor Lugosi},
  title = {On sequential prediction of individual sequences relative to a set
	of experts},
  booktitle = COLT,
  year = {1998},
  pages = {1--11},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{CestnikBr87,
  author = {I. K. {Cestnik, B} and I. Bratko},
  title = {Assistant 86: {A} Knowledge-Elicitation Tool for Sophisticated Users},
  booktitle = {Progress in Machine Learning--Proceedings of EWSL 87: 2nd European
	Working Session on Learning},
  year = {1987},
  pages = {31--45},
  address = {Bled, Yogoslavia},
  month = may
}

@INPROCEEDINGS{CDAR97,
  author = {Chakrabarti, S. and Dom, B. and Agrawal, R. and Raghavan, P.},
  title = {Using Taxonomy, Discriminants, and Signatures for Navigating in Text
	Databases},
  booktitle = {VLDB},
  year = {1997},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@INPROCEEDINGS{MacCartneyGrMaCeMa07,
  author = {Chambers, N. and Cer, D. and Grenager, T. and Hall, D. and Kiddon,
	C. and MacCartney, B. and de Marneffe, M. and Ramage, D. and Yeh,
	E. and Manning, C.},
  title = {Learning Alignments and Leveraging Natural Logic},
  booktitle = {ACL-PASCAL Workshop on Textual Entailment and Paraphrasing},
  year = {2007},
  pages = {165--170},
  address = {Prague},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/W/W07/W07-1427}
}

@INPROCEEDINGS{CCGHKMMRYM07,
  author = {Chambers, N. and Cer, D. and Grenager, T. and Hall, D. and Kiddon,
	C. and MacCartney, B. and de Marneffe, M. and Ramage, D. and Yeh,
	E. and Manning, C. D.},
  title = {Learning Alignments and Leveraging Natural Logic},
  booktitle = {ACL-PASCAL Workshop on Textual Entailment and Paraphrasing},
  year = {2007},
  pages = {165--170},
  address = {Prague},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/W/W07/W07-1427}
}

@INPROCEEDINGS{ChambersJu08,
  author = {N. Chambers and D. Jurafsky},
  title = {Jointly Combining Implicit Constraints Improves Temporal Ordering},
  booktitle = EMNLP,
  year = {2008}
}

@INPROCEEDINGS{ChanVaLa07,
  author = {A. Chan and N. Vasconcelos and G. Lanckriet},
  title = {Direct convex relaxations of sparse {SVM}},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {145--152},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@ARTICLE{Chan91,
  author = {Edward P. F. Chan and H{\'e}ctor J. Hern{\'a}ndez},
  title = {Independence-Reducible Database Schemes},
  journal = jacm,
  year = {1991},
  volume = {38},
  pages = {854-886},
  number = {4},
  month = oct,
  keywords = {Database Theory; Algorithms; Design; Theory; chase; constant-time
	maintainable schemes; functional dependencies; independent database
	scheme; query evaluation; representative instance; }
}

@INPROCEEDINGS{ChanSt95,
  author = {Philip K. Chan and Salvatore J. Stolfo},
  title = {A comparative evaluation of voting and meta-learning on partitioned
	data},
  booktitle = ICML,
  year = {1995},
  pages = {90--98},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{Chan00,
  author = {T.M.~Chan},
  title = {Approximating the Diameter, width, smallest enclosing cylinder and
	minimum-width annulus},
  booktitle = {SOCG},
  year = {2000},
  pages = {300--309}
}

@ARTICLE{Chan03,
  author = {T. M. Chan},
  title = {On levels in arrangements of curves},
  journal = DCG,
  year = {2003},
  volume = {29},
  pages = {375--393},
  nubmer = {3},
  url = {http://link.springer-ny.com/link/service/journals/00454/contents/02/2840/index.html}
}

@ARTICLE{Chan02,
  author = {T. M. Chan},
  title = {Approximating the Diameter, width, smallest enclosing cylinder and
	minimum-width annulus},
  journal = IJCGA,
  year = {2002},
  volume = {12},
  pages = {67--85},
  number = {2},
  url = {http://www.worldscinet.com/ijcga/12/1201n02/S0218195902000748.html}
}

@INPROCEEDINGS{Chan02a,
  author = {T. M. Chan},
  title = {Low-dimensional linear programming with violations},
  booktitle = FOCS,
  year = {2002},
  pages = {570--579},
  url = {http://www.math.uwaterloo.ca/~tmchan/pub.html}
}

@INPROCEEDINGS{Chan00b,
  author = {T. M. Chan},
  title = {On levels in arrangements of curves},
  booktitle = FOCS,
  year = {2000},
  pages = {??},
  nickname = {FOCS 2000}
}

@INPROCEEDINGS{Chan99,
  author = {T. M. Chan},
  title = {Dynamic Planar convex hull operations in near-logarithmic amortized
	time},
  booktitle = FOCS,
  year = {1999},
  pages = {92--99},
  nickname = {FOCS '99}
}

@UNPUBLISHED{Chan99b,
  author = {T. M. Chan},
  title = {Remarks on $k$-level algorithms in the plane},
  note = {manuscript. {\tt http://www}\hspace{0.001cm}{\tt.cs.uwaterloo.ca/}\hspace{0.001cm}{\tt{}{}{}{}{}{}{}\protect\raisebox{-0.1cm}{\symbol{'176}}}\hspace{0.001cm}{\tt{tmchan/pub.html}}},
  year = {1999}
}

@ARTICLE{Chan98,
  author = {T. M. Chan},
  title = {Approximate nearest neighbor queries revisited},
  journal = DCG,
  year = {1998},
  volume = {20},
  pages = {359--373}
}

@ARTICLE{Chan96,
  author = {T. M. Chan},
  title = {Output-Sensitive Results on Convex Hulls, Extreme Points, and Related
	Problems},
  journal = DCG,
  year = {1996},
  volume = {16},
  pages = {369--387}
}

@INPROCEEDINGS{ChanNg07,
  author = {Chan, Yee Seng and Ng, Hwee Tou},
  title = {Domain Adaptation with Active Learning for Word Sense Disambiguation},
  booktitle = ACL,
  year = {2007},
  pages = {49--56},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1007}
}

@INPROCEEDINGS{ChanNgCh07,
  author = {Chan, Yee Seng and Ng, Hwee Tou and Chiang, David},
  title = {Word Sense Disambiguation Improves Statistical Machine Translation},
  booktitle = ACL,
  year = {2007},
  pages = {33--40},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1005}
}

@ARTICLE{Chandrasekaran89,
  author = {B. Chandrasekaran},
  title = {Task-Structures, Knowledge Acquisition and Learning},
  journal = {Machine Learning},
  year = {1989},
  volume = {4},
  pages = {339--345},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Chandru91,
  author = {V. Chandru and J. N. Hooker},
  title = {Extended Horn Sets in Propositional Logic},
  journal = jacm,
  year = {1991},
  volume = {38},
  pages = {205-221},
  number = {1},
  month = jan,
  keywords = {Logic Programming; Algorithms; Theory; Horn clauses; propositional
	logic; }
}

@ARTICLE{ChangLa87,
  author = {Fu Chang and Tze Leung Lai},
  title = {Optimal Stopping and Dynamic Allocation},
  journal = {Advances in Applied Probability},
  year = {1987},
  volume = {19},
  pages = {829--853},
  comment = {Bandit problem}
}

@INPROCEEDINGS{CBGWB09,
  author = {J. Chang and J. Boyd-Graber and S. Gerrish and C. Wang and D. Blei},
  title = {Reading Tea Leaves: How Humans Interpret Topic Models},
  booktitle = NIPS,
  year = {2009}
}

@INPROCEEDINGS{CRRR08,
  author = {Ming-Wei Chang and Lev Ratinov and Nicholas Rizzolo and Dan Roth},
  title = {Learning and Inference with Constraints},
  booktitle = {Proceedings of AAAI-08},
  year = {2008},
  pages = {1513-1518},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@INPROCEEDINGS{ChangTo07,
  author = {Chang, Pi-Chuan and Toutanova, Kristina},
  title = {A Discriminative Syntactic Word Order Model for Machine Translation},
  booktitle = ACL,
  year = {2007},
  pages = {9--16},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1002}
}

@INPROCEEDINGS{ChangGa93,
  author = {Richard Chang and William I. Gasarch},
  title = {On bounded queries and approximation},
  booktitle = FOCS,
  year = {1993},
  pages = {547--556},
  publisher = {IEEE Computer Society Press, Los Alamitos, CA}
}

@ARTICLE{Chapman87,
  author = {Chapman, D.},
  title = {Planning for Conjuctive Goals},
  journal = {Artificial Intelligence},
  year = {1987},
  volume = {32}
}

@ARTICLE{ChapmanKo78,
  author = {R. S. Chapman and L. L. Kohn},
  title = {Comprehension strategies in two- and three-year-olds: Animate agents
	or probable events?},
  journal = {Journal of Speech and Hearing Research},
  year = {1978},
  volume = {21},
  pages = {746-761}
}

@INPROCEEDINGS{CCFM97,
  author = {M. Charikar and C. Chekuri and T. Feder and R. Motwani},
  title = {Incremental Clustering and Dynamic Information Retrieval},
  booktitle = STOC,
  year = {1997},
  pages = {626--635}
}

@INPROCEEDINGS{CGTS99,
  author = {Moses Charikar and Sudipto Guha and {\'{E}}va Tardos and David B.
	Shmoys},
  title = {A Constant-Factor Approximation Algorithm for the $k$-Median Problem
	(Extended Abstract)},
  booktitle = STOC,
  year = {1999},
  pages = {1--10},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{CKMN01,
  author = {M. Charikar and S. Khuller and D. M. Mount and G. Narasimhan},
  title = {Algorithms for facility location problems with outliers},
  booktitle = SODA,
  year = {2001},
  pages = {642--651}
}

@ARTICLE{Charnes53,
  author = {Charnes, A.},
  title = {Constrained Games and Linear Programming},
  journal = {Proceedings of the National Academy of Sciences of the United States
	of America},
  year = {1953},
  volume = {39},
  pages = {639--641},
  number = {7},
  month = {July},
  copyright = {Copyright 1953 National Academy of Sciences},
  keywords = {Mathematics},
  publisher = {National Academy of Sciences}
}

@INPROCEEDINGS{Charniak01,
  author = {E. Charniak},
  title = {Immediate-Head Parsing for Language Models},
  booktitle = ACL,
  year = {2001},
  pages = {116--123},
  address = {Toulouse, France}
}

@INPROCEEDINGS{Charniak00,
  author = {E. Charniak},
  title = {A Maximum-Entropy-Inspired Parser},
  booktitle = NAACL,
  year = {2000}
}

@INPROCEEDINGS{Charniak97,
  author = {Charniak, E.},
  title = {Statistical parsing with a context-free grammar and word statistics},
  booktitle = AAAI,
  year = {1997}
}

@ARTICLE{Charniak97a,
  author = {Charniak, E.},
  title = {Statistical techniques for natural language parsing},
  journal = {The AI Magazine},
  year = {1997}
}

@BOOK{Charniak93,
  title = {Statistical Language Learning},
  publisher = {MIT Press},
  year = {1993},
  author = {Charniak, E.}
}

@INPROCEEDINGS{CASGKMPPSWYZZ00,
  author = {Eugene Charniak and Yasemin Altun and Rodrigo de Salvo Braz and Benjamin
	Garrett and Margaret Kosmala and Tomer Moscovich and Lixin Pang and
	Changhee Pyo and Ye Sun and Wei Wy and Zhongfa Yang and Shawn Zeller
	and Lisa Zorn},
  title = {Reading Comprehension Programs in a Statistical-Language-Processing
	Class},
  booktitle = {ANLP-NAACL Workshop on Reading Comprehension Tests as Evaluation
	for Computer-Based Lanugage Understanding Systems},
  year = {2000},
  pages = {1--5},
  address = {Seattle, WA}
}

@INPROCEEDINGS{CharniakGo88,
  author = {Charniak, E. and R. P. Goldman},
  title = {A Logic for semantic interpretation},
  booktitle = ACL,
  year = {1988},
  pages = {87--94}
}

@INPROCEEDINGS{CharniakJo05,
  author = {Charniak, Eugene and Johnson, Mark},
  title = {Coarse-to-Fine n-Best Parsing and MaxEnt Discriminative Reranking},
  booktitle = ACL,
  year = {2005},
  pages = {173--180},
  address = {Ann Arbor, Michigan},
  publisher = {ACL}
}

@INPROCEEDINGS{ChaviraDaYa04,
  author = {Chavira, M. and Darwiche, A. and Yaeger, M.},
  title = {Compiling Relational {Bayesian} Networks for Exact Inference},
  booktitle = {European Workshop on Probabilistic Graphical Models},
  year = {2004},
  pages = {49--56}
}

@BOOK{Chazelle00,
  title = {The Discrepancy Method},
  publisher = {Cambridge University Press},
  year = {2000},
  author = {B. Chazelle},
  url = {http://www.cs.princeton.edu/~chazelle/book.html}
}

@ARTICLE{Chazelle93,
  author = {B. Chazelle},
  title = {Cutting hyperplanes for divide-and-conquer},
  journal = DCG,
  year = {1993},
  volume = {9},
  pages = {145--158},
  number = {2},
  annote = {266},
  keywords = {partition, divide-and-conquer, hyperplanes}
}

@INPROCEEDINGS{Chazelle91,
  author = {B. Chazelle},
  title = {An optimal convex hull algorithm and new results on cuttings},
  booktitle = FOCS,
  year = {1991},
  pages = {29--38}
}

@ARTICLE{Chazelle90,
  author = {Bernard Chazelle},
  title = {Lower Bounds for Orthogonal Range Searching {I}: The Reporting Case},
  journal = jacm,
  year = {1990},
  volume = {37},
  pages = {200-212},
  number = {2},
  month = apr,
  keywords = {Computational Geometry; Algorithms; Theory; }
}

@ARTICLE{Chazelle90a,
  author = {Bernard Chazelle},
  title = {Lower Bounds for Orthogonal Range Searching {II}: The Arithmetic
	Model},
  journal = jacm,
  year = {1990},
  volume = {37},
  pages = {439-463},
  number = {3},
  month = jul,
  keywords = {Computational Geometry; Algorithms; Theory; }
}

@ARTICLE{Chazelle84,
  author = {B. Chazelle},
  title = {Convex partitions of polyhedra: a lower bound and worst-case optimal
	algorithm},
  journal = SICOMP,
  year = {1984},
  volume = {13},
  pages = {488--507}
}

@ARTICLE{Chazelle92,
  author = {Bernard Chazelle and Herbert Edelsbrunner},
  title = {An Optimal Algorithm for Intersecting Line Segments in the Plane},
  journal = jacm,
  year = {1992},
  volume = {39},
  pages = {1-54},
  number = {1},
  month = jan,
  keywords = {Computational Geometry; Algorithms; Theory; }
}

@INPROCEEDINGS{ChazelleEd88,
  author = {B. Chazelle and H. Edelsbrunner},
  title = {An optimal algorithm for intersecting line segments in the plane},
  booktitle = FOCS,
  year = {1988},
  pages = {590--600},
  keywords = {intersection, topological sweep, segments}
}

@ARTICLE{CEGGHSS94,
  author = {B.~Chazelle and H.~Edelsbrunner and M. Grigni and L. J.~Guibas and
	J. Hershberger and M.~Sharir and J.~Snoeyink},
  title = {Ray shooting in polygons using geodesic triangulations},
  journal = {Algorithmica},
  year = {1994},
  volume = {12},
  pages = {54--68}
}

@ARTICLE{ChazelleGu86,
  author = {B. Chazelle and L. J. Guibas},
  title = {Fractional cascading: {I}. {A} data structuring technique},
  journal = {Algorithmica},
  year = {1986},
  volume = {1},
  pages = {133--162},
  number = {3}
}

@ARTICLE{ChazelleGuLe85,
  author = {B. Chazelle and L. J. Guibas and D. T. Lee},
  title = {The power of geometric duality},
  journal = {BIT},
  year = {1985},
  volume = {25},
  pages = {76--90}
}

@INPROCEEDINGS{CLHLQLL08,
  author = {Che, W. and Li, Z. and Hu, Y. and Li, Y. and Qin, B. and Liu, T.
	and Li, S.},
  title = {A Cascaded Syntactic and Semantic Dependency Parsing System},
  booktitle = CoNLL,
  year = {2008},
  pages = {238--242},
  address = {Manchester, England},
  month = {August},
  publisher = {Coling 2008 Organizing Committee},
  url = {http://www.aclweb.org/anthology/W08-2134}
}

@INBOOK{CKSTF,
  pages = {206--306},
  title = {Autoclass: A Bayesian Classification System},
  publisher = {Morgan Kaufmann},
  editor = {Jude W. Shavlik and Thomas G. Dietterich},
  author = {Cheeseman, Peter and James Kelly and Matthew Self andJohn Stutz and
	Will Taylor and Don Freeman},
  address = {San Mateo, California},
  booktitle = {Readings in Machine Learning}
}

@ARTICLE{Cheeseman88,
  author = {Cheeseman, Peter C.},
  title = {An inquiry into computer understanding},
  journal = {Computational Intelligence},
  year = {1988},
  volume = {4},
  pages = {58--66},
  number = {1},
  month = Feb,
  comment = {More defense of Bayesian inference}
}

@INPROCEEDINGS{Cheeseman85,
  author = {Cheeseman, Peter C.},
  title = {In Defense of Probability},
  booktitle = IJCAI,
  year = {1985},
  pages = {1002--1009},
  comment = {Argues in favor of subjective Bayesianism by refuting some common
	misconceptions.}
}

@INPROCEEDINGS{Cheeseman84,
  author = {P. C. Cheeseman},
  title = {Learning of Expert Systems from Data},
  booktitle = {Workshop on Principles of Knowledge-Based Systems},
  year = {1984},
  pages = {115--122},
  month = dec,
  comment = {Describes a `message-length' approach to inferring significant contingencies
	in a contingency table.}
}

@INPROCEEDINGS{Cheeseman83,
  author = {Cheeseman, Peter C.},
  title = {A Method of Computing Generalized Bayesian Probability Values for
	Expert Systems},
  booktitle = {Eighth International Conference on Artificial Intelligence},
  year = {1983},
  pages = {198--202},
  month = Aug,
  comment = {Describes iterative graph-oriented method for computing a maximum-entropy
	distribution subject to constraints.}
}

@INPROCEEDINGS{CheesemanSeKeTaFrSt88,
  author = {Cheeseman, Peter C. and Matthew Self andJim Kelly and Will Taylor
	and Don Freeman andJohn Stutz},
  title = {Bayesian Classification},
  booktitle = AAAI,
  year = {1988},
  pages = {607--611}
}

@INPROCEEDINGS{ChelbaAc04,
  author = {Chelba, Ciprian and Acero, Alex },
  title = {Adaptation of Maximum Entropy Capitalizer: Little Data Can Help a
	Lot},
  booktitle = SIGDAT,
  year = {2004},
  editor = {Lin, Dekang and Wu, Dekai },
  pages = {285--292},
  address = {Barcelona, Spain},
  month = {July},
  publisher = ACL,
  citeulike-article-id = {4036908},
  keywords = {domain-adaptation},
  posted-at = {2009-02-11 21:30:20},
  priority = {2}
}

@INPROCEEDINGS{ChelbaJe98,
  author = {C. Chelba and F. Jelinek },
  title = {Exploiting Syntactic Structure for Language Modeling},
  booktitle = COLING-ACL,
  year = {1998}
}

@INPROCEEDINGS{ChemuduguntaSmSt06,
  author = {Chemudugunta, C. and Smyth, P. and Steyvers, M.},
  title = {Modeling General and Specific Aspects of Documents with a Probabilistic
	Topic Model},
  booktitle = NIPS,
  year = {2006}
}

@INBOOK{CGSGCL95,
  chapter = {6},
  pages = {95--114},
  title = {A method for constructive learning of recurrent neural networks},
  publisher = {MIT Press},
  year = {1995},
  author = {Dong Chen and C. Lee Giles and Gordon Sun and Mark W. Goudreau and
	Hsing-Hen Chen and Yee-Chun Lee},
  volume = {III: Selecting Good Models},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@INPROCEEDINGS{ChenMo08,
  author = {D. Chen and R. Mooney},
  title = {Learning to sportscast: a test of grounded language acquisition},
  booktitle = ICML,
  year = {2008},
  pages = {128-135}
}

@INPROCEEDINGS{ChenSnBa07,
  author = {Chen, Erdong and Snyder, Benjamin and Barzilay, Regina},
  title = {Incremental Text Structuring with Online Hierarchical Ranking},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {83--91},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1009}
}

@ARTICLE{Chen75,
  author = {Chen, HJ},
  title = {Effects of biogenic amines and TRH on release of prolactin and TSH
	in the rat},
  journal = {Endocrinology},
  year = {1975},
  volume = {96},
  pages = {10--14},
  number = {1},
  publisher = {Endocrine Soc}
}

@INPROCEEDINGS{ChenHa91,
  author = {J. Chen and Y. Han},
  title = {Storing shortest paths for a polyhedron},
  booktitle = ICCI,
  year = {1991},
  editor = {F. Dehne and F. Fiala and W. W. Koczkodaj},
  pages = {169--80},
  publisher = {Springer-Verlag},
  annote = {99a}
}

@ARTICLE{ChenHa96,
  author = {J. Chen and Y. Han},
  title = {{Shortest paths on a polyhedron; Part I: computing shortest paths}},
  journal = {Int.\ J. Comput. Geom. \& Appl.},
  year = {1996},
  volume = {6},
  pages = {127--144},
  number = {2}
}

@INPROCEEDINGS{ChenHa90,
  author = {J. Chen and Y. Han},
  title = {Shortest paths on a polyhedron},
  booktitle = {SOCG},
  year = {1990},
  pages = {360--369},
  annote = {60}
}

@INPROCEEDINGS{ChenRa03,
  author = {J. Chen and O. Rambow},
  title = {Use of Deep Linguistic Features for the Recognition and Labeling
	of Semantic Arguments},
  booktitle = EMNLP,
  year = {2003},
  pages = {41--48},
  address = {Sapporo, Japan}
}

@PHDTHESIS{Chen81,
  author = {K. Chen},
  title = {Tradeoffs in Machine Inductive Inference},
  school = {SUNY at Buffalo},
  year = {1981},
  annote = {Also TR 178 from SUNY Buffalo Dept. of CS}
}

@ARTICLE{Chen82,
  author = {K. J. Chen},
  title = {Tradeoffs in the inductive inference of nearly minimal size programs},
  journal = {Inform. Control},
  year = {1982},
  volume = {52},
  pages = {68--86}
}

@ARTICLE{ChenMiSm96,
  author = {Peter C. Y. Chen and James K. Mills and Kenneth C. Smith},
  title = {Performance Improvement of Robot Continuous-Path Operation through
	Iterative Learning Using Neural Networks},
  journal = {Machine Learning},
  year = {1996},
  volume = {23},
  pages = {191--220},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{ChenLiZh07,
  author = {Chen, Qing and Li, Mu and Zhou, Ming},
  title = {Improving Query Spelling Correction Using Web Search Results},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {181--189},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1019}
}

@INPROCEEDINGS{Chen93,
  author = {Stanley Chen},
  title = {Aligning sentences in bilingual corpora using lexical information},
  booktitle = ACL,
  year = {1993}
}

@INPROCEEDINGS{ChenBeRo98,
  author = {S. F. Chen and D. Beeferman and R. Rosenfeld},
  title = {Evaluation Metrics for Language Models},
  booktitle = {DARPA Broadcast News Transcription and Understanding Workshop},
  year = {1998}
}

@INPROCEEDINGS{ChenGo96,
  author = {S. F. Chen and J. Goodman},
  title = {An Empirical Study of Smoothing Techniques for Language Modeling},
  booktitle = ACL,
  year = {1996},
  editor = {Arivind Joshi and Martha Palmer},
  pages = {310--318},
  address = {San Francisco},
  publisher = {Morgan Kaufmann Publishers}
}

@INPROCEEDINGS{ChenRo99,
  author = {S. F. Chen and R. Rosenfeld},
  title = {Efficient Sampling and Feature Selection in Whole Sentence Maximum
	Entropy Language Models},
  booktitle = ICASSP,
  year = {1999},
  address = {Phoenix, Arizona}
}

@INPROCEEDINGS{ChenZhIs07,
  author = {Chen, Wenliang and Zhang, Yujie and Isahara, Hitoshi},
  title = {A Two-Stage Parser for Multilingual Dependency Parsing},
  booktitle = {CoNLL Shared Task Session of EMNLP-CoNLL},
  year = {2007},
  pages = {1129--1133},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1122}
}

@INPROCEEDINGS{ChenJe07,
  author = {X. Chen and J. Jeong},
  title = {Minimum reference set based feature selection for small sample classifications},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {153--160},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{ChenMa07,
  author = {Chen, Ying and Martin, James},
  title = {Towards Robust Unsupervised Personal Name Disambiguation},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {190--198},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1020}
}

@INPROCEEDINGS{Chen94,
  author = {Z. Chen},
  title = {A note on learning {DNF} formulas using equivalence and incomplete
	membership queries},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1994},
  pages = {272--281},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Chen93a,
  author = {Z. Chen},
  title = {Learning unions of two rectangles in the plane with equivalence queries},
  booktitle = COLT,
  year = {1993},
  pages = {243--252},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{ChenAm99,
  author = {Z. Chen and F. Ameur},
  title = {The learnability of unions of two rectangles in the two-dimensional
	discretized space},
  journal = {J. of Comput. Syst. Sci.},
  year = {1999},
  volume = {59},
  pages = {70--83},
  number = {1}
}

@ARTICLE{ChenHo96,
  author = {Z. Chen and S. Homer},
  title = {The bounded injury priority method and the learnability of unions
	of rectangles},
  journal = {Ann. Pure and Applied Logic},
  year = {1996},
  volume = {77},
  pages = {143--168},
  number = {2}
}

@INPROCEEDINGS{ChenHo94,
  author = {Z. Chen and S. Homer},
  title = {On learning counting fuctions with queries},
  booktitle = COLT,
  year = {1994},
  pages = {218--227},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{ChenMa94,
  author = {Zhixiang Chen and Wolfgang Maass},
  title = {On-line learning of rectangles and unions of rectangles},
  journal = {Machine Learning},
  year = {1994},
  volume = {17},
  pages = {23--50},
  number = {2/3},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{ChenMa92,
  author = {Z. Chen and W. Maass},
  title = {On-line learning of rectangles},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1992},
  pages = {16--28},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{ChengVi07,
  author = {L. Cheng and S. Vishwanathan},
  title = {Learning to compress images and video},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {161--168},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INBOOK{ChengWa95,
  chapter = {14},
  pages = {257--276},
  title = {Analysis of the blurring process},
  publisher = {MIT Press},
  year = {1995},
  author = {Yizong Cheng and Zhangyong Wan},
  volume = {III: Selecting Good Models},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@INPROCEEDINGS{CHLM02,
  author = {O. Cheong and S. {Har-Peled} and N. Linial and J. Matousek},
  title = {The One-Round {Voronoi} Game},
  booktitle = {SOCG},
  year = {2002},
  pages = {97--101}
}

@ARTICLE{CHLMH03,
  author = {O. Cheong and S.~{Har-Peled} and N. Linial and J. Matousek and S.
	{Har-Peled}},
  title = {The One-Round {Voronoi} Game},
  journal = DCG,
  year = {2003},
  note = {To appear}
}

@ARTICLE{Cherniak84,
  author = {Cherniak, C.},
  title = {Prototypical and Deductive Reasoning},
  journal = {Journal of verbal learning and verbal behavior},
  year = {1984},
  volume = {23},
  pages = {625--642}
}

@TECHREPORT{CherniavskySm86,
  author = {J. Cherniavsky and C. Smith},
  title = {Using telltales in developing program test sets},
  institution = {Georgetown University, Dept. of Computer Science, TR-4},
  year = {1986}
}

@UNPUBLISHED{CherniavskySt87,
  author = {J. Cherniavsky and R. Statman},
  title = {Testing and inductive inference: abstract approaches},
  note = {Preprint, Georgetown University},
  year = {1987}
}

@INPROCEEDINGS{CherniavskyVeSt88,
  author = {J. C. Cherniavsky and M. Velauthapillai and R. Statman},
  title = {Inductive inference: an abstract approach},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1988},
  pages = {251--266},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{Chernoff52,
  author = {H. Chernoff},
  title = {A measure of asymptotic efficiency for tests of a hypothesisbased
	on the sum of observations},
  journal = {Annals of Math. Stat.},
  year = {1952},
  volume = {23},
  pages = {493--509},
  comment = {Contains foundations for ``Chernoff bounds''}
}

@INPROCEEDINGS{CherryQuirk08,
  author = {C. Cherry and C. Quirk},
  title = {Discriminative, syntactic language modeling through latent SVMs},
  booktitle = {Proceedings of the Eighth Conference of {AMTA}},
  year = {2008},
  address = {Honolulu, Hawaii},
  month = {October}
}

@INCOLLECTION{Cherry90,
  author = {L. L. Cherry},
  title = {Index},
  booktitle = {Unix Research System Papers},
  publisher = {AT\&T},
  year = {1990},
  volume = {2},
  pages = {609--610},
  edition = {10}
}

@INPROCEEDINGS{Cheung99,
  author = {Dennis Cheung},
  title = {Learning Real Polynomials with a {T}uring Machine},
  booktitle = ALT,
  year = {1999},
  volume = {1720},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {231--240},
  publisher = {Springer-Verlag}
}

@ARTICLE{CKSTW98,
  author = {L. P. Chew and K. Kedem and M. Sharir and B. Tagansky and E. Welzl},
  title = {{Voronoi} Diagrams of Lines in 3-Space under Polyhedral Convex Distance
	Functions},
  journal = JALG,
  year = {1998},
  volume = {29},
  pages = {238--255},
  number = {2}
}

@INPROCEEDINGS{ChewAb07,
  author = {Chew, Peter and Abdelali, Ahmed},
  title = {Benefits of the `Massively Parallel Rosetta Stone': Cross-Language
	Information Retrieval with over 30 Languages},
  booktitle = ACL,
  year = {2007},
  pages = {872--879},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1110}
}

@INPROCEEDINGS{ChiaLiNg07,
  author = {Chia, Tee Kiah and Li, Haizhou and Ng, Hwee Tou},
  title = {A Statistical Language Modeling Approach to Lattice-Based Spoken
	Document Retrieval},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {810--818},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1085}
}

@TECHREPORT{Chickering02,
  author = {D. M. Chickering},
  title = {The WinMine Toolkit},
  institution = {Microsoft},
  year = {2002},
  number = {MSR-TR-2002-103},
  address = {Redmond, WA}
}

@ARTICLE{ChickeringHe97,
  author = {David Maxwell Chickering and David Heckerman},
  title = {Efficient approximations for the marginal likelihood of {B}ayesian
	networks with hidden variables},
  journal = {Machine Learning},
  year = {1997},
  volume = {29},
  pages = {181--212},
  publisher = {Kluwer Academic Publishers, Boston}
}

@BOOK{ChierchiaMc01,
  title = {Meaning and grammar: An introduction to semantics},
  publisher = {MIT Press},
  year = {2001},
  author = {G. Chierchia and S. McConnell-Ginet}
}

@INPROCEEDINGS{ChieuNg03,
  author = {Chieu, Hai Leong and Ng, Hwee Tou},
  title = {Named Entity Recognition with a Maximum Entropy Approach},
  booktitle = CoNLL,
  year = {2003},
  editor = {Walter Daelemans and Miles Osborne},
  pages = {160--163},
  publisher = {Edmonton, Canada}
}

@ARTICLE{ChinWa83,
  author = {F. Chin and C. A. Wang},
  title = {Optimal Algorithms for the Intersection and the Minimum Distance
	Problems between Planar Polygons},
  journal = {IEEE Trans. Comput.},
  year = {1983},
  volume = {C-32},
  pages = {1203--1207},
  number = {12}
}

@INPROCEEDINGS{ChiuPoDi07,
  author = {Chiu, Andy and Poupart, Pascal and DiMarco, Chrysanne},
  title = {Generating Lexical Analogies Using Dependency Relations},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {561--570},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1059}
}

@INPROCEEDINGS{ChklovskiPa04,
  author = {T. Chklovski and P. Pantel},
  title = {{VerbOcean: Mining the Web for Fine-Grained Semantic Verb Relations}},
  booktitle = EMNLP,
  year = {2004},
  pages = {33--40}
}

@INPROCEEDINGS{Chodorow85,
  author = {M. S. Chodorow and R. J. Byrd and G. E. Heidron},
  title = {Extracting Semantic Hierarchies from a Large On-Line Dictionary},
  booktitle = ACL,
  year = {1985},
  pages = {299--304}
}

@INPROCEEDINGS{ChodorowByHe85,
  author = {M. S. Chodorow and R. J. Byrd and G. E. Heidron},
  title = {Extracting Semantic Hierarchies from a Large On-Line Dictionary},
  booktitle = ACL,
  year = {1985},
  pages = {299--304}
}

@INPROCEEDINGS{ChodorowskiMi98,
  author = {Jacques Chodorowski and Laurent Miclet},
  title = {Applying grammatical inference in learning a language model for oral
	dialogue},
  booktitle = {International Workshop on Algorithmic Learning},
  year = {1998},
  volume = {1433},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {102--113},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{ChoiSeYa94,
  author = {J. Choi and J. Sellen and C. K. Yap},
  title = {Approximate {Euclidean} Shortest Path in $3$-Space},
  booktitle = {SOCG},
  year = {1994},
  pages = {41--48}
}

@INPROCEEDINGS{ChoiBrCa06,
  author = {Y. Choi and E. Breck and C. Cardie},
  title = {Joint Extraction of Entities and Relations for Opinion Recognition
	
	},
  booktitle = EMNLP,
  year = {2006}
}

@INPROCEEDINGS{CDFGKKKS92,
  author = {P. Cholak and R. Downey and L. Fortnow and W. Gasarch and E. Kinber
	and M. Kummer and S. Kurtz and T. Slaman},
  title = {Degrees of inferability},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1992},
  pages = {180--192},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{Chor89,
  author = {Benny Chor and Michael Merritt and David B. Shmoys},
  title = {Simple Constant-Time Consensus Protocols in Realistic Failure Models},
  journal = jacm,
  year = {1989},
  volume = {36},
  pages = {591-614},
  number = {3},
  month = jul,
  keywords = {Distributed Computing; Algorithms; Performance; Reliability; Theory;
	agreement problem; consensus problem; cryptography; fault tolerance;}
}

@ARTICLE{ChouekaLu85,
  author = {Y. Choueka and S. Lusignan},
  title = {Disambiguation by Short Contexts},
  journal = {Computers and the Humanities},
  year = {1985},
  volume = {19}
}

@INPROCEEDINGS{Christ94,
  author = {Oliver Christ},
  title = {A modular and flexible architecture for an integrated corpus query
	system},
  booktitle = COMPLEX,
  year = {1994},
  pages = {23--32}
}

@ARTICLE{ChristianiniShLo02,
  author = {N. Christianini and J. Shawe-Taylor and H. Lodhi},
  title = {Latent {S}emantic {K}ernels},
  journal = {Journal of Intelligent Information Systems},
  year = {2002},
  volume = {18},
  pages = {127--152},
  number = {2--3}
}

@ARTICLE{LSK,
  author = {Nello Christianini and John Shawe-Taylor and Huma Lodhi},
  title = {Latent {S}emantic {K}ernels},
  journal = {Journal of Intelligent Information Systems},
  year = {2002},
  volume = {18},
  pages = {127--152},
  number = {2--3}
}

@INPROCEEDINGS{Chung94,
  author = {T. H. Chung},
  title = {Approximate methods for sequential decision making using expert advice},
  booktitle = COLT,
  year = {1994},
  pages = {183--189},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{CDGFHS93,
  author = {K. Church and I. Dagan and W. Gale and P. Fung and J. Helfman and
	B. Satish},
  title = {Aligning Parallel Texts: Do Methods Developed for English-French
	Generalize to Asian Languages?},
  booktitle = {Pacific Asia Conference on Formal and Computational Linguistics},
  year = {1993}
}

@INPROCEEDINGS{Church93b,
  author = {K. Church and I. Dagan and W. Gale and P. Fung and J. Helfman and
	B. Satish},
  title = {Aligning Parallel Texts: Do Methods Developed for English-French
	Generalize to Asian Languages?},
  booktitle = {Pacific Asia Conference on Formal and Computational Linguistics},
  year = {1993}
}

@INPROCEEDINGS{Church95,
  author = {K. Church and W. Gale},
  title = {Inverse document frequency (IDF): a measure of deviations from {Poisson}},
  booktitle = {Third the Workshop on Very Large Corpora},
  year = {1995},
  pages = {121--130}
}

@INPROCEEDINGS{ChurchGa95,
  author = {K. Church and W. Gale},
  title = {Inverse document frequency (IDF): a measure of deviations from {Poisson}},
  booktitle = {Third the Workshop on Very Large Corpora},
  year = {1995},
  pages = {121--130}
}

@INPROCEEDINGS{CGHH89,
  author = {Kenneth Church and William Gale and Patrick Hanks and Donald Hindle},
  title = {Parsing, word association and typical predicate argument structure},
  booktitle = IPW,
  year = {1989}
}

@INPROCEEDINGS{Church89,
  author = {Kenneth Church and William Gale and Patrick Hanks and Donald Hindle},
  title = {Parsing, word association and typical predicate argument structure},
  booktitle = IPW,
  year = {1989}
}

@INPROCEEDINGS{ChurchHaGa07,
  author = {Church, Kenneth and Hart, Ted and Gao, Jianfeng},
  title = {Compressing Trigram Language Models With {Golomb} Coding},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {199--207},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1021}
}

@INCOLLECTION{Church92,
  author = {K. W. Church},
  title = {Current practice in part of speech tagging and suggestions for the
	future},
  booktitle = {For Henry Kucera},
  publisher = {Michigan Slavic Publications},
  year = {1992},
  editor = {A. W. Mackie and T. K. McAuley and C. Simmons},
  address = {University of Michigan, Ann Arbor}
}

@INPROCEEDINGS{Church93,
  author = {Kenneth W. Church},
  title = {Char\_align: A program for aligning parallel texts at the character
	level},
  booktitle = ACL,
  year = {1993}
}

@INPROCEEDINGS{Church88,
  author = {Church, Kenneth W.},
  title = {A stochastic parts program and noun phrase parser for unrestricted
	text},
  booktitle = ANLP,
  year = {1988}
}

@ARTICLE{Church91,
  author = {Kenneth W. Church and William A. Gale},
  title = {A comparison of the enhanced {Good-Turing} and deleted estimation
	methods for estimating probabilities of {English} bigrams},
  journal = CSL,
  year = {1991},
  volume = {5},
  pages = {19--54}
}

@ARTICLE{ChurchGa91,
  author = {Kenneth W. Church and William A. Gale},
  title = {A comparison of the enhanced {Good-Turing} and deleted estimation
	methods for estimating probabilities of {English} bigrams},
  journal = CSL,
  year = {1991},
  volume = {5},
  pages = {19--54}
}

@INCOLLECTION{CGHH91,
  author = {K. W. Church and W. A. Gale and P. Hanks and D. M. Hindle},
  title = {Using statistics in lexical analysis},
  booktitle = {Lexical Acquisition: Exploiting On-Line Resources to Build a Lexicon},
  publisher = {Lawrence Erlbaum Associates},
  year = {1991},
  editor = {U. Zernik},
  address = {Hillsdale, NJ}
}

@INCOLLECTION{Church91b,
  author = {K. W. Church and W. A. Gale and P. Hanks and D. M. Hindle},
  title = {Using statistics in lexical analysis},
  booktitle = {Lexical Acquisition: Exploiting On-Line Resources to Build a Lexicon},
  publisher = {Lawrence Erlbaum Associates},
  year = {1991},
  editor = {U. Zernik},
  address = {Hillsdale, NJ}
}

@ARTICLE{Church90,
  author = {Church, Kenneth W. and Hanks, Patrick},
  title = {Word association norms, mutual information, and Lexicography},
  journal = CL,
  year = {1990},
  volume = {16},
  pages = {22--29},
  number = {1}
}

@ARTICLE{ChurchHa90,
  author = {Church, Kenneth W. and Hanks, Patrick},
  title = {Word association norms, mutual information, and Lexicography},
  journal = CL,
  year = {1990},
  volume = {16},
  pages = {22--29},
  number = {1}
}

@ARTICLE{Church93a,
  author = {Kenneth W. Church and Robert L. Mercer},
  title = {Introduction to the special issue in computational linguistics using
	large corpora},
  journal = CL,
  year = {1993},
  volume = {19},
  pages = {1--24},
  number = {1}
}

@ARTICLE{ChurchMe93,
  author = {Kenneth W. Church and Robert L. Mercer},
  title = {Introduction to the special issue in computational linguistics using
	large corpora},
  journal = CL,
  year = {1993},
  volume = {19},
  pages = {1--24},
  number = {1}
}

@ARTICLE{Chzelle93,
  author = {B. Chzelle},
  title = {An optimal convex hull algorithm in any fixed dimension},
  journal = DCG,
  year = {1993},
  volume = {10},
  pages = {377--409}
}

@ARTICLE{Chzelle91,
  author = {B. Chzelle},
  title = {Triangulating a simple polygon in linear time},
  journal = DCG,
  year = {1991},
  volume = {6},
  pages = {485--524}
}

@ARTICLE{CEGPSSS92,
  author = {B. Chzelle and H. Edelsbrunner and L. J. Guibas and R. Pollack and
	R. Seidel and M. Sharir and J. Snoeyink},
  title = {Counting and cutting cycles of lines and rods in space},
  journal = CGTA,
  year = {1992},
  volume = {1},
  pages = {305--323}
}

@ARTICLE{CEGS94,
  author = {B. Chzelle and H. Edelsbrunner and L. J. Guibas and M. Sharir},
  title = {Algorithms for bichromatic line segment problems and polyhedral terrains},
  journal = {Algorithmica},
  year = {1994},
  volume = {11},
  pages = {116--132}
}

@ARTICLE{CEGS93,
  author = {B. Chzelle and H. Edelsbrunner and L. J. Guibas and M. Sharir},
  title = {Diameter, width, closest line pair and parametric searching},
  journal = DCG,
  year = {1993},
  volume = {10},
  pages = {183--196}
}

@ARTICLE{CEGSS93,
  author = {B. Chzelle and H. Edelsbrunner and L. J. Guibas and M. Sharir and
	J. Snoeyink},
  title = {Computing a face in an arrangement of line segments},
  journal = SICOMP,
  year = {1993},
  volume = {22},
  pages = {1286--1302},
  annote = {13}
}

@ARTICLE{ChzelleFr90,
  author = {B. Chzelle and J. Friedman},
  title = {A deterministic view of random sampling and its use in geometry},
  journal = {Combinatorica},
  year = {1990},
  volume = {10},
  pages = {229--249},
  number = {3},
  annote = {derandomizes with polynomial overhead},
  keywords = {point location, range search, $d$-dimensional}
}

@INPROCEEDINGS{CichoszMu95,
  author = {Pawel Cichosz and Jan J. Mulawka},
  title = {Fast and efficient reinforcement learning with truncated temporal
	differences},
  booktitle = ICML,
  year = {1995},
  pages = {99--107},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{CimianoWe07,
  author = {Cimiano, Philipp and Wenderoth, Johanna},
  title = {Automatic Acquisition of Ranked Qualia Structures from the Web},
  booktitle = ACL,
  year = {2007},
  pages = {888--895},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1112}
}

@ARTICLE{Clancey89,
  author = {William J. Clancey},
  title = {The Knowledge Level Reinterpreted: Modeling How Systems Interact},
  journal = {Machine Learning},
  year = {1989},
  volume = {4},
  pages = {285--291},
  publisher = {Kluwer Academic Publishers, Boston}
}

@BOOK{Clark93,
  title = {The Lexicon in Acquisition},
  publisher = Cambridge,
  year = {1993},
  author = {E. Clark}
}

@INPROCEEDINGS{ClarkHa09,
  author = {Clark, Peter and Harrison, Phil},
  title = {An Inference-Based Approach to Recognizing Entailment},
  booktitle = TAC,
  year = {2009},
  pages = {63--72}
}

@INPROCEEDINGS{ClarkHaThMuHoFe07,
  author = {Clark, P. and Harrison, P. and Thompson, J. and Murray, W. and Hobbs,
	J. and Fellbaum, C.},
  title = {On the Role of Lexical and World Knowledge in RTE3},
  booktitle = {ACL-PASCAL Workshop on Textual Entailment and Paraphrasing},
  year = {2007},
  pages = {54--59},
  address = {Prague},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/W/W07/W07-1409}
}

@ARTICLE{ClarkNi89,
  author = {Peter Clark and Tim Niblett},
  title = {The {CN2} Induction Algorithm},
  journal = {Machine Learning},
  year = {1989},
  volume = {3},
  pages = {261--283},
  annote = {Was a 1987 Tech Report from The Turing Institute},
  comment = {Experimental study of rule induction, with accomodation for noise.},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{ClarkNi87,
  author = {P. Clark and T. Niblett},
  title = {Induction in Noisy Domains},
  booktitle = {Progress in Machine Learning--Proceedings of EWSL 87: 2nd European
	Working Session on Learning},
  year = {1987},
  pages = {11--30},
  address = {Bled, Yogoslavia},
  month = may
}

@INPROCEEDINGS{ClarkCu07,
  author = {Clark, Stephen and Curran, James},
  title = {Formalism-Independent Parser Evaluation with CCG and DepBank},
  booktitle = ACL,
  year = {2007},
  pages = {248--255},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1032}
}

@ARTICLE{ClarkeCoBu95,
  author = {C. L. Clarke and G. V. Cormack and and F. J. Burkowski},
  title = {An Algebra for Structured Text Search and A Framework for its Implementation},
  journal = {The Computer Journal},
  year = {1995},
  volume = {38(1)},
  pages = {43--56}
}

@ARTICLE{Clco95,
  author = {C. L. Clarke and G. V. Cormack and and F. J. Burkowski},
  title = {An Algebra for Structured Text Search and A Framework for its Implementation
	
	},
  journal = {The Computer Journal},
  year = {1995},
  volume = {38(1)},
  pages = {43--56}
}

@ARTICLE{ClarkeLa08,
  author = {J. Clarke and M. Lapata},
  title = {Global Inference for Sentence Compression: An Integer Linear Programming
	Approach},
  journal = {Journal of Artificial Intelligence Research (JAIR)},
  year = {2008},
  volume = {31},
  pages = {399-429}
}

@INPROCEEDINGS{ClarkeLa07,
  author = {Clarke, James and Lapata, Mirella},
  title = {Modelling Compression with Discourse Constraints},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {1--11},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1001}
}

@INPROCEEDINGS{ClarkeLa06,
  author = {Clarke, James and Lapata, Mirella},
  title = {Constraint-Based Sentence Compression: An Integer Programming Approach},
  booktitle = ACL,
  year = {2006},
  pages = {144--151},
  address = {Sydney, Australia},
  month = {July},
  publisher = {ACL}
}

@INPROCEEDINGS{Clarkson94,
  author = {K. L. Clarkson},
  title = {An Algorithm for Approximate Closest-Point Queries},
  booktitle = {SOCG},
  year = {1994},
  pages = {160--164}
}

@INPROCEEDINGS{Clarkson93,
  author = {K. L. Clarkson},
  title = {Algorithms for Polytope Covering and Approximation},
  booktitle = {WADS},
  year = {1993},
  volume = {709},
  series = {Lecture Notes Comput. Sci.},
  pages = {246--252},
  publisher = {Springer-Verlag},
  annote = {{509}}
}

@INPROCEEDINGS{Clarkson88,
  author = {K. L. Clarkson},
  title = {Applications of random sampling in computational geometry, {II}},
  booktitle = {SOCG},
  year = {1988},
  pages = {1--11}
}

@ARTICLE{Clarkson88a,
  author = {K. L. Clarkson},
  title = {A randomized algorithm for closest-point queries},
  journal = SICOMP,
  year = {1988},
  volume = {17},
  pages = {830--847}
}

@INPROCEEDINGS{Clarkson87,
  author = {K. L. Clarkson},
  title = {Approximation algorithms for shortest path motion planning},
  booktitle = STOC,
  year = {1987},
  pages = {56--65},
  keywords = {motion planning, approximation, two-dimensional, three-dimensional,
	Voronoi diagrams}
}

@ARTICLE{Clarkson87a,
  author = {K. L. Clarkson},
  title = {New applications of random sampling in computational geometry},
  journal = DCG,
  year = {1987},
  volume = {2},
  pages = {195--222},
  keywords = {combinatorial geometry, data structuring, reporting, searching, separation,
	range search, point location, probabilistic analysis, triangulations,
	$d$-dimensional}
}

@ARTICLE{CEGSW90,
  author = {K. L. Clarkson and H. Edelsbrunner and L. J. Guibas and M. Sharir
	and E. Welzl},
  title = {{Combinatorial complexity bounds for arrangements of curves and spheres}},
  journal = DCG,
  year = {1990},
  volume = {5},
  pages = {99--160}
}

@ARTICLE{CEMST96,
  author = {K. L. Clarkson and D. Eppstein and G. L. Miller and C. Sturtivant
	and S.-H. Teng},
  title = {Approximating center points with iterative {Radon} points},
  journal = IJCGA,
  year = {1996},
  volume = {6},
  pages = {357--377},
  url = {http://cm.bell-labs.com/who/clarkson/center.html}
}

@ARTICLE{ClarksonSh89,
  author = {K. L. Clarkson and P. W. Shor},
  title = {{Applications of random sampling in computational geometry II}},
  journal = DCG,
  year = {1989},
  volume = {4},
  pages = {387--421}
}

@INBOOK{ClearwaterLe94,
  chapter = {6},
  pages = {81--95},
  title = {Sensitivity constraints in learning},
  publisher = {MIT Press},
  year = {1994},
  author = {Scott H. Clearwater and Yongwon Lee},
  volume = {II: Intersections Between Theory and Experiment},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@INPROCEEDINGS{ClearyTr95,
  author = {John G. Cleary and Leonard E. Trigg},
  title = {{K}*: an instance-based learner using an entropic distance measure},
  booktitle = ICML,
  year = {1995},
  pages = {108--114},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{CoccaroJu98,
  author = {Noah Coccaro and Daniel Jurafsky},
  title = {Towards better integration os semantic predictors in statistical
	language modeling},
  booktitle = ICSLP,
  year = {1998},
  address = {Sydney}
}

@ARTICLE{Cockett90,
  author = {J. R. B. Cockett and J. A. Herrera},
  title = {Decision Tree Reduction},
  journal = jacm,
  year = {1990},
  volume = {37},
  pages = {815-842},
  number = {4},
  month = oct,
  keywords = {Operations Research; Algorithms; Design; Performance; Theory; control
	decisions; discrete decision theory; theory; essential decisions;
	expected testing cost; irreducible decision trees; reasonable cost
	criteria; redundant decisions; rebust optimization of decision trees;
	stable optimization of decision trees; syntactic optimization; }
}

@ARTICLE{CohenKuBe95,
  author = {D. M. Cohen and C. Kulikowski and H. Berman},
  title = {{DEXTER}: {A} System that Experiments with Choices of Training Data
	Using Expert Knowledge in the Domain of {DNA} Hydration},
  journal = {Machine Learning},
  year = {1995},
  volume = {21},
  pages = {81--101},
  number = {1/2},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{Cohen97,
  author = {Edith Cohen},
  title = {Learning noisy perceptrons by a perceptron in polynomial time},
  booktitle = FOCS,
  year = {1997},
  pages = {514--523},
  publisher = {IEEE Computer Society Press, Los Alamitos, CA}
}

@ARTICLE{Cohen60,
  author = {Cohen, J.},
  title = {A coefficient of agreement for nominal scales.},
  journal = {Educational and Psychological Measurement},
  year = {1960},
  volume = {20},
  pages = {37--46},
  number = {1},
  publisher = {SAGE Publications}
}

@INPROCEEDINGS{CohenSm07,
  author = {Cohen, Shay B. and Smith, Noah A.},
  title = {Joint Morphological and Syntactic Disambiguation},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {208--217},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1022}
}

@INPROCEEDINGS{Cohen04,
  author = {W. Cohen},
  title = {Exploiting Dictionaries in Named Entity Extraction: Combining Semi-Markov
	Extraction Processes and Data Integration Methods},
  booktitle = KDD,
  year = {2004},
  pages = {89--98}
}

@ARTICLE{Cohen95b,
  author = {Cohen, W.},
  title = {{PAC}-learning recursive logic programs: Efficient algorithms},
  journal = JAIR,
  year = {1995},
  volume = {2},
  pages = {501--539}
}

@INPROCEEDINGS{Cohen93,
  author = {William Cohen},
  title = {Cryptographic Limitations on Learning One-Clause Logic Programs},
  booktitle = {National Conference on Artificial Intelligence},
  year = {1993},
  address = {Washington, D.C.}
}

@INPROCEEDINGS{Cohen93a,
  author = {William Cohen},
  title = {Pac-Learning a Restricted Class of Recursive Logic Programs},
  booktitle = {National Conference on Artificial Intelligence},
  year = {1993},
  address = {Washington, D.C.}
}

@ARTICLE{CohenPa95,
  author = {Cohen, W. and Page, D.},
  title = {Polynomial Learnability and Inductive Logic Programming: Methods
	and Results},
  journal = {New Generation Computing},
  year = {1995},
  pages = {369--409}
}

@INPROCEEDINGS{CohenSa04,
  author = {W. Cohen and S. Sarawagi},
  title = {Exploiting Dictionaries in Named Entity Extraction: Combining Semi-Markov
	Extraction Processes and Data Integration Methods},
  booktitle = SIGKDD,
  year = {2004}
}

@INPROCEEDINGS{Cohen99,
  author = {William W. Cohen},
  title = {What can we learn from the web?},
  booktitle = ICML,
  year = {1999},
  pages = {515--521},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@ARTICLE{Cohen98,
  author = {William W. Cohen},
  title = {Hardness results for learning first-order representations and programming
	by demonstration},
  journal = {Machine Learning},
  year = {1998},
  volume = {30},
  pages = {57--87},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{Cohen96,
  author = {William W. Cohen},
  title = {The dual {DFA} learning problem: hardness results for programming
	by demonstration and learning first-order representations},
  booktitle = COLT,
  year = {1996},
  pages = {29--40},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{Cohen95,
  author = {William W. Cohen},
  title = {Fast effective rule induction},
  booktitle = ICML,
  year = {1995},
  pages = {115--123},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{Cohen95a,
  author = {William W. Cohen},
  title = {Text categorization and relational learning},
  booktitle = ICML,
  year = {1995},
  pages = {124--132},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{Cohen94,
  author = {William W. Cohen},
  title = {Incremental abductive {EBL}},
  journal = {Machine Learning},
  year = {1994},
  volume = {15},
  pages = {5--24},
  number = {1},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Cohen93b,
  author = {William W. Cohen},
  title = {Creating a Memory of Casual Relationships},
  journal = {Machine Learning},
  year = {1993},
  volume = {10},
  pages = {179--183},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Cohen92,
  author = {William W. Cohen},
  title = {Abductive Explanation-Based Learning: {A} Solution to the Multiple
	Inconsistent Explanation Problem},
  journal = {Machine Learning},
  year = {1992},
  volume = {8},
  pages = {167--219},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{CohenDe97,
  author = {William W. Cohen and Prem Devanbu},
  title = {A comparative study of inductive logic programming methods for software
	fault prediction},
  booktitle = ICML,
  year = {1997},
  pages = {66--74},
  publisher = {Morgan Kaufmann}
}

@INBOOK{CohenGrSc94,
  chapter = {11},
  pages = {171--181},
  title = {Probabilistic hill-climbing},
  publisher = {MIT Press},
  year = {1994},
  author = {William W. Cohen and Russell Greiner and Dale Schuurmans},
  volume = {II: Intersections Between Theory and Experiment},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@INPROCEEDINGS{CohenHi95,
  author = {William W. Cohen and Haym Hirsh},
  title = {Corrigendum for: {L}earnability of description logics},
  booktitle = COLT,
  year = {1995},
  pages = {463},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{CohenHi94,
  author = {Cohen, W. W. and H. Hirsh},
  title = {The Learnability of Description Logics with Equality Constraints},
  journal = {Machine Learning},
  year = {1994},
  volume = {17},
  pages = {169-199}
}

@INPROCEEDINGS{CohenHi94a,
  author = {William W. Cohen and Haym Hirsh},
  title = {Learning the {CLASSIC} Description Logic: Theoretical and Experimental
	Results},
  booktitle = {Principles of Knowledge Representation and Reasoning},
  year = {1994},
  publisher = {Morgan Kaufmann},
  editors = {J. Doyle and E. Sandewall and P. Torasso}
}

@ARTICLE{CohenHi94b,
  author = {William W. Cohen and Haym Hirsh},
  title = {Learnability of description logics with equality constraints},
  journal = {Machine Learning},
  year = {1994},
  volume = {17},
  pages = {169--200},
  number = {2/3},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{CohenHi92,
  author = {W. W. Cohen and H. Hirsh},
  title = {Learnability of description logics},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1992},
  pages = {116--127},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{Cohen03NE,
  author = {William W. Cohen and Pradeep Ravikumar and Stephen E. Fienberg},
  title = {A comparison of string metrics for matching names and records},
  booktitle = {KDD Workshop on Data Cleaning and Object Consolidation},
  year = {2003}
}

@INPROCEEDINGS{CohenRaFi03,
  author = {W. W. Cohen and P. Ravikumar and S. E. Fienberg},
  title = {A comparison of string metrics for matching names and records},
  booktitle = {KDD Workshop on Data Cleaning and Object Consolidation},
  year = {2003}
}

@INPROCEEDINGS{CohenSi96,
  author = {W. W. Cohen and Y. Singer},
  title = {Context-sensitive learning methods for text categorization},
  booktitle = {Annual International ACM Conference on Research and Development in
	Information Retrieval},
  year = {1996},
  page = {307--315}
}

@ARTICLE{CohnAtLa94,
  author = {David Cohn and Les Atlas and Richard Ladner},
  title = {Improving generalization with active learning},
  journal = {Machine Learning},
  year = {1994},
  volume = {15},
  pages = {201--221},
  number = {2},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{CohnLa07,
  author = {Cohn, Trevor and Lapata, Mirella},
  title = {Large Margin Synchronous Generation and its Application to Sentence
	Compression},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {73--82},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1008}
}

@INPROCEEDINGS{CohnLa07a,
  author = {Cohn, Trevor and Lapata, Mirella},
  title = {Machine Translation by Triangulation: Making Effective Use of Multi-Parallel
	Corpora},
  booktitle = ACL,
  year = {2007},
  pages = {728--735},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1092}
}

@MISC{CMLOTYT00,
  author = {N. Collier and H. Mima and S. Lee and T. Ohta and Y. Tateisi and
	A. Yakushiji and J. Tsujii},
  title = {Collier N., Mima H., Lee S.Z., Ohta T., Tateisi Y., Yakushiji A.,
	and Tsujii J. The GENIA Project: Knowledge Acquisition from Biology
	Texts, Genome Informatics, 11:448-449, 2000.},
  year = {2000},
  booktitle = {The GENIA Project: Knowledge Acquisition from Biology Texts},
  url = {citeseer.ist.psu.edu/collier00genia.html}
}

@INPROCEEDINGS{Collins02,
  author = {M. Collins},
  title = {Discriminative Training Methods for Hidden {Markov} Models: Theory
	and Experiments with Perceptron Algorithms},
  booktitle = SIGDAT,
  year = {2002}
}

@INPROCEEDINGS{Collins00,
  author = {M. Collins},
  title = {Discriminative Reranking for Natural Language Parsing},
  booktitle = ICML,
  year = {2000},
  pages = {175--182},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@PHDTHESIS{Collins99,
  author = {M. Collins},
  title = {Head-driven Statistical Models for Natural Language Parsing.},
  school = {Computer Science Department, University of Pennsylvenia},
  year = {1999},
  address = {Philadelphia}
}

@INPROCEEDINGS{Collins97,
  author = {M. Collins},
  title = {Three Generative, Lexicalised Models for Statistical Parsing},
  booktitle = ACL,
  year = {1997}
}

@INPROCEEDINGS{Collins96,
  author = {M. Collins},
  title = {A New Statistical Parser Based on Bigram Lexical Dependencies},
  booktitle = ACL,
  year = {1996},
  pages = {184-191}
}

@INPROCEEDINGS{CollinsBr95,
  author = {M. Collins and J Brooks},
  title = {Prepositional Phrase Attachment through a Backed-Off Model},
  booktitle = {Third the Workshop on Very Large Corpora},
  year = {1995}
}

@INPROCEEDINGS{CollinsDu02,
  author = {M. Collins and N. Duffy},
  title = {New Ranking Algorithms for Parsing and Taggins: Kernels over Discrete
	Structures, and the Voted Perceptron},
  booktitle = ACL,
  year = {2002}
}

@ARTICLE{CGKCB08,
  author = {Collins, M. and Globerson, A. and Koo, T. and Carreras, X. and Bartlett,
	P. L.},
  title = {Exponentiated Gradient Algorithms for Conditional Random Fields and
	Max-Margin Markov Networks},
  journal = JMLR,
  year = {2008},
  volume = {9}
}

@ARTICLE{CollinsKo05,
  author = {M. Collins and T. Koo},
  title = {Discriminative Reranking for Natural Language Parsing},
  journal = CL,
  year = {2005},
  volume = {31},
  pages = {25--70},
  number = {1},
  address = {Cambridge, MA, USA},
  publisher = {MIT Press}
}

@INPROCEEDINGS{CollinsRo04,
  author = {Michael Collins and Brian Roark},
  title = {Incremental parsing with the perceptron algorithm},
  booktitle = ACL,
  year = {2004},
  pages = {111},
  address = {Morristown, NJ, USA},
  publisher = {Association for Computational Linguistics},
  doi = {http://dx.doi.org/10.3115/1218955.1218970},
  location = {Barcelona, Spain}
}

@INPROCEEDINGS{CollinsScSi00,
  author = {Michael Collins and Robert E. Schapire and Yoram Singer},
  title = {Logistic Regression, {A}da{B}oost and {B}regman Distances},
  booktitle = COLT,
  year = {2000},
  pages = {158--169},
  publisher = {Morgan Kaufmann, San Francisco}
}

@INPROCEEDINGS{CollinsSi99,
  author = {M. Collins and Y. Singer},
  title = {Unsupervised models for named entity classification},
  booktitle = SIGDAT,
  year = {1999}
}

@ARTICLE{Collins92,
  author = {Oliver Collins and Sam Dolinar and Robert McEliece and Fabrizio Pollara},
  title = {A {VLSI} Decomposition of the deBruijn Graph},
  journal = jacm,
  year = {1992},
  volume = {39},
  pages = {931-948},
  number = {4},
  month = oct,
  keywords = {Interconnection Networks; Algorithms; Design; Theory; deBruijn graphs;
	graph decomposition; }
}

@INPROCEEDINGS{CSWB06,
  author = {Collobert, R. and Sinz, F. and Weston, J. and Bottou, L.},
  title = {Trading convexity for scalability},
  booktitle = ICML,
  year = {2006}
}

@INPROCEEDINGS{CollobertWe07,
  author = {Collobert, Ronan and Weston, Jason},
  title = {Fast Semantic Extraction Using a Novel Neural Network Architecture},
  booktitle = ACL,
  year = {2007},
  pages = {560--567},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1071}
}

@INPROCEEDINGS{CDGL99,
  author = {Francesco De Comit\'e and Fran\c{c}ois Denis and Remi Gilleron and
	Fabien Letouzey},
  title = {Positive and Unlabeled Examples Help Learning},
  booktitle = ALT,
  year = {1999},
  volume = {1720},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {219--230},
  publisher = {Springer-Verlag}
}

@ARTICLE{Condon91,
  author = {Anne Condon},
  title = {Space-Bounded Probalilistic Game Automata},
  journal = jacm,
  year = {1991},
  volume = {38},
  pages = {472-494},
  number = {2},
  month = apr,
  keywords = {Theory of Computation; Theory; Arthur-Merlin games; interactive proof
	systems; probabilistic game automata; }
}

@ARTICLE{Conklin95,
  author = {Darrell Conklin},
  title = {Machine discovery of protein motifs},
  journal = {Machine Learning},
  year = {1995},
  volume = {21},
  pages = {125--150},
  number = {1/2},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{ConklinWi94,
  author = {Darrell Conklin and Ian H. Witten},
  title = {Complexity-based induction},
  journal = {Machine Learning},
  year = {1994},
  volume = {16},
  pages = {203--226},
  number = {3},
  publisher = {Kluwer Academic Publishers, Boston}
}

@TECHREPORT{Connell89,
  author = {Jonanthan Connell},
  title = {A Colony Architecture for an Artificial Creature},
  institution = {MIT AI Laboratory},
  year = {1989},
  number = {AI-TR 1151},
  comment = {Design of Herbert, who collects soda cans from desks.}
}

@ARTICLE{CookRoAr76,
  author = {C. M. Cook and A. Rosenfeld and A. R. Aronson},
  title = {Grammatical inference by hill-climbing},
  journal = {Inform. Sci.},
  year = {1976},
  volume = {10},
  pages = {59--80}
}

@ARTICLE{CookHo94,
  author = {D.J. Cook and L.B. Holder},
  title = {Substructure Discovery Using Minimum Description Length and Background
	Knowledge},
  journal = {Journal of Artificial Intelligence Research},
  year = {1994},
  volume = {1},
  pages = {231--255}
}

@INBOOK{Cook94,
  chapter = {4},
  pages = {65--80},
  title = {Defining the limits of analogical planning},
  publisher = {MIT Press},
  year = {1994},
  author = {Diane J. Cook},
  volume = {I: Constraints and Prospects},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@INPROCEEDINGS{CookFaSt08,
  author = {P. Cook and A. Fazly and S. Stevenson},
  title = {The VNC-Tokens Dataset},
  booktitle = {LREC, Workshop Towards a Shared Task for Multiword Expressions},
  year = {2008}
}

@ARTICLE{Cooper90,
  author = {Cooper, F. G.},
  title = {The Computational Complexity of Probabilistic InferenceUsing Bayesian
	Belief Networks},
  journal = {Artificial Intelligence},
  year = {1990},
  volume = {42},
  pages = {393-405}
}

@ARTICLE{CooperHe92,
  author = {Gregory F. Cooper and Edward Herskovits},
  title = {A Bayesian Method for the Induction of Probabilistic Networks from
	Data},
  journal = {Machine Learning},
  year = {1992},
  volume = {9},
  pages = {309--347},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Cooper62,
  author = {P. Cooper},
  title = {The hypersphere in pattern recognition},
  journal = {Information and Control},
  year = {1962},
  volume = {5},
  pages = {324--346}
}

@INPROCEEDINGS{CCEFGJKPPPV96,
  author = {Robin Cooper and Richard Crouch and Jan van Eijck and Chris Fox and
	Josef van Genabith and Jan Jaspers and Hans Kamp and Manfred Pinkal
	and Massimo Poesio and Stephen Pulman and Espen Vestre},
  title = {Describing the Approaches},
  booktitle = {The FraCaS Consortium},
  year = {1996}
}

@BOOK{CormenLeRi90,
  title = {Introduction to Algorithms},
  publisher = {The MIT Press},
  year = {1990},
  author = {T. H. Cormen and C. E. Leiserson and R. L. Rivest},
  address = {Cambridge, Mass.}
}

@ARTICLE{CornuejolsFiNe77,
  author = {Cornuejols, G., M.L. Fisher and G.L. Nemhauser},
  title = {Location of Bank Accounts to Optimize Float: An Analytical Study
	of Exact and Approximate Algorithms},
  journal = {Management Science},
  year = {1977},
  volume = {23},
  pages = {789--810}
}

@INPROCEEDINGS{CMTV00,
  author = {A. Corral and Y. Manolopoulos and Y. Theodoridis and M. Vassilakopoulos},
  title = {Closest Pair Queries in Spatial Databases},
  booktitle = {ACM SIGMOD International Conference on Management of Data},
  year = {2000},
  pages = {189--200}
}

@ARTICLE{Corrigan88,
  author = {R. Corrigan},
  title = {Children's identification of actors and patients in prototypical
	and nonprototypical sentence types},
  journal = {Cognitive Development},
  year = {1988},
  volume = {3},
  pages = {285-297}
}

@INPROCEEDINGS{CortesMoRa07,
  author = {C. Cortes and M. Mohri and A. Rastogi},
  title = {Magnitude-preserving ranking algorithms},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {169--176},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@ARTICLE{CortesVa95,
  author = {C. Cortes and V. Vapnik},
  title = {Support-Vector Networks},
  journal = {Machine Learning},
  year = {1995},
  volume = {20},
  pages = {273-297}
}

@ARTICLE{Cosmadakis90,
  author = {Stavros S. Cosmadakis and Paris C. Kanellakis and Moshe Y. Vardi},
  title = {Polynomial-Time Implication Problems for Unary Inclusion Dependencies},
  journal = jacm,
  year = {1990},
  volume = {37},
  pages = {15-46},
  number = {1},
  month = jan,
  keywords = {Database Theory; Design; Theory; complementary view; complete axiomatizations;
	decidability; embedded implicational dependencies; finite implication;
	functional dependencies; implication; lossless join; polynomial-time
	algorithms; unary inclusion dependencies; }
}

@ARTICLE{CostSa93,
  author = {Scott Cost and Steven Salzberg},
  title = {A Weighted Nearest Neighbor Algorithm for Learning with Symbolic
	Features},
  journal = {Machine Learning},
  year = {1993},
  volume = {10},
  pages = {57--78},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{CPQC03,
  author = {V\'{\i}tor Santos Costa and David Page and Maleeha Qazi and James
	Cussens},
  title = {CLP(BN): Constraint Logic Programming for Probabilistic Knowledge.},
  booktitle = UAI,
  year = {2003},
  pages = {517-524},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@INPROCEEDINGS{CosteNi98,
  author = {F. Coste and J. Nicolas},
  title = {How considering incompatible state mergins may reduce the {DFA} induction
	search tree},
  booktitle = {International Workshop on Algorithmic Learning},
  year = {1998},
  volume = {1433},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {199--210},
  publisher = {Springer-Verlag}
}

@ARTICLE{CoulonKa79,
  author = {D. Coulon and D. Kayser},
  title = {Construction of natural language sentence acceptors by a supervised
	learning technique},
  journal = {IEEE Trans. Pattern Anal. Mach. Intell.},
  year = {1979},
  volume = {PAMI-1},
  pages = {94--99}
}

@INPROCEEDINGS{Cover65a,
  author = {T. Cover},
  title = {Behavior of sequential predictors of binary sequences},
  booktitle = {Prague Conference on Information Theory, Statistical Decision Functions
	and Random Processes},
  year = {1965},
  pages = {263--272},
  publisher = {Publishing House of the Czechoslovak Academy of Sciences}
}

@ARTICLE{Cover91,
  author = {T. M. Cover},
  title = {Universal Portfolios},
  journal = {Mathematical Finance},
  year = {1991},
  volume = {1},
  pages = {1--29},
  number = {1}
}

@ARTICLE{Cover73,
  author = {Cover, Thomas M.},
  title = {On Determining the Irrationality of the Mean of a Random Variable},
  journal = {The Annals of Statistics},
  year = {1973},
  volume = {1},
  pages = {862--871},
  number = {5}
}

@INCOLLECTION{Cover69,
  author = {Cover, Thomas M.},
  title = {Learning in Pattern Recognition},
  booktitle = {Methodologies of Pattern Recognition},
  publisher = {Academic Press},
  year = {1969},
  pages = {111--132},
  comment = {Bayesian classification procedures. Learning with finite memory.}
}

@ARTICLE{Cover65,
  author = {Cover, Thomas M.},
  title = {Geometrical and Statistical Properties of Systems of Linear inequalities
	with applications to pattern recognition},
  journal = {IEEE Transactions on Electronic Computers},
  year = {1965},
  volume = {EC-14},
  pages = {326--334},
  number = {3}
}

@ARTICLE{CoverHa67,
  author = {T. M. Cover and P. E. Hart},
  title = {Nearest Neighbor Pattern Classification},
  journal = {IEEE Transactions in Information Theory},
  year = {1967},
  volume = {IT-13},
  pages = {21--27},
  number = {1},
  month = jan
}

@BOOK{CoverTh91,
  title = {Elements of Information Theory},
  publisher = {Wiley and Sons},
  year = {1991},
  author = {Cover, T. M. and J. A. Thomas}
}

@INCOLLECTION{CoverWa76,
  author = {Cover, T. M. and T. J. Wagner},
  title = {Topics in Statistical Pattern Recognition},
  booktitle = {Communication and Cybernetics: Digital Pattern Recognition},
  publisher = {Springer-Verlag},
  year = {1976},
  editor = {K. S. Fu},
  volume = {10},
  chapter = {2},
  comment = {Learning classifiers. Distribution-free techniques. Modelling by gambling
	games. Finite memory learning.}
}

@INBOOK{CoxLe94,
  chapter = {18},
  pages = {297--319},
  title = {Unsupervised learning for mobile robot navigation using probabilistic
	data association},
  publisher = {MIT Press},
  year = {1994},
  author = {Ingemar J. Cox and John J. Leonard},
  volume = {II: Intersections Between Theory and Experiment},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@ARTICLE{Cox46,
  author = {Cox, R.T.},
  title = {Probability, Frequency and Reasonable Expectation},
  journal = {American Journal of Physics},
  year = {1946},
  volume = {14},
  pages = {1--13},
  number = {1}
}

@BOOK{Coxeter73,
  title = {Regular Polytopes},
  publisher = {Dover Publications, Inc.},
  year = {1973},
  author = {H. S. M. Coxeter},
  address = {New York},
  edition = {second}
}

@BOOK{CoxeterMo72,
  title = {Generators and Relations for Discrete Groups},
  publisher = {Springer-Verlag},
  year = {1972},
  author = {H. S. M. Coxeter and W. O. J. Moser},
  address = {New York},
  edition = {third},
  comment = {high-powered book on groups with, among other things, good discussion
	of Cayley graphs.}
}

@INPROCEEDINGS{CozmanCoCi03,
  author = {Fabio Gagliardi Cozman and Ira Cohen and Marcelo Cesar Cirelo},
  title = {Semi-Supervised Learning of Mixture Models},
  booktitle = ICML,
  year = {2003},
  pages = {99-106},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@INPROCEEDINGS{CramerSi00,
  author = {Koby Cramer and Yoram Singer},
  title = {On the Learnability and Design of Output Codes for Multiclass Problems},
  booktitle = COLT,
  year = {2000},
  pages = {35--46},
  publisher = {Morgan Kaufmann, San Francisco}
}

@ARTICLE{CDKSS06,
  author = {Crammer, K. and Dekel, O. and Keshet, J. and Shalev-Shwartz, S. and
	Singer, Y.},
  title = {Online Passive-Aggressive Algorithms},
  journal = JMLR,
  year = {2006}
}

@TECHREPORT{CrammerMcPe05,
  author = {K. Crammer and R. Mcdonald and F. Pereira},
  title = {Scalable large-margin online learning for structured classification},
  institution = {Department of Computer and Information Science, University of Pennsylvania},
  year = {2005}
}

@ARTICLE{CrammerSi01,
  author = {K. Crammer and Y. Singer},
  title = {Ultraconservative Online Algorithms for Multiclass Problems},
  journal = JMLR,
  year = {2001},
  volume = {3}
}

@ARTICLE{CravenSl00,
  author = {M. Craven and S. Slattery},
  title = {Relational Learning with Statistical Predicate Invention: Better
	Models for Hypertext.},
  journal = MLJ,
  year = {2000},
  note = {To appear}
}

@INBOOK{CravenSh95,
  chapter = {16},
  pages = {307--321},
  title = {Investigating the value of a good input representation},
  publisher = {MIT Press},
  year = {1995},
  author = {Mark W. Craven and Jude W. Shavlik},
  volume = {III: Selecting Good Models},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@INPROCEEDINGS{CravenSh94,
  author = {Mark W. Craven and Jude W. Shavlik},
  title = {Using sampling and queries to extract rules from trained neural networks},
  booktitle = ICML,
  year = {1994},
  pages = {37--45},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{CrawHu95,
  author = {Susan Craw and Paul Hutton},
  title = {Protein folding: symbolic refinement competes with neural networks},
  booktitle = ICML,
  year = {1995},
  pages = {133--141},
  publisher = {Morgan Kaufmann}
}

@INCOLLECTION{Crespi-Reghizzi72,
  author = {S. Crespi-Reghizzi},
  title = {An effective model for grammar inference},
  booktitle = {Information Processing},
  publisher = {North-Holland Publishing Co.},
  year = {1972},
  pages = {524--529}
}

@UNPUBLISHED{Crespi-ReghizziMa80,
  author = {S. Crespi-Reghizzi and D. Mandrioli},
  title = {Inferring grammars by means of profiles: a unifying view},
  note = {Internal report, Istituto di Elettrotechnica ed Elettronica del Politechnico
	di Milano},
  year = {1980}
}

@ARTICLE{Crespi-ReghizziLi73,
  author = {M. M. A. {Crespi-Reghizzi, S} and L. Lichten},
  title = {The use of grammatical inference for designing programming languages},
  journal = {Commun. ACM},
  year = {1973},
  volume = {16},
  pages = {83--90}
}

@BOOK{CristianiniSh00,
  title = {An Introduction to Support Vector Machines},
  publisher = {Cambridge Press},
  year = {2000},
  author = {N. Cristianini and J. Shawe-Taylor}
}

@ARTICLE{CristianiniShLo02,
  author = {Cristianini, N. and Shawe-Taylor, J. and Lodhi, H.},
  title = {Latent Semantic Kernels},
  journal = {Journal of Intelligent Information Systems},
  year = {2002},
  volume = {18},
  pages = {127--152},
  number = {2},
  publisher = {Springer}
}

@INPROCEEDINGS{CristianiniShSy98,
  author = {Nello Cristianini and John Shawe-Taylor and Peter Sykacek},
  title = {Bayesian classifiers are large margin hyperplanes in a {H}ilbert
	space},
  booktitle = ICML,
  year = {1998},
  pages = {109--117},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@BOOK{Critchlow85,
  title = {Metric Methods for Analyzing Partially Ranked Data},
  publisher = {Springer-Verlag},
  year = {1985},
  author = {Douglas E. Critchlow},
  volume = {34},
  series = {Lecture Notes in Statistics}
}

@ARTICLE{Crochemore91,
  author = {Maxime Crochemore and Dominique Perrin},
  title = {Two-Way String Matching},
  journal = jacm,
  year = {1991},
  volume = {38},
  pages = {651-675},
  number = {3},
  month = jul,
  keywords = {String Processing; Algorithms; Design; Theory; analysis of algorithms;
	combinatorial algorithms; pattern matching; text processing; }
}

@BOOK{Cruse04,
  title = {Meaning in Language: An Introduction to Semantics and Pragmatics},
  publisher = {Oxford University Press},
  year = {2004},
  author = {A. Cruse}
}

@INPROCEEDINGS{Cruz-Alc'azarVi98,
  author = {P. P. Cruz-Alc{\'a}zar and E. Vidal-Ruiz},
  title = {Learning regular grammars to model music style: comparing different
	coding schemes},
  booktitle = {International Workshop on Algorithmic Learning},
  year = {1998},
  volume = {1433},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {211--222},
  publisher = {Springer-Verlag}
}

@ARTICLE{Csiszar75,
  author = {Csisz\`ar, I.},
  title = {I-Divergence Geometry of Probability Distributions and Minimization
	Problems},
  journal = {The Annals of Probability},
  year = {1975},
  volume = {3},
  pages = {146--158},
  number = {1},
  comment = {Generalized proof of iterative techniques for computing maximum-entropy
	distributions.}
}

@INPROCEEDINGS{Cucerzan07,
  author = {Cucerzan, Silviu},
  title = {Large-Scale Named Entity Disambiguation Based on {Wikipedia} Data},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {708--716},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1074}
}

@INPROCEEDINGS{CucerzanBr05,
  author = {Silviu Cucerzan and Eric Brill},
  title = {Extracting semantically related queries by exploiting user session
	information},
  booktitle = {Technical Report, Microsoft Research},
  year = {2005}
}

@INPROCEEDINGS{CuellarSi93,
  author = {J. R. Cuellar and H. U. Simon},
  title = {Neural discriminant analysis},
  booktitle = {International Workshop on Analogical and Inductive Inference and
	International Workshop on Algorithmic Learning Theory},
  year = {1993},
  volume = {744},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {223--236},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{CulottaSo04,
  author = {A. Culotta and J. Sorenson},
  title = {Dependency Tree Kernels for Relation Extraction},
  booktitle = ACL,
  year = {2004},
  pages = {423--429}
}

@ARTICLE{Cuninghame-Green89,
  author = {R. Cuninghame-Green},
  title = {Geometry, shoemaking and the {M}ilk-{T}ray problem},
  journal = {New Scientist},
  year = {1989},
  volume = {12 August},
  pages = {50-53}
}

@INPROCEEDINGS{CMBT02,
  author = {H. Cunningham and D. Maynard and K. Bontcheva and V. Tablan},
  title = {{GATE: A Framework and Graphical Development Environment for Robust
	NLP Tools and Applications}},
  booktitle = ACL,
  year = {2002},
  address-omit = {Morristown, NJ, USA},
  month-omit = {July},
  publisher-omit = {Association for Computational Linguistics}
}

@ARTICLE{Cunto89,
  author = {Walter Cunto and J. Ian Munro},
  title = {Average Case Selection},
  journal = jacm,
  year = {1989},
  volume = {36},
  pages = {270-279},
  number = {2},
  month = apr,
  keywords = {Data Structures and Algorithms; Algorithms; Theory; Verification;
	average case; lower bounds; median; selection; }
}

@PHDTHESIS{Curran03,
  author = {J. Curran},
  title = {From Distributional to Semantic Similarity},
  school = {school of informatics, University of Edinburgh},
  year = {2003}
}

@INPROCEEDINGS{Cussens99,
  author = {James Cussens},
  title = {Loglinear models for first-order probabilistic reasoning},
  booktitle = UAI,
  year = {1999},
  editor = {Kathryn Blackmond Laskey and Henri Prade},
  pages = {126--133},
  publisher = {Morgan Kaufmann},
  url = {citeseer.nj.nec.com/cussens99loglinear.html}
}

@INPROCEEDINGS{Cussens98,
  author = {James Cussens},
  title = {Using Prior Probabilities and Density Estimation for Relational Classification},
  booktitle = ILP,
  year = {1998},
  editor = {David Page},
  volume = {1446 of LNAI},
  pages = {106-115},
  publisher = {Springer-Verlag}
}

@ARTICLE{Cussens00,
  author = {James Cussens},
  title = {Parameter Estimation in Stochastic Logic Programs},
  journal = {Machine Learning},
  year = {2000},
  volume = {44},
  pages = {245--271},
  number = {3},
  publisher = {Kluwer Academic Publishers, Boston},
  url = {citeseer.nj.nec.com/cussens00parameter.html}
}

@INPROCEEDINGS{Cussens97,
  author = {Cussens, J.},
  title = {Part-of-Speech Tagging Using Progol},
  booktitle = ILP,
  year = {1997},
  pages = {93--108},
  address = {Prague, Czech Republic},
  publisher = {Springer},
  note = {LNAI 1297}
}

@INPROCEEDINGS{Cussens95,
  author = {James Cussens},
  title = {A {B}ayesian analysis of algorithms for learning finite functions},
  booktitle = ICML,
  year = {1995},
  pages = {142--149},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{Cutting-et-al93,
  author = {C. Cutting and D. Karger and J. Pedersen},
  title = {Constant interaction-time Scatter/Gather browsing of very large document
	collections},
  booktitle = ACM-SIGIR,
  year = {1993}
}

@INPROCEEDINGS{CuttingKaPe93,
  author = {C. Cutting and D. Karger and J. Pedersen},
  title = {Constant interaction-time Scatter/Gather browsing of very large document
	collections},
  booktitle = ACM-SIGIR,
  year = {1993}
}

@UNPUBLISHED{Cybenko88b,
  author = {G. Cybenko},
  title = {Continuous-Valued Neural Networks with Two Hidden Layers are Sufficient},
  note = {To appear.},
  year = {1989}
}

@ARTICLE{Cybenko89,
  author = {G. Cybenko},
  title = {Approximation by Superpositions of a Sigmoidal Function},
  journal = {Mathematics of Control},
  year = {1989},
  volume = {2},
  pages = {303--314}
}

@INPROCEEDINGS{GiampiccoloMagniniDaganDolan07,
  author = {D. Giampiccolo, B. Magnini, I. Dagan and B. Dolan},
  title = {The Third PASCAL Recognizing Textual Entailment Challenge},
  booktitle = {Workshops on Textual Entailment and Paraphrasing},
  year = {2007},
  pages = {1-9}
}

@INPROCEEDINGS{DuzeroskiMuRu92,
  author = {S. D\u{z}eroski and S. Muggleton and S. Russell},
  title = {{PAC}-learnability of determinate logic programs},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1992},
  pages = {128--135},
  publisher = {ACM Press, New York, NY}
}

@INCOLLECTION{Daelemans95,
  author = {W. Daelemans},
  title = {Memory-based lexical acquisition and processing},
  booktitle = {Machine Translations and the Lexicon},
  publisher = {Springer Verlag},
  year = {1995},
  editor = {P. Steffens},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {85--98},
  address = {Berlin}
}

@ARTICLE{DaelemansBoZa99,
  author = {W. Daelemans and A. V. Bosch and J. Zavrel},
  title = {Forgetting Exceptions is Harmful in Language Learning},
  journal = {Machine Learning},
  year = {1999},
  note = {Special issue on Machine Learning and Natural Language}
}

@PHDTHESIS{Dagan92,
  author = {Ido Dagan},
  title = {Multilingual Statistical Approaches for Natural Language Disambiguation},
  school = {Computer Science Department, Technion - Israel Institute of Technology},
  year = {1992},
  address = {Haifa},
  month = {May},
  note = {(in Hebrew)}
}

@INPROCEEDINGS{Dagan94b,
  author = {Ido Dagan and Kenneth Church},
  title = {{\it Termight}: Identifying and translating technical terminology},
  booktitle = ANLP,
  year = {1994},
  pages = {34--40}
}

@INPROCEEDINGS{DaganCh94,
  author = {Ido Dagan and Kenneth Church},
  title = {{\it Termight}: Identifying and translating technical terminology},
  booktitle = ANLP,
  year = {1994},
  pages = {34--40}
}

@INPROCEEDINGS{Dagan93a,
  author = {Ido Dagan and Kenneth Church and William Gale},
  title = {Robust bilingual word alignment for machine aided translation},
  booktitle = {Workshop on Very Large Corpora: Academic and Industrial Perspectives},
  year = {1993},
  pages = {1--8},
  place = {Columbus, Ohio}
}

@INPROCEEDINGS{DaganChGa93,
  author = {Ido Dagan and Kenneth Church and William Gale},
  title = {Robust bilingual word alignment for machine aided translation},
  booktitle = {Workshop on Very Large Corpora: Academic and Industrial Perspectives},
  year = {1993},
  pages = {1--8},
  place = {Columbus, Ohio}
}

@INPROCEEDINGS{DaganEn95,
  author = {Ido Dagan and Sean Engelson},
  title = {Committee-Based Sampling for Training Probabilistic Classifiers},
  booktitle = ICML,
  year = {1995},
  month = {July}
}

@INPROCEEDINGS{DaganEn95a,
  author = {Ido Dagan and Sean Engelson},
  title = {Selective sampling in natural language learning.},
  booktitle = {IJCAI Workshop On New Approaches to Learning for Natural Language
	Processing},
  year = {1995},
  month = {August}
}

@UNPUBLISHED{Dagan95b,
  author = {Ido Dagan and Ronen Feldman and Haym Hirsh},
  title = {Browsing and analyzing keyword-based text collections},
  note = {In preparation, to be submitted to the {5th Annual Symposium on Document
	Analysis and Information Retrieval (SDAIR-96)}}
}

@INPROCEEDINGS{DaganGl05,
  author = {I. Dagan and O. Glickman},
  title = {A Probabilistic Setting and Lexical Cooccurrence Model for Textual
	Entailment},
  booktitle = {ACL Workshop on Empirical Modeling of Semantic Equivalence and Entailment},
  year = {2005},
  address = {Ann Arbor, MI}
}

@INPROCEEDINGS{DaganGl05a,
  author = {Ido Dagan and Oren Glickman},
  title = {The pascal recognising textual entailment challenge},
  booktitle = {PASCAL Challenges Workshop on Recognising Textual Entailment},
  year = {2005},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@INPROCEEDINGS{DaganGl04,
  author = {I. Dagan and O. Glickman},
  title = {Probabilistic Textual Entailment: Generic Applied Modeling of Language
	Variability},
  booktitle = {Learning Methods for Text Understanding and Mining},
  year = {2004},
  address = {Grenoble, France}
}

@INPROCEEDINGS{DaganGl:04,
  author = {I. Dagan and O. Glickman},
  title = {Probabilistic Textual Entailment: Generic Applied Modeling of Language
	Variability},
  booktitle = {Learning Methods for Text Understanding and Mining},
  year = {2004},
  address = {Grenoble, France}
}

@INPROCEEDINGS{DaganGlMa05,
  author = {Dagan, I. and Glickman, O. and Magnini, B.},
  title = {The PASCAL Recognising Textual Entailment Challenge},
  booktitle = {PASCAL - Workshop on Recognising Textual Entailment},
  year = {2005},
  pages = {1--8},
  month = {April},
  url = {http://www.cs.biu.ac.il/~glikmao/rte05/rte05_proceedings.pdf}
}

@INCOLLECTION{Dagan91b,
  author = {Ido Dagan and Alon Itai},
  title = {A Statistical Filter for Resolving Pronoun References},
  booktitle = {Artificial Intelligence and Computer Vision},
  publisher = {Elsevier Science Publishers B.V.},
  year = {1991},
  editor = {Y. A. Feldman and A. Bruckstein},
  pages = {125--135},
  note = {(The Proc. of the 7th Israeli Sym. on Artificial Intelligence and
	Computer Vision, 1990)}
}

@INCOLLECTION{DaganIt91,
  author = {Ido Dagan and Alon Itai},
  title = {A Statistical Filter for Resolving Pronoun References},
  booktitle = {Artificial Intelligence and Computer Vision},
  publisher = {Elsevier Science Publishers B.V.},
  year = {1991},
  editor = {Y. A. Feldman and A. Bruckstein},
  pages = {125--135},
  note = {(The Proc. of the 7th Israeli Sym. on Artificial Intelligence and
	Computer Vision, 1990)}
}

@ARTICLE{Dagan94,
  author = {Ido Dagan and Alon Itai},
  title = {Word Sense Disambiguation Using a Second Language Monolingual Corpus},
  journal = CL,
  year = {1994},
  volume = {20},
  pages = {563--596},
  number = {4}
}

@ARTICLE{DaganIt94,
  author = {Dagan, I. and A. Itai},
  title = {Word Sense Disambiguation Using a Second Language Monolingual Corpus},
  journal = CL,
  year = {1994},
  volume = {20},
  pages = {563--596},
  number = {4}
}

@INPROCEEDINGS{Dagan90,
  author = {Ido Dagan and Alon Itai},
  title = {Automatic Acquisition of Constraints for the Resolution of Anaphora
	References and Syntactic Ambiguities},
  booktitle = COLING,
  year = {1990},
  volume = {3},
  pages = {330--332}
}

@INPROCEEDINGS{DaganIt90,
  author = {Ido Dagan and Alon Itai},
  title = {Automatic Acquisition of Constraints for the Resolution of Anaphora
	References and Syntactic Ambiguities},
  booktitle = COLING,
  year = {1990},
  volume = {3},
  pages = {330--332}
}

@INPROCEEDINGS{Dagan-et-al91,
  author = {I. Dagan and A. Itai and U. Schwall},
  title = {Two languages are more informative than one},
  booktitle = ACL,
  year = {1991}
}

@INPROCEEDINGS{Dagan91,
  author = {Ido Dagan and Alon Itai and Ulrike Schwall},
  title = {Two languages are more informative than one},
  booktitle = ACL,
  year = {1991},
  pages = {130--137}
}

@INPROCEEDINGS{DaganItSc91,
  author = {Ido Dagan and Alon Itai and Ulrike Schwall},
  title = {Two languages are more informative than one},
  booktitle = ACL,
  year = {1991},
  pages = {130--137}
}

@ARTICLE{DaganLePe99,
  author = {Ido Dagan and Lillian Lee and Fernando C. N. Pereira},
  title = {Similarity-Based Models of Word Cooccurrence Probabilities},
  journal = {Machine Learning},
  year = {1999},
  volume = {34},
  pages = {43--69},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Dagan95,
  author = {Ido Dagan and Shaul Marcus and Shaul Markovitch},
  title = {Contextual word similarity and estimation from sparse data},
  journal = CSL,
  year = {1995},
  volume = {9},
  pages = {123-152}
}

@ARTICLE{DaganMaMa95,
  author = {Ido Dagan and Shaul Marcus and Shaul Markovitch},
  title = {Contextual word similarity and estimation from sparse data},
  journal = CSL,
  year = {1995},
  volume = {9},
  pages = {123-152}
}

@INPROCEEDINGS{Dagan-et-al93,
  author = {I. Dagan and S. Marcus and S. Markovitch},
  title = {Contextual word similarity and estimation from sparse data},
  booktitle = ACL,
  year = {1993}
}

@INPROCEEDINGS{Dagan93,
  author = {Ido Dagan and Shaul Marcus and Shaul Markovitch},
  title = {Contextual word similarity and estimation from sparse data},
  booktitle = ACL,
  year = {1993},
  pages = {164--171}
}

@INPROCEEDINGS{DaganMaMa93,
  author = {Ido Dagan and Shaul Marcus and Shaul Markovitch},
  title = {Contextual word similarity and estimation from sparse data},
  booktitle = ACL,
  year = {1993},
  pages = {164--171}
}

@INPROCEEDINGS{Dagan94c,
  author = {I. Dagan and F. Pereira and L. Lee},
  title = {Similarity-based estimation of word cooccurrence probabilities},
  booktitle = ACL,
  year = {1994},
  pages = {272--278}
}

@INPROCEEDINGS{DaganPeLe94,
  author = {I. Dagan and F. Pereira and L. Lee},
  title = {Similarity-based estimation of word cooccurrence probabilities},
  booktitle = ACL,
  year = {1994},
  pages = {272--278}
}

@ARTICLE{DagumLu97,
  author = {Paul Dagum and Michael Luby},
  title = {An Optimal Approximation Algorithm for Bayesian Inference},
  journal = {Artificial Intelligence},
  year = {1997},
  volume = {93},
  pages = {1-27},
  url = {citeseer.ist.psu.edu/dagum97optimal.html}
}

@ARTICLE{DagumLu93,
  author = {Paul Dagum and Michael Luby},
  title = {Approximating Probabilistic Inference in {B}ayesian Belief Networks
	is NP-Hard},
  journal = {Artificial Intelligence},
  year = {1993},
  volume = {60},
  pages = {141-153},
  number = {1}
}

@TECHREPORT{DagumLu91,
  author = {Dagum, Paul and Michael Luby},
  title = {Approximating Probabilistic Inference in Baysian Belief Networks
	is NP-hard},
  institution = {Knowledge Systems Laboratory, Stanford University},
  year = {1991},
  number = {KSL-91-51},
  month = Aug
}

@INCOLLECTION{Dahlgren88,
  author = {K. Dahlgren},
  title = {Using common sense knowledge to disambiguate word senses},
  booktitle = {Natural Language Understanding and Logic Programming},
  publisher = {North-Holland},
  year = {1988},
  editor = {Veronice Dahl and Patrick Saint-Dizier},
  pages = {255--275}
}

@INPROCEEDINGS{DahlmeierNgSc09,
  author = {Dahlmeier, D. and Ng, H. T. and Schultz, T.},
  title = {Joint Learning of Preposition Senses and Semantic Roles of Prepositional
	Phrases},
  booktitle = EMNLP,
  year = {2009},
  pages = {450--458}
}

@INPROCEEDINGS{DaiYe07,
  author = {G. Dai and D. Yeung},
  title = {Kernel selection for semi-supervised kernel machines},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {185--192},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{DYXY07,
  author = {W. Dai and Q. Yang and G. Xue and Y. Yu},
  title = {Boosting for transfer learning},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {193--200},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{Daille94,
  author = {Beatrice Daille},
  title = {Study and implementation of combined techniques for automatic extraction
	of terminology},
  booktitle = {The Balancing Act, Combining Symbolic and Statistical Approaches
	to Language -- Proceedings of the Workshop},
  year = {1994},
  pages = {29--36}
}

@INPROCEEDINGS{Daille94a,
  author = {Beatrice Daille},
  title = {Towards automatic extraction of monolingual and bilingual terminology},
  booktitle = COLING,
  year = {1994},
  pages = {515--521}
}

@INPROCEEDINGS{Daille94b,
  author = {Beatrice Daille},
  title = {Towards automatic extraction of monolingual and bilingual terminology},
  booktitle = COLING,
  year = {1994},
  pages = {515--521}
}

@INPROCEEDINGS{DalandSiPi07,
  author = {Daland, Robert and Sims, Andrea D. and Pierrehumbert, Janet},
  title = {Much ado about nothing: A social network model of Russian paradigmatic
	gaps},
  booktitle = ACL,
  year = {2007},
  pages = {936--943},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1118}
}

@BOOK{Dale92,
  title = {Generating Referring Expressions: Constructing Descriptions in a
	Domain of Objects and Processes},
  publisher = {MIT Press},
  year = {1992},
  author = {R. Dale},
  address = {Boston, Massachusetts}
}

@INPROCEEDINGS{Daley93,
  author = {Robert Daley},
  title = {Multi-Agent Learning: Theoretical and Empirical Studies},
  booktitle = {International Workshop on Nonmonotonic and Inductive Logic},
  year = {1993},
  volume = {659},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {175--183},
  publisher = {Springer--Verlag}
}

@INPROCEEDINGS{Daley88,
  author = {R. Daley},
  title = {Transformation of probabilistic learning strategies into deterministic
	learning strategies},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1988},
  pages = {220--226},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{Daley83,
  author = {R. Daley},
  title = {On the error correcting power of pluralism in {BC}-type inductive
	inference},
  journal = {Theoret. Comput. Sci.},
  year = {1983},
  volume = {24},
  pages = {95--104}
}

@ARTICLE{Daley77,
  author = {R. Daley},
  title = {On the inference of optimal descriptions},
  journal = {Theoret. Comput. Sci.},
  year = {1977},
  volume = {4},
  pages = {301--319}
}

@INPROCEEDINGS{DaleyKa97,
  author = {Robert Daley and Bala Kalyanasundaram},
  title = {{FIN}ite Learning Capabilities and Their Limits},
  booktitle = COLT,
  year = {1997},
  pages = {81--89},
  publisher = {ACM Press, New York, NY}
}

@INCOLLECTION{DaleyKa95,
  author = {Robert Daley and Bala Kalyanasundaram},
  title = {Towards Reduction Arguments for {FIN}ite Learning},
  booktitle = {Algorithmic Learning for Knowledge-Based Systems},
  publisher = {Springer--Verlag},
  year = {1995},
  volume = {961},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {63--75}
}

@INPROCEEDINGS{DaleyKa93,
  author = {R. Daley and B. Kalyanasundaram},
  title = {Capabilities of probabilistic learners with bounded mind changes},
  booktitle = COLT,
  year = {1993},
  pages = {182--191},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{DaleyKa93a,
  author = {R. Daley and B. Kalyanasundaram},
  title = {Use of reduction arguments in determining {P}opperian {FIN}-type
	learning capabilities},
  booktitle = {International Workshop on Analogical and Inductive Inference and
	International Workshop on Algorithmic Learning Theory},
  year = {1993},
  volume = {744},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {173--186},
  publisher = {Springer-Verlag}
}

@ARTICLE{DaleyKaVe95,
  author = {R. Daley and B. Kalyanasundaram and M. Velauthapillai},
  title = {Breaking the Probability 1/2 Barrier in {FIN}-type Learning},
  journal = {J. of Comput. Syst. Sci.},
  year = {1995},
  volume = {50},
  pages = {574--599},
  note = {Earlier version in 5th COLT, 1992}
}

@ARTICLE{DaleyKaVe94,
  author = {R. Daley and B. Kalyanasundaram and M. Velauthapillai},
  title = {The power of probabilism in popperian {FIN}ite learning},
  journal = {J. of Experimental and Theoret. Artif. Intell.},
  year = {1994},
  volume = {6},
  pages = {41--62},
  number = {1},
  note = {Special issue for AII '92}
}

@INPROCEEDINGS{DaleyKaVe93,
  author = {R. Daley and B. Kalyanasundaram and M. Velauthapillai},
  title = {Capabilities of fallible {FIN}ite learning},
  booktitle = COLT,
  year = {1993},
  pages = {199--208},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{DPVW91,
  author = {R. Daley and L. Pitt and M. Velauthapillia and T. Will},
  title = {Relations between probabilistic and team one-shot learners},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1991},
  pages = {228--239},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{DaleySm86,
  author = {R. Daley and C. Smith},
  title = {On the Complexity of Inductive Inference},
  journal = {Inform. Control},
  year = {1986},
  volume = {69},
  pages = {12--40},
  annote = {Earlier version was TR-83-4 from Univ of Pitt. in 1983}
}

@INPROCEEDINGS{Daley86,
  author = {R. P. Daley},
  title = {Inductive Inference Hierarchies: Probabilistic vs Pluralistic},
  booktitle = {International Spring School on Mathematical Methods of Specification
	and Synthesis of Software Systems},
  year = {1986},
  volume = {215},
  series = {Lecture Notes in Computer Science},
  pages = {73--82}
}

@INPROCEEDINGS{Daley86a,
  author = {R. P. Daley},
  title = {Towards the Development of an Analysis of Learning Algorithms},
  booktitle = {International Workshop on Analogical and Inductive Inference},
  year = {1986},
  volume = {265},
  series = {Lecture Notes in Computer Science},
  pages = {1--18},
  publisher = {Springer-Verlag}
}

@TECHREPORT{Dalkey85,
  author = {Dalkey, Norman C.},
  title = {Prior Probabilities Revisited},
  institution = {UCLA Computer Science Department},
  year = {1985},
  number = {CSD-850007},
  comment = {Justification of maximum-entropy via proper scoring rules for probability
	distributions. Some consequences.}
}

@INPROCEEDINGS{Dalmau99,
  author = {Victor Dalmau},
  title = {Boolean Formulas are Hard to Learn for Most Gate Bases},
  booktitle = ALT,
  year = {1999},
  volume = {1720},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {301--312},
  publisher = {Springer-Verlag}
}

@ARTICLE{Dalmau99a,
  author = {Victor Dalmau},
  title = {A Dichotomy Theorem for Learning Quantified {B}oolean Formulas},
  journal = {Machine Learning},
  year = {1999},
  volume = {35},
  pages = {207--224},
  number = {3},
  comment = {first in 10th COLT '97},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{DalmauJe99,
  author = {Victor Dalmau and Peter Jeavons},
  title = {Learnability of Quantified Formula},
  booktitle = EuroCOLT,
  year = {1999},
  volume = {1572},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {63--78},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{DDMSV04,
  author = {Nilesh Dalvi and Pedro Domingos and Mausam and Sumit Sanghai and
	Deepak Verma},
  title = {Adversarial classification},
  booktitle = KDD,
  year = {2004},
  pages = {99--108},
  address = {New York, NY, USA},
  publisher = {ACM},
  doi = {http://doi.acm.org/10.1145/1014052.1014066},
  isbn = {1-58113-888-1},
  location = {Seattle, WA, USA}
}

@INPROCEEDINGS{Damaschke98,
  author = {P. Damaschke},
  title = {Computational Aspects of Parallel Attribute-Efficient Learning},
  booktitle = ALT,
  year = {1998},
  volume = {1501},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {103--111},
  publisher = {Springer-Verlag}
}

@ARTICLE{Damerau93,
  author = {Fred J. Damerau},
  title = {Generating and evaluating domain-oriented multi-word terms from texts},
  journal = {Information Processing \& Management},
  year = {1993},
  volume = {29},
  pages = {433--447},
  number = {4}
}

@INPROCEEDINGS{DangLi07,
  author = {Dang, Hoa Trang and Lin, Jimmy},
  title = {Different Structures for Evaluating Answers to Complex Questions:
	Pyramids Won't Topple, and Neither Will Human Assessors},
  booktitle = ACL,
  year = {2007},
  pages = {768--775},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1097}
}

@INPROCEEDINGS{DDGS93,
  author = {C. Darken and M. Donahue and L. Gurvits and E. Sontag},
  title = {Rate of approximation results motivated by robust neural network
	learning},
  booktitle = COLT,
  year = {1993},
  pages = {303--309},
  publisher = {ACM Press, New York, NY}
}

@BOOK{DARPA95,
  title = {Proceedings of the 6th Message Understanding Conference},
  publisher = {Morgan Kaufman},
  year = {1995},
  author = {DARPA}
}

@ARTICLE{DarrochRa72,
  author = {J. N. Darroch and D. Ratcliff},
  title = {Generalized iterative scaling for log-linear models},
  journal = {Annals of Mathematical Statistics},
  year = {1972},
  volume = {43},
  pages = {1470--1480},
  number = {5}
}

@ARTICLE{Darwiche03,
  author = {A. Darwiche},
  title = {A differential approach to inference in Bayesian networks},
  journal = {Journal of ACM},
  year = {2003},
  volume = {50},
  pages = {280-305},
  number = {3}
}

@ARTICLE{Darwiche01,
  author = {Darwiche, A.},
  title = {Recursive conditioning},
  journal = AI,
  year = {2001},
  volume = {126},
  pages = {5--41},
  number = {1-2},
  address = {Essex, UK},
  issn = {0004-3702}
}

@BOOK{Darwin59,
  title = {The Origin of Species},
  publisher = {John Murray},
  year = {1859},
  author = {Charles R. Darwin},
  address = {London}
}

@INPROCEEDINGS{DasSm09,
  author = {D. Das and N. A. Smith},
  title = {Paraphrase Identification as Probabilistic Quasi-Synchronous Recognition},
  booktitle = ACL,
  year = {2009},
  month = {August}
}

@INPROCEEDINGS{DasGuptaSiSo94,
  author = {B. DasGupta and H. T. Siegelmann and E. Sontag},
  title = {On a learnability question associated to neural networks with continuous
	activations},
  booktitle = COLT,
  year = {1994},
  pages = {47--56},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{Dasgupta97,
  author = {Sanjoy Dasgupta},
  title = {The sample complexity of learning fixed-structure {B}ayesian networks},
  journal = {Machine Learning},
  year = {1997},
  volume = {29},
  pages = {165--180},
  publisher = {Kluwer Academic Publishers, Boston}
}

@TECHREPORT{DasguptaGu99,
  author = {S. Dasgupta and A. Gupta},
  title = {An elementary proof of the {Johnson-Lindenstrauss} lemma},
  institution = {International computer science institute},
  year = {1999},
  number = {TR-99-006}
}

@INPROCEEDINGS{DasguptaNg07,
  author = {Dasgupta, Sajib and Ng, Vincent},
  title = {Unsupervised Part-of-Speech Acquisition for Resource-Scarce Languages},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {218--227},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1023}
}

@ARTICLE{DLSS95,
  author = {A. Datta and H.-P. Lenhof and C. Schwarz and M. Smid},
  title = {Static and dynamic algorithms for $k$-point clustering problems},
  journal = JALG,
  year = {1995},
  volume = {19},
  pages = {474--503}
}

@INPROCEEDINGS{DattaKi97,
  author = {Piew Datta and Dennis Kibler},
  title = {Learning symbolic prototypes},
  booktitle = ICML,
  year = {1997},
  pages = {75--82},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{DattaKi95,
  author = {Piew Datta and Dennis Kibler},
  title = {Learning prototypical concept descriptions},
  booktitle = ICML,
  year = {1995},
  pages = {158--166},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{Daume08,
  author = {Daum\'{e} III, Hal},
  title = {Cross-Task Knowledge-Constrained Self Training},
  booktitle = EMNLP,
  year = {2008},
  pages = {680--688},
  address = {Honolulu, Hawaii},
  month = {October},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/D08-1071}
}

@INPROCEEDINGS{Daume07,
  author = {Daum\'{e} III, Hal},
  title = {Frustratingly Easy Domain Adaptation},
  booktitle = ACL,
  year = {2007},
  pages = {256--263},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1033}
}

@INPROCEEDINGS{DaumeCa07,
  author = {Daum\'{e} III, Hal and Campbell, Lyle},
  title = {A Bayesian Model for Discovering Typological Implications},
  booktitle = ACL,
  year = {2007},
  pages = {65--72},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1009}
}

@ARTICLE{DaumeMa06,
  author = {Hal Daum\'{e} and Daniel Marcu},
  title = {Domain adaptation for statistical classifiers},
  journal = {Journal of Artificial Intelligence},
  year = {2006},
  volume = {26},
  pages = {101--126}
}

@INPROCEEDINGS{DaumeMa05,
  author = {H. Daum\'{e} and D. Marcu},
  title = {Learning as search optimization: approximate large margin methods
	for structured prediction},
  booktitle = ICML,
  year = {2005},
  pages = {169--176},
  address = {New York, NY, USA},
  publisher = {ACM},
  doi = {http://doi.acm.org/10.1145/1102351.1102373},
  isbn = {1-59593-180-5},
  location = {Bonn, Germany}
}

@BOOK{Davenport83,
  title = {{The Higher Arithmetic: Introduction to the Theory of Numbers}},
  publisher = {Oxford University Press},
  year = {1983},
  author = {H. Davenport},
  address = {Oxford}
}

@ARTICLE{DavenportSc65,
  author = {H. Davenport and A. Schinzel},
  title = {{A combinatorial problem connected with differential equations}},
  journal = {Amer. J. Math.},
  year = {1965},
  volume = {87},
  pages = {684--695}
}

@INPROCEEDINGS{DavidTs99,
  author = { {David Guijarro, Jun Tarui and Tatsuie Tsukiji}},
  title = {Finding Relevant Variables in {PAC} Model with Membership Queries},
  booktitle = ALT,
  year = {1999},
  volume = {1720},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {313--322},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{DavidovRa08,
  author = {D. Davidov and A. Rappoport},
  title = {Unsupervised discovery of generic relationships using pattern clusters
	and its evaluation by automatically generated SAT analogy questions},
  booktitle = ACL,
  year = {2008}
}

@INPROCEEDINGS{DavidovRa08a,
  author = {Davidov, Dmitry and Rappoport, Ari},
  title = {Unsupervised Discovery of Generic Relationships Using Pattern Clusters
	and its Evaluation by Automatically Generated {SAT} Analogy Questions},
  booktitle = {ACL-HLT},
  year = {2008},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@INPROCEEDINGS{DavidovRaKo07,
  author = {Davidov, Dmitry and Rappoport, Ari and Koppel, Moshe},
  title = {Fully Unsupervised Discovery of Concept-Specific Relationships by
	Web Mining},
  booktitle = ACL,
  year = {2007},
  pages = {232--239},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1030}
}

@INPROCEEDINGS{DavidsonRa07,
  author = {I. Davidson and S. Ravi},
  title = {Intractability and clustering with constraints},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {201--208},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@ARTICLE{Davis90,
  author = {Henry W. Davis},
  title = {Cost-Error Relationships in {A*} Tree-Searching},
  journal = jacm,
  year = {1990},
  volume = {37},
  pages = {195-199},
  number = {2},
  month = apr,
  keywords = {Artificial Intelligence; Algorithms; Theory; }
}

@INPROCEEDINGS{DCRP07,
  author = {J. Davis and V. Costa and S. Ray and D. Page},
  title = {An integrated approach to feature invention and model construction
	for drug activity prediction},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {217--224},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{DKJSD07,
  author = {J. Davis and B. Kulis and P. Jain and S. Sra and I. Dhillon},
  title = {Information-theoretic metric learning},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {209--216},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@ARTICLE{Dawid92,
  author = {A. P. Dawid},
  title = {Prequential Analysis, Stochastic Complexity and Bayesian Inference},
  journal = {Bayesian Statistics},
  year = {1992},
  volume = {109},
  pages = {109--125},
  address = {Oxford},
  publisher = {Oxford University Press}
}

@BOOK{Dawkins89,
  title = {The Selfish Gene},
  publisher = {Oxford University Press},
  year = {1989},
  author = {Richard Dawkins},
  edition = {New}
}

@ARTICLE{Dayan92,
  author = {Peter Dayan},
  title = {The Convergence of {TD}({$\lambda$}) for General {$\lambda$}},
  journal = {Machine Learning},
  year = {1992},
  volume = {8},
  pages = {341--362},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{DayanSe96,
  author = {Peter Dayan and Terrence J. Sejnowski},
  title = {Exploration Bonuses and Dual Control},
  journal = {Machine Learning},
  year = {1996},
  volume = {25},
  pages = {5--22},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{DayanSe94,
  author = {Peter Dayan and Terrence J. Sejnowski},
  title = {{TD($\lambda$)} converges with probability 1},
  journal = {Machine Learning},
  year = {1994},
  volume = {14},
  pages = {295--301},
  number = {3},
  publisher = {Kluwer Academic Publishers, Boston}
}

@BOOK{Dayhoff90,
  title = {Neural Network Architectures; An Intorduction},
  publisher = {Van Nostrand Reinhold},
  year = {1990},
  author = {Dayhoff, E. Judith},
  address = {New York},
  comment = {Ch. 7,8, contains a survey of the brain structure}
}

@ARTICLE{DeRaedt97,
  author = {De Raedt, L.},
  title = {Logical Settings for Concept Learning},
  journal = AI,
  year = {1997},
  volume = {95},
  pages = {187--201},
  number = {1}
}

@ARTICLE{Dean89,
  author = {Thomas Dean},
  title = {Using Temporal Hierarchies to Efficiently Maintain Large Temporal
	Databases},
  journal = jacm,
  year = {1989},
  volume = {36},
  pages = {687-718},
  number = {4},
  month = oct,
  keywords = {Artificial Intelligence; Algorithms; Performance; discrimination trees;
	reason maintenance; temporal reasoning; }
}

@ARTICLE{DABEKKM94,
  author = {Tom Dean and Dana Angluin and Kenneth Basye and Sean Engelson and
	Leslie Kaelbling and Evangelos Kokkevis and Oded Maron},
  title = {Inferring Finite Automata with Stochastic Output Functions and an
	Application to Map Learning},
  journal = {Machine Learning},
  year = {1994}
}

@INPROCEEDINGS{DABEKKM92,
  author = {Tom Dean and Dana Angluin and Kenneth Basye and Sean Engelson and
	Leslie Kaelbling and Evangelos Kokkevis and Oded Maron},
  title = {Inferring Finite Automata with Stochastic Output Functions and an
	Application to Map Learning},
  booktitle = AAAI,
  year = {1992},
  pages = {208--214}
}

@INPROCEEDINGS{DebiliSaZr94,
  author = {Fathi Debili and Ely\`es Sammouda and Adnane Zribi},
  title = {Using Syntactic Dependencies for Word Alignment},
  booktitle = {Conference on Applied Natural Language Processing},
  year = {1994},
  note = {(poster presentation)}
}

@ARTICLE{Debray92,
  author = {Saumya K. Debray},
  title = {Efficient Dataflow Analysis of Logic Programs},
  journal = jacm,
  year = {1992},
  volume = {39},
  pages = {949-984},
  number = {4},
  month = oct,
  keywords = {Programming Languages; Algorithms; Languages; Performance; program
	analysis; PROLOG; }
}

@INPROCEEDINGS{Decatur97,
  author = {Scott Decatur},
  title = {{PAC} learning with constant-partition classification noise and applications
	to decision tree induction},
  booktitle = ICML,
  year = {1997},
  pages = {83--91},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{Decatur93,
  author = {Decatur, S. E.},
  title = {Statistical Queries and Faulty {PAC} Oracles},
  booktitle = COLT,
  year = {1993},
  pages = {262--268},
  publisher = {{ACM} Press}
}

@INPROCEEDINGS{DecaturGe95,
  author = {S. E. Decatur and R. Gennaro},
  title = {On Learning from Noisy and Incomplete Examples},
  booktitle = COLT,
  year = {1995},
  pages = {353--360}
}

@ARTICLE{DecaturGoRo99,
  author = {Scott E. Decatur and Oded Goldreich and Dana Ron},
  title = {Computational Sample Complexity},
  journal = {{SIAM} J. Comput.},
  year = {1999},
  volume = {29},
  pages = {854--879},
  number = {3},
  notes = {first in COLT '97}
}

@ARTICLE{Dechter99,
  author = {Rina Dechter},
  title = {Bucket Elimination: A Unifying Framework for Reasoning},
  journal = {Artificial Intelligence},
  year = {1999},
  volume = {113},
  pages = {41-85},
  number = {1-2},
  url = {citeseer.ist.psu.edu/article/dechter99bucket.html}
}

@INPROCEEDINGS{Dechter96,
  author = {R. Dechter},
  title = {Bucket elimination: A unifying framework for probabilistic inference},
  booktitle = UAI,
  year = {1996},
  pages = {211-219}
}

@TECHREPORT{Dechter90,
  author = {R. Dechter},
  title = {On the Design of Networks with Hidden Variables},
  institution = {Technion, Haifa},
  year = {1990},
  month = jul
}

@INPROCEEDINGS{DechterMa04,
  author = {R. Dechter and R. Mateescu},
  title = {{Mixtures of deterministic-probabilistic networks and their AND/OR
	search space}},
  booktitle = {AUAI},
  year = {2004},
  pages = {120--129},
  address = {Arlington, Virginia, United States},
  publisher = {AUAI Press},
  isbn = {0-9749039-0-6},
  location = {Banff, Canada}
}

@ARTICLE{DechterPe88,
  author = {Dechter, Rina and Judea Pearl},
  title = {Network-Based Heuristics for Constraint-Satisfaction Problems},
  journal = {Artificial Intelligence},
  year = {1988},
  volume = {34},
  pages = {1-38}
}

@ARTICLE{DechterRi03,
  author = {Rina Dechter and Irina Rish},
  title = {Mini-buckets: A general scheme for bounded inference},
  journal = {J. ACM},
  year = {2003},
  volume = {50},
  pages = {107--153},
  number = {2},
  doi = {http://doi.acm.org/10.1145/636865.636866},
  issn = {0004-5411},
  publisher = {ACM Press}
}

@INBOOK{DecoSc97,
  chapter = {9},
  pages = {137--153},
  title = {Dynamic modeling of chaotic time series by neural networks},
  publisher = {MIT Press},
  year = {1997},
  author = {Gustavo Deco and Bernd Sch{\"u}rmann},
  volume = {IV: Making Learning Systems Practical},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@ARTICLE{LSI,
  author = {Scott Deerwester and Susan T. Dumais and George W. Furnas and Thomas
	K. Landauer},
  title = {Indexing by {L}atent {S}emantic {A}nalysis},
  journal = {Journal of the American Society for Information Science},
  volume = {41},
  pages = {391-–407},
  number = {6}
}

@ARTICLE{DDFL90,
  author = {S. Deerwester and S. T. Dumais and G. W. Furnas and Thomas K. Landauer},
  title = {Indexing by {L}atent {S}emantic {A}nalysis},
  journal = {Journal of the American Society for Information Science},
  year = {1990},
  volume = {41},
  pages = {391-–407},
  number = {6},
  comments = {LSI}
}

@INPROCEEDINGS{DehneKlSe02,
  author = {F. K. H. A. Dehne and R. Klein and R. Seidel},
  title = {Maximizing a {Voronoi} Region: The Convex Case},
  booktitle = {ISAAC},
  year = {2002},
  pages = {624--634}
}

@INPROCEEDINGS{DeJong81,
  author = {DeJong, G.},
  title = {Generalization based on explanations},
  booktitle = IJCAI,
  year = {1981},
  pages = {67--70}
}

@ARTICLE{DejongMo86,
  author = {Gerald Dejong and Raymond Mooney},
  title = {Explanation-Based Learning: An Alternative View},
  journal = {Machine Learning},
  year = {1986},
  volume = {1},
  pages = {145--176},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{DelageMa07,
  author = {E. Delage and S. Mannor},
  title = {Percentile optimization in uncertain {MDP} with application to efficient
	exploration},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {225--232},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{DelcherKaGo93,
  author = {Delcher, A. and S. Kasif and H. Goldberg and W. Xsu},
  title = {Application of Probabilistic Causal Trees to Analysis of Protein
	Secondary Structure},
  booktitle = AAAI,
  year = {1993},
  pages = {316--321}
}

@INPROCEEDINGS{DeldenGo02,
  author = {S. van Delden and F. Gomez},
  title = {Combining Finite State Automata and a Greedy Learning Algorithm to
	Determine the Syntactic Roles of Commas.},
  booktitle = {ICTAI},
  year = {2002},
  pages = {293--300}
}

@INPROCEEDINGS{Demberg07,
  author = {Demberg, Vera},
  title = {A Language-Independent Unsupervised Model for Morphological Segmentation},
  booktitle = ACL,
  year = {2007},
  pages = {920--927},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1116}
}

@INPROCEEDINGS{DembergScM07,
  author = {Demberg, Vera and Schmid, Helmut and M\"ohler, Gregor},
  title = {Phonological Constraints and Morphological Preprocessing for Grapheme-to-Phoneme
	Conversion},
  booktitle = ACL,
  year = {2007},
  pages = {96--103},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1013}
}

@ARTICLE{DemingSt40,
  author = {Deming, W. Edwards and Frederick F. Stephan},
  title = {On a Least Squares Adjustment of a Sampled Frequency Table when the
	Expected Marginal Totals are Known},
  journal = {Annals Mathematical Statistics},
  year = {1940},
  volume = {11},
  pages = {427--444},
  comment = {Introduces iterative updating procedure; useful for computing maximum-entropy
	solution.}
}

@ARTICLE{Demolombe92,
  author = {Robert Demolombe},
  title = {Syntactical Characterization of a Subset of Domain-Independent Formulas},
  journal = jacm,
  year = {1992},
  volume = {39},
  pages = {71-94},
  number = {1},
  month = jan,
  keywords = {Database Theory; Languages; Theory; relational model; }
}

@ARTICLE{DempsterLaRu77,
  author = {A. P. Dempster and N. M. Laird and D. B. Rubin},
  title = {Maximum Likelihood from Incomplete Data via the {EM} Algorithm},
  journal = {Journal of the Royal Statistical Society},
  year = {1977},
  volume = {39},
  pages = {1-38}
}

@INPROCEEDINGS{DKWM07,
  author = {DeNeefe, Steve and Knight, Kevin and Wang, Wei and Marcu, Daniel},
  title = {What Can Syntax-Based {MT} Learn from Phrase-Based {MT}?},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {755--763},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1079}
}

@INPROCEEDINGS{DeNeroKl08,
  author = {DeNero, J. and Klein, D.},
  title = {The Complexity of Phrase Alignment Problems},
  booktitle = {ACL-HLT},
  year = {2008},
  pages = {25--28},
  address = {Columbus, Ohio},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P08/P08-2007}
}

@INPROCEEDINGS{DeNeroKlein08,
  author = {DeNero, John and Klein, Dan},
  title = {The Complexity of Phrase Alignment Problems},
  booktitle = {ACL-HLT},
  year = {2008},
  pages = {25--28},
  address = {Columbus, Ohio},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P08/P08-2007}
}

@INPROCEEDINGS{DeNeroKl07,
  author = {DeNero, John and Klein, Dan},
  title = {Tailoring Word Alignments to Syntactic Machine Translation},
  booktitle = ACL,
  year = {2007},
  pages = {17--24},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1003}
}

@INPROCEEDINGS{DengKaPa91,
  author = {X. Deng and T. Kameda and C. Papadimitriou},
  title = {How to learn in an unknown environment},
  booktitle = FOCS,
  year = {1991},
  pages = {298--303},
  publisher = {IEEE Computer Society Press, Los Alamitos, CA}
}

@INPROCEEDINGS{DengPa90,
  author = {Xiaotie Deng and Christos H. Papadimitriou},
  title = {Exploring an Unknown Graph},
  booktitle = FOCS,
  year = {1990},
  volume = {I},
  pages = {355--361}
}

@INPROCEEDINGS{DengGa07,
  author = {Deng, Yonggang and Gao, Yuqing},
  title = {Guiding Statistical Word Alignment Models With Prior Knowledge},
  booktitle = ACL,
  year = {2007},
  pages = {1--8},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1001}
}

@ARTICLE{Denis99,
  author = {F. Denis},
  title = {Finding a Minimal 1-{DNF} Consistent with a Positive Sample is {LOGSNP}-Complete},
  journal = {Inform. Process. Lett.},
  year = {1999},
  volume = {69},
  pages = {1--5},
  number = {1}
}

@INPROCEEDINGS{Denis98,
  author = {F. Denis},
  title = {{PAC} Learning from Positive Statistical Queries},
  booktitle = ALT,
  year = {1998},
  volume = {1501},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {112--126},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{DenisD'Gi96,
  author = {F. Denis and C. D'Halluin and R. Gilleron},
  title = {{PAC} learning with simple examples},
  booktitle = STACS,
  year = {1996},
  volume = {1046},
  series = {Lecture Notes in Computer Science},
  pages = {231--242},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{DenisGi97,
  author = {Fran{\c c}ois Denis and R{\'e}mi Gilleron},
  title = {{PAC} learning under helpful distributions},
  booktitle = ALT,
  year = {1997},
  volume = {1316},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {132--145},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{DenisBa07,
  author = {P. Denis and J. Baldridge},
  title = {Joint Determination of Anaphoricity and Coreference Resolution using
	Integer Programming},
  booktitle = NAACL,
  year = {2007}
}

@ARTICLE{DSWSHJH87,
  author = {J. Denker and D. Schwartz and B. Wittner and S. Solla and R. Howard
	and L. Jackel and J. Hopfield},
  title = {Automatic learning, rule extraction and generalization},
  journal = {Complex Systems},
  year = {1987},
  volume = {1},
  pages = {877--922}
}

@ARTICLE{Dennis84,
  author = {Dennis, J.E., Jr.},
  title = {A User's Guide to Nonlinear Optimization Algorithms},
  journal = {Proceedings of the IEEE},
  year = {1984},
  volume = {72},
  pages = {1765--1776},
  number = {12},
  month = Dec,
  comment = {Brief survey with bibliography.}
}

@ARTICLE{DeRose88,
  author = {DeRose, S.J.},
  title = {Grammatical category disambiguation by statistical optimization},
  journal = CL,
  year = {1988},
  volume = {14},
  pages = {31--39},
  number = {1}
}

@INPROCEEDINGS{Dershowitz94,
  author = {N. Dershowitz},
  title = {From specifications to programs: induction in the service of synthesis},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1994},
  pages = {6--7},
  publisher = {Springer-Verlag}
}

@ARTICLE{Dertthick90,
  author = {Dertthick, M},
  title = {Mundane Reasoning by settling on a plausible model},
  journal = {Artificial Intelligence},
  year = {1990},
  volume = {46},
  pages = {107-157},
  comment = {see file}
}

@INPROCEEDINGS{DeSantisMaWe88,
  author = {A. DeSantis and G. Markowsky and M. N. Wegman},
  title = {Learning probabilistic prediction functions},
  booktitle = FOCS,
  year = {1988},
  pages = {110--119},
  publisher = {IEEE Computer Society Press, Los Alamitos, CA},
  annote = {Also in COLT88}
}

@INPROCEEDINGS{DeschachtMo07,
  author = {Deschacht, Koen and Moens, Marie-Francine},
  title = {Text Analysis for Automatic Image Annotation},
  booktitle = ACL,
  year = {2007},
  pages = {1000--1007},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1126}
}

@INPROCEEDINGS{DeshpandeBaKa07,
  author = {Deshpande, P. and Barzilay, R. and Karger, D.},
  title = {Randomized Decoding for Selection-and-Ordering Problems},
  booktitle = HLT,
  year = {2007},
  pages = {444--451},
  address = {Rochester, New York},
  month = {April},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/N/N07/N07-1056}
}

@INPROCEEDINGS{DevaneyRa97,
  author = {Mark Devaney and Ashwin Ram},
  title = {Efficient feature selection in conceptual clustering},
  booktitle = ICML,
  year = {1997},
  pages = {92--97},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{DevillersGo98,
  author = {O. Devillers and M. Golin},
  title = {Dog Bites Postman: Point Location in the Moving {Voronoi} Diagram
	and Related Problems},
  journal = IJCGA,
  year = {1998},
  volume = {8},
  pages = {321--342}
}

@INPROCEEDINGS{DevillersPr00,
  author = {O. Devillers and F. P. Preparata},
  title = {Evaluating the cylindricity of a nominally cylindrical point set},
  booktitle = SODA,
  year = {2000},
  pages = {518--527}
}

@INPROCEEDINGS{DevittAh07,
  author = {Devitt, Ann and Ahmad, Khurshid},
  title = {Sentiment Polarity Identification in Financial News: A Cohesion-based
	Approach},
  booktitle = ACL,
  year = {2007},
  pages = {984--991},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1124}
}

@ARTICLE{Devroye88,
  author = {L. Devroye},
  title = {Automatic Pattern Recognition: {A} Study of the Probability of Error},
  journal = {IEEE Trans. Pattern Anal. Mach. Intell.},
  year = {1988},
  volume = {10},
  pages = {530--543},
  number = {4},
  month = jul
}

@BOOK{DevroyeGyLu96,
  title = {A Probabilistic Theory of Pattern Recognition},
  publisher = {Springer Verlag},
  year = {1996},
  author = {L. Devroye and L. Gyorfi and G. Lugosi},
  series = {Applications of Mathematics}
}

@INCOLLECTION{DevroyeWa82,
  author = {L. Devroye and T.J. Wagner},
  title = {Handbook of Statistics},
  booktitle = {Nearest neighbor methods in discrimination},
  publisher = {North-Holland},
  year = {1982},
  editor = {P. R. Krishnaiah and L. N. Kanal},
  volume = {2}
}

@ARTICLE{DevroyeWa79,
  author = {L. P. Devroye and T. J. Wagner},
  title = {Distribution-Free Performance Bounds with the Resubstitution Error
	Estimate},
  journal = {IEEE Trans. Inform. Theory},
  year = {1979},
  volume = {IT-25},
  pages = {208--210}
}

@ARTICLE{DevroyeWa76,
  author = {L. P. Devroye and T. J. Wagner},
  title = {A Distribution-Free Performance Bound in Error Estimation},
  journal = {IEEE Trans. Inform. Theory},
  year = {1976},
  volume = {IT-22},
  pages = {586--587}
}

@ARTICLE{Dey98,
  author = {T. K. Dey},
  title = {Improved Bounds for Planar $k$-Sets and Related Problems},
  journal = DCG,
  year = {1998},
  volume = {19},
  pages = {373--382},
  number = {3},
  url = {http://link.springer-ny.com/link/service/journals/00454/bibs/19n3p373.html}
}

@INPROCEEDINGS{Dey97,
  author = {T. K. Dey},
  title = {Improved Bounds for {$k$-Sets} and {$k$-th} levels},
  booktitle = FOCS,
  year = {1997},
  pages = {156--161},
  nickname = {FOCS '97}
}

@INPROCEEDINGS{DeJong95,
  author = {Gerald De{J}ong},
  title = {A case study of explanation-based control},
  booktitle = ICML,
  year = {1995},
  pages = {167--175},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{DhagatHe94,
  author = {Aditi Dhagat and Lisa Hellerstein},
  title = {{PAC} learning with irrelevant attributes},
  booktitle = FOCS,
  year = {1994},
  pages = {64--74},
  publisher = {IEEE Computer Society Press, Los Alamitos, CA}
}

@INPROCEEDINGS{DiabBh09,
  author = {Diab, M. and Bhutada, P.},
  title = {Verb Noun Construction MWE Token Classification},
  booktitle = {Workshop on Multiword Expressions: Identification, Interpretation,
	Disambiguation and Applications},
  year = {2009},
  pages = {17--22},
  url = {http://www.aclweb.org/anthology/W/W09/W09-2903}
}

@ARTICLE{DiaconisGr77,
  author = {Persi Diaconis and R. L. Graham},
  title = {Spearman's Footrule as a Measure of Disarray},
  journal = {Journal of the Royal Statistical Society},
  year = {1977},
  volume = {39},
  pages = {262-268}
}

@ARTICLE{DiaconisSa98,
  author = {P. Diaconis and L. Saloff-Coste},
  title = {What Do We Know about the {M}etropolis Algorithm?},
  journal = {Journal of Computer and System Sciences},
  year = {1998},
  volume = {57},
  pages = {20-36}
}

@INPROCEEDINGS{DietterichKeMa96,
  author = {Tom Dietterich and Michael Kearns and Yishay Mansour},
  title = {Applying the weak learning framework to understand and improve {C}4.5},
  booktitle = ICML,
  year = {1996},
  pages = {96--104},
  publisher = {Morgan Kaufmann}
}

@INCOLLECTION{Dietterich99,
  author = {Thomas G. Dietterich},
  title = {Machine Learning},
  booktitle = {The {MIT} Encyclopedia of the Cognitive Sciences},
  publisher = {{MIT} Press},
  year = {1999},
  editor = {Rob Wilson and Frank Keil}
}

@ARTICLE{Dietterich00,
  author = {Thomas G. Dietterich},
  title = {An Experimental Comparison of Three Methods for Constructing Ensembles
	of Decision Trees: {B}agging, {B}oosting, and Randomization},
  journal = {Machine Learning},
  year = {2000},
  volume = {40},
  pages = {139--157},
  number = {2},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Dietterich98,
  author = {Dietterich, T. G.},
  title = {Approximate Statistical Tests for Comparing Supervised Classification
	Learning Algorithms},
  journal = {Neural Computation},
  year = {1998},
  volume = {10},
  pages = {1895--1924},
  number = {7}
}

@INPROCEEDINGS{Dietterich98a,
  author = {Thomas G. Dietterich},
  title = {The {MAXQ} method for hierarchical reinforcement learning},
  booktitle = ICML,
  year = {1998},
  pages = {118--126},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@ARTICLE{Dietterich97,
  author = {Dietterich, T. G.},
  title = {Machine Learning Research: Four Current Directions},
  journal = {AI Magazine},
  year = {1997},
  volume = {18},
  pages = {97--136},
  number = {4}
}

@ARTICLE{Dietterich90,
  author = {Thomas G. Dietterich},
  title = {Exploratory Research in Machine Learning},
  journal = {Machine Learning},
  year = {1990},
  volume = {5},
  pages = {5--9},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Dietterich86,
  author = {Thomas G. Dietterich},
  title = {Learning at the Knowledge Level},
  journal = {Machine Learning},
  year = {1986},
  volume = {1},
  pages = {287--316},
  number = {3},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{Dietterich84,
  author = {T. G. Dietterich},
  title = {Learning About Systems That Contain State Variables},
  booktitle = {National Conference on Artificial Intelligence},
  year = {1984},
  pages = {96--100},
  month = aug
}

@ARTICLE{Diettrich95a,
  author = {Dietterich, T. G. and Bakiri, G. },
  title = {Solving Multiclass Learning Problems via Error-Correcting Output
	Codes},
  journal = {Journal of Artificial Intelligence Research },
  year = {1995},
  volume = {2},
  pages = {263-286}
}

@ARTICLE{DietterichFl97,
  author = {Thomas G. Dietterich and Nicholas S. Flann},
  title = {Explanation-based learning and reinforcement learning: a unified
	view},
  journal = {Machine Learning},
  year = {1997},
  volume = {28},
  pages = {169--210},
  note = {Earlier version in 12th International Conf on ML, 1995},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{DietterichHiBa95,
  author = {Thomas G. Dietterich and Hermann Hild and Ghulum Bakiri},
  title = {A comparison of {ID3} and backpropogation for {E}nglish text-to-speech
	mapping},
  journal = {Machine Learning},
  year = {1995},
  volume = {18},
  pages = {51--80},
  number = {1},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{DLCD82,
  author = {T. G. Dietterich and R. L. London and K. Clarkson and G. Dromey},
  title = {Learning and inductive inference},
  booktitle = {The Handbook of Artificial Intellegence},
  year = {1982},
  volume = {3},
  pages = {323--512},
  publisher = {William Kaufman, Inc.},
  editors = {P. R. Cohen and E. A. Feigenbaum}
}

@ARTICLE{DietterichMi85,
  author = {T. G. Dietterich and R. S. Michalski},
  title = {Discovering patterns in sequences of events},
  journal = {Artificial Intelligence},
  year = {1985},
  volume = {25},
  pages = {187--232}
}

@INPROCEEDINGS{DietterichMi79,
  author = {T. G. Dietterich and R. S. Michalski},
  title = {Learning and generalization of characteristic descriptions: evaluation
	criteria and comparative review of selected methods},
  booktitle = IJCAI,
  year = {1979},
  pages = {223--231},
  publisher = {IJCAI}
}

@INPROCEEDINGS{DietzBiSc07,
  author = {L. Dietz and S. Bickel and T. Scheffer},
  title = {Unsupervised prediction of citation influences},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {233--240},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@ARTICLE{DietzenPf92,
  author = {Scott Dietzen and Frank Pfenning},
  title = {Higher-Order and Modal Logic as a Framework for Explanation-Based
	Generalization},
  journal = {Machine Learning},
  year = {1992},
  volume = {9},
  pages = {23--55},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Dill89,
  author = {Jens M. Dill},
  title = {A Counter-Example for ``A Simpler Construction for Showing the Intrinsically
	Exponential Complexity of the Circularity Problem for Attribute Grammars''},
  journal = jacm,
  year = {1989},
  volume = {36},
  pages = {92-96},
  number = {1},
  month = jan,
  keywords = {Formal Languages; Algorithms; Languages; Performance; Theory; alternating
	Turing machines; attribute grammar; circularity problem; computational
	complexity; exponential time; }
}

@ARTICLE{Dillencourt92,
  author = {Michael B. Dillencourt and Hanan Samet and Markku Tamminen},
  title = {A General Approach to Connected-Component Labelling for Arbitrary
	Image Representations},
  journal = jacm,
  year = {1992},
  volume = {39},
  pages = {253-280},
  number = {2},
  month = apr,
  keywords = {Data Structures and Algorithms; }
}

@UNPUBLISHED{DinurSa01,
  author = {I. Dinur and S. Safra},
  title = {On the Importance of Being Biased},
  note = {manuscript \href{http://www.math.ias.edu/~iritd/mypapers/vc.pdf}{{\tt
	http://www.math.ias.edu/\tildegen{}iritd/mypapers/vc.pdf}}},
  year = {2001}
}

@TECHREPORT{DoRo10,
  author = {Quang Do and Dan Roth},
  title = {On-the-fly Constraint-Based Taxonomic Relation Identification},
  year = {2010},
  address = {University of Illinois},
  note = {http://L2R.cs.uiuc.edu/$\sim$danr/Papers/DoRo10.pdf},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@ARTICLE{DHKS93,
  author = {D. Dobkin and J. Hershberger and D. Kirkpatrick and S. Suri},
  title = {Computing the intersection-depth of polyhedra},
  journal = {Algorithmica},
  year = {1993},
  volume = {9},
  pages = {518--533}
}

@ARTICLE{Dobkin91,
  author = {David Dobkin and Subhash Suri},
  title = {Maintenance of Geometric Extrema},
  journal = jacm,
  year = {1991},
  volume = {38},
  pages = {275-298},
  number = {2},
  month = apr,
  keywords = {Computational Geometry; Algorithms; Theory; decomposability; dynamization;
	geometric algorithms; semi-online model; Voronoi diagram; }
}

@INPROCEEDINGS{DobkinGu95,
  author = {David P. Dobkin and Dimitrios Gunopulos},
  title = {Concept learning with geometric hypotheses},
  booktitle = COLT,
  year = {1995},
  pages = {329--336},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{DobkinKi90,
  author = {D. P. Dobkin and D. G. Kirkpatrick},
  title = {Determining the separation of preprocessed polyhedra -- a unified
	approach},
  booktitle = ICALP,
  year = {1990},
  volume = {443},
  series = {Lecture Notes in Computer Science},
  pages = {400--413},
  publisher = {Springer-Verlag}
}

@ARTICLE{DobkinKi85,
  author = {D. P. Dobkin and D. G. Kirkpatrick},
  title = {A linear algorithm for determining the separation of convex polyhedra},
  journal = JALG,
  year = {1985},
  volume = {6},
  pages = {381--392},
  keywords = {design of algorithms, construction, separation, convex, polyhedra,
	hierarchical representations}
}

@PHDTHESIS{Dolan89,
  author = {Charles Patrick Dolan},
  title = {Tensor Manipulation Networks: Connectionist and Symbolic Approaches
	to Comprehension, Learning, and Planning},
  school = {UCLA Computer Science Department},
  year = {1989},
  month = Jun
}

@INPROCEEDINGS{MSRppCorpus,
  author = {W. Dolan and C. Quirk and C. Brockett},
  title = {Unsupervised Construction of Large Paraphrase Corpora: Exploiting
	Massively Parallel News Sources},
  booktitle = COLING,
  year = {2004}
}

@ARTICLE{Dolev93,
  author = {Danny Dolev and Cynthia Dwork and Orli Waarts and Moti Yung},
  title = {Perfectly Secure Message Transmission},
  journal = jacm,
  year = {1993},
  volume = {40},
  pages = {17-47},
  number = {1},
  month = jan,
  keywords = {Distributed Communication; Algorithms; Reliability; Security; distributed
	computing; fault-tolerance; perfectly secure communication; }
}

@ARTICLE{Dolev90,
  author = {Danny Dolev and Ruediger Reischuk and H. Raymond Strong},
  title = {Early Stopping in Byzantine Agreement},
  journal = jacm,
  year = {1990},
  volume = {37},
  pages = {720-741},
  number = {4},
  month = oct,
  keywords = {Distributed Computing; Algorithms; Reliability; Theory; Verification;
	agreement problem; asynchronous system; Byzantine Generals problem;
	commit problem; consensus problem; distributed computing; early stopping;
	fault tolerance; reliability; }
}

@INPROCEEDINGS{Doll'arRaBe07,
  author = {P. Doll\'{a}r and V. Rabaud and S. Belongie},
  title = {Non-isometric manifold learning: analysis and an algorithm},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {241--248},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{Domingo99,
  author = {Carlos Domingo},
  title = {Faster Near-Optimal Reinforcement Learning: Adding Adaptiveness to
	the {E}$^3$ Algorithm},
  booktitle = ALT,
  year = {1999},
  volume = {1720},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {241--251},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{DomingoGaWa98,
  author = {Carlos Domingo and Ricard Gavald{\`a} and Osamu Watanabe},
  title = {Practical algorithms for on-line sampling},
  booktitle = {International Conference on Discovery Science},
  year = {1998},
  volume = {1532},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {150--161},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{DomingoLa95,
  author = {Carlos Domingo and Victor Lav{\'i}n},
  title = {The query complexity of learning some subclasses of context-free
	grammars},
  booktitle = EuroCOLT,
  year = {1995},
  pages = {404--414},
  publisher = {Springer-Verlag}
}

@ARTICLE{DomingoMiPi99,
  author = {Carlos Domingo and Nina Mishra and Leonard Pitt},
  title = {Efficient Read-Restricted Monotone {CNF}/{DNF} Dualization by Learning
	with Membership Queries},
  journal = {Machine Learning},
  year = {1999},
  volume = {37},
  pages = {89--110},
  number = {1},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{DomingoSh95,
  author = {Carlos Domingo and John Shawe-Taylor},
  title = {The complexity of learning minor closed graph classes},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1995},
  pages = {249--260},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{DomingoTsWa97,
  author = {Carlos Domingo and Tatsuie Tsukiji and Osamu Watanabe},
  title = {Partial {O}ccam's razor and its applications},
  booktitle = ALT,
  year = {1997},
  volume = {1316},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {85--99},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{DomingoWa00,
  author = {Carlos Domingo and Osamu Watanabe},
  title = {Mada{B}oost: {A} Modification of {A}da{B}oost},
  booktitle = COLT,
  year = {2000},
  pages = {180--189},
  publisher = {Morgan Kaufmann, San Francisco}
}

@INPROCEEDINGS{Domingos98,
  author = {Pedro Domingos},
  title = {A process-oriented heuristic for model selection},
  booktitle = ICML,
  year = {1998},
  pages = {127--135},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{Domingos97,
  author = {Pedro Domingos},
  title = {Knowledge acquisition from examples via multiple models},
  booktitle = ICML,
  year = {1997},
  pages = {98--106},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{DomingosPa97,
  author = {Domingos, P. and Pazzani. M},
  title = {Beyond Independence: Conditions for the optimality of simple Bayesian
	Classifier },
  journal = {Machine Learning},
  year = {1997},
  volume = {29},
  pages = {103-130}
}

@ARTICLE{DomingosPa97a,
  author = {Pedro Domingos and Michael Pazzani},
  title = {On the optimality of the simple {B}ayesian classifier under zero-one
	loss},
  journal = {Machine Learning},
  year = {1997},
  volume = {29},
  pages = {103--130},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{DomingosPa96,
  author = {Pedro Domingos and Michael Pazzani},
  title = {Beyond independence: conditions for the optimality of the simple
	{B}ayesian classifier},
  booktitle = ICML,
  year = {1996},
  pages = {105--112},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{DLNHNM92,
  author = {Donini, Francesco M. and Lenzerini, Maurizio and Nardi, Daniele and
	Bernhard Hollunder and Nutt, Werner and Marchetti Spaccamela, Alberto},
  title = {The complexity of existential quantification in concept languages},
  journal = {Artificial Intelligence},
  year = {1992},
  volume = {53},
  pages = {309-327}
}

@INPROCEEDINGS{DonohoRe96,
  author = {Steve Donoho and Larry Rendell},
  title = {Constructive induction using fragmentary knowledge},
  booktitle = ICML,
  year = {1996},
  pages = {113--121},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{DonohoRe95,
  author = {Stephen K. Donoho and Larry A. Rendell},
  title = {Lessons from theory revision applied to constructive induction},
  booktitle = ICML,
  year = {1995},
  pages = {185--193},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{Dorigo95,
  author = {Marco Dorigo},
  title = {{ALECSYS} and the {A}utono{M}ouse: learning to control a real robot
	by distributed classifier systems},
  journal = {Machine Learning},
  year = {1995},
  volume = {19},
  pages = {209--240},
  number = {3},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INCOLLECTION{Doucet74,
  author = {P. G. Doucet},
  title = {The syntactic inference problem for {D0L} sequences},
  booktitle = {L-systems},
  publisher = {Springer-Verlag},
  year = {1974},
  pages = {146--161}
}

@INPROCEEDINGS{DoughertyKoSa95,
  author = {James Dougherty and Ron Kohavi and Mehran Sahami},
  title = {Supervised and unsupervised discretization of continuous features},
  booktitle = ICML,
  year = {1995},
  pages = {194--202},
  publisher = {Morgan Kaufmann}
}

@TECHREPORT{Douglas93,
  author = {D. H. Douglas},
  title = {Least Cost Path in Geographic Information Systems},
  institution = {Department of Geography, University of Ottawa},
  year = {1993},
  type = {Research Note No. 61},
  address = {Ottawa, Ontario},
  month = aug,
  annote = {paper was submitted to a journal. Has it appeared??},
  keywords = {shortest paths, weighted region problem, GIS, Snell's Law}
}

@ARTICLE{DouglasPe73,
  author = {D. H. Douglas and T. K. Peucker},
  title = {Algorithms for the Reduction of the Number of Points Required to
	Represent a Digitized Line or Its Caricature},
  journal = {Canadian Cartographer},
  year = {1973},
  volume = {10},
  pages = {112--122},
  number = {2},
  month = dec
}

@ARTICLE{Dowd89,
  author = {Martin Dowd and Yehoshua Perl and Larry Rudolph and Michael Saks},
  title = {The Periodic Balanced Sorting Network},
  journal = jacm,
  year = {1989},
  volume = {36},
  pages = {738-757},
  number = {4},
  month = oct,
  keywords = {Computer Systems; Algorithms; Design; Theory; Verification; Batcher's
	networks; comparators network; parallel sorting; periodic networks;
	shell sort; shuffle-exchange interconnection; sorting networks; }
}

@ARTICLE{Dowdy92,
  author = {Lawrence W. Dowdy and Brian M. Carlson and Alan T. Krantz and Satish
	K. Tripathi},
  title = {Single-Class Bounds of Multi-Class Queuing Networks},
  journal = jacm,
  year = {1992},
  volume = {39},
  pages = {188-213},
  number = {1},
  month = jan,
  keywords = {System Modeling and Analysis; Performance; bounding analysis; product-form
	networks; queuing networks; }
}

@INPROCEEDINGS{DoweOlWa96,
  author = {David L. Dowe and Jonathan J. Oliver and Chris S. Wallace},
  title = {{MML} estimation of the parameters of the spherical {F}isher distribution},
  booktitle = ALT,
  year = {1996},
  volume = {1160},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {213--227},
  publisher = {Springer-Verlag}
}

@ARTICLE{DowlingGa84,
  author = {Dowling, W. F. and Gallier, J. H.},
  title = {Linear-time algorithm for testing satisfiability of propositional
	Horn formulae.},
  journal = {Journal of Logic Programming},
  year = {1984},
  volume = {3},
  pages = {267--284}
}

@INPROCEEDINGS{DowneyScEt07,
  author = {Downey, Doug and Schoenmackers, Stefan and Etzioni, Oren},
  title = {Sparse Information Extraction: Unsupervised Language Models to the
	Rescue},
  booktitle = ACL,
  year = {2007},
  pages = {696--703},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1088}
}

@INPROCEEDINGS{DowneyEvFe93,
  author = {R. Downey and P. Evans and M. Fellows},
  title = {Parameterized learning complexity},
  booktitle = COLT,
  year = {1993},
  pages = {51--57},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{Dowty91,
  author = {D. Dowty},
  title = {Thematic Proto-Roles and Argument Selection},
  journal = {Language},
  year = {1991},
  volume = {67},
  pages = {547-619}
}

@PROCEEDINGS{Doyle88,
  title = {Knowledge, representation and rational self government},
  year = {1988},
  editor = {M. Y. Vardy},
  publisher = {Morgan Kaufman},
  author = {Doyle, J.},
  booktitle = {Second conference on Theoretical aspects of Reasoningabout Knowledge},
  pages = {345-354}
}

@ARTICLE{Doyle89,
  author = {Doyle, J.},
  title = {Constructive belief and rational representation},
  journal = {Computational Intelligence},
  year = {1989},
  volume = {5},
  number = {1}
}

@TECHREPORT{Doyle88a,
  author = {J. Doyle},
  title = {On Rationality and Learning},
  institution = {Carnegie Mellon University},
  year = {1988}
}

@ARTICLE{DoyleP91,
  author = {Doyle, J. and R. Patil},
  title = {Two theses of knowledge representation: languagerestrictions, taxonomic
	classification, and the utility of representation services},
  journal = {Artificial Intelligence},
  year = {1991},
  volume = {48},
  pages = {261--297}
}

@TECHREPORT{DoylePa89,
  author = {Doyle, J. and R. Patil},
  title = {Two Dogmas of Knowledge Representation: LanguageRestriction, Taxonomic
	Classification, and the Utility of Representation Services},
  institution = {MIT Laboratory for Computer Science},
  year = {1989},
  number = {MIT/LCS/TM-387b},
  month = Sep
}

@INPROCEEDINGS{Drakopoulos95,
  author = {John A. Drakopoulos},
  title = {Bounds on the classification error of the nearest neighbor rule},
  booktitle = ICML,
  year = {1995},
  pages = {203--208},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{DrasJo96,
  author = {M. Dras and M. Johnson},
  title = {Death and lightness: Using a demographic model to find support verbs},
  booktitle = {International Conference on the Cognitive Science of Natural Language
	Processing},
  year = {1996}
}

@INBOOK{Drastal94,
  chapter = {7},
  pages = {163--211},
  title = {Learning in abstraction space},
  publisher = {MIT Press},
  year = {1994},
  author = {George Drastal},
  volume = {I: Constraints and Prospects},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@INPROCEEDINGS{DBPGGP07,
  author = {Dredze, Mark and Blitzer, John and Pratim Talukdar, Partha and Ganchev,
	Kuzman and Graca, Jo\~ao and Pereira, Fernando},
  title = {Frustratingly Hard Domain Adaptation for Dependency Parsing},
  booktitle = {CoNLL Shared Task Session of EMNLP-CoNLL},
  year = {2007},
  pages = {1051--1055},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1112}
}

@PHDTHESIS{Drescher89,
  author = {G. L. Drescher},
  title = {Made-up Minds: {A} Constructivist Approach to Artificial Intelligence},
  school = {MIT EECS Department},
  year = {1989},
  month = sep,
  note = {(Reprinted by MIT Press.)}
}

@INPROCEEDINGS{Drescher87,
  author = {Gary L. Drescher},
  title = {A Mechanism for Early {Piagetian} Learning},
  booktitle = AAAI,
  year = {1987},
  pages = {290--294},
  address = {Seattle, Washington},
  month = Jul
}

@TECHREPORT{Drescher86,
  author = {Drescher, Gary L.},
  title = {Genetic {AI}---Translating {P}iaget into {L}isp},
  institution = {MIT Artificial Intelligence Laboratory},
  year = {1986},
  number = {890},
  month = Feb
}

@MASTERSTHESIS{Drescher85,
  author = {Drescher, Gary L.},
  title = {The Schema Mechanism: A Conception of Constructivist Intelligence},
  school = {MIT Department of Electrical Engineering and Computer Science},
  year = {1985},
  month = Feb,
  comment = {Constructivist version of Piagetian theory.}
}

@TECHREPORT{Drescher80,
  author = {Drescher, Gary L.},
  title = {Suggestions for Genetic {A.I.}},
  institution = {MIT Artificial Intelligence Laboratory},
  year = {1980},
  number = {198},
  month = Feb
}

@INPROCEEDINGS{Drucker97,
  author = {Harris Drucker},
  title = {Improving regressors using boosting techniques},
  booktitle = ICML,
  year = {1997},
  pages = {107--115},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{DCJLV94,
  author = {Harris Drucker and Corinna Cortes and L. D. Jackel and Yann Le{C}un
	and Vladimir Vapnik},
  title = {Boosting and other machine learning algorithms},
  booktitle = ICML,
  year = {1994},
  pages = {53--61},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{DrukerScSi93,
  author = {Druker, H. and R. Schapire and P. Simard},
  title = {Improving performance in Neural Networks using a Boosting algorithm},
  booktitle = NIPS,
  year = {1993},
  pages = {42--49},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{DuFaGu99,
  author = {Q. Du and V. Faber and M. Gunzburger},
  title = {Centroidal Voronoi Tessellations: Applications and Algorithms},
  journal = SIAM_REVIEW,
  year = {1999},
  volume = {41},
  pages = {637--676},
  number = {4},
  annote = {920},
  url = {http://epubs.siam.org/sam-bin/dbq/article/35283}
}

@INPROCEEDINGS{Duame07,
  author = {H. Duam\'{e}},
  title = {Frustratingly Easy Domain Adaptation},
  booktitle = ACL,
  year = {2007},
  pages = {256--263},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1033}
}

@INPROCEEDINGS{DuanZhXu07,
  author = {Duan, Xiangyu and Zhao, Jun and Xu, Bo},
  title = {Probabilistic Parsing Action Models for Multi-Lingual Dependency
	Parsing},
  booktitle = {CoNLL Shared Task Session of EMNLP-CoNLL},
  year = {2007},
  pages = {940--946},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1098}
}

@INPROCEEDINGS{Dud'ikBlSc07,
  author = {M. Dud\'{i}k and D. Blei and R. Schapire},
  title = {Hierarchical maximum entropy density estimation},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {249--256},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@BOOK{DudaHa73,
  title = {Pattern Classification and Scene Analysis},
  publisher = {Wiley},
  year = {1973},
  author = {R. O. Duda and P. E. Hart}
}

@BOOK{DudaHaSt01,
  title = {Pattern Classification},
  publisher = {Wiley-Interscience},
  year = {2001},
  author = {R. O. Duda and P. E. Hart and D. G. Stork},
  address = {New York},
  edition = {2nd}
}

@TECHREPORT{DKRZ92,
  author = {R. Dudley and S. Kulkarni and T. Richardson and O. Zeituni},
  title = {A metric entropy bound is not sufficient for learnability},
  institution = {MIT LIDS},
  year = {1992},
  number = {LIDS-P-2144},
  month = oct
}

@ARTICLE{Dudley78,
  author = {Dudley, R. M.},
  title = {Central Limit Theorems for Empirical Measures},
  journal = {The Annals of Probability},
  year = {1978},
  volume = {6},
  pages = {899--929},
  number = {6},
  comment = {Generalization and proofs of Vapnik-Chervonenkis results.}
}

@ARTICLE{Dudley74,
  author = {R. M. Dudley},
  title = {{Metric entropy of some classes of sets with differentiable boundaries}},
  journal = {J. Approx. Theory},
  year = {1974},
  volume = {10},
  pages = {227--236},
  number = {3},
  notes = {correction: Volume 26, Number 2, June 1979, pp.192--193}
}

@INPROCEEDINGS{Duff95,
  author = {Michael O. Duff},
  title = {{Q}-learning for bandit problems},
  booktitle = ICML,
  year = {1995},
  pages = {209--217},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{Duffy86,
  author = {Gavan Duffy},
  title = {Categorical disambiguation},
  booktitle = AAAI,
  year = {1986}
}

@INPROCEEDINGS{DuffyHe00,
  author = {Nigel Duffy and David Helmbold},
  title = {Leveraging for Regression},
  booktitle = COLT,
  year = {2000},
  pages = {208--219},
  publisher = {Morgan Kaufmann, San Francisco}
}

@INPROCEEDINGS{DuffyHe99,
  author = {Nigel Duffy and David P. Helmbold},
  title = {A Geometric Approach to Leveraging Weak Learners},
  booktitle = EuroCOLT,
  year = {1999},
  volume = {1572},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {18--33},
  publisher = {Springer-Verlag}
}

@TECHREPORT{DuMouchel99,
  author = {W. DuMouchel},
  title = {Computer Intrusion Detection Based on Bayes Factors for Comparing
	Command Transition Probabilities},
  institution = {National Institute of Statistical Sciences (NISS)},
  year = {1999},
  number = {TR91}
}

@INPROCEEDINGS{DunaganVe01,
  author = {J. Dunagan and S. Vempala},
  title = {Optimal outlier removal in high-dimensional spaces},
  booktitle = STOC,
  year = {2001},
  pages = {627--636},
  url = {http://portal.acm.org/citation.cfm?id=380860&coll=portal&dl=ACM&CFID=6053296&CFTOKEN=23775034}
}

@INPROCEEDINGS{DuncanGoRa97,
  author = {C. A. Duncan and M. T. Goodrich and E. A. Ramos},
  title = {Efficient Approximation and Optimization Algorithms for Computational
	Metrology},
  booktitle = SODA,
  year = {1997},
  pages = {121--130}
}

@INPROCEEDINGS{Dupon94,
  author = {P. Dupon},
  title = {Regular grammatical inferencefrom positive and negative samples by
	genetic search: The {GIG} method},
  booktitle = ICGI,
  year = {1994},
  volume = {862},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {236--245},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{DupontCh98,
  author = {Pierre Dupont and Lin Chase},
  title = {Using symbol clustering to improve probabilistic automaton inference},
  booktitle = {International Workshop on Algorithmic Learning},
  year = {1998},
  volume = {1433},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {232--243},
  publisher = {Springer-Verlag}
}

@UNPUBLISHED{DurandDrPu02,
  author = {F. Durand and G. Drettakis and C. Puech},
  title = {The 3D Visibility Complex},
  note = {submitted to ACM Transactions on Graphics},
  year = {2002}
}

@INPROCEEDINGS{DHKN03,
  author = {B. Van Durme and Y. Huang and A. Kupsc and E. Nyberg},
  title = {Towards Light Semantic Processing for Question Answering},
  booktitle = {HLT Workshop on Text Meaning},
  year = {2003}
}

@ARTICLE{Dwork92a,
  author = {Cynthia Dwork and Larry Stockmeyer},
  title = {Finite State Verifiers {II}: Zero Knowledge},
  journal = jacm,
  year = {1992},
  volume = {39},
  pages = {829-858},
  number = {4},
  month = oct,
  keywords = {Complexity Theory; Theory; Arthur-Merlin games; complexity theory
	; finite state automata; interactive proof systems; probabilistic
	automata; zero knowledge; }
}

@ARTICLE{Dwyer90,
  author = {R. A. Dwyer},
  title = {Kinder, gentler average-case analysis for convex hulls and maximal
	vectors},
  journal = {SIGACT News},
  year = {1990},
  volume = {21},
  pages = {64--71},
  number = {2},
  keywords = {probabilistic analysis, expected-case analysis, convex hull, $d$-dimensional}
}

@ARTICLE{Dyer91,
  author = {Martin Dyer and Alan Frieze and Ravi Kannan},
  title = {A Random Polynomial Time Algorithm for Approximating the Volume of
	Convex Bodies},
  journal = jacm,
  year = {1991},
  volume = {38},
  pages = {1-17},
  number = {1},
  month = jan,
  keywords = {Computational Geometry; Algorithms; convex sets; random walks; sampling;
	volume; }
}

@INCOLLECTION{DyerMe97,
  author = {M. Dyer and N. Megiddo},
  title = {Linear programming in low dimensions},
  booktitle = {Handbook of Discrete and Computational Geometry},
  publisher = {CRC Press LLC},
  year = {1997},
  editor = {J. E. Goodman and J. O'Rourke},
  chapter = {38},
  pages = {699--710},
  address = {Boca Raton, FL}
}

@ARTICLE{DzeroskiDeDr01,
  author = {Saso Dzeroski and De Raedt, L. and Kurt Driessens},
  title = {Relational Reinforcement Learning},
  journal = {Machine Learning},
  year = {2001},
  volume = {43},
  pages = {5--52},
  number = {1/2},
  month = {April},
  abstract = {Relational reinforcement learning is presented, a learning technique
	that combines reinforcement learning with relational learning or
	inductive logic programming. Due to the use of a more expressive
	representation language to represent states, actions and Q-functions,
	relational reinforcement learning can be potentially applied to a
	new range of learning tasks. One such task that we investigate is
	planning in the blocks world, where it is assumed that the effects
	of the actions are unknown to the agent and the agent has to learn
	a policy. Within this simple domain we show that relational reinforcement
	learning solves some existing problems with reinforcement learning.
	In particular, relational reinforcement learning allows us to employ
	structural representations, to abstract from specific goals pursued
	and to exploit the results of previous learning phases when addressing
	new (more complex) situations.},
  issn = {0885-6125},
  pubtype = {11}
}

@INPROCEEDINGS{DzeroskiEr97,
  author = {Dzeroski, S. and Erjavec, T.},
  title = {Induction of Slovene Nominal Paradigms},
  booktitle = ILP,
  year = {1997},
  pages = {141--148},
  address = {Prague, Czech Republic},
  publisher = {Springer},
  note = {LNAI 1297}
}

@INBOOK{DvMuRu95,
  chapter = {13},
  pages = {243--255},
  title = {{PAC}-learnability of constrained nonrecursive logic programs},
  publisher = {MIT Press},
  year = {1995},
  author = {Sa{\v s}o D{\v z}eroski and Stephen Muggleton and Stuart Russell},
  volume = {III: Selecting Good Models},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@INPROCEEDINGS{DvRaBl98,
  author = {Sa{\v s}o D{\v z}eroski and Luc De Raedt and Hendrik Blockeel},
  title = {Relational reinforcement learning},
  booktitle = ICML,
  year = {1998},
  pages = {136--143},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{Bar-EliBerFiYa92,
  author = {E. Bar-Eli, P. Berman, A. Fiat and P. Yan},
  title = {On-line Navigation in a Room},
  booktitle = SODA,
  year = {1992},
  pages = {237--249}
}

@INPROCEEDINGS{EFNN89,
  author = {H. Ebara and N. Fukuyama and H. Nakano and Y. Nakanishi},
  title = {Roundness algorithms using the {Voronoi} diagrams},
  booktitle = {CCCG},
  year = {1989},
  pages = {41}
}

@BOOK{Edelman87,
  title = {Neural Darwinism -- The Theory of Neuronal Group Selection},
  publisher = {Basic Books},
  year = {1987},
  author = {Gerald M. Edelman}
}

@ARTICLE{EdelmanRee82,
  author = {Edelman, G. M. and G. N Reeke, Jr.},
  title = {Selective networks capable of representative transformations, limited
	generalizations and associative memory},
  journal = {Proceedings of the National Academy of Scicence},
  year = {1982},
  volume = {79},
  pages = {2091--2095}
}

@ARTICLE{Edelman93,
  author = {S. Edelman},
  title = {On Learning to REcognize 3-D objects from Examples},
  journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence},
  year = {1993},
  volume = {15},
  pages = {833-837},
  number = {8}
}

@BOOK{Edelsbrunner87,
  title = {{Algorithms in Combinatorial Geometry}},
  publisher = {Springer-Verlag},
  year = {1987},
  author = {H. Edelsbrunner},
  series = {EATCS Monographs on Theoretical Computer Science},
  address = {Heidelberg},
  url = {http://www.springer.de/cgi-bin/search_book.pl?isbn=3-540-13722-X&cookie=done}
}

@ARTICLE{EdelsbrunnerGu89,
  author = {H. Edelsbrunner and L. J. Guibas},
  title = {Topologically sweeping an arrangement},
  journal = {J. Comput. Syst. Sci.},
  year = {1989},
  volume = {38},
  pages = {165--194},
  note = {Corrigendum in 42 (1991), 249--251}
}

@ARTICLE{EGHSSSW89,
  author = {H. Edelsbrunner and L. J. Guibas and J. Hershberger and R. Seidel
	and M. Sharir and J. Snoeyink and E. Welzl},
  title = {Implicitly representing arrangements of lines or segments},
  journal = DCG,
  year = {1989},
  volume = {4},
  pages = {433--466}
}

@ARTICLE{EGPPSS92,
  author = {H. Edelsbrunner and L. J. Guibas and J. Pach and R. Pollack and R.
	Seidel and M. Sharir},
  title = {{Arrangements of curves in the plane: Topology, combinatorics, and
	algorithms}},
  journal = TCS,
  year = {1992},
  volume = {92},
  pages = {319--336}
}

@ARTICLE{EdelsbrunnerGuSh90,
  author = {H. Edelsbrunner and L. J. Guibas and M. Sharir},
  title = {{The complexity and construction of many faces in arrangements of
	lines and of segments}},
  journal = DCG,
  year = {1990},
  volume = {5},
  pages = {161--196}
}

@ARTICLE{EdelsbrunnerGuSh89,
  author = {H. Edelsbrunner and L. J. Guibas and M. Sharir},
  title = {The upper envelope of piecewise linear functions: algorithms and
	applications},
  journal = DCG,
  year = {1989},
  volume = {4},
  pages = {311--336},
  keywords = {upper/lower envelope, arrangement of simplices}
}

@ARTICLE{EdelsbrunnerGuSt86,
  author = {H. Edelsbrunner and L. J. Guibas and J. Stolfi},
  title = {Optimal point location in a monotone subdivision},
  journal = SICOMP,
  year = {1986},
  volume = {15},
  pages = {317--340},
  number = {2},
  keywords = {data structuring, searching, point location, binary search, directed
	acyclic graphs, subdivisions, two-dimensional}
}

@ARTICLE{EdelsbrunnerSh90,
  author = {H. Edelsbrunner and M. Sharir},
  title = {{The maximum number of ways to stab $n$ disjoint convex sets in the
	plane is $2n-2$}},
  journal = DCG,
  year = {1990},
  volume = {5},
  pages = {35--42}
}

@ARTICLE{EdelsbrunnerWe86,
  author = {H. Edelsbrunner and E. Welzl},
  title = {Constructing belts in two-dimensional arrangements with applications},
  journal = SICOMP,
  year = {1986},
  volume = {15},
  pages = {271--284}
}

@ARTICLE{EdmondsJo73,
  author = {Jack Edmonds and Ellis L. Johnson},
  title = {Matching, {E}uler Tours and the {C}hinese {P}ostman},
  journal = {Mathematical Programming},
  year = {1973},
  volume = {5},
  pages = {88-124},
  comment = {Shows how to solve Chinese postman problem via matching. Describes
	algorithms for finding Euler tours.}
}

@INPROCEEDINGS{Efrat99,
  author = {A. Efrat},
  title = {The Complexity of the Union of $(\alpha,\beta)$-Covered Objects},
  booktitle = {SOCG},
  year = {1999},
  pages = {134--142},
  url = {http://www.cs.arizona.edu/~alon/papers/alphabeta.ps}
}

@ARTICLE{EfratGo94,
  author = {A. Efrat and C. Gotsman},
  title = {{Subpixel image registration using circular fiducials}},
  journal = IJCGA,
  year = {1994},
  volume = {4},
  pages = {403--422},
  number = {4}
}

@INPROCEEDINGS{EGHLMM00,
  author = {A. Efrat and L. J. Guibas and S. {Har-Peled} and and D. C. Lin and
	J. S.B. Mitchell and T. M. Murali},
  title = {Sweeping Simple Polygons with a Chain of Guards},
  booktitle = SODA,
  year = {2000},
  pages = {927--936}
}

@INPROCEEDINGS{EGHM01,
  author = {A. Efrat and L. J. Guibas and S. {Har-Peled} and T. M. Murali},
  title = {Morphing between Polylines},
  booktitle = SODA,
  year = {2001},
  pages = {680-689}
}

@ARTICLE{EfratHa02,
  author = {A. Efrat and S. {Har-Peled}},
  title = {Locating guards in art galleries},
  journal = {2nd IFIP Internat. Conf. Theo. Comp. Sci.},
  year = {2002},
  pages = {181--192}
}

@INPROCEEDINGS{EfratHa98,
  author = {A. Efrat and S. {Har-Peled}},
  title = {{Fly cheaply: on the minimum fuel consumption problem}},
  booktitle = {SOCG},
  year = {1998},
  pages = {143--145}
}

@ARTICLE{EfratHa98a,
  author = {A. Efrat and S. {Har-Peled}},
  title = {{Fly cheaply: on the minimum fuel consumption problem}},
  journal = IJCGA,
  year = {1998},
  note = {to appear}
}

@ARTICLE{EHGMM02,
  author = {A. Efrat and S. {Har-Peled} and L. J. Guibas and J. S.B. Mitchell
	and T.M. Murali},
  title = {New Similarity Measures between Polylines with Applications to Morphing
	and Polygon Sweeping},
  journal = DCG,
  year = {2002},
  volume = {28},
  pages = {535--569}
}

@ARTICLE{EfratSh00,
  author = {A. Efrat and M. Sharir},
  title = {On the complexity of the union of fat convex objects in the plane},
  journal = DCG,
  year = {2000},
  volume = {23},
  pages = {171--189}
}

@ARTICLE{Efron65,
  author = {B. Efron},
  title = {The convex hull of a random set of points},
  journal = {Biometrika},
  year = {1965},
  volume = {52},
  pages = {331--343},
  number = {3},
  annote = {168}
}

@ARTICLE{EfronTh87,
  author = {Bradley Efron and Ronald Thisted},
  title = {Did Shakespeare write a newly discovered poem?},
  journal = {Biometrika},
  year = {1987},
  volume = {74},
  pages = {445-455}
}

@ARTICLE{EgeciogluKa89,
  author = {O. Egecioglu and B. Kalantari},
  title = {Approximating the diameter of a set of points in the {Euclidean}
	space},
  journal = IPL,
  year = {1989},
  volume = {32},
  pages = {205--211}
}

@ARTICLE{EhrenfeuchtHa89,
  author = {Ehrenfeucht, Andrzej and David Haussler},
  title = {Learning Decision Trees from Random Examples},
  journal = {Information and Computation},
  year = {1989},
  volume = {82},
  pages = {231--246},
  number = {3},
  month = Sep
}

@INPROCEEDINGS{EhrenfeuchtHa88,
  author = {Ehrenfeucht, Andrzej and David Haussler},
  title = {Learning Decision Trees from Random Examples},
  booktitle = {Workshop on Computational Learning Theory},
  year = {1988},
  pages = {182--194},
  address = {Cambridge, MA},
  month = Aug
}

@ARTICLE{EhrenfeuchtHaKeVa89,
  author = {Andrzej Ehrenfeucht and David Haussler and Michael Kearns and Leslie
	Valiant},
  title = {A General Lower Bound on the Number of Examples Needed for Learning},
  journal = {Information and Computation},
  year = {1989},
  volume = {82},
  pages = {247--251},
  number = {3},
  month = Sep
}

@INPROCEEDINGS{Eijk93,
  author = {Pim van der Eijk},
  title = {Automating the acquisition of bilingual terminology},
  booktitle = EACL,
  year = {1993},
  pages = {113--119}
}

@ARTICLE{EiseltLa89,
  author = {H. A. Eiselt and G. Laporte},
  title = {Competitive spatial models},
  journal = {European Journal of Operational Research},
  year = {1989},
  volume = {39},
  pages = {231--242}
}

@ARTICLE{EiseltLaTh93,
  author = {H. A. Eiselt and G. Laporte and J.-F. Thisse},
  title = {Competitive location models: A framework and bibliography},
  journal = {Transportation Science},
  year = {1993},
  volume = {27},
  pages = {44--54}
}

@INPROCEEDINGS{EisenbergRi90,
  author = {Eisenberg, Bonnie and Ronald Rivest},
  title = {On the Sample Complexity of {PAC}-Learning Using Random and Chosen
	Examples},
  booktitle = COLT,
  year = {1990},
  pages = {154--162},
  publisher = {Morgan Kaufmann},
  tag = {TOC-display}
}

@MASTERSTHESIS{Eisenberg92,
  author = {B. B. Eisenberg},
  title = {On the sample complexity of {PAC}-learning using random and chosen
	examples},
  school = {MIT EECS Department},
  year = {1992},
  note = {(LCS Technical report MIT/LCS/TR-535, March 1992.)}
}

@INPROCEEDINGS{EisensteinDa07,
  author = {Eisenstein, Jacob and Davis, Randall},
  title = {Conditional Modality Fusion for Coreference Resolution},
  booktitle = ACL,
  year = {2007},
  pages = {352--359},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1045}
}

@INPROCEEDINGS{Eisner96,
  author = {J. Eisner},
  title = {Three New Probabilistic Models for Dependency Parsing: An Exploration},
  booktitle = COLING,
  year = {1996},
  pages = {340--345},
  address = {Copenhagen},
  month = {August},
  timestamp = {2007.01.26},
  url = {http://cs.jhu.edu/~jason/papers/#coling96}
}

@ARTICLE{EjdysG99,
  author = {Piotr Ejdys and Grzegorz G{\'a}ra},
  title = {The More We Learn the Less We Know? On Inductive Learning from Examples},
  journal = {Fundamenta Informaticae},
  year = {1999},
  volume = {39},
  pages = {359--374},
  number = {4}
}

@ARTICLE{ElGindyAv81,
  author = {H. ElGindy and D. Avis},
  title = {A linear algorithm for computing the visibility polygon from a point},
  journal = JALG,
  year = {1981},
  volume = {2},
  pages = {186--197},
  keywords = {polygons, visibility, visibility graphs}
}

@ARTICLE{ElioWa91,
  author = {Ren{\'{e}}e Elio and Larry Watanabe},
  title = {An Incremental Deductive Strategy for Controlling Constructive Induction
	in Learning from Examples},
  journal = {Machine Learning},
  year = {1991},
  volume = {7},
  pages = {7--44},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{ElisseeffGuPa00,
  author = {A. Elisseeff and Y. Guermeur and H. {Paugam-Moisy}},
  title = {Margin error and generalization capabilities of multiclass discriminant
	systems},
  booktitle = {IEEE-INNS-ENNS International Joint Conference on Neural Networks},
  year = {2000}
}

@TECHREPORT{Elkan97,
  author = {C. Elkan},
  title = {Boosting and Naive Bayesian Learning},
  institution = {Department of Computer Science, University of California, San Diego},
  year = {1997},
  number = {CS97-557}
}

@ARTICLE{Elman91,
  author = {Jeffrey L. Elman},
  title = {Distributed Representations, Simple Recurrent Networks, and Grammatical
	Structure},
  journal = {Machine Learning},
  year = {1991},
  volume = {7},
  pages = {195--225},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{Elomaa94,
  author = {Tapio Elomaa},
  title = {In defense of {C}4.5: notes on learning one-level decision trees},
  booktitle = ICML,
  year = {1994},
  pages = {62--69},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{ElomaaRo99,
  author = {Tapio Elomaa and Juho Rousu},
  title = {General and Efficient Multisplitting of Numerical Attributes},
  journal = {Machine Learning},
  year = {1999},
  volume = {36},
  pages = {201--244},
  number = {3},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{ElsnerCh07,
  author = {Micha Elsner and Eugene Charniak},
  title = {A unified local and global model for discourse coherence},
  booktitle = NAACL,
  year = {2007}
}

@INPROCEEDINGS{Elworthy94,
  author = {David Elworthy},
  title = {Does {Baum-Welch} re-estimation improve taggers?},
  booktitle = ANLP,
  year = {1994},
  pages = {53--58}
}

@ARTICLE{Emde77,
  author = {P. van {Emde Boas}},
  title = {Preserving order in a forest in less than logarithmic time and linear
	space},
  journal = IPL,
  year = {1977},
  volume = {6},
  pages = {80--82}
}

@INPROCEEDINGS{EmdeWe96,
  author = {Werner Emde and Dietrich Wettschereck},
  title = {Relational instance-based learning},
  booktitle = ICML,
  year = {1996},
  pages = {122--130},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{EmeraldSuTh98,
  author = {J. D. Emerald and K. G. Subramanian and D. G. Thomas},
  title = {Learning a subclass of context-free languages},
  booktitle = {International Workshop on Algorithmic Learning},
  year = {1998},
  volume = {1433},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {223--231},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{EngebretsenInO'02,
  author = {L. Engebretsen and P. Indyk and R. O'Donnell},
  title = {Derandomized dimensionality reduction with applications},
  booktitle = SODA,
  year = {2002},
  note = {to appear}
}

@ARTICLE{Engelfriet89,
  author = {Joost Engelfriet and Gilberto Fil{\'e}},
  title = {Passes, Sweeps, and Visits in Attribute Grammars},
  journal = jacm,
  year = {1989},
  volume = {36},
  pages = {841-869},
  number = {4},
  month = oct,
  keywords = {Formal Languages; Algorithms; Languages; Theory; Verification; attribute
	evaluator; attribute grammar; computational complexity; }
}

@INPROCEEDINGS{EngelsonKo96,
  author = {Sean P. Engelson and Moshe Koppel},
  title = {Identifying the information contained in a flawed theory},
  booktitle = ICML,
  year = {1996},
  pages = {131--138},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{EngelsonKo95,
  author = {Sean P. Engelson and Moshe Koppel},
  title = {Distilling reliable information from unreliable theories},
  booktitle = ICML,
  year = {1995},
  pages = {218--225},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{Eppstein03,
  author = {D. Eppstein},
  title = {Dynamic generators of topologically embedded graphs},
  booktitle = SODA,
  year = {2003},
  pages = {599--608}
}

@INPROCEEDINGS{Eppstein98,
  author = {D. Eppstein},
  title = {Fast Hierarchical Clustering and Other Applications of Dynamic Closest
	Pairs},
  booktitle = SODA,
  year = {1998},
  pages = {619--628},
  nickname = {SODA '98}
}

@INPROCEEDINGS{Eppstein97,
  author = {D. Eppstein},
  title = {Faster construction of planar two-centers},
  booktitle = SODA,
  year = {1997}
}

@ARTICLE{Eppstein95,
  author = {D. Eppstein},
  title = {Dynamic {Euclidean} minimum spanning trees and extrema of binary
	functions},
  journal = DCG,
  year = {1995},
  volume = {13},
  pages = {111--122},
  url = {http://www.ics.uci.edu/~eppstein/pubs/Epp-DCG-95.pdf}
}

@ARTICLE{EppsteinEr94,
  author = {D. Eppstein and J. Erickson},
  title = {Iterated nearest neighbors and finding minimal polytopes},
  journal = DCG,
  year = {1994},
  volume = {11},
  pages = {321--350},
  url = {http://compgeom.cs.uiuc.edu/~jeffe/pubs/small.html}
}

@ARTICLE{Eppstein92,
  author = {David Eppstein and Zvi Galil and Raffaele Giancarlo and Giuseppe
	F. Italiano},
  title = {Sparse Dynamic Programming {I}: Linear Cost Functions},
  journal = jacm,
  year = {1992},
  volume = {39},
  pages = {519-545},
  number = {3},
  month = jul,
  keywords = {String Processing; Algorithms; Theory; dynamic programming; recurrence;
	sequence alignment; sparsity; time complexity; }
}

@INBOOK{Epstein94,
  chapter = {18},
  pages = {487--521},
  title = {Hard questions about easy tasks: issues from learning to play games},
  publisher = {MIT Press},
  year = {1994},
  author = {Susan L. Epstein},
  volume = {I: Constraints and Prospects},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@ARTICLE{Epstein94a,
  author = {Susan L. Epstein},
  title = {Toward an ideal trainer},
  journal = {Machine Learning},
  year = {1994},
  volume = {15},
  pages = {251--278},
  number = {3},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{ErgunKuRu95,
  author = {Funda Erg{\"u}n and Ravi S. Kumar and Ronitt Rubinfeld},
  title = {On learning bounded-width branching programs},
  booktitle = COLT,
  year = {1995},
  pages = {361--368},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{ErgunKuRu97,
  author = {Funda Erg{\"u}n and S. Ravi Kumar and Ronitt Rubinfeld},
  title = {Learning Distributions from Random Walks},
  booktitle = COLT,
  year = {1997},
  pages = {243--249},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{Erickson01,
  author = {J. Erickson},
  title = {Nice point sets can have nasty {Delaunay} triangulations},
  booktitle = {SOCG},
  year = {2001},
  pages = {96--105},
  url = {http://www.uiuc.edu/~jeffe/pubs/spread.html}
}

@ARTICLE{Erickson99,
  author = {J. Erickson},
  title = {New Lower Bounds for Convex Hull Problems in Odd Dimensions},
  journal = SICOMP,
  year = {1999},
  volume = {28},
  pages = {1198--1214},
  url = {http://compgeom.cs.uiuc.edu/~jeffe/pubs/convex.html}
}

@INPROCEEDINGS{Erickson95,
  author = {J. Erickson},
  title = {New Lower Bounds for {Hopcroft's} Problem},
  booktitle = {SOCG},
  year = {1995},
  pages = {127--137},
  annote = {109},
  keywords = {partitioning algorithms}
}

@ARTICLE{EricksonHa03,
  author = {J. Erickson and S. {Har-Peled}},
  title = {Optimally Cutting a Surface into a Disk},
  journal = DCG,
  year = {2003},
  note = {To appear}
}

@INPROCEEDINGS{EricksonHa02,
  author = {J. Erickson and S. {Har-Peled}},
  title = {Optimally Cutting a Surface into a Disk},
  booktitle = {SOCG},
  year = {2002},
  pages = {244--253}
}

@ARTICLE{EricksonSe95,
  author = {J. Erickson and R. Seidel},
  title = {Better lower bounds on detecting affine and spherical degeneracies},
  journal = DCG,
  year = {1995},
  volume = {13},
  pages = {41--57},
  url = {http://compgeom.cs.uiuc.edu/~jeffe/pubs/degen.html}
}

@INPROCEEDINGS{Erk07,
  author = {Erk, Katrin},
  title = {A Simple, Similarity-based Model for Selectional Preferences},
  booktitle = ACL,
  year = {2007},
  pages = {216--223},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1028}
}

@INPROCEEDINGS{ErkanOzRa07,
  author = {Erkan, Gunes and Ozgur, Arzucan and Radev, Dragomir R.},
  title = {Semi-Supervised Classification for Extracting Protein Interaction
	Sentences using Dependency Parsing},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {228--237},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1024}
}

@INPROCEEDINGS{ERSSZ97,
  author = {Thomas Erlebach and Peter Rossmanith and Hans Stadtherr and Angelika
	Steger and Thomas Zeugmann},
  title = {Learning one-variable pattern languages very efficiently on average,
	in parallel, and by asking queries},
  booktitle = ALT,
  year = {1997},
  volume = {1316},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {260--276},
  publisher = {Springer-Verlag}
}

@TECHREPORT{ERSSZ96,
  author = {T. Erlebach and P. Rossmanith and H. Stadtherr and A. Steger and
	T. Zeugmann},
  title = {Efficient Learning of One-Variable Pattern Languages from Positive
	Examples},
  institution = {Department of Informatics, Kyushu University},
  year = {1996},
  number = {DOI-TR-128}
}

@ARTICLE{ESFF00,
  author = {Floriana Esposito and Giovanni Semeraro and Nicola Fanizzi and Stefano
	Ferilli},
  title = {Multistrategy Theory Revision: Induction and Abduction in {INTHELEX}},
  journal = {Machine Learning},
  year = {2000},
  volume = {38},
  pages = {133--156},
  number = {1/2},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{EspositoRa07,
  author = {R. Esposito and D. Radicioni},
  title = {{CarpeDiem}: an algorithm for the fast evaluation of {SSL} classifiers},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {257--264},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{Essen92,
  author = {Ute Essen and Volker Steinbiss},
  title = {Cooccurrence Smoothing for Stochastic Language Modeling},
  booktitle = ICASSP,
  year = {1992},
  volume = {I},
  pages = {161--164},
  publisher = {{IEEE}}
}

@ARTICLE{Estivill-CastroMaWo93,
  author = {Vladimir Estivill-Castro and Heikki Mannila and Derick Wood},
  title = {Right invariant metrics and measures of presortedness},
  journal = {Discrete Applied Mathematics},
  year = {1993},
  volume = {42},
  pages = {1-16}
}

@INPROCEEDINGS{EsuliSe07,
  author = {Esuli, Andrea and Sebastiani, Fabrizio},
  title = {PageRanking WordNet Synsets: An Application to Opinion Mining},
  booktitle = ACL,
  year = {2007},
  pages = {424--431},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1054}
}

@INPROCEEDINGS{EtheringtonBoBrKa89,
  author = {Etherington, D. and A. Borgida and R. Brachman and H. Kautz},
  title = {Vivid Knowledge and Tractable Reasoning: PerliminaryReport},
  booktitle = IJCAI,
  year = {1989}
}

@BOOK{Etherington88,
  title = {Reasoning With Incomplete Information},
  publisher = {Morgan Kaufmann},
  year = {1988},
  author = {Etherington, D. W.}
}

@ARTICLE{EtzioniEt94,
  author = {Oren Etzioni and Ruth Etzioni},
  title = {Statistical Methods for Analyzing Speedup Learning Experiments},
  journal = {Machine Learning},
  year = {1994},
  volume = {14},
  pages = {333--347},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Euler36,
  author = {L. Euler},
  title = {Solutio problematis ad geometriam situs pertinentis},
  journal = {Commentarii Academiae Petropolitanae},
  year = {1736},
  volume = {8},
  pages = {128--140},
  comment = {Original reference for "Euler tours"}
}

@INPROCEEDINGS{EvansZh96,
  author = {David A. Evans and Chengxiang Zhai},
  title = {Noun Phrase Analysis in Large Unrestricted Text for Information Retrieval},
  booktitle = ACL,
  year = {1996},
  pages = {17--24}
}

@INPROCEEDINGS{EvansRaVa93,
  author = {W. Evans and S. Rajagopalan and U. Vazirani},
  title = {Choosing a reliable hypothesis},
  booktitle = COLT,
  year = {1993},
  pages = {269--276},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{ELRS03,
  author = {G.~Even and Z.~Lotker and D.~Ron and S.~Smordinsky},
  title = {Conflict-free colorings of simple geometric regions with applications
	to frequency assignment in cellular networks},
  journal = SICOMP,
  year = {2003},
  note = {To appear.}
}

@INPROCEEDINGS{ELRS02,
  author = {G.~Even and Z.~Lotker and D.~Ron and S.~Smordinsky},
  title = {Conflict-free colorings of simple geometric regions with applications
	to frequency assignment in cellular networks},
  booktitle = FOCS,
  year = {2002},
  pages = {691--700},
  url = {http://www.eng.tau.ac.il/~guy/Papers/ELRS.pdf}
}

@ARTICLE{EverettRoKr96,
  author = {H. Everett and J.-M. Robert and M. van Kreveld},
  title = {An optimal algorithm for the $({\leq} k)$-levels, with applications
	to separation and transversal problems},
  journal = IJCGA,
  year = {1996},
  volume = {6},
  pages = {247--261}
}

@INPROCEEDINGS{EvgeniouPo04,
  author = {T. Evgeniou and M. Pontil},
  title = {Regularized multi--task learning},
  booktitle = KDD,
  year = {2004},
  pages = {109--117},
  address = {New York, NY, USA},
  publisher = {ACM},
  doi = {http://doi.acm.org/10.1145/1014052.1014067},
  isbn = {1-58113-888-1},
  location = {Seattle, WA, USA}
}

@INPROCEEDINGS{EvgeniouPo99,
  author = {Theodoros Evgeniou and Massimiliano Pontil},
  title = {On the ${V}_\gamma$ Dimension for Regression in Reproducing Kernel
	Hilbert Spaces},
  booktitle = ALT,
  year = {1999},
  volume = {1720},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {106--117},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{EzawaSiNo96,
  author = {Kazuo J. Ezawa and Moninder Singh and Steven W. Norton},
  title = {Learning goal oriented {B}ayesian networks for telecommunications
	risk management},
  booktitle = ICML,
  year = {1996},
  pages = {139--147},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{FaberMy91,
  author = {V. Faber and J. Mycielski},
  title = {Applications of Learning Theorems},
  journal = {Fundamenta Informaticae},
  year = {1991},
  volume = {15},
  pages = {145--167},
  number = {2}
}

@INPROCEEDINGS{FRCMQC07,
  author = {Fader, Anthony and Radev, Dragomir R. and Crespin, Michael H. and
	Monroe, Burt L. and Quinn, Kevin M. and Colaresi, Michael},
  title = {{M}aven{R}ank: Identifying Influential Members of the {US} Senate
	Using Lexical Centrality},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {658--666},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1069}
}

@ARTICLE{Fagin82,
  author = {Fagin, R.},
  title = {{H}orn Clauses and Database Dependencies},
  journal = JACM,
  year = {1982},
  volume = {29},
  pages = {952--985},
  number = {4}
}

@ARTICLE{FaginHaMe90,
  author = {Ronald Fagin and Joseph Y. Halpern and Nimrod Megiddo},
  title = {A Logic for Reasoning about Probabilities},
  journal = {Information and Computation},
  year = {1990},
  volume = {87},
  pages = {78-128},
  number = {1/2},
  url = {citeseer.ist.psu.edu/fagin90logic.html}
}

@ARTICLE{Fagin92,
  author = {Ronald Fagin and Joseph Y. Halpern and Moshe Y. Vardi},
  title = {What Can Machines Know? On the Properties of Knowledge in Distributed
	Systems},
  journal = jacm,
  year = {1992},
  volume = {39},
  pages = {328-376},
  number = {2},
  month = apr,
  keywords = {Logic; Theory; axioms; distributed knowledge; properties of knowledge;
	reasoning about knowledge; }
}

@ARTICLE{Fagin91,
  author = {Ronald Fagin and Joseph Y. Halpern and Moshe Y. Vardi},
  title = {A Model-Theoretic Analysis of Knowledge},
  journal = jacm,
  year = {1991},
  volume = {38},
  pages = {382-428},
  number = {2},
  month = apr,
  keywords = {Distributed Computing; Theory; common knowledge; distributed systems;
	epistemology; knowledge; knowledge structures; Kripke structure;
	modal logic; possible worlds; reasoning about knowledge; }
}

@ARTICLE{FaginKuSi03,
  author = {Ronald Fagin and Ravi Kumar and D. Sivakumar},
  title = {Comparing Top k Lists},
  journal = {SIAM Journal on Discrete Mathematics},
  year = {2003},
  volume = {17},
  pages = {134-160}
}

@ARTICLE{FagiuoliZa98,
  author = {Enrico Fagiuoli and Marco Zaffalon},
  title = {2U: an exact interval propagation algorithm for polytrees with binary
	variables},
  journal = {Artificial Intelligence},
  year = {1998},
  volume = {106},
  pages = {77--107},
  number = {1},
  address = {Essex, UK},
  doi = {http://dx.doi.org/10.1016/S0004-3702(98)00089-7},
  issn = {0004-3702},
  publisher = {Elsevier Science Publishers Ltd.}
}

@BOOK{Fahlman79,
  title = {NETL: A System for representation and Using Real-world Knowledge},
  publisher = {MIT Press},
  year = {1979},
  author = {Fahlman,S.}
}

@INPROCEEDINGS{FahlmanLe90a,
  author = {Fahlman, Scott E. and Christian Lebiere},
  title = {The Cascade-Correlation Learning Architecture},
  booktitle = NIPS,
  year = {1990},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{FahmyBi93,
  author = {Amr F. Fahmy and A. W. Biermann},
  title = {Synthesis of real time acceptors},
  journal = {J. Symbolic Computation},
  year = {1993},
  volume = {15},
  pages = {807--842}
}

@INPROCEEDINGS{FahmyRo95,
  author = {Amr F. Fahmy and Robert S. Roos},
  title = {Efficient learning of real time one-counter automata},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1995},
  pages = {25--40},
  publisher = {Springer-Verlag}
}

@ARTICLE{FaigleKeSt96,
  author = {U.~Faigle and W.~Kern and M.~Streng},
  title = {{Note on the computational complexity of $j$-radii of polytopes in
	$\Re^n$}},
  journal = {Mathematical Programming},
  year = {1996},
  volume = {73},
  pages = {1--5}
}

@ARTICLE{FalkenhainerMi86,
  author = {Brian C. Falkenhainer and Ryszard S. Michalski},
  title = {Integrating Quantitative and Qualitative Discovery: The {ABACUS}
	System},
  journal = {Machine Learning},
  year = {1986},
  volume = {1},
  pages = {367--401},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{FaloutsosLi95,
  author = {C. Faloutsos and K. I. Lin},
  title = {{FastMap}: a fast algorithm for indexing, data-mining and visualization
	of traditional and multimedia datasets},
  journal = {SIGMOD Record (ACM Special Interest Group on Management of Data)},
  year = {1995},
  volume = {24},
  pages = {163--174},
  number = {2},
  month = {June},
  acknowledgement = {Nelson H. F. Beebe, Center for Scientific Computing, Department of
	Mathematics, University of Utah, Salt Lake City, UT 84112, USA, Tel:
	+1 801 581 5254, FAX: +1 801 581 4148, e-mail: \path|beebe@math.utah.edu|,
	URL: \path|http://www.math.utah.edu/\tildegen{}beebe/|},
  affiliation = {AT\&T Bell Labs., Murray Hill, NJ, USA},
  bibdate = {Mon Dec 9 16:02:09 MST 1996},
  classification = {C6160 (Database management systems (DBMS)); C6170K (Knowledge engineering
	techniques); C7240 (Information analysis and indexing); C6160S (Spatial
	and pictorial databases); C4240 (Programming and algorithm theory)},
  coden = {SRECD8},
  issn = {0163-5808},
  keywords = {FastMap; Fast algorithm; Indexing; Data-mining; Visualization; Multimedia
	datasets; Traditional datasets; Feature-extraction functions; Domain
	expert; Highly fine-tuned spatial access methods; Best-match query;
	K-dimensional space; Potential clusters; Pattern recognition},
  thesaurus = {Feature extraction; Indexing; Knowledge acquisition; Multimedia computing;
	Pattern matching},
  xxcrossref = {Anonymous:1995:ASI}
}

@ARTICLE{FCHWL08,
  author = {R.-E. Fan and K.-W. Chang and C.-J. Hsieh and X.-R. Wang and C.-J.
	Lin},
  title = {LIBLINEAR: A Library for Large Linear Classification},
  journal = {Journal of Machine Learning Research},
  year = {2008},
  volume = {9},
  pages = {1871--1874}
}

@INPROCEEDINGS{FSZC99,
  author = {Wei Fan and Salvatore J. Stolfo and Junxin Zhang and Philip K. Chan},
  title = {Ada{C}ost: misclassification cost-sensitive boosting},
  booktitle = ICML,
  year = {1999},
  pages = {97--105},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{Fang08,
  author = {Hui Fang},
  title = {A {R}e-examination of {Q}uery {E}xpansion using {L}exical {R}esources},
  booktitle = ACL,
  year = {2008},
  pages = {139--147}
}

@INPROCEEDINGS{FangVe93,
  author = {S. Fang and S. Venkatesh},
  title = {On the average tractability of binary integer programming and the
	curious transition to perfect generalization in learning majority
	functions},
  booktitle = COLT,
  year = {1993},
  pages = {310--316},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{FangVe96,
  author = {Shao C. Fang and Santosh S. Venkatesh},
  title = {Learning binary perceptrons perfectly efficiently},
  journal = {J. of Comput. Syst. Sci.},
  year = {1996},
  volume = {52},
  pages = {374--389},
  number = {2}
}

@BOOK{Fano61,
  title = {Transmission of Information},
  publisher = {Cambridge, Mass., MIT Press},
  year = {1961},
  author = {R. Fano}
}

@INPROCEEDINGS{FarahmandSzAu07,
  author = {A. Farahmand and C. Szepesv\'{a}ri and J. Audibert},
  title = {Manifold-adaptive dimension estimation},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {265--272},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@ARTICLE{Farley88,
  author = {A. A. Farley},
  title = {Mathematical {P}rogramming {M}odels for {C}utting-{S}tock {P}roblems
	in the {C}lothing {I}ndustry},
  journal = {Journal of the Operational Research Society},
  year = {1988},
  volume = {39},
  pages = {41-53},
  number = {1}
}

@TECHREPORT{FarmerSi88,
  author = {Farmer, J. Doyne and John J. Sidorowich},
  title = {Exploiting Chaos to Predict the Future and Reduce Noise},
  institution = {Los Alamos National Laboratory},
  year = {1988},
  number = {LA-UR-88-901},
  month = mar
}

@TECHREPORT{Fass84,
  author = {L. Fass},
  title = {Inference of skeletal automata},
  institution = {Georgetown University Computer Science Dept. TR-2},
  year = {1984}
}

@ARTICLE{FattahO'93,
  author = {Yousri El Fattah and Paul O'Rorke},
  title = {Explanation-Based Learning for Diagnosis},
  journal = {Machine Learning},
  year = {1993},
  volume = {13},
  pages = {35--70},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{FaugerasPo87,
  author = {O. D. Faugeras and J. Ponce},
  title = {An object-centered hierarchical representation for $3$-d objects:
	{The} prism-tree},
  journal = {Computer Vision, Graphics, and Image Processing},
  year = {1987},
  volume = {38},
  pages = {1--28}
}

@ARTICLE{FayyadIr92,
  author = {Usama M. Fayyad and Keki B. Irani},
  title = {On the Handling of Continuous-Valued Attributes in Decision Tree
	Generation},
  journal = {Machine Learning},
  year = {1992},
  volume = {8},
  pages = {87--102},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{FazlyCoSt09,
  author = {A. Fazly and P. Cook and S. Stevenson},
  title = {Unsupervised Type and Token Identification of Idiomatic Expression},
  journal = CL,
  year = {2009}
}

@INPROCEEDINGS{FazlySt07,
  author = {Fazly, A. and Stevenson, S.},
  title = {Distinguishing Subtypes of Multiword Expressions Using Linguistically-Motivated
	Statistical Measures},
  booktitle = {Workshop on A Broader Perspective on Multiword Expressions},
  year = {2007},
  pages = {9--16},
  address = {Prague, Czech Republic},
  month = {June},
  url = {http://www.aclweb.org/anthology/W/W07/W07-1102}
}

@INPROCEEDINGS{Feder98,
  author = {Meir Feder},
  title = {Learning to communicate via unknown channel},
  booktitle = COLT,
  year = {1998},
  pages = {79},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{FederMe94,
  author = {Feder, M and Merhav, N.},
  title = {Relation between entropy and error probability},
  journal = {IEEE Trans. on Information Theory},
  year = {1994},
  volume = {40},
  pages = {259-266}
}

@ARTICLE{FederMeGu92,
  author = {M. Feder and N. Merhav and M. Gutman},
  title = {Universal Prediction of Individual Sequences},
  journal = {{IEEE} Transactions on Information Theory},
  year = {1992},
  volume = {38},
  pages = {1258--1270}
}

@INPROCEEDINGS{FederGr88,
  author = {T. Feder and D. H. Greene},
  title = {Optimal algorithms for approximate clustering},
  booktitle = STOC,
  year = {1988},
  pages = {434--444}
}

@UNPUBLISHED{FeigeSh87,
  author = {U. Feige and A. Shamir},
  title = {Learning in permutation groups (extended abstract)},
  note = {Preprint, Applied Mathematics Dept., The Weizmann Institute of Science.},
  year = {1987}
}

@INPROCEEDINGS{FeigelsonHe96,
  author = {Aaron Feigelson and Lisa Hellerstein},
  title = {Learning conjunctions of two unate {DNF} formulas: computational
	and informational results},
  booktitle = COLT,
  year = {1996},
  pages = {255--265},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{Feldman72,
  author = {J. Feldman},
  title = {Some Decidability results on Grammatical Inference and Complexity},
  journal = {Inform. Control},
  year = {1972},
  volume = {20},
  pages = {244--262}
}

@INPROCEEDINGS{Feldman98,
  author = {Jerome A. Feldman},
  title = {Real language learning},
  booktitle = {International Workshop on Algorithmic Learning},
  year = {1998},
  volume = {1433},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {114--125},
  publisher = {Springer-Verlag}
}

@TECHREPORT{Feldman67,
  author = {J. A. Feldman},
  title = {First thoughts on grammatical inference},
  institution = {Stanford University Artificial Intelligence Memo 55},
  year = {1967}
}

@TECHREPORT{FeldmanRe69,
  author = {J. A. Feldman and S. Reder},
  title = {Grammatical complexity and inference},
  institution = {Computer Science Dept., Stanford University},
  year = {1969}
}

@ARTICLE{FeldmanSh77,
  author = {J. A. Feldman and P. Shields},
  title = {Total complexity and the inference of best programs},
  journal = {Math. Syst. Theory},
  year = {1977},
  volume = {10},
  pages = {181--191}
}

@TECHREPORT{Feldman94,
  author = {R. Feldman},
  title = {Knowledge Discovery in Textual Databases},
  institution = {Bar-Ilan University},
  year = {1994},
  address = {Ramat-Gan, Israel}
}

@INPROCEEDINGS{Feldman95a,
  author = {Ronen Feldman and Ido Dagan},
  title = {{KDT} -- Knowledge Discovery in Texts},
  booktitle = KDD,
  year = {1995},
  month = {August},
  place = {Montreal}
}

@INPROCEEDINGS{Feldman95b,
  author = {Ronen Feldman and Ido Dagan},
  title = {Knowledge Discovery in Textual Databases},
  booktitle = {ECML - Workshop in Knowledge Discovery},
  year = {1995},
  month = {May},
  place = {Crete}
}

@INPROCEEDINGS{FeldmanDa95,
  author = {Ronen Feldman and Ido Dagan},
  title = {{KDT} -- Knowledge Discovery in Texts},
  booktitle = KDD,
  year = {1995},
  month = {August},
  place = {Montreal}
}

@UNPUBLISHED{Feldman95c,
  author = {Ronen Feldman and Ido Dagan and Willi Klosgen},
  title = {Efficient algorithms for mining associations in texts},
  note = {In preparation}
}

@UNPUBLISHED{FeldmanDaKl,
  author = {Ronen Feldman and Ido Dagan and Willi Klosgen},
  title = {Efficient algorithms for mining associations in texts},
  note = {In preparation}
}

@ARTICLE{FeliciangeliHe77,
  author = {H. Feliciangeli and G. Herman},
  title = {Algorithms for producing grammars from sample derivations: a common
	problem of formal language theory and developmental biology},
  journal = {J. of Comput. Syst. Sci.},
  year = {1977},
  volume = {7},
  pages = {97--118}
}

@BOOK{Fellbaum98,
  title = {WordNet: An Electronic Lexical Database},
  publisher = {MIT Press},
  year = {1998},
  author = {C. Fellbaum}
}

@BOOK{FellbaumNe98,
  title = {WordNet: an electronic lexical database},
  publisher = {MIT Press USA},
  year = {1998},
  author = {Fellbaum, C. and NetLibrary, I.}
}

@BOOK{Feller71,
  title = {An Introduction to Probability Theory and its Applications},
  publisher = {John Wiley \& Sons, NY},
  year = {1971},
  author = {W. Feller},
  volume = {II},
  eddition = {2ed}
}

@BOOK{Feller68,
  title = {An Introduction to Probability Theory and Its Applications},
  publisher = {John Wiley and Sons, Inc.},
  year = {1968},
  author = {William Feller},
  volume = {1}
}

@INPROCEEDINGS{FelzenszwalbMcRam08,
  author = {Felzenszwalb, P. and Mcallester, D. and Ramanan, D.},
  title = {A Discriminatively Trained, Multiscale, Deformable Part Model},
  booktitle = CVPR,
  year = {2008},
  month = {June},
  citeulike-article-id = {2873027},
  citeulike-linkout-0 = {http://www.ics.uci.edu/~dramanan/papers/latent.pdf},
  comment = {This paper is a model based approach in which the Dalal-Triggs HOG
	detector is used as the feature base. They have a whole and part
	representation. The classification is done using latent svm. Currently
	one of the best methods for object detection.},
  keywords = {detection, object},
  posted-at = {2008-06-08 00:42:17},
  priority = {0},
  url = {http://www.ics.uci.edu/~dramanan/papers/latent.pdf}
}

@ARTICLE{FGMR09,
  author = {Felzenszwalb, P. F. and Girshick, R. B. and McAllester, D. and Ramanan,
	D.},
  title = {Object Detection with Discriminatively Trained Part Based Models},
  journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence},
  year = {2009},
  volume = {99},
  number = {1}
}

@INPROCEEDINGS{FengBuHo07,
  author = {Feng, Donghui and Burns, Gully and Hovy, Eduard},
  title = {Extracting Data Records from Unstructured Biomedical Full Text},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {837--846},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1088}
}

@ARTICLE{FernaldMo93,
  author = {A. Fernald and H. Morikawa},
  title = {Common themes and cultural variations in Japanese and American mothers'
	speech to infants},
  journal = {Child Development},
  year = {1993},
  volume = {64},
  pages = {637-656}
}

@ARTICLE{Ferreira03,
  author = {F. Ferreira},
  title = {The misinterpretation of noncanonical sentences},
  journal = {Cognitive Psychology},
  year = {2003},
  volume = {47},
  pages = {164-203}
}

@INPROCEEDINGS{Ferret07,
  author = {Ferret, Olivier},
  title = {Finding document topics for improving topic segmentation},
  booktitle = ACL,
  year = {2007},
  pages = {480--487},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1061}
}

@INPROCEEDINGS{FerrettiMa94,
  author = {C. Ferretti and G. Mauri},
  title = {Identifying regular languages over partially-commutative monoids},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1994},
  pages = {282--289},
  publisher = {Springer-Verlag}
}

@BOOK{Feyerabend81,
  title = {Philosophical Papers: Realism, Rationalism, \& Scientific Method},
  publisher = {Cambridge University Press},
  year = {1981},
  author = {Feyerabend, P. K.},
  volume = {1}
}

@INPROCEEDINGS{FiatFo91,
  author = {A. Fiat and D. P. Foster and H. Karloff and Y. Rabani and Y. Ravid
	and S. Vishwanathan},
  title = {Competitive Algorithms for Layered Graph Traversal},
  booktitle = FOCS,
  year = {1991},
  pages = {288-297},
  publisher = {IEEE}
}

@INPROCEEDINGS{FMSST89,
  author = {A. Fiat and S. Moses and A. Shamir and I. Shimshoni and G. Tardos},
  title = {Planning and learning in permutation groups},
  booktitle = FOCS,
  year = {1989},
  pages = {274--279},
  publisher = {IEEE Computer Society Press, Los Alamitos, CA}
}

@ARTICLE{Fiat92,
  author = {Amos Fiat and Moni Naor and Jeanette P. Schmidt and Alan Siegel},
  title = {Nonoblivious Hashing},
  journal = jacm,
  year = {1992},
  volume = {39},
  pages = {764-782},
  number = {4},
  month = oct,
  keywords = {Analysis of Algorithms; Algorithms; Theory; dictionary problem; model
	of computation; O(1) probe search; oblivious and nonoblivious search;
	perfect hashing; upper and lower bounds; }
}

@ARTICLE{Fickett96,
  author = {Fickett, J. W.},
  title = {The Gene Identification Problem: An Overview for Developers},
  journal = {Computers and Chemistry},
  year = {1996},
  volume = {20},
  pages = {103--118}
}

@INPROCEEDINGS{Fiechter94,
  author = {C. N. Fiechter},
  title = {Efficient reinforcement learning},
  booktitle = COLT,
  year = {1994},
  pages = {88--97},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{Fiechter97,
  author = {Claude-Nicolas Fiechter},
  title = {{PAC} Adaptive Control of Linear Systems},
  booktitle = COLT,
  year = {1997},
  pages = {72--80}
}

@ARTICLE{Fiedler72,
  author = {Fiedler, Miroslav},
  title = {Bounds for Eigenvalues of Doubly Stochastic Matrices},
  journal = {Linear Algebra and its Applications},
  year = {1972},
  volume = {5},
  pages = {299--310},
  number = {3},
  month = Jul
}

@ARTICLE{Fienberg70,
  author = {Fienberg, Stephen E.},
  title = {An Iterative Procedure for Estimation in Contingency Tables},
  journal = {Journal of Mathematical Statistics},
  year = {1970},
  volume = {41},
  pages = {907--917},
  number = {3},
  comment = {Proves convergence of Deming/Stephan iterative procedure for finding
	maximum entropy solution}
}

@ARTICLE{FigielLiMi77,
  author = { T. Figiel and J. Lindenstrauss and V. D. Milman},
  title = {The dimension of almost spherical sections of convex bodies},
  journal = {Acta Math.},
  year = {1977},
  pages = {53--94},
  number = {139}
}

@ARTICLE{FikesNi71,
  author = {Fikes, R. E. and N. Nilsson},
  title = {STRIPS: A New Approach to the Application of TheoremProving to Problem
	Solving},
  journal = {Artificial Intelligence},
  year = {1971},
  volume = {5}
}

@INPROCEEDINGS{FilimonovHa07,
  author = {Filimonov, Denis and Harper, Mary},
  title = {Recovery of Empty Nodes in Parse Structures},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {620--629},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1065}
}

@INPROCEEDINGS{FilippovaSt08,
  author = { Filippova,K. and Strube, M. },
  title = {Dependency Tree Based Sentence Compression},
  booktitle = {INLG},
  year = {2008},
  url = {http://www.aclweb.org/anthology-new/W/W08/W08-1105}
}

@INPROCEEDINGS{FilippovaSt08a,
  author = {Filippova, K. and Strube, M.},
  title = {Sentence Fusion via Dependency Graph Compression},
  booktitle = EMNLP,
  year = {2008},
  pages = {177--185},
  address = {Honolulu, Hawaii},
  month = {October},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/D08-1019}
}

@INPROCEEDINGS{FilippovaSt07,
  author = {Filippova, Katja and Strube, Michael},
  title = {Generating Constituent Order in German Clauses},
  booktitle = ACL,
  year = {2007},
  pages = {320--327},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1041}
}

@INCOLLECTION{Fillmore68,
  author = {C. J. Fillmore},
  title = {The Case for Case},
  booktitle = {Universals in Linguistic Theory},
  publisher = {Holt, Rinehart, and Winston},
  year = {1968},
  editor = {Bach and Harms },
  pages = {1-88},
  address = {New York}
}

@INPROCEEDINGS{FillmoreWoBa01,
  author = {C. J. Fillmore and C. Wooters and C. F. Baker},
  title = {Building a Large Lexical Databank Which Provides Deep Semantics},
  booktitle = {Pacific Asian Conference on Language, Information and Computation},
  year = {2001},
  address = {HongKong}
}

@INPROCEEDINGS{Finch94,
  author = {S. Finch},
  title = {Exploiting sophisticated representations for document retrieval},
  booktitle = {Conference on Applied Natural Language Processing},
  year = {1994}
}

@INPROCEEDINGS{FinkeHi95,
  author = {U. Finke and K. Hinrichs},
  title = {Overlaying simply connected planar subdivisions in linear time},
  booktitle = {SOCG},
  year = {1995},
  pages = {119--126},
  keywords = {red-blue segment intersection}
}

@INPROCEEDINGS{FinkelGrMa05,
  author = {Finkel, J. R. and Grenager, T. and Manning, C.},
  title = {Incorporating non-local information into information extraction systems
	by Gibbs sampling},
  booktitle = ACL,
  year = {2005},
  pages = {363--370},
  address = {Morristown, NJ, USA},
  publisher = {Association for Computational Linguistics},
  location = {Ann Arbor, Michigan}
}

@INPROCEEDINGS{FinkelGrMa07,
  author = {Finkel, Jenny Rose and Grenager, Trond and Manning, Christopher D.},
  title = {The Infinite Tree},
  booktitle = ACL,
  year = {2007},
  pages = {272--279},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1035}
}

@INPROCEEDINGS{FinkelMa09,
  author = {Finkel, J. R. and Manning, C. D.},
  title = {Hierarchical Bayesian domain adaptation},
  booktitle = NAACL,
  year = {2009},
  pages = {602--610},
  address = {Morristown, NJ, USA},
  publisher = {Association for Computational Linguistics},
  isbn = {978-1-932432-41-1},
  location = {Boulder, Colorado}
}

@INPROCEEDINGS{FinkelMa08,
  author = {J. R. Finkel and C. D. Manning},
  title = {The Importance of Syntactic Parsing and Inference in Semantic Role
	Labeling},
  booktitle = {ACL-HLT},
  year = {2008}
}

@ARTICLE{Finkelstein01,
  author = {L. Finkelstein and E. Gabrilovich and Y. Matias and E. rivlin and
	A. Solan and G. Wolfman and E. Ruppin},
  title = {Placing Search in Context: The Concept Revisted},
  journal = {ACM TOIS},
  year = {2002},
  volume = {20},
  pages = {116-131},
  number = {1}
}

@ARTICLE{FMPS98,
  author = {Paul Finn and Stephen Muggleton and David Page and Ashwin Srinivasan},
  title = {Pharmacophore discovery using the inductive logic programming system
	{PROG0L}},
  journal = {Machine Learning},
  year = {1998},
  volume = {30},
  pages = {241--270},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INBOOK{FinnoffZi94,
  chapter = {8},
  pages = {113--131},
  title = {Detecting structure in small datasets by network fitting under complexity
	constraints},
  publisher = {MIT Press},
  year = {1994},
  author = {W. Finnoff and H. G. Zimmermann},
  volume = {II: Intersections Between Theory and Experiment},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@INBOOK{FintonHu95,
  chapter = {5},
  pages = {77--94},
  title = {Importance-based feature extraction for reinforcement learning},
  publisher = {MIT Press},
  year = {1995},
  author = {David J. Finton and Yu Hen Hu},
  volume = {III: Selecting Good Models},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@INPROCEEDINGS{FiroiuCo99,
  author = {Laura Firoiu and Paul R. Cohen},
  title = {Abstracting from robot sensor data using hidden {M}arkov models},
  booktitle = ICML,
  year = {1999},
  pages = {106--114},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{FiroiuOaCo98,
  author = {Laura Firoiu and Tim Oates and Paul R. Cohen},
  title = {Learning deterministic finite automaton with a recurrent neural network},
  booktitle = {International Workshop on Algorithmic Learning},
  year = {1998},
  volume = {1433},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {90--101},
  publisher = {Springer-Verlag}
}

@ARTICLE{Firth57,
  author = {J. R. Firth},
  title = {A Synopsis of Linguistic Theory 1930-1955},
  year = {1957},
  pages = {1--32},
  booktitle = {Studies in Linguistic Analysis},
  comment = {Reprinted in Selected Papers of J. R. Firth, edited by F. Palmer.
	Longman, 1968},
  publisher = {Blackwell}
}

@INPROCEEDINGS{Fischer95,
  author = {Paul Fischer},
  title = {More or less efficient agnostic learning of convex polygons},
  booktitle = COLT,
  year = {1995},
  pages = {337--344},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{Fischer94,
  author = {P. Fischer},
  title = {Learning Unions of Convex Polygons},
  booktitle = EuroCOLT,
  year = {1994},
  volume = {New Series Number 53},
  series = {The Institute of Mathematics and its Applications Conference Series},
  pages = {61--67},
  address = {Oxford},
  publisher = {Oxford University Press},
  isbn = {0 19 853492 2}
}

@INPROCEEDINGS{FischerPSi91,
  author = {P. Fischer and S. P{\"o}lt and H. U. Simon},
  title = {Probably almost {B}ayes decisions},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1991},
  pages = {88--94},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufman}
}

@ARTICLE{FischerSi92,
  author = {Paul Fischer and Hans Ulrich Simon},
  title = {On Learning Ring-Sum-Expansions},
  journal = {SIAM J. Computing},
  year = {1992},
  volume = {21},
  pages = {181--192},
  number = {1},
  month = Feb
}

@ARTICLE{FischhoffBM83,
  author = {Fischhoff, Baruch and Ruth Beyth-Marom},
  title = {Hypothesis Evaluation from a Bayesian Perspective},
  journal = {Psychological Review},
  year = {1983},
  volume = {90},
  pages = {239--260},
  number = {3},
  comment = {Taxonomy of ways people might deviate from Bayesianism.}
}

@INPROCEEDINGS{Fischlin98,
  author = {M. Fischlin},
  title = {Cryptographic Limitations on Parallelizing Membership and Equivalence
	Queries with Applications to Random Self-Reductions},
  booktitle = ALT,
  year = {1998},
  volume = {1501},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {72--86},
  publisher = {Springer-Verlag}
}

@ARTICLE{Fisher02,
  author = {C. Fisher},
  title = {Structural limits on verb mapping: The role of abstract structure
	in 2.5-year-olds},
  journal = {Developmental Science},
  year = {2002},
  volume = {5},
  pages = {56-65}
}

@ARTICLE{Fisher96,
  author = {C. Fisher},
  title = {Structural limits on verb mapping: The role of analogy in children's
	interpretation of sentences},
  journal = {Cognitive Psychology},
  year = {1996},
  volume = {31},
  pages = {41-81}
}

@ARTICLE{FHRG94,
  author = {C. Fisher and D. G. Hall and S. Rakowitz and L. R. Gleitman},
  title = {When it is netter to receive than to give: Syntactic and conceptual
	constraints on vocabulary growth},
  journal = {Lingua},
  year = {1994},
  volume = {92},
  pages = {333-375}
}

@ARTICLE{Fisher87,
  author = {Douglas H. Fisher},
  title = {Knowledge Acquisition Via Incremental Conceptual Clustering},
  journal = {Machine Learning},
  year = {1987},
  volume = {2},
  pages = {139--172},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{FisherHo86,
  author = {Fisher, M.L. and D.S.Hochbaum},
  title = {Probabilistic Analysis of the Planar $K$-Median Problem},
  journal = {Mathematics of Operations Research},
  year = {1980},
  volume = {5},
  pages = {27--34},
  month = Feb
}

@INPROCEEDINGS{FisherRo07,
  author = {Fisher, Seeger and Roark, Brian},
  title = {The utility of parse-derived features for automatic discourse segmentation},
  booktitle = ACL,
  year = {2007},
  pages = {488--495},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1062}
}

@ARTICLE{FitzpatrickGr88,
  author = {J. Michael Fitzpatrick and John J. Grefenstette},
  title = {Genetic Algorithms in Noisy Environments},
  journal = {Machine Learning},
  year = {1988},
  volume = {3},
  pages = {101--120},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{FixHo49,
  author = {E. Fix and J. Hodges},
  title = {Discriminatory Analysis. Nonparametric Discrimination: Consistency
	Properties},
  journal = {Technical Report 4, Project Number 21-49-004, USAF School of Aviation
	Medicine, Randolph Field, TX},
  year = {1949}
}

@INPROCEEDINGS{FlachLa99,
  author = {Peter Flach and Nicolas Lachiche},
  title = {{1BC}: A First-Order {Bayesian} Classifier},
  booktitle = ILP,
  year = {1999},
  editor = {Sazo Dzeroski and Peter Flach},
  pages = {92-103},
  publisher = {Springer-Verlag},
  comment = {Multiple instance, individual-based relational feature Naive Bayes}
}

@INPROCEEDINGS{FlamminiMaCe92,
  author = {M. Flammini and A. Marchetti-Spaccamela and L. K. Cera},
  title = {Learning {DNF} formulae under classes of probability distributions},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1992},
  pages = {85--92},
  publisher = {ACM Press, New York, NY}
}

@TECHREPORT{Flanagan81,
  author = {P. A. Flanagan},
  title = {A discrete model of semantic learning},
  institution = {Brown University Computer Science Dept., CS-79},
  year = {1981}
}

@ARTICLE{FlannDi89,
  author = {Nicholas S. Flann and Thomas G. Dietterich},
  title = {A Study of Explanation-Based Methods for Inductive Learning},
  journal = {Machine Learning},
  year = {1989},
  volume = {4},
  pages = {187--226},
  number = {2},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{FlannaganFrHo86,
  author = {Flannagan, Michael J. and Lisbeth S. Fried and Keith J. Holyoak},
  title = {Distributional Expectations and the Induction of Category Structure},
  journal = {Journal of Experimental Psychology: Learning, Memory, and Cognition},
  year = {1986},
  volume = {12},
  pages = {241--256},
  number = {2},
  comment = {Experimental evidence in favor of idea that people expect exemplars
	of a category to follow the normal distribution}
}

@ARTICLE{Fleischer99,
  author = {R. Fleischer},
  title = {Decision Trees: {O}ld and New Results},
  journal = {Inform. Comput.},
  year = {1999},
  volume = {152},
  pages = {44--61},
  number = {1}
}

@ARTICLE{FlignerVe86,
  author = {M. A. Fligner and J. S. Verducci},
  title = {Distance Based Ranking Models},
  journal = {Journal of the Royal Statistical Society},
  year = {1986},
  volume = {48},
  pages = {359-369}
}

@INPROCEEDINGS{FlorianYa99,
  author = {R. Florian and D. Yarowsky},
  title = {Dynamic Non Language Modeling via Hierarchical Topic-Based Adaptation},
  booktitle = ACL,
  year = {1999},
  address = {College Park, MD, USA}
}

@PHDTHESIS{Floyd89,
  author = {Floyd, Sally},
  title = {Space-bounded learning and the {V}apnik-{C}hervonenkis Dimension},
  school = {U.C. Berkeley},
  year = {1989},
  month = Dec,
  note = {ICSI Tech Report TR-89-061}
}

@INPROCEEDINGS{Floyd89a,
  author = {S. Floyd},
  title = {Space-bounded learning and the {V}apnik-{C}hervonenkis dimension},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1989},
  pages = {349--364},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{FloydWa95,
  author = {Sally Floyd and Manfred Warmuth},
  title = {Sample compression, learnability, and the {V}apnik-{C}hervonenkis
	dimension},
  journal = {Machine Learning},
  year = {1995},
  volume = {21},
  pages = {269--304},
  number = {3},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Fogarty92,
  author = {Terence C. Fogarty},
  title = {First Nearest Neighbor Classification on Frey and Slate's Letter
	Recognition Problem},
  journal = {Machine Learning},
  year = {1992},
  volume = {9},
  pages = {387--388},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{Fong95,
  author = {Philip W. L. Fong},
  title = {A quantitative study of hypothesis selection},
  booktitle = ICML,
  year = {1995},
  pages = {226--234},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{ForrestMi93,
  author = {Stephanie Forrest and Melanie Mitchell},
  title = {What Makes a Problem Hard for a Genetic Algorithm? Some Anomalous
	Results and Their Explanation},
  journal = {Machine Learning},
  year = {1993},
  volume = {13},
  pages = {285--319},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{Forster99,
  author = {J{\"u}rgen Forster},
  title = {Learning Multiplicity Automata from Smallest Counterexamples},
  booktitle = EuroCOLT,
  year = {1999},
  volume = {1572},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {79--90},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{ForsterWa00,
  author = {J{\"u}rgen Forster and Manfred Warmuth},
  title = {Relative Expexted Instantaneous Loss Bounds},
  booktitle = COLT,
  year = {2000},
  pages = {90--99},
  publisher = {Morgan Kaufmann, San Francisco}
}

@ARTICLE{FGJKKKPSSS94,
  author = {L. Fortnow and W. Gasarch and S. Jain and E. Kinber and M. Kummer
	and S. Kurtz and M. Pleszkoch and T. Slaman and R. Solovay and F.
	Stephan},
  title = {Extremes in the Degrees of Inferability},
  journal = {Annals of Pure and Applied Logic},
  year = {1994},
  volume = {66},
  pages = {21--276},
  annote = {Subsumes the COLT paper by Gasarch and Pleszkoch entitled {\it Learning
	via Queries to an Oracle}}
}

@INCOLLECTION{Fortune97,
  author = {S. Fortune},
  title = {Voronoi diagrams and {Delaunay} triangulations},
  booktitle = {Handbook of Discrete and Computational Geometry},
  publisher = {CRC Press LLC},
  year = {1997},
  editor = {J. E. Goodman and J. O'Rourke},
  chapter = {20},
  address = {Boca Raton, FL}
}

@ARTICLE{Fortune87,
  author = {S. J. Fortune},
  title = {A sweepline algorithm for {Voronoi} diagrams},
  journal = {Algorithmica},
  year = {1987},
  volume = {2},
  pages = {153--174},
  keywords = {plane-sweep, geometric transformations, Voronoi diagrams, Delaunay
	triangulations}
}

@BOOK{Foster82,
  title = {GEO-METRICS {II}: {The} application of geometric tolerancing techniques},
  publisher = {Addison-Wesley},
  year = {1982},
  author = {L. W. Foster}
}

@INPROCEEDINGS{FHHNNS05,
  author = {A. Fowler and B. Hauser and D. Hodges and I. Niles and A. Novischi
	and J. Stephan},
  title = {Applying COGEX to Recognize Textual Entailment.},
  booktitle = RTE,
  year = {2005}
}

@BOOK{Francis82,
  title = {Frequency Analysis of English Usage},
  publisher = {Houghton Mifflin Company},
  year = {1982},
  author = {W. Francis and H. Kucera},
  place = {Boston, MA}
}

@BOOK{FrancisKu82,
  title = {Frequency Analysis of English Usage},
  publisher = {Houghton Mifflin Company},
  year = {1982},
  author = {W. Francis and H. Kucera},
  place = {Boston, MA}
}

@INPROCEEDINGS{FrankWi99,
  author = {Eibe Frank and Ian H. Witten},
  title = {Making better use of global discretization},
  booktitle = ICML,
  year = {1999},
  pages = {115--123},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{FrankWi98,
  author = {Eibe Frank and Ian H. Witten},
  title = {Generating accurate rule sets without global optimization},
  booktitle = ICML,
  year = {1998},
  pages = {144--151},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{FrankWi98a,
  author = {Eibe Frank and Ian H. Witten},
  title = {Using a permutation test for attribute selection in decision trees},
  booktitle = ICML,
  year = {1998},
  pages = {152--160},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@ARTICLE{FranklMa88,
  author = {P. Frankl and H. Maehara},
  title = {The Johnson-Lindenstrauss Lemma and the Sphericity of Some Graphs},
  journal = {Journal of Combinatorial Theory B},
  year = {1988},
  volume = {44},
  pages = {355--362}
}

@ARTICLE{FGMS96,
  author = {Paolo Frasconi and Marco Gori and Marco Maggini and Giovanni Soda},
  title = {Representation of finite state automata in recurrent radial basis
	function networks},
  journal = {Machine Learning},
  year = {1996},
  volume = {23},
  pages = {5--32},
  number = {1},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{FraserMa07,
  author = {Fraser, Alexander and Marcu, Daniel},
  title = {Getting the Structure Right for Word Alignment: {LEAF}},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {51--60},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1006}
}

@INPROCEEDINGS{Frawley-et-al91,
  author = {W.J. Frawley and G. Piatetsky-Shapiro and C.J. Matheus},
  title = {Knowledge Discovery in Databases: An Overview},
  booktitle = {Knowledge Discovery in Databases},
  year = {1991},
  editor = {G. Piatetsky-Shapiro and W. Frawley},
  pages = {1--27},
  address = {Cambridge, MA},
  publisher = {MIT Press}
}

@INPROCEEDINGS{FrawleyPiMa91,
  author = {W.J. Frawley and G. Piatetsky-Shapiro and C.J. Matheus},
  title = {Knowledge Discovery in Databases: An Overview},
  booktitle = {Knowledge Discovery in Databases},
  year = {1991},
  editor = {G. Piatetsky-Shapiro and W. Frawley},
  pages = {1--27},
  address = {Cambridge, MA},
  publisher = {MIT Press}
}

@INCOLLECTION{Frawley91,
  author = {W. J. Frawley and G. Piatetsky-Shapiro and C. J. Matheus},
  title = {Knowledge discovery in databases: an overview},
  booktitle = {Knowledge Discovery in Databases},
  publisher = MIT,
  year = {1991},
  editor = {G. Piatetsky-Shapiro and W. J. Frawley},
  pages = {1--27}
}

@PHDTHESIS{Frazier94,
  author = {M. Frazier},
  title = {Matters Horn and Other Features in the Computational Learning Theory
	Landscape: The Notion of Membership},
  school = {Dept. of Computer Science, University of Illinois at Urbana-Champaign},
  year = {1994},
  note = {Technical report UIUCDCS-R-94-1858}
}

@INPROCEEDINGS{FGMP94,
  author = {M. Frazier and S. Goldman and N. Mishra and L. Pitt},
  title = {Learning from a consistently ignorant teacher},
  booktitle = COLT,
  year = {1994},
  pages = {328--339},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{FrazierPa93,
  author = {M. Frazier and C. D. Page},
  title = {Learnability of Recursive, Non-determinate Theories: Some Basic Results
	and Techniques},
  booktitle = ILP,
  year = {1993}
}

@ARTICLE{FrazierPi96,
  author = {Michael Frazier and Leonard Pitt},
  title = {{CLASSIC} Learning},
  journal = {Machine Learning},
  year = {1996},
  volume = {25},
  pages = {151--193},
  note = {Was in COLT 1994},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{FrazierPi94,
  author = {M. Frazier and L. Pitt},
  title = {Some New Directions in Computational Learning Theory},
  booktitle = EuroCOLT,
  year = {1994},
  volume = {New Series Number 53},
  series = {The Institute of Mathematics and its Applications Conference Series},
  pages = {19--32},
  address = {Oxford},
  publisher = {Oxford University Press},
  isbn = {0 19 853492 2}
}

@INPROCEEDINGS{FrazierPi94a,
  author = {M. Frazier and L. Pitt},
  title = {{CLASSIC} Learning},
  booktitle = COLT,
  year = {1994},
  pages = {23-34}
}

@INPROCEEDINGS{FrazierPi93,
  author = {Frazier, M. and L. Pitt},
  title = {Learning from Entailment: An Application to propositional {H}orn
	sentences},
  booktitle = ML,
  year = {1993},
  pages = {120--127},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{Frederickson91,
  author = {Greg N. Frederickson},
  title = {Planar Graph Decomposition and All Pairs Shortest Paths},
  journal = jacm,
  year = {1991},
  volume = {38},
  pages = {162-204},
  number = {1},
  month = jan,
  keywords = {Graph Theory; Algorithms; Theory; all pairs shortest paths; approximation
	algorithm; compact routing table; graph embedding; NP-completeness;
	outerplanar graph; planar graph; succinct encoding; }
}

@ARTICLE{Frederickson87,
  author = {G. N. Frederickson},
  title = {Fast algorithms for shortest paths in planar graphs, with applications},
  journal = SICOMP,
  year = {1987},
  volume = {16},
  pages = {1004--1022},
  number = {6},
  keywords = {shortest paths, graphs}
}

@ARTICLE{Frederickson85,
  author = {G. N. Frederickson},
  title = {Data Structures for On-Line Updating of Minimum Spanning Trees, with
	Applications},
  journal = SICOMP,
  year = {1985},
  volume = {14},
  pages = {781--798},
  number = {4}
}

@INCOLLECTION{Fredkin64,
  author = {E. Fredkin},
  title = {Techniques using {LISP} for automatically discovering interesting
	relations in data},
  booktitle = {The Programming Language LISP},
  publisher = {MIT Press},
  year = {1964},
  pages = {108--124}
}

@ARTICLE{FredmanKoSz84,
  author = {M. L. Fredman and J. Komlos and E. Szemeredi},
  title = {Storing a sparse table with $O(1)$ worst case access time},
  journal = JACM,
  year = {1984},
  volume = {31},
  pages = {538--544},
  number = {3},
  month = jul
}

@ARTICLE{Freeman92,
  author = {J. A. Freeman},
  title = {Neural Networks in Mathematica},
  journal = {AI Expert: the Magazine of Aritificial Intelligence in Practice},
  year = {1992},
  volume = {7},
  pages = {26--35},
  number = {11},
  month = nov
}

@ARTICLE{Freitag00,
  author = {D. Freitag},
  title = {Machine Learning for Information Extraction in Informal Domains},
  journal = MLJ,
  year = {2000},
  volume = {39},
  pages = {169--202},
  number = {2/3},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{Freitag98,
  author = {Dayne Freitag},
  title = {Multistrategy learning for information extraction},
  booktitle = ICML,
  year = {1998},
  pages = {161--169},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{FreitagKh07,
  author = {Freitag, Dayne and Khadivi, Shahram},
  title = {A Sequence Alignment Model Based on the Averaged Perceptron},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {238--247},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1025}
}

@INPROCEEDINGS{Freivalds90,
  author = {R. Freivalds},
  title = {Inductive inference of minimal programs},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1990},
  pages = {3--20},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{Freivalds85,
  author = {R. Freivalds},
  title = {Recursiveness of the Enumerating Functions Increases the Inferrability
	of Recursively Enumerable Sets},
  journal = {Bulletin of the European Association for Theoretical Computer Science},
  year = {1985},
  volume = {27},
  pages = {35--40}
}

@ARTICLE{Freivalds79,
  author = {R. Freivalds},
  title = {On the Principle Capabilities of Probabilistic Algorithms in Inductive
	Inference},
  journal = {Semiotika Inform},
  year = {1979},
  volume = {12},
  pages = {137--140}
}

@INCOLLECTION{Freivalds74,
  author = {R. Freivalds},
  title = {On the Complexity and Optimality of Computation in the Limit},
  booktitle = {Theory of Algorithms and Programs},
  publisher = {Latvian State University, Riga},
  year = {1974},
  volume = {1},
  pages = {155--173},
  note = {(in Russian)},
  annote = {Journal also called {\it Latvii gosudarst. Univ. ucenye Zapiski}}
}

@INCOLLECTION{Freivalds74a,
  author = {R. Freivalds},
  title = {Uniform and Non Uniform Predictability},
  booktitle = {Theory of Algorithms and Programs},
  publisher = {Latvian State University, Riga},
  year = {1974},
  volume = {1},
  pages = {89--100}
}

@ARTICLE{FreivaldsBoWi98,
  author = {Rusins Freivalds and Ognian Botuscharov and Rolf Wiehagen},
  title = {Identifying nearly minimal {G}{\"o}del numbers from additional information},
  journal = {Annals of Mathematics and Artificial Intelligence},
  year = {1998},
  volume = {23},
  pages = {199--209},
  number = {1/2},
  note = {Special issue for AII '94 and ALT '94}
}

@INPROCEEDINGS{FGKS94,
  author = {R. Freivalds and D. Gobleja and M. Karpinski and C. H. Smith},
  title = {Co-learnability and {FIN}-identifiability of enumerable classes of
	total recursive functions},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1994},
  pages = {100--105},
  publisher = {Springer-Verlag}
}

@ARTICLE{FreivaldsHo94,
  author = {R. Freivalds and A. Hoffmann},
  title = {An inductive inference appraoch to classification},
  journal = {J. of Experimental and Theoret. Artif. Intell.},
  year = {1994},
  volume = {6},
  pages = {63--72},
  number = {1},
  note = {Special issue for AII '92}
}

@INPROCEEDINGS{FreivaldsJa95,
  author = {Rusins Freivalds and Sanjay Jain},
  title = {Kolmogorov numberings and minimal identification},
  booktitle = EuroCOLT,
  year = {1995},
  pages = {182--195},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{FreivaldsKaSm94,
  author = {R. Freivalds and M. Karpinski and C. H. Smith},
  title = {Co-learning of total recursive functions},
  booktitle = COLT,
  year = {1994},
  pages = {190--197},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{FreivaldsKiSm96,
  author = {R. Freivalds and E. Kinber and C. Smith},
  title = {On the Intrinsic Complexity of Learning},
  journal = {Inform. Comput.},
  year = {1996},
  volume = {123},
  pages = {64--71},
  number = {2},
  note = {Earlier version in EUROCOLT 1995}
}

@ARTICLE{FreivaldsKiSm95,
  author = {R. Freivalds and E. Kinber and C. Smith},
  title = {On the Impact of Forgetting on Learning Machines},
  journal = {Journal of the ACM},
  year = {1995},
  volume = {42},
  pages = {1146--1168},
  number = {6},
  note = {Earlier version in 6th COLT, 1993}
}

@INCOLLECTION{FreivaldsKi77,
  author = {R. Freivalds and E. B. Kinber},
  title = {Limit Identification of Minimal {G\"odel} Numbers},
  booktitle = {Theory of Algorithms and Programs},
  publisher = {Latvian State University, Riga},
  year = {1977},
  volume = {3},
  pages = {3--34}
}

@INCOLLECTION{FreivaldsKiSm95a,
  author = {R. Freivalds and E. B. Kinber and C. H. Smith},
  title = {Probabilistic versus Deterministic Memory Limited Learning},
  booktitle = {Algorithmic Learning for Knowledge-Based Systems},
  publisher = {Springer--Verlag},
  year = {1995},
  volume = {961},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {155--161}
}

@INCOLLECTION{FreivaldsKiWi95,
  author = {R. Freivalds and E. B. Kinber and R. Wiehagen},
  title = {Error detecting in inductive inference},
  booktitle = {Algorithmic Learning for Knowledge-Based Systems},
  publisher = {Springer--Verlag},
  year = {1995},
  volume = {961},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {25--48}
}

@ARTICLE{FreivaldsKiWi95a,
  author = {R\={u}si\c{n}\v{s} Freivalds and Efim B. Kinber and Rolf Wiehagen},
  title = {How Inductive Inference Strategies Discover Their Errors},
  journal = {Inform. Comput.},
  year = {1995},
  volume = {118},
  pages = {208--226},
  number = {2}
}

@INCOLLECTION{FreivaldsKiWi95b,
  author = {R. Freivalds and E. B. Kinber and R. Wiehagen},
  title = {Learning from good examples},
  booktitle = {Algorithmic Learning for Knowledge-Based Systems},
  publisher = {Springer--Verlag},
  year = {1995},
  volume = {961},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {49--62}
}

@ARTICLE{FreivaldsKiWi93,
  author = {R. Freivalds and E. B. Kinber and R. Wiehagen},
  title = {On the power of inductive inference from good examples},
  journal = {Theoret. Comput. Sci.},
  year = {1993},
  volume = {110},
  pages = {131--144},
  number = {1}
}

@INPROCEEDINGS{FreivaldsKiWi89,
  author = {R. Freivalds and E. B. Kinber and R. Wiehagen},
  title = {Inductive Inference From Good Examples},
  booktitle = {International Workshop on Analogical and Inductive Inference},
  year = {1989},
  pages = {1--17}
}

@ARTICLE{FreivaldsKiWi88,
  author = {R. Freivalds and E. B. Kinber and R. Wiehagen},
  title = {Probabilistic Versus Deterministic Inductive Inference in Nonstandard
	Numberings},
  journal = {Zeitschr. f. math. Logik und Grundlagen d. Math. Bd.},
  year = {1988},
  volume = {34},
  pages = {531--539}
}

@ARTICLE{FreivaldsKiWi84,
  author = {R. Freivalds and E. B. Kinber and R. Wiehagen},
  title = {Connections between Identifying Functionals, Standardizing Operations,
	and Computable Numberings},
  journal = {Zeitschr. f. math. Logik und Grundlagen d. Math. Bd.},
  year = {1984},
  volume = {30},
  pages = {145--164}
}

@ARTICLE{FreivaldsKiWi82,
  author = {R. Freivalds and E. B. Kinber and R. Wiehagen},
  title = {Inductive Inference and Computable One-one Numberings},
  journal = {Zeitschr. f. math. Logik und Grundlagen d. Math. Bd.},
  year = {1982},
  volume = {28},
  pages = {463--479}
}

@INPROCEEDINGS{FreivaldsSm92,
  author = {Rusins Freivalds and Carl Smith},
  title = {Memory Limited Inductive Inference Machines},
  booktitle = SWAT,
  year = {1992},
  volume = {621},
  series = {Lecture Notes in Computer Science},
  pages = {19--29},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{FreivaldsSm93,
  author = {R. Freivalds and C. H. Smith},
  title = {On the duality between mechanistic learners and what it is they learn},
  booktitle = {International Workshop on Analogical and Inductive Inference and
	International Workshop on Algorithmic Learning Theory},
  year = {1993},
  volume = {744},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {137--149},
  publisher = {Springer-Verlag}
}

@ARTICLE{FreivaldsSm93a,
  author = {R. Freivalds and C. H. Smith},
  title = {On the role of procrastination for machine learning},
  journal = {Inform. Comput.},
  year = {1993},
  volume = {107},
  pages = {237--271},
  number = {2},
  annote = {Was in COLT 1992 pages 363--376 and Univ. of MD. TR-91-27 in 1991}
}

@ARTICLE{FreivaldsSmVe89,
  author = {R. Freivalds and C. H. Smith and M. Velauthapillai},
  title = {Trade-Off Among Parameters Affecting Inductive Inference},
  journal = {Inform. Comput.},
  year = {1989},
  volume = {82},
  pages = {323--349}
}

@INPROCEEDINGS{FreivaldsZe96,
  author = {R. Freivalds and T. Zeugmann},
  title = {Co--Learning of Recursive Languages from Positive Data},
  booktitle = {Perspectives of System Informatics},
  year = {1996},
  pages = {122--133},
  publisher = {Springer--Verlag},
  note = {Lecture Notes in Computer Science 1181. Also TR RIFIS-TR-CS-110,
	Kyushu University 33, 1995.}
}

@INPROCEEDINGS{Freivalds79a,
  author = {R. V. Freivalds},
  title = {Finite identification of general recursive functions by probabilistic
	strategies},
  booktitle = FCT,
  year = {1979},
  pages = {138--145},
  address = {Berlin},
  publisher = {Akademie-Verlag}
}

@INPROCEEDINGS{Freivalds75,
  author = {R. V. Freivalds},
  title = {Functions computable in the Limit by Probabilistic Machines},
  booktitle = FOCS,
  year = {1975},
  volume = {28},
  series = {Lecture Notes in Computer Science},
  pages = {77--87},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Freivalds75a,
  author = {R. V. Freivalds},
  title = {Minimal {G}{\"o}del numbers and their identification in the limit},
  booktitle = {4th},
  year = {1975},
  volume = {32},
  series = {Lecture Notes in Computer Science},
  pages = {219--225},
  publisher = {Springer-Verlag}
}

@ARTICLE{Freivalds74b,
  author = {R. V. Freivalds},
  title = {On the limit synthesis of numbers of general recursive functions
	in various computable numerations},
  journal = {Soviet Math. Doklady},
  year = {1974},
  volume = {15},
  pages = {1681--1683}
}

@ARTICLE{FreivaldsWi79,
  author = {R. V. Freivalds and R. Wiehagen},
  title = {Inductive inference with additional information},
  journal = {Elektronische Informationsverarbeitung und Kybernetik},
  year = {1979},
  volume = {15},
  pages = {179--185}
}

@INPROCEEDINGS{Freund99,
  author = {Yoav Freund},
  title = {An adaptive version of the boost by majority algorithm},
  booktitle = COLT,
  year = {1999},
  pages = {102--113},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{Freund98,
  author = {Yoav Freund},
  title = {Self bounding learning algorithms},
  booktitle = COLT,
  year = {1998},
  pages = {247--258},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{Freund96,
  author = {Yoav Freund},
  title = {Predicting a binary sequence almost as well as the optimal biased
	coin},
  booktitle = COLT,
  year = {1996},
  pages = {89--98},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{Freund95,
  author = {Y. Freund},
  title = {Boosting a Weak Learning Algorithm by Majority},
  journal = {Inform. Comput.},
  year = {1995},
  volume = {121},
  pages = {256--285},
  number = {2},
  month = sep,
  note = {Also appeared in COLT90}
}

@INPROCEEDINGS{Freund94,
  author = {Yoav Freund},
  title = {Sifting informative examples from a random source},
  booktitle = {Working Notes of the Workshop on Relevance, AAAI Fall Symposium Series},
  year = {1994},
  pages = {85--89}
}

@INPROCEEDINGS{Freund92,
  author = {Yoav Freund},
  title = {An Improved Boosting Algorithm and Its Implications onLearning Complexity},
  booktitle = COLT,
  year = {1992},
  pages = {391--398},
  publisher = {{ACM} Press}
}

@INPROCEEDINGS{Freund90,
  author = {Yoav Freund},
  title = {Boosting a Weak Learning Algorithm by Majority},
  booktitle = COLT,
  year = {1990},
  pages = {202--216},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{FreundHa92,
  author = {Y. Freund and D. Haussler},
  title = {Unsupervised Learning of Distributions on Binary Vectors Using Two
	layer Networks},
  booktitle = NIPS,
  year = {1992},
  pages = {912--919}
}

@INPROCEEDINGS{FISS98,
  author = {Yoav Freund and Raj Iyer and Robert E. Schapire and Yoram Singer},
  title = {An efficient boosting algorithm for combining preferences},
  booktitle = ICML,
  year = {1998},
  pages = {170--178},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{FKMRR95,
  author = {Yoav Freund and Michael Kearns and Yishay Mansour and Dana Ron and
	Ronitt Rubinfeld},
  title = {Efficient algorithms for learning to play repeated games against
	computationally bounded adversaries},
  booktitle = FOCS,
  year = {1995},
  pages = {332--341},
  publisher = {IEEE Computer Society Press, Los Alamitos, CA}
}

@INPROCEEDINGS{FKRRSS93,
  author = {Y. Freund and M. Kearns and D. Ron and R. Rubinfeld and R. Schapire
	and L. Sellie},
  title = {Efficient learning of typical finite automata from random walks},
  booktitle = STOC,
  year = {1993},
  pages = {315--324},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{FreundMa99,
  author = {Yoav Freund and Yishay Mansour},
  title = {Estimating a mixture of two product distributions},
  booktitle = COLT,
  year = {1999},
  pages = {53--62},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{FreundMa97,
  author = {Yoav Freund and Yishay Mansour},
  title = {Learning under persistent drift},
  booktitle = EuroCOLT,
  year = {1997},
  pages = {109--118},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{FreundMa99a,
  author = {Yoav Freund and Llew Mason},
  title = {The alternating decision tree learning algorithm,},
  booktitle = ICML,
  year = {1999},
  pages = {124--133},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{FreundOp00,
  author = {Yoav Freund and Manfred Opper},
  title = {Continuous Drifting Games},
  booktitle = COLT,
  year = {2000},
  pages = {126--132},
  publisher = {Morgan Kaufmann, San Francisco}
}

@INPROCEEDINGS{FreundRo95,
  author = {Yoav Freund and Dana Ron},
  title = {Learning to model sequences generated by switching distributions},
  booktitle = COLT,
  year = {1995},
  pages = {41--50},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{FreundSc98,
  author = {Y. Freund and R. Schapire},
  title = {Large Margin Classification using the {P}erceptron algorithm},
  booktitle = COLT,
  year = {1998},
  pages = {209--217}
}

@ARTICLE{FreundSc99,
  author = {Yoav Freund and Robert E. Schapire},
  title = {Large Margin Classification Using the Perceptron Algorithm},
  journal = {Machine Learning},
  year = {1999},
  volume = {37},
  pages = {277--296},
  number = {3},
  comment = {first in 11th COLT '98},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{FreundSc96,
  author = {Yoav Freund and Robert E. Schapire},
  title = {Experiments with a new Boosting algorithm},
  booktitle = ICML,
  year = {1996},
  pages = {148--146},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{FreundSc96a,
  author = {Yoav Freund and Robert E. Schapire},
  title = {Game theory, on-line prediction and boosting},
  booktitle = COLT,
  year = {1996},
  pages = {325--332},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{FreundSc97,
  author = {Y. Freund and R. E. Schapire:},
  title = {A Decision-Theoretic Generalization of On-Line Learning and an Application
	to Boosting},
  journal = {J. Comput. Syst. Sci.},
  year = {1997},
  volume = {55},
  pages = {119--139},
  number = {1},
  note = {First appeared in EuroCOLT '95}
}

@ARTICLE{FSST97,
  author = {Yoav Freund and H. Sebastian Seung and Eli Shamir and Naftali Tishby},
  title = {Selective sampling using the query by committee algorithm},
  journal = {Machine Learning},
  year = {1997},
  volume = {28},
  pages = {133--168},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{FreySl91,
  author = {Peter W. Frey and David J. Slate},
  title = {Letter Recognition Using Holland-Style Adaptive Classifiers},
  journal = {Machine Learning},
  year = {1991},
  volume = {6},
  pages = {161--182},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Friedman97,
  author = {Friedman, J. H.},
  title = {On bias, variance, 0/1-loss and curse-of-dimensionality},
  journal = {Data Mining and Knowledge Discovery},
  year = {1997},
  volume = {55}
}

@ARTICLE{FriedmanSt81,
  author = {J. H. Friedman and W. Stuetzle},
  title = {Projection Pursuit Regression},
  journal = {J. American Statistical Association},
  year = {1981},
  volume = {76},
  pages = {817--823},
  number = {376},
  month = dec,
  comment = {Good description of projection pursuit}
}

@ARTICLE{FriedmanBeFi77,
  author = {Jerome J. Friedman and Jon Louis Bentley and Raphael Ari Finkel},
  title = {An Algorithm for Finding Best Matches in Logarithmic Expected Time},
  journal = {ACM Transactions on Mathematical Software},
  year = {1977},
  volume = {3},
  pages = {209--226},
  number = {3},
  month = Sep
}

@INPROCEEDINGS{Friedman97a,
  author = {Nir Friedman},
  title = {Learning belief networks in the presence of missing values and hidden
	variables},
  booktitle = ICML,
  year = {1997},
  pages = {125--133},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{FriedmanGeGo97,
  author = {Nir Friedman and Dan Geiger and Moises Goldszmidt},
  title = {Bayesian network classifiers},
  journal = {Machine Learning},
  year = {1997},
  volume = {29},
  pages = {131--163},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{FrGeKoPf99,
  author = {N. Friedman and L. Getoor and D. Koller and A. Pfeffer},
  title = {Learning Probabilistic Relational Models},
  booktitle = IJCAI,
  year = {1999},
  pages = {1300-1309}
}

@INPROCEEDINGS{FriedmanGo96,
  author = {N. Friedman and M. Goldszmidt },
  title = {Builiding Classifiers using Bayesian Networks},
  booktitle = {National Conference on Artificial},
  year = {1996}
}

@INPROCEEDINGS{FriedmanGo96a,
  author = {Nir Friedman and Moises Goldszmidt},
  title = {Discretizing continuous attributes while learning {B}ayesian neworks},
  booktitle = ICML,
  year = {1996},
  pages = {157--165},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{FriedmanGoLe98,
  author = {Nir Friedman and Moises Goldszmidt and Thomas J. Lee},
  title = {Bayesian network classification with continuous attributes: getting
	the best of both discretization and parametric fitting},
  booktitle = ICML,
  year = {1998},
  pages = {179--187},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{FriedmanKoPf98,
  author = {N. Friedman and Koller, D. and Pfeffer, A.},
  title = {Structured Representation of Complex Stochastic Systems},
  booktitle = {AAAI-IAAI},
  year = {1998},
  pages = {157-164},
  url = {citeseer.nj.nec.com/friedman99structured.html}
}

@ARTICLE{FMDBS96,
  author = {H. Friedrich and S. M{\"u}nch and R. Dillman and S. Bocionek and
	M. Sassin},
  title = {Robot Programming by Demonstration ({RPD}): Supporting the Induction
	by Human Interaction},
  journal = {Machine Learning},
  year = {1996},
  volume = {23},
  pages = {163--189},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{FriessCrCa98,
  author = {Thilo-Thomas Frie{\ss} and Nello Cristianini and Colin Campbell},
  title = {The {K}ernel-{A}datron algorithm: a fast and simple learning procedure
	for {S}upport {V}ector machines},
  booktitle = ICML,
  year = {1998},
  pages = {188--196},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@TECHREPORT{FrischAL82,
  author = {Frisch, A. and J. Allen},
  title = {Knowledge Representation and Retrieval},
  institution = {Computer Science Department, University of Rochester,Rochester, NY.},
  year = {1982},
  number = {TR-104}
}

@ARTICLE{FrischHa94,
  author = {Alan M. Frisch and Peter Haddawy},
  title = {Anytime Deduction for Probabilistic Logic},
  journal = {Artificial Intelligence},
  year = {1994},
  volume = {69},
  pages = {93--122},
  number = {1--2},
  url = {citeseer.ist.psu.edu/frisch94anytime.html}
}

@INPROCEEDINGS{FromerGl09,
  author = {M. Fromer and A. Globerson},
  title = {An LP View of the M-best MAP problem},
  booktitle = NIPS,
  year = {2009},
  pages = {567--575}
}

@ARTICLE{Fr'echet06,
  author = {M. Fr{\'e}chet},
  title = {Sur quelques points du calcul fonctionnel},
  journal = {Rendiconti del Circolo Mathematico di Palermo},
  year = {1906},
  volume = {22},
  pages = {1--74}
}

@ARTICLE{FuBo75,
  author = {K. Fu and T. L. Booth},
  title = {Grammatical Inference: Introduction and Survey -- Part 1},
  journal = {IEEE Transactions on Systems, Man, and Cybernetics},
  year = {1975},
  volume = {SMC-5},
  pages = {85--111},
  number = {1},
  month = jan,
  comment = {Inference of finite-state and context-free grammars reviewed.}
}

@ARTICLE{FuBo75a,
  author = {K. Fu and T. L. Booth},
  title = {Grammatical Inference: Introduction and Survey -- Part 2},
  journal = {IEEE Transactions on Systems, Man, and Cybernetics},
  year = {1975},
  volume = {SMC-5},
  pages = {409--423},
  number = {4},
  month = jul,
  comment = {Inference of stochastic finite-state and context-free grammars.}
}

@BOOK{Fu77,
  title = {Syntactic Pattern Recognition, Applications},
  publisher = {Springer-Verlag, N.Y.},
  year = {1977},
  author = {K. S. Fu}
}

@BOOK{Fu74,
  title = {Syntactic Methods in Pattern Recognition},
  publisher = {Academic Press, N. Y.},
  year = {1974},
  author = {K. S. Fu}
}

@INPROCEEDINGS{Fuchs95,
  author = {Matthias Fuchs},
  title = {Learning proof heuristics by adapting parameters},
  booktitle = ICML,
  year = {1995},
  pages = {235--243},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{FJCBN89,
  author = {T. Fujisaki and F. Jelinek and J. Cocke and E. Black and T. Nishino},
  title = {A probabilistic parsing method for sentence disambiguation},
  booktitle = IPW,
  year = {1989}
}

@INPROCEEDINGS{Fujisaki89,
  author = {T. Fujisaki and F. Jelinek and J. Cocke and E. Black and T. Nishino},
  title = {A probabilistic parsing method for sentence disambiguation},
  booktitle = IPW,
  year = {1989}
}

@INPROCEEDINGS{FujitaHa92,
  author = {K. Fujita and M. Harao},
  title = {Proving based on similarity},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1992},
  pages = {213--223},
  publisher = {IOS Press}
}

@INPROCEEDINGS{Fukumizu99,
  author = {Kenji Fukumizu},
  title = {Generalization Error of Linear Neural Networks in Unidentifiable
	Cases},
  booktitle = ALT,
  year = {1999},
  volume = {1720},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {51--62},
  publisher = {Springer-Verlag}
}

@BOOK{Fukunaga90,
  title = {Statistical Pattern Recognition},
  publisher = {Academic Press},
  year = {1990},
  author = {K. Fukunaga},
  edition = {2nd}
}

@UNPUBLISHED{Fulk89,
  author = {M. Fulk},
  title = {Regressiveness},
  note = {unpublished},
  year = {1989}
}

@ARTICLE{Fulk86,
  author = {M. Fulk},
  title = {The disjunctive Learning Problem},
  journal = {20th Asilomar Conference on Signals, Systems and Computers},
  year = {1986},
  pages = {343--345}
}

@PHDTHESIS{Fulk85,
  author = {M. Fulk},
  title = {A Study of Inductive Inference machines},
  school = {SUNY at Buffalo},
  year = {1985}
}

@ARTICLE{Fulk90,
  author = {M. A. Fulk},
  title = {Prudence and Other Conditions on Formal Language Learning},
  journal = {Inform. Comput.},
  year = {1990},
  volume = {85},
  pages = {1--11},
  number = {1}
}

@INPROCEEDINGS{Fulk90a,
  author = {M. A. Fulk},
  title = {Robust separations in inductive inference},
  booktitle = FOCS,
  year = {1990},
  pages = {405--410},
  publisher = {IEEE Computer Society Press, Los Alamitos, CA}
}

@ARTICLE{Fulk88,
  author = {M. A. Fulk},
  title = {Saving the Phenomenon: Requirements that Inductive Inference Machines
	not Contradict Known Data},
  journal = {Inform. Comput.},
  year = {1988},
  volume = {79},
  pages = {193--209},
  number = {3}
}

@ARTICLE{FulkJa94,
  author = {M. A. Fulk and S. Jain},
  title = {Approximate Inference and Scientific Method},
  journal = {Inform. Comput.},
  year = {1994},
  volume = {114},
  pages = {179--191},
  number = {2},
  annote = {Was in {\sl Proceedings of the First International Workshop on Algorithmic
	Learning Theory}, Tokyo, Japan, October 1990. Was also Univ of Rochester
	TR 313 in 1989}
}

@INPROCEEDINGS{FulkJa89,
  author = {M. A. Fulk and S. Jain},
  title = {Learning in the Presence of Inaccurate Information},
  booktitle = COLT,
  year = {1989},
  pages = {175--188},
  month = aug,
  publisher = {Morgan Kaufmann, Inc.},
  annote = {Also University of Rochester TR 279 from 1989}
}

@ARTICLE{FulkJaOs94,
  author = {Mark Fulk and Sanjay Jain and Daniel N. Osherson},
  title = {Open problems in {\em Systems that learn}},
  journal = {J. of Comput. Syst. Sci.},
  year = {1994},
  volume = {49},
  pages = {589--604},
  number = {3}
}

@INPROCEEDINGS{FultonKaSa95,
  author = {Truxton Fulton and Simon Kasif and Steven Salzberg},
  title = {Efficient algorithms for finding multi-way splits for decision trees},
  booktitle = ICML,
  year = {1995},
  pages = {244--251},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{Fung96,
  author = {Pascale Fung},
  title = {Domain Word Translation by Space-Frequency Analysis of Context Length
	Histograms},
  booktitle = ICASSP,
  year = {1996},
  volume = {I},
  pages = {184--187}
}

@INPROCEEDINGS{Fung95,
  author = {Pascale Fung},
  title = {A pattern matching method for finding noun and proper noun translations
	from noisy parallel corpora},
  booktitle = ACL,
  year = {1995},
  pages = {236--233}
}

@INPROCEEDINGS{Fung95a,
  author = {Pascale Fung},
  title = {Compiling Bilingual Lexicon Entries from a Non-Parallel English-Chinese
	Corpus},
  booktitle = {Annual Workshop on Very Large Corpora},
  year = {1995},
  pages = {173--183}
}

@INPROCEEDINGS{Fung95b,
  author = {Pascale Fung},
  title = {Compiling Bilingual Lexicon Entries from a Non-Parallel English-Chinese
	Corpus},
  booktitle = {Annual Workshop on Very Large Corpora},
  year = {1995},
  pages = {173--183}
}

@INPROCEEDINGS{Fung94b,
  author = {Pascale Fung and Ken Church},
  title = {K-vec: a new approach for aligning parallel texts},
  booktitle = COLING,
  year = {1994}
}

@INPROCEEDINGS{FungCh94,
  author = {Pascale Fung and Ken Church},
  title = {K-vec: a new approach for aligning parallel texts},
  booktitle = COLING,
  year = {1994}
}

@ARTICLE{Fung96b,
  author = {Pascale Fung and Katheleen McKeown},
  title = {A Technical Word and Term Translation Aid using Noisy Parallel Corpora
	Across Language Groups},
  journal = {The Machine Translation Journal},
  year = {1996}
}

@ARTICLE{FungMc96,
  author = {Pascale Fung and Katheleen McKeown},
  title = {A Technical Word and Term Translation Aid using Noisy Parallel Corpora
	Across Language Groups},
  journal = {The Machine Translation Journal},
  year = {1996}
}

@INPROCEEDINGS{Fung94,
  author = {Pascale Fung and Katheleen McKeown},
  title = {Aligning noisy parallel corpora across language groups: word pair
	feature matching by dynamic time warping},
  booktitle = AMTA,
  year = {1994},
  pages = {81--88}
}

@INPROCEEDINGS{FungMc94,
  author = {Pascale Fung and Katheleen McKeown},
  title = {Aligning noisy parallel corpora across language groups: word pair
	feature matching by dynamic time warping},
  booktitle = AMTA,
  year = {1994},
  pages = {81--88}
}

@INPROCEEDINGS{Fung-Wu:tmi:95,
  author = {Pascale Fung and Dekai Wu},
  title = {Coerced Markov Models for Cross-Lingual Lexical Tag Relations},
  booktitle = TMI,
  year = {1995},
  volume = {1},
  pages = {240--255},
  address = {Leuven, Belgium},
  month = Jul
}

@INPROCEEDINGS{FungWu95,
  author = {Pascale Fung and Dekai Wu},
  title = {Coerced Markov Models for Cross-Lingual Lexical Tag Relations},
  booktitle = TMI,
  year = {1995},
  volume = {1},
  pages = {240--255},
  address = {Leuven, Belgium},
  month = Jul
}

@INPROCEEDINGS{FunkeMe00,
  author = {S. Funke and K. Mehlhorn},
  title = {{LOOK} - A Lazy object-oriented kernel for geometric computation},
  booktitle = {SOCG},
  year = {2000},
  pages = {156--165}
}

@INPROCEEDINGS{FurstJaSm91,
  author = {Merrick Furst and Jeffrey Jackson and Sean Smith},
  title = {Improved Learning of {$AC^0$} Functions},
  booktitle = COLT,
  year = {1991},
  pages = {317--325},
  address = {Santa Cruz, California},
  month = Aug
}

@TECHREPORT{FurstJaSm90,
  author = {Merrick Furst and Jeffrey Jackson and Sean Smith},
  title = {Learning {$AC^0$} Functions Sampled Under MutuallyIndependent Distributions},
  institution = {Carnegie Mellon University School of Computer Science},
  year = {1990},
  number = {CMU-CS-90-183},
  month = Oct
}

@INPROCEEDINGS{Furukawa92,
  author = {K. Furukawa},
  title = {Preliminary study on program synthesis based on induction and verification},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1992},
  pages = {299--306},
  publisher = {IOS Press}
}

@INPROCEEDINGS{FuruyaMi92,
  author = {S. Furuya and S. Miyano},
  title = {Analogy is {NP}-hard},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1992},
  pages = {207--212},
  publisher = {IOS Press}
}

@INPROCEEDINGS{FurnkranzWi94,
  author = {Johannes F{\"u}rnkranz and Gerhard Widmer},
  title = {Incremental reduced error pruning},
  booktitle = ICML,
  year = {1994},
  pages = {70--77},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{GotzSu04,
  author = {G\"{o}tz, T. and Suhre, O.},
  title = {{Design and Implementation of the UIMA Common Analysis System}},
  journal = {{IBM Systems Journal}},
  year = {2004},
  address-omit = {Riverton, NJ, USA},
  number-omit = {3},
  pages-omit = {476--489},
  publisher-omit = {IBM Corp.},
  volume-omit = {43}
}

@ARTICLE{Gabor89,
  author = {Csaba P. Gabor and Kenneth J. Supowit and Wen-Lian Hsu},
  title = {Recognizing Circle Graphs in Polynomial Time},
  journal = jacm,
  year = {1989},
  volume = {36},
  pages = {435-473},
  number = {3},
  month = jul,
  keywords = {Combinatorics and Graph Theory; Algorithms; Theory; Verification;
	circle graph; graph decomposition; induced subgraph; intersection
	graph; polynomial-time algorithms; }
}

@ARTICLE{Gabow89,
  author = {Harold N. Gabow and Zvi Galil and Thomas H. Spencer},
  title = {Efficient Implementation of Graph Algorithms Using Contraction},
  journal = jacm,
  year = {1989},
  volume = {36},
  pages = {540-572},
  number = {3},
  month = jul,
  keywords = {Data Structures and Algorithms; Algorithms; Theory; Verification;
	amortization; matching in graphs; minimum spanning trees; priority
	queue; worst-case bound; }
}

@ARTICLE{Gabow91,
  author = {Harold N. Gabow and Robert E. Tarjan},
  title = {Faster Scaling Algorithms for General Graph-Matching Problems},
  journal = jacm,
  year = {1991},
  volume = {38},
  pages = {815-853},
  number = {4},
  month = oct,
  keywords = {Combinatorics and Graph Theory; Algorithms; Design; Theory; augmenting
	path; blossom; matching; network optimization; scaling; }
}

@INPROCEEDINGS{Gabrilovich07,
  author = {Evgeniy Gabrilovich and Shaul Markovitch},
  title = {Computing Semantic Relatedness using Wikipedia-based Explicit Semantic
	Analysis},
  booktitle = IJCAI,
  year = {2007}
}

@INPROCEEDINGS{GabrilovichMa07,
  author = {Evgeniy Gabrilovich and Shaul Markovitch},
  title = {Computing Semantic Relatedness using Wikipedia-based Explicit Semantic
	Analysis},
  booktitle = IJCAI,
  year = {2007},
  pages = {1606--1611}
}

@ARTICLE{GabrilovichMa07a,
  author = {Gabrilovich, E. and Markovitch, S. },
  journal = {IJCAI},
  year = {2007},
  citeulike-article-id = {2157093},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@INPROCEEDINGS{GabrilovichMarkovitch07,
  author = {E. Gabrilovich and S. Markovitch},
  title = {Computing Semantic Relatedness Using Wikipeida-based Explicit Semantic
	Analysis},
  booktitle = IJCAI,
  year = {2007}
}

@INPROCEEDINGS{GabrilovichMa06,
  author = {Evgeniy Gabrilovich and Shaul Markovitch},
  title = {Overcoming the Brittleness Bottleneck using Wikipedia: Enhancing
	Text Categorization with Encyclopedic Knowledge},
  booktitle = AAAI,
  year = {2006},
  pages = {1301--1306}
}

@INPROCEEDINGS{GabrilovichMa05,
  author = {Evgeniy Gabrilovich and Shaul Markovitch},
  title = {Feature Generation for Text Categorization Using World Knowledge},
  booktitle = IJCAI,
  year = {2005},
  pages = {1048--1053}
}

@INPROCEEDINGS{GabsdilKoSt02,
  author = {Malte Gabsdil and Alexander Koller and Kristina Striegnitz},
  title = {Natural Language and Inference in a Computer Game},
  booktitle = COLING,
  year = {2002},
  address = {Taipe, Taiwan}
}

@ARTICLE{GaedeG98,
  author = {V. Gaede and O. G{\"u}nther},
  title = {Multidimensional Access Methods},
  journal = {ACM Comput. Surv.},
  year = {1998},
  volume = {30},
  pages = {170--231}
}

@INPROCEEDINGS{Gaertner98,
  author = {B. Gaertner},
  title = {Exact Arithmetic at Low Cost - {A} Case Study in Linear Programming},
  booktitle = SODA,
  year = {1998},
  pages = {157--166},
  nickname = {SODA'98}
}

@INPROCEEDINGS{GaertnerLl02,
  author = {T. Gaertner and J.W. Lloyd and P.A. Flach},
  title = {Kernels for Structured Data},
  booktitle = ILP,
  year = {2002}
}

@ARTICLE{Gaines79,
  author = {B. R. Gaines},
  title = {Maryanski's Grammatical Inferencer},
  journal = {IEEE Trans. Computers},
  year = {1979},
  volume = {C-27},
  pages = {62--64},
  number = {1},
  month = jan,
  comment = {Corrects some typographical errors in the Maryanski-Booth algorithm
	for inferring a probabilistic finite-state grammar from a given set
	of strings.}
}

@ARTICLE{GajentaanOv95,
  author = {A. Gajentaan and M. H. Overmars},
  title = {On a class of {$O(n^2)$} problems in computational geometry},
  journal = CGTA,
  year = {1995},
  volume = {5},
  pages = {165--185}
}

@BOOK{Galambos87,
  title = {The Asymptotic Theory of Extreme Order Statistics},
  publisher = {R. E. Krieger},
  year = {1987},
  author = {Janos Galambos},
  address = {Malabar, FL},
  note = {Second Edition}
}

@ARTICLE{GaleChJa92,
  author = {W. A. Gale and K. W. Church and D. Jarowsky},
  title = {A Method for Disambiguation Word Senses in Large Corpora},
  journal = {Computers and the Humanities},
  year = {1992},
  volume = {26},
  pages = {415-439},
  number = {5-6}
}

@INCOLLECTION{GaleChYa94,
  author = {W. A. Gale and K. W. Church and D. Yarowsky},
  title = {Discrimination decisions for 100,000-dimensional spaces},
  booktitle = {Current issue in Computational Linguistics: In Honor of {D}on {W}alker},
  publisher = {Kluwer Academic Publishers},
  year = {1994},
  pages = {429--450}
}

@ARTICLE{GaleChYa93,
  author = {W. A. Gale and K. W. Church and D. Yarowsky},
  title = {A Method for Disambiguating Word Senses in a Large Corpus},
  journal = {Computers and the Humanities},
  year = {1993},
  volume = {26},
  pages = {415--439}
}

@ARTICLE{Gale93,
  author = {William Gale and Kenneth Church},
  title = {A program for aligning sentences in bilingual corpora},
  journal = CL,
  year = {1993},
  volume = {19},
  pages = {75--102},
  number = {1}
}

@ARTICLE{GaleCh93,
  author = {William Gale and Kenneth Church},
  title = {A program for aligning sentences in bilingual corpora},
  journal = CL,
  year = {1993},
  volume = {19},
  pages = {75--102},
  number = {1}
}

@INPROCEEDINGS{Gale91,
  author = {William Gale and Kenneth Church},
  title = {Identifying word correspondence in parallel text},
  booktitle = DARPA,
  year = {1991}
}

@INPROCEEDINGS{Gale91b,
  author = {William Gale and Kenneth Church},
  title = {A program for aligning sentences in bilingual corpora},
  booktitle = ACL,
  year = {1991}
}

@INPROCEEDINGS{Gale91c,
  author = {William Gale and Kenneth Church},
  title = {Concordances for parallel texts},
  booktitle = {Seventh Annual Conference of the UW Center for the New OED and Text
	Research, Using Corpora},
  year = {1991},
  pages = {40--62}
}

@INPROCEEDINGS{GaleCh91,
  author = {William Gale and Kenneth Church},
  title = {Identifying word correspondence in parallel text},
  booktitle = DARPA,
  year = {1991}
}

@INPROCEEDINGS{GaleCh91a,
  author = {William Gale and Kenneth Church},
  title = {A program for aligning sentences in bilingual corpora},
  booktitle = ACL,
  year = {1991}
}

@INPROCEEDINGS{GaleCh91b,
  author = {William Gale and Kenneth Church},
  title = {Concordances for parallel texts},
  booktitle = {Seventh Annual Conference of the UW Center for the New OED and Text
	Research, Using Corpora},
  year = {1991},
  pages = {40--62},
  place = {Oxford, U.K.}
}

@ARTICLE{GaleChYa93a,
  author = {W. Gale and K. Church and D. Yarowsky},
  title = {A method for disambiguating word senses in a large corpus},
  journal = {Computers and the Humanities},
  year = {1993},
  volume = {26},
  pages = {415--439}
}

@TECHREPORT{Gale92,
  author = {W. Gale and K. Church and D. Yarowsky},
  title = {A method for disambiguating word senses in a large corpus},
  institution = {AT\&T Bell Laboratories},
  year = {1992},
  number = {Statistical Research Report, No. 104}
}

@INPROCEEDINGS{Gale92b,
  author = {W. Gale and K. Church and D. Yarowsky},
  title = {Work on statistical methods for word sense disambiguation},
  booktitle = {Working Notes, AAAI Fall Symposium Series, Probabilistic Approaches
	to Natural Language},
  year = {1992},
  pages = {54--60}
}

@INPROCEEDINGS{Gale92c,
  author = {W. Gale and K. Church and D. Yarowsky},
  title = {Using bilingual materials to develop word sense disambiguation methods},
  booktitle = TMI,
  year = {1992},
  pages = {101--112}
}

@INPROCEEDINGS{GaleChYa92a,
  author = {W. Gale and K. Church and D. Yarowsky},
  title = {Work on statistical methods for word sense disambiguation},
  booktitle = {Working Notes, AAAI Fall Symposium Series, Probabilistic Approaches
	to Natural Language},
  year = {1992},
  pages = {54--60}
}

@INPROCEEDINGS{GaleChYa92b,
  author = {W. Gale and K. Church and D. Yarowsky},
  title = {Using bilingual materials to develop word sense disambiguation methods},
  booktitle = TMI,
  year = {1992},
  pages = {101--112}
}

@ARTICLE{Gallier93,
  author = {Jean Gallier and Paliath Narendran and David Plaisted and Stan Raatz
	and Wayne Snyder},
  title = {An Algorithm for Finding Canonical Sets of Ground Rewrite Rules in
	Polynomial Time},
  journal = jacm,
  year = {1993},
  volume = {40},
  pages = {1-16},
  number = {1},
  month = jan,
  keywords = {Deductive Systems and Equational Reasoning; Algorithms; completion
	procedures; congruence closure; equational logic; term rewriting;}
}

@ARTICLE{Gallier92,
  author = {Jean Gallier and Paliath Narendran and Stan Raatz and Wayne Snyder},
  title = {Theorem Proving Using Equational Matings and Rigid {\it E}-Unification},
  journal = jacm,
  year = {1992},
  volume = {39},
  pages = {377-429},
  number = {2},
  month = apr,
  keywords = {Logic; Algorithms; Languages; Theory; automated theorem proving; equational
	reasoning; Knuth-Bendix procedure; NP-completeness; matings; unification;}
}

@INPROCEEDINGS{Galperin96,
  author = {Igal Galperin},
  title = {Analysis of greedy expert hiring and an application to memory-based
	learning},
  booktitle = COLT,
  year = {1996},
  pages = {217--223},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{GalperinRi93,
  author = {Galperin, Igal and Ronald L. Rivest},
  title = {Scapegoat Trees},
  booktitle = SODA,
  year = {1993},
  pages = {to appear},
  month = Jan
}

@INPROCEEDINGS{Gama99,
  author = {Jo{\~a}o Gama},
  title = {Discriminant trees},
  booktitle = ICML,
  year = {1999},
  pages = {134--142},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{Gama98,
  author = {Jo{\~a}o Gama},
  title = {Local cascade generalization},
  booktitle = ICML,
  year = {1998},
  pages = {206--214},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{Gama97,
  author = {Jo{\~a}o Gama},
  title = {Probabilistic linear tree},
  booktitle = ICML,
  year = {1997},
  pages = {134--142},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{Gamarnik99,
  author = {David Gamarnik},
  title = {Extension of the {PAC} framework to finite and countable {M}arkov
	chains},
  booktitle = COLT,
  year = {1999},
  pages = {308--317},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{Gamarnik98,
  author = {David Gamarnik},
  title = {Efficient learning of monotone concepts via quadratic optimization},
  booktitle = COLT,
  year = {1998},
  pages = {134--143},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{GambardellaDo95,
  author = {Luca M. Gambardella and Marco Dorigo},
  title = {Ant-{Q}:a reinforcement learning approach to the traveling salesman
	problem},
  booktitle = ICML,
  year = {1995},
  pages = {252--260},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{GambergerLaD96,
  author = {Dragan Gamberger and Nada Lavra{\v c} and Sa{\v s}o D\u{z}eroski},
  title = {Noise elimination in inductive concept learning: a case study in
	medical diagnosis},
  booktitle = ALT,
  year = {1996},
  volume = {1160},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {199--212},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{GambergerLaGr99,
  author = {Dragan Gamberger and Nada Lavra{\v c} and Ciril Gro{\v s}elj},
  title = {Experiments with noise filtering in a medical domain},
  booktitle = ICML,
  year = {1999},
  pages = {143--151},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{GamboaFr03,
  author = {H. Gamboa and A. Fred},
  title = {An Identity Authentication System Based On Human Computer Interaction
	Behaviour.},
  booktitle = {Pattern Recognition in Information Systems},
  year = {2003}
}

@INBOOK{GamsBoCe94,
  chapter = {10},
  pages = {157--170},
  title = {A schema for using multiple knowledge},
  publisher = {MIT Press},
  year = {1994},
  author = {Matja{\v z} Gams and Marko Bohanec and Bojan Cestnik},
  volume = {II: Intersections Between Theory and Experiment},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@INPROCEEDINGS{GamsLa87,
  author = {Gams, M. and N. Lavrac},
  title = {Review of Five Empirical Learning Systems Within a Proposed Schemata},
  booktitle = {Progress in Machine Learning--Proceedings of EWSL 87: 2nd European
	Working Session on Learning},
  year = {1987},
  editor = {Bratko, I. and N. Lavrac},
  pages = {46--66},
  address = {Bled, Yogoslavia},
  month = may
}

@INPROCEEDINGS{Ganascia93,
  author = {J. G. Ganascia},
  title = {Algebraic structure of some learning systems},
  booktitle = {International Workshop on Analogical and Inductive Inference and
	International Workshop on Algorithmic Learning Theory},
  year = {1993},
  volume = {744},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {398--409},
  publisher = {Springer-Verlag}
}

@ARTICLE{GGGT10,
  author = {K. Ganchev and J. Gra\c{c}a and J. Gillenwater and B. Taskar},
  title = {Posterior Regularization for Structured Latent Variable Models},
  journal = JMLR,
  year = {2010}
}

@TECHREPORT{GGGT09,
  author = {K. Ganchev and J. Graca and J. Gillenwater and B. Taskar},
  title = {Posterior Regularization for Structured Latent Variable Models},
  institution = {University of Pennsylvania Department of Computer and Information
	Science},
  year = {2009},
  number = {MS-CIS-09-16}
}

@INPROCEEDINGS{GAJT07,
  author = {Gao, Jianfeng and Andrew, Galen and Johnson, Mark and Toutanova,
	Kristina},
  title = {A Comparative Study of Parameter Estimation Methods for Statistical
	Natural Language Processing},
  booktitle = ACL,
  year = {2007},
  pages = {824--831},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1104}
}

@INPROCEEDINGS{GGHZZ01,
  author = {J. Gao and L. Guibas and J. Hershberger and L. Zhang and A. Zhu},
  title = {Discrete Mobile Centers},
  booktitle = {SOCG},
  year = {2001},
  pages = {188--196}
}

@UNPUBLISHED{GaoGu02,
  author = {J.~Gao and L. J. Guibas},
  title = {Staying in the middle: approximate medians in $\reals^1$ and $\reals^2$
	for moving points},
  note = {menuscript},
  year = {2002}
}

@INPROCEEDINGS{GaoLi89,
  author = {Q. Gao and M. Li},
  title = {An application of minimum description length principle to online
	recognition of handprinted alphanumerals},
  booktitle = IJCAI,
  year = {1989},
  pages = {843--848},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{GarciaNd98,
  author = {Fr{\'e}d{\'e}rick Garcia and Seydina M. Ndiaye},
  title = {A learning rate analysis of reinforcement learning algorithms in
	finite-horizon},
  booktitle = ICML,
  year = {1998},
  pages = {215--223},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{Garc'ia-LopezRa97,
  author = {J. Garc{\'i}a-Lopez and P. Ramos},
  title = {Fitting a set of points by a circle},
  booktitle = {SOCG},
  year = {1997},
  pages = {139--146}
}

@ARTICLE{Garc'ia-LopezRaSn98,
  author = {J. Garc{\'i}a-Lopez and P. Ramos and J. Snoeyink},
  title = {Fitting a Set of Points by a Circle},
  journal = DCG,
  year = {1998},
  volume = {20},
  pages = {389-402},
  number = {3},
  url = {http://link.springer-ny.com/link/service/journals/00454/bibs/20n3p389.html}
}

@INPROCEEDINGS{GardentKo07,
  author = {Gardent, Claire and Kow, Eric},
  title = {A Symbolic Approach to Near-Deterministic Surface Realisation using
	Tree Adjoining Grammar},
  booktitle = ACL,
  year = {2007},
  pages = {328--335},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1042}
}

@INBOOK{GarvinRa97,
  chapter = {15},
  pages = {245--278},
  title = {Probabilistic self-structuring and learning},
  publisher = {MIT Press},
  year = {1997},
  author = {David Garvin and Peter Rayner},
  volume = {IV: Making Learning Systems Practical},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@INPROCEEDINGS{GasarchHi95,
  author = {William Gasarch and Geoffrey R. Hird},
  title = {Reductions for learning via queries},
  booktitle = COLT,
  year = {1995},
  pages = {152--161},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{GKPSZ95,
  author = {William Gasarch and Efim Kinber and Mark Pleszkoch and Carl Smith
	and Thomas Zeugmann},
  title = {Learning via Queries, Teams, and Anomalies},
  journal = {Fundamenta Informaticae},
  year = {1995},
  volume = {23},
  pages = {67--89},
  note = {Shorter version in Third Annual Conference on Computational Learning
	Theory, 1990, pages 327-337, published by Morgan Kaufman}
}

@ARTICLE{GasarchPlSo92,
  author = {W. Gasarch and M. Pleszkoch and R. Solovay},
  title = {Learning via Queries to $[+,<]$},
  journal = {J. Symbolic Logic},
  year = {1992},
  volume = {57},
  pages = {53--81},
  number = {1},
  month = mar,
  annote = {Earlier version in COLT90},
  callno = {B1.J89}
}

@ARTICLE{GPSV98,
  author = {William Gasarch and Mark G. Pleszkoch and Frank Stephan and Mahendran
	Velauthapillai},
  title = {Classification using information},
  journal = {Annals of Mathematics and Artificial Intelligence},
  year = {1998},
  volume = {23},
  pages = {147--168},
  number = {1/2},
  note = {Special issue for AII '94 and ALT '94}
}

@INPROCEEDINGS{GasarchLe97,
  author = {William I. Gasarch and Andrew C. Y. Lee},
  title = {Inferring Answers to Queries},
  booktitle = COLT,
  year = {1997},
  pages = {275--284},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{GasarchPlVe94,
  author = {W. I. Gasarch and M. G. Pleszkoch and M. Velauthapillai},
  title = {Classification using information},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1994},
  pages = {290--300},
  publisher = {Springer-Verlag}
}

@ARTICLE{GSSV92,
  author = {W. I. Gasarch and R. K. Sitaraman and C. H. Smith and M. Velauthapillai},
  title = {Learning programs with an easy to calculate set of errors},
  journal = {Fundamentca Informaticae},
  year = {1992},
  pages = {355--370},
  annote = {Was in COLT88}
}

@ARTICLE{Gasarch92,
  author = {William I. Gasarch and Carl H. Smith},
  title = {Learning via Queries},
  journal = jacm,
  year = {1992},
  volume = {39},
  pages = {649-674},
  number = {3},
  month = jul,
  keywords = {Theory of Computation; Inductive Inference; Machine Learning; learning
	by example; learning via a teacher; omega automata; }
}

@INPROCEEDINGS{GasarchSm86,
  author = {W. I. Gasarch and C. H. Smith},
  title = {On the Inference of Sequences of Functions},
  booktitle = {International Workshop on Analogical and Inductive Inference},
  year = {1986},
  volume = {265},
  series = {Lecture Notes in Computer Science},
  pages = {23--41},
  annote = {Subsumed by {\sl Training Sequences} which is co-authored by Angluin
	and appeared in {\it Theoretical Computer Science} in 1989}
}

@INPROCEEDINGS{GattDe07,
  author = {Gatt, Albert and van Deemter, Kees},
  title = {Incremental Generation of Plural Descriptions: Similarity and Partitioning},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {102--111},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1011}
}

@INPROCEEDINGS{Gaussier92,
  author = {E. Gaussier and J. M. Lange and F. Meunier},
  title = {Towards bilingual terminology},
  booktitle = {ALLC/ACH},
  year = {1992}
}

@INPROCEEDINGS{Gavald`a94,
  author = {R. Gavald{\`a}},
  title = {On the Power of Equivalence Queries},
  booktitle = EuroCOLT,
  year = {1994},
  volume = {New Series Number 53},
  series = {The Institute of Mathematics and its Applications Conference Series},
  pages = {193--203},
  address = {Oxford},
  publisher = {Oxford University Press},
  isbn = {0 19 853492 2}
}

@INPROCEEDINGS{Gavald`aGu95,
  author = {Ricard Gavald{\`a} and David Guijarro},
  title = {Learning ordered binary decision diagrams},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1995},
  pages = {228--238},
  publisher = {Springer-Verlag}
}

@INBOOK{GawronskaScHo94,
  chapter = {17},
  pages = {279--294},
  title = {Learning properties of multi-layer perceptrons with and without feedback},
  publisher = {MIT Press},
  year = {1994},
  author = {D. Gawronska and B. Sch{\"u}rmann and J. Hollatz},
  volume = {II: Intersections Between Theory and Experiment},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@INPROCEEDINGS{GeMo06,
  author = {Ge, R. and Mooney, R.},
  title = {Discriminative Reranking for Semantic Parsing},
  booktitle = ACL,
  year = {2006},
  pages = {263--270},
  address = {Sydney, Australia},
  month = {July},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P06/P06-2034}
}

@INPROCEEDINGS{GeMo05,
  author = {Ge, R. and Mooney, R.},
  title = {A Statistical Semantic Parser that Integrates Syntax and Semantics},
  booktitle = {CONLL},
  year = {2005},
  pages = {9--16},
  address = {Ann Arbor, Michigan},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/W/W05/W05-0602}
}

@ARTICLE{Gee83,
  author = {Gee, J. P. and F. Grosjean},
  title = {Performance structures:A psycholinguistic and linguistic appraisal},
  journal = {Cognitive Psychology},
  year = {1983},
  volume = {15},
  pages = {411--458}
}

@INPROCEEDINGS{GeibelWy96,
  author = {P. Geibel and F. Wysotzki},
  title = {Relational Learning with Decision Trees},
  booktitle = ECAI,
  year = {1996},
  pages = {428-432}
}

@INPROCEEDINGS{GeibelWy96a,
  author = {Peter Geibel and Fritz Wysotzki},
  title = {Learning relational concepts with decision trees},
  booktitle = ICML,
  year = {1996},
  pages = {166--174},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{Geisser70,
  author = {Geisser, Seymour},
  title = {The Inferential Use of Predictive Distributions},
  booktitle = {Foundations of Statistical Inference},
  year = {1970},
  editor = {Godambe, V. P. and D. A. Sprott},
  publisher = {Holt, Rinehart, and Winston},
  comment = {Argues for deriving probability density of future observations (a
	predictive distribution) from prior observations.}
}

@INPROCEEDINGS{GellySi07,
  author = {S. Gelly and D. Silver},
  title = {Combining online and offline knowledge in {UCT}},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {273--280},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INCOLLECTION{Geman86,
  author = {Geman, Stuart},
  title = {Stochastic Relaxation Methods for Image Restoration and Expert Systems},
  booktitle = {Automated Image Analysis: Theory and Experiments},
  publisher = {Academic Press},
  year = {1986},
  editor = {D.B. Cooper and R.L.Launer and D.E. McClure},
  comment = {Describes stochastic relaxation technique for maximum entropy computations
	and for image restoration.}
}

@ARTICLE{Geman84,
  author = {Stuart Geman and Donald Geman},
  title = {Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration
	of Images},
  journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence},
  year = {1984},
  volume = {PAMI-6},
  pages = {721--741},
  number = {6},
  month = Nov,
  comment = {Uses Markov random fields and edge models.}
}

@ARTICLE{GemelloMaSa91,
  author = {Roberto Gemello and Franco Mana and Lorenza Saitta},
  title = {Rigel: An Inductive Learning System},
  journal = {Machine Learning},
  year = {1991},
  volume = {6},
  pages = {7--35},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{GentileHe98,
  author = {Claudio Gentile and David P. Helmbold},
  title = {Improved lower bounds for learning from noisy examples: an information-theoretic
	approach},
  booktitle = COLT,
  year = {1998},
  pages = {104--115},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{GentileLi99,
  author = {Claudio Gentile and Nick Littlestone},
  title = {The robustness of the p-norm algorithms},
  booktitle = COLT,
  year = {1999},
  pages = {1--11},
  publisher = {ACM Press, New York, NY}
}

@INCOLLECTION{GentnerBo01,
  author = {D. Gentner and L. Boroditsky},
  title = {Individuation, relativity and early word learning},
  booktitle = {Language Acquisition and Conceptual Development},
  publisher = {Cambridge University Press},
  year = {2001},
  editor = {M. Bowerman and S. C. Levinson},
  pages = {215-256},
  address = {New York}
}

@ARTICLE{George59,
  author = {George, F. H.},
  title = {Inductive machines and the problem of learning},
  journal = {Cybernetica},
  year = {1959},
  volume = {II},
  pages = {109--126},
  comment = {Discussion of learning; machines which learn associations.}
}

@ARTICLE{George57,
  author = {George, F. H.},
  title = {Logical Networks and Probability},
  journal = {Bulletin of Mathematical Biophysics},
  year = {1957},
  volume = {19},
  pages = {187--199},
  comment = {Extends McCulloch-Pitts networks with counters for probabilities.}
}

@INCOLLECTION{GeorgeffWa84,
  author = {M. P. Georgeff and C. S. Wallace},
  title = {A General Selection Criterion for Inductive Inference},
  booktitle = ECAI,
  publisher = {Elsevier Science},
  year = {1984},
  pages = {473--482}
}

@INPROCEEDINGS{GPPS06,
  author = {Filippo Geraci and Marco Pellegrini and Paolo Pisati and Fabrizio
	Sebestiani},
  title = {A {S}calable {A}lgorithm for {H}igh-{Q}uality {C}lustering of {W}eb
	{S}nippets},
  booktitle = {SAC},
  year = {2006},
  pages = {1058--1062}
}

@INPROCEEDINGS{GerberTaWh07,
  author = {S. Gerber and T. Tasdizen and R. Whitaker},
  title = {Robust non-linear dimensionality reduction using successive 1-dimensional
	{Laplacian} eigenmaps},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {281--288},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@ARTICLE{German92,
  author = {Steven M. German and A. Prasad Sistla},
  title = {Reasoning about Systems with Many Processes},
  journal = jacm,
  year = {1992},
  volume = {39},
  pages = {675-735},
  number = {3},
  month = jul,
  keywords = {Theory of Computation; Algorithms; Performance; Theory; Verification;}
}

@INPROCEEDINGS{GJKMY01,
  author = {U. Germann and M. Jahr and K. Knight and D. Marcu and K. Yamada},
  title = {Fast Decoding and Optimal Decoding for Machine Translation},
  booktitle = ACL,
  year = {2001},
  pages = {228--235},
  address = {Toulouse, France},
  month = {July},
  publisher = {Association for Computational Linguistics},
  doi = {10.3115/1073012.1073042},
  url = {http://www.aclweb.org/anthology/P01-1030}
}

@BOOK{GershoGr91,
  title = {Vector Quantization and Signal Compression},
  publisher = {Kluwer Academic Publishers},
  year = {1991},
  author = {A. Gersho and R. M. Gray}
}

@INPROCEEDINGS{GertnerFi06,
  author = {Y. Gertner and C. Fisher},
  title = {Predicted errors in early verb learning.},
  booktitle = BUCLD,
  year = {2006}
}

@ARTICLE{GertnerFiEi06,
  author = {Y. Gertner and C. Fisher and J. Eisengart},
  title = {Learning Words and Rules: Abstract knowledge of word order in early
	sentence comprehension},
  journal = {Psychological Science},
  year = {2006},
  volume = {17},
  pages = {684-691}
}

@INPROCEEDINGS{GervasioDe94,
  author = {Melinda T. Gervasio and Gerald F. De{J}ong},
  title = {An incremental learning approach for completable planning},
  booktitle = ICML,
  year = {1994},
  pages = {78--86},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{GervasioIbLa99,
  author = {Melinda T. Gervasio and Wayne Iba and Pat Langley},
  title = {Learning user evaluation functions for adaptive scheduling assistance},
  booktitle = ICML,
  year = {1999},
  pages = {152--161},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@ARTICLE{Getoor00,
  author = {Lise Getoor},
  title = {Learning Probabilistic Relational Models},
  journal = {Lecture Notes in Computer Science},
  year = {2000},
  volume = {1864},
  pages = {1300-1307},
  url = {citeseer.nj.nec.com/getoor00learning.html}
}

@INPROCEEDINGS{GFKT01,
  author = {Lise Getoor and Nir Friedman and Daphne Koller and Benjamin Taskar},
  title = {Learning Probabilistic Models of Relational Structure},
  booktitle = ICML,
  year = {2001},
  pages = {170--177},
  publisher = {Morgan Kaufmann, San Francisco, CA},
  url = {citeseer.ist.psu.edu/article/getoor01learning.html}
}

@INPROCEEDINGS{GerutsWhdA07,
  author = {P. Geurts and L. Wehenkel and F. d'Alch\'{e}-Buc},
  title = {Gradient boosting for kernelized output spaces},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {289--296},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@ARTICLE{GMMN90,
  author = {L.~Gewali and A.~Meng and J. S. B. Mitchell and S. Ntafos},
  title = {Path planning in $0/1/\infty$ weighted regions with applications},
  journal = {ORSA J. Computing},
  year = {1990},
  volume = {2},
  pages = {253--272}
}

@ARTICLE{GhahramaniJo97,
  author = {Zoubin Ghahramani and Michael I. Jordan},
  title = {Factorial hidden {M}arkov models},
  journal = {Machine Learning},
  year = {1997},
  volume = {29},
  pages = {245--273},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INBOOK{GhahramaniJo97a,
  chapter = {5},
  pages = {67--85},
  title = {Mixture models for learning from incomplete data},
  publisher = {MIT Press},
  year = {1997},
  author = {Zoubin Ghahramani and Michael I. Jordan},
  volume = {IV: Making Learning Systems Practical},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@INPROCEEDINGS{GhavamzadehEn07,
  author = {M. Ghavamzadeh and Y. Engel},
  title = {Bayesian actor-critic algorithms},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {297--304},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{GhoseIpSu07,
  author = {Ghose, Anindya and Ipeirotis, Panagiotis and Sundararajan, Arun},
  title = {Opinion Mining using Econometrics: A Case Study on Reputation Systems},
  booktitle = ACL,
  year = {2007},
  pages = {416--423},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1053}
}

@INPROCEEDINGS{Ghosh87,
  author = {S. K. Ghosh},
  title = {Approximation algorithms for art gallery problems},
  booktitle = {Canadian Information Processing Society Congress},
  year = {1987}
}

@INPROCEEDINGS{GDMD09,
  author = {Danilo Giampiccolo and Hoa Trang Dang and Bernando Magnini and Ido
	Dagan},
  title = {The {F}ourth {PASCAL} {R}ecognizing {T}extual {E}ntailment {C}hallenge},
  booktitle = TAC,
  year = {2009}
}

@INPROCEEDINGS{RTE4overview,
  author = {Danilo Giampiccolo and Hoa Trang Dang and Bernando Magnini and Ido
	Dagan},
  title = {The {F}ourth {PASCAL} {R}ecognizing {T}extual {E}ntailment {C}hallenge},
  booktitle = TAC,
  year = {2009}
}

@INPROCEEDINGS{GiampiccoloBeDaDo07,
  author = {Giampiccolo, D. and Magnini, B. and Dagan, I. and Dolan, B.},
  title = {The Third PASCAL Recognizing Textual Entailment Challenge},
  booktitle = {ACL-PASCAL Workshop on Textual Entailment and Paraphrasing},
  year = {2007},
  pages = {1--9},
  address = {Prague},
  month = {June},
  url = {http://www.aclweb.org/anthology/W/W07/W07-1401}
}

@INPROCEEDINGS{GiampiccoloMaIdDo07,
  author = {Giampiccolo, Danilo and Magnini, Bernardo and Dagan, Ido and Dolan,
	Bill},
  title = {The Third PASCAL Recognizing Textual Entailment Challenge},
  booktitle = {ACL-PASCAL Workshop on Textual Entailment and Paraphrasing},
  year = {2007},
  pages = {1--9},
  address = {Prague},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/W/W07/W07-1401}
}

@INPROCEEDINGS{GMDD07,
  author = {Giampiccolo, D. and Magnini, B. and Dagan, I. and Dolan, B.},
  title = {The Third PASCAL Recognizing Textual Entailment Challenge},
  booktitle = {ACL-PASCAL Workshop on Textual Entailment and Paraphrasing},
  year = {2007},
  pages = {1--9},
  address = {Prague},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/W/W07/W07-1401}
}

@INPROCEEDINGS{GibsonHeKarKatPa89,
  author = {Gibson, G. and L. Hellerstein and R.M. Karp and R.H. Katz and D.A.
	Patterson},
  title = {Coding techniques for handling failures in large disk arrays},
  booktitle = ASPLOS,
  year = {1989},
  note = {(To appear)}
}

@ARTICLE{Gibson96,
  author = {Gavin J. Gibson},
  title = {Exact classification with two-layer neural nets},
  journal = {J. of Comput. Syst. Sci.},
  year = {1996},
  volume = {52},
  pages = {349--356},
  number = {2}
}

@INPROCEEDINGS{Gil94,
  author = {Yolanda Gil},
  title = {Learning by experimentation: incremental refinement of incomplete
	planning domains},
  booktitle = ICML,
  year = {1994},
  pages = {87--95},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{GilbertOn94,
  author = {E. G. Gilbert and C. J. Ong},
  title = {New distances for the separation and penetration of objects},
  booktitle = {International Conference Robotics Automation},
  year = {1994},
  pages = {579--586}
}

@INPROCEEDINGS{GildeaHo03,
  author = {D. Gildea and J. Hockenmaier},
  title = {Identifying Semantic Roles Using Combinatory Categorial Grammar},
  booktitle = EMNLP,
  year = {2003},
  address = {Sapporo, Japan}
}

@ARTICLE{GildeaJu02,
  author = {D. Gildea and D. Jurafsky},
  title = {Automatic Labeling of Semantic Roles},
  journal = {Computational Linguistics},
  year = {2002},
  volume = {28},
  pages = {245-288},
  number = {3},
  month = {September}
}

@INPROCEEDINGS{GildeaJu02a,
  author = {D. Gildea and D. Jurafsky},
  title = {Automatic labeling of semantic roles},
  booktitle = CL,
  year = {2002},
  pages = {245--288},
  url = {citeseer.ist.psu.edu/article/gildea00automatic.html}
}

@ARTICLE{GildeaJu02b,
  author = {D. Gildea and D. Jurafsky},
  title = {Automatic Labeling of Semantic Roles},
  journal = {Computational Linguistics},
  year = {2002},
  volume = {28},
  pages = {245--288},
  number = {3}
}

@INPROCEEDINGS{GildeaPa02,
  author = {D. Gildea and M. Palmer},
  title = {The Necessity of Parsing for Predicate Argument Recognition},
  booktitle = ACL,
  year = {2002},
  pages = {239--246}
}

@INPROCEEDINGS{GildeaTe07,
  author = {Gildea, Daniel and Temperley, David},
  title = {Optimizing Grammars for Minimum Dependency Length},
  booktitle = ACL,
  year = {2007},
  pages = {184--191},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1024}
}

@BOOK{GilksRiSp95,
  title = {Markov Chain Monte Carlo in Practice},
  publisher = {Chapman \& Hall/CRC},
  year = {1995},
  author = {W. R. Gilks and S. Richardson and D. J. Speigelhalter},
  month = {December}
}

@ARTICLE{GGGL99,
  author = {J. Gillette and H. Gleitman and L. R. Gleitman and A. Lederer},
  title = {Human simulations of vocabulary learning},
  journal = {Cognition},
  year = {1999},
  volume = {73},
  pages = {135-176}
}

@INPROCEEDINGS{GillmanSi94,
  author = {D. Gillman and M. Sipser},
  title = {Inference and minimization of hidden {M}arkov chains},
  booktitle = COLT,
  year = {1994},
  pages = {147--158},
  publisher = {ACM Press, New York, NY}
}

@UNPUBLISHED{GillmanSi91,
  author = {Gillman, D. and M. Sipser},
  title = {Colored Markov Chains},
  note = {Unpublished Manuscript},
  year = {1992}
}

@MISC{GionisInMo97,
  author = {A. Gionis and P. Indyk and R. Motwani},
  title = {Similarity Search in High Dimensions via Hashing},
  year = {1997},
  text = {A. Gionis, P. Indyk, and R. Motwani. Similarity Search in High Dimensions
	via Hashing. Manuscript, 1997.}
}

@ARTICLE{GiordanaBe98,
  author = {Attilio Giordana and Giuseppe Lo Bello},
  title = {Learning Classification Programs: The Genetic Algorithm Approach},
  journal = {Fundamenta Informaticae},
  year = {1998},
  volume = {35},
  pages = {163--177},
  number = {1/4}
}

@INPROCEEDINGS{GiordanaPi99,
  author = {Attilio Giordana and Roberto Piola},
  title = {On some misbehaviour of back-propagation with non-normalized {RBFN}s
	and a solution},
  booktitle = ICML,
  year = {1999},
  pages = {162--170},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{GiordanaSaZi94,
  author = {Attilio Giordana and Lorenza Saitta and Floriano Zini},
  title = {Learning disjunctive concepts by means of genetic algorithms},
  booktitle = ICML,
  year = {1994},
  pages = {96--104},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{Giordano94,
  author = {J. Y. Giordano},
  title = {Inference of context-free grammars by enumeration: Structural containment
	as an ordering bias},
  booktitle = ICGI,
  year = {1994},
  volume = {862},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {212--221},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Girju07,
  author = {Girju, Roxana},
  title = {Improving the Interpretation of Noun Phrases with Cross-linguistic
	Information},
  booktitle = ACL,
  year = {2007},
  pages = {568--575},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1072}
}

@INPROCEEDINGS{GGOFBM04,
  author = {Girju, R. and Giuglea, A.M. and Olteanu, M. and Fortu, O. and Bolohan,
	O. and Moldovan, D.},
  title = {Support Vector Machines Applied to the Classification of Semantic
	Relations in Nominalized Noun Phrases},
  booktitle = {HLT-NAACL Workshop on Computational Lexical Semantics},
  year = {2004}
}

@BOOK{Gittins89,
  title = {Multi-armed Bandit Allocation Indices},
  publisher = {Wiley},
  year = {1989},
  author = {J. C. Gittins},
  comment = {``the book'' on allocation indices for bandit problems}
}

@INPROCEEDINGS{GiulianoGl07,
  author = {Giuliano, Claudio and Gliozzo, Alfio},
  title = {Instance Based Lexical Entailment for Ontology Population},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {248--256},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1026}
}

@ARTICLE{Glasserman91,
  author = {Paul Glasserman},
  title = {Structural Conditions for Pertubation Analysis of Queuing Systems},
  journal = jacm,
  year = {1991},
  volume = {38},
  pages = {1005-1025},
  number = {4},
  month = oct,
  keywords = {Performance Analysis; Design; Performance; Theory; gradient estimation;
	networks of queues; perturbation analysis; sensitivity analysis;
	simulation; }
}

@ARTICLE{Gleitman90,
  author = {L. R. Gleitman},
  title = {The structural sources of verb meanings},
  journal = {Language Acquisition},
  year = {1990},
  volume = {1},
  pages = {3-55}
}

@ARTICLE{GGMO96,
  author = {L. R. Gleitman and H. Gleitman and C. Miller and R. Ostrin},
  title = {Similar, and similar predicates},
  journal = {Cognition},
  year = {1996},
  volume = {58},
  pages = {321-376}
}

@INPROCEEDINGS{GlickmanDaKo05,
  author = {O. Glickman and I. Dagan and M. Koppel},
  title = {A Probabilistic Classification Approach for Lexical Textual Entailment},
  booktitle = AAAI,
  year = {2005}
}

@INPROCEEDINGS{GKCC07,
  author = {A. Globerson and T. Koo and X. Carreras and M. Collins},
  title = {Exponentiated gradient algorithms for log-linear structured prediction},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {305--312},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@ARTICLE{GJLS97,
  author = {C. Globig and K. P. Jantke and S. Lange and Y. Sakakibara},
  title = {On Case-Based Learnabilty of Languages},
  journal = {New Generation Computing},
  year = {1997},
  volume = {15},
  pages = {59--85},
  number = {1},
  note = {Special issue for AII '94 and ALT '94}
}

@INPROCEEDINGS{GlobigLa94,
  author = {C. Globig and S. Lange},
  title = {On Case-Based Representability and Learnability of Languages},
  booktitle = FOCS,
  year = {1994},
  volume = {872},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {106--120},
  publisher = {Springer--Verlag}
}

@INCOLLECTION{GlobigWe95,
  author = {Christoph Globig and Stefan Wess},
  title = {Learning in Case-Based Classification Algorithms},
  booktitle = {Algorithmic Learning for Knowledge-Based Systems},
  publisher = {Springer--Verlag},
  year = {1995},
  volume = {961},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {340--362}
}

@INPROCEEDINGS{GoelInVa01,
  author = {A. Goel and P. Indyk and K. R. Varadarajan},
  title = {Reductions among high dimensional proximity problems},
  booktitle = SODA,
  year = {2001},
  pages = {769-778},
  url = {http://pollux.usc.edu/~agoel/papers/reductions.ps}
}

@ARTICLE{GoemansWi95,
  author = {M. X. Goemans and D. P. Williamson},
  title = {Improved Approximation Algorithms for Maximum Cut and Satisfiability
	Problems Using Semidefinite Programming},
  journal = JACM,
  year = {1995},
  volume = {42},
  pages = {1115--1145},
  number = {6},
  month = nov,
  area = {Complexity of Algorithms}
}

@TECHREPORT{Goetsch86,
  author = {Goetsch, Gordon J.},
  title = {CONSENSUS: A Statistical Learning Procedure in a Connectionist Network},
  institution = {Carnegie-Mellon Computer Science Department},
  year = {1986},
  number = {CMU-CS-86-131},
  month = May,
  comment = {Layered network built out of communities of units, each with a supervisor.}
}

@INPROCEEDINGS{GoetzKuMi96,
  author = {Patrick Goetz and Shailesh Kumar and Risto Miikkulainen},
  title = {On-line adaptation of a signal predistorter through dual reinforcement
	learning},
  booktitle = ICML,
  year = {1996},
  pages = {175--181},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{Goguen92,
  author = {Joseph A. Goguen and Rod M. Burstall},
  title = {Institutions: Abstract Model Theory for Specification and Programming},
  journal = jacm,
  year = {1992},
  volume = {39},
  pages = {95-146},
  number = {1},
  month = jan,
  keywords = {Programming Languages and Methodology; Language; Theory; }
}

@INPROCEEDINGS{Golan88,
  author = {Igal Golan and Shalom Lappin and Mori Rimon},
  title = {An active bilingual lexicon for machine translation},
  booktitle = COLING,
  year = {1988},
  pages = {205--211}
}

@INPROCEEDINGS{GolanLaRi88,
  author = {Igal Golan and Shalom Lappin and Mori Rimon},
  title = {An active bilingual lexicon for machine translation},
  booktitle = COLING,
  year = {1988},
  pages = {205--211}
}

@ARTICLE{Gold78,
  author = {Gold, E. Mark},
  title = {Complexity of Automaton Identification from Given Data},
  journal = {Information and Control},
  year = {1978},
  volume = {37},
  pages = {302--320},
  comment = {Proves that finding an automaton of $n$ or fewer states which agrees
	with a given list of input/output pairs.}
}

@ARTICLE{Gold72,
  author = {Gold, E. Mark},
  title = {System Identification via State Characterization},
  journal = {Automatica},
  year = {1972},
  volume = {8},
  pages = {621--636}
}

@ARTICLE{Gold71,
  author = {E. M. Gold},
  title = {Universal Goal Seekers},
  journal = {Inform. Control},
  year = {1971},
  volume = {18},
  pages = {395--403}
}

@ARTICLE{Gold67,
  author = {Gold, E. Mark},
  title = {Language Identification in the Limit},
  journal = InfCtrl,
  year = {1967},
  volume = {10},
  pages = {447--474},
  comment = {Classic paper, introducing computer science theory into learning.}
}

@ARTICLE{Gold65,
  author = {E. M. Gold},
  title = {Limiting Recursion},
  journal = {J. Symbolic Logic},
  year = {1965},
  volume = {30},
  pages = {28--48}
}

@PHDTHESIS{Gold65a,
  author = {M. Gold},
  title = {Models of Goal Seeking and Learning},
  school = {University of California, Los Angeles},
  year = {1965}
}

@INCOLLECTION{Goldammer95,
  author = {Ulf Goldammer},
  title = {Inductive Synthesis of Rewrite Programs},
  booktitle = {Algorithmic Learning for Knowledge-Based Systems},
  publisher = {Springer--Verlag},
  year = {1995},
  volume = {961},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {435--466}
}

@ARTICLE{GoldbergTa89,
  author = {Andrew V. Goldberg and Robert E. Tarjan},
  title = {Finding Minimum-Cost Circulations by Canceling Negative Cycles},
  journal = jacm,
  year = {1989},
  volume = {36},
  pages = {873-886},
  number = {4},
  month = oct,
  keywords = {Operations Research; Algorithms; Theory; cycle canceling; dynamic
	tree; minimum-cost flow; network optimization; transportation problem;
	transshipment problem; }
}

@ARTICLE{Goldberg90,
  author = {David E. Goldberg},
  title = {Probability Matching, the Magnitude of Reinforcement, and Classifier
	System Bidding},
  journal = {Machine Learning},
  year = {1990},
  volume = {5},
  pages = {407--425},
  publisher = {Kluwer Academic Publishers, Boston}
}

@BOOK{Goldberg89,
  title = {Genetic Algorithms in Search, Optimization, and Machine Learning},
  publisher = {Addison-Wesley},
  year = {1989},
  author = {D. E. Goldberg}
}

@ARTICLE{GoldbergHo88,
  author = {D. E. Goldberg and J. H. Holland},
  title = {Genetic Algorithms and Machine Learning},
  journal = {Machine Learning},
  year = {1988},
  volume = {3},
  pages = {95--99},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{GoldbergHo88a,
  author = {D. E. Goldberg and J. H. Holland},
  title = {Special Issue on Genetic Algorithms},
  journal = {Machine Learning},
  year = {1988},
  volume = {3},
  number = {2/3},
  month = Oct,
  publisher = {Kluwer Academic Publishers}
}

@INPROCEEDINGS{GoldbergCh01,
  author = {K.~Goldberg and B.~Chen},
  title = {Collaborative control of robot motion: Robustness to error},
  booktitle = {International Conference Intelligent Robots},
  year = {2001},
  url = {http://www.ieor.berkeley.edu/~goldberg/pubs/robust-iros01.pdf}
}

@INPROCEEDINGS{GCSBFHPS01,
  author = {K.~Goldberg and B.~Chen and R.~Solomon and S.~Bui and B.~Farzin and
	J.~Heitler and D.~Poon and G.~Smith},
  title = {Collaborative teleoperation via the internet},
  booktitle = {ICRA},
  year = {2001},
  url = {http://www.ieor.berkeley.edu/~goldberg/pubs/ctoi.pdf}
}

@INPROCEEDINGS{GSKPLHSHPD02,
  author = {K.~Goldberg and D.~Song and Y.~Khor and D.~Pescovitz and A.~Levandowski
	and J.~Himmelstein and J.~Shih and A.~Ho and E.~Paulos and J.~Donath},
  title = {Collaborative online teleoperation with spatial dynamic voting and
	a human ``tele-actor''},
  booktitle = {ICRA},
  year = {2002},
  url = {http://ford.ieor.berkeley.edu:8000/papers/paper?paper_id=7}
}

@INPROCEEDINGS{GoldbergHaWi96,
  author = {Leslie Ann Goldberg and William E. Hart and David Bruce Wilson},
  title = {Analysis of a simple learning algorithm: learning foraging thresholds
	for lizards},
  booktitle = COLT,
  year = {1996},
  pages = {2--9},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{GoldbergKw00,
  author = {Paul Goldberg and Stephen Kwek},
  title = {The Precision of Query Points as a Resource for Learning Convex Polytopes
	with Membership Queries},
  booktitle = COLT,
  year = {2000},
  pages = {225--235},
  publisher = {Morgan Kaufmann, San Francisco}
}

@INPROCEEDINGS{Goldberg99,
  author = {Paul W. Goldberg},
  title = {Learning fixed-dimension linear thresholds from fragmented data},
  booktitle = COLT,
  year = {1999},
  pages = {88--99},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{GoldbergGo94,
  author = {P. W. Goldberg and S. A. Goldman},
  title = {Learning one-dimensional geometric patterns under one-sided random
	misclassification noise},
  booktitle = COLT,
  year = {1994},
  pages = {246--255},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{GoldbergGoMa94,
  author = {P. W. Goldberg and S. A. Goldman and H. D. Mathais},
  title = {Learning unions of boxes with membership and equivalence queries},
  booktitle = COLT,
  year = {1994},
  pages = {198--207},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{GoldbergGoSc96,
  author = {Paul W. Goldberg and Sally A. Goldman and Stephen D. Scott},
  title = {{PAC} Learning of One-Dimensional Patterns},
  journal = {Machine Learning},
  year = {1996},
  volume = {25},
  pages = {51--70},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{GoldbergJe95,
  author = {Paul W. Goldberg and Mark R. Jerrum},
  title = {Bounding the {V}apnik-{C}hervonenkis dimension of concept classes
	parametrized by real numbers},
  journal = {Machine Learning},
  year = {1995},
  volume = {18},
  pages = {131--148},
  number = {2/3},
  annote = {Earlier version in sixth COLT, 1993},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{GoldbergEl07,
  author = {Goldberg, Yoav and Elhadad, Michael},
  title = {SVM Model Tampering and Anchored Learning: A Case Study in Hebrew
	NP Chunking},
  booktitle = ACL,
  year = {2007},
  pages = {224--231},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1029}
}

@INPROCEEDINGS{Golding95,
  author = {A. R. Golding},
  title = {A {B}ayesian hybrid method for context-sensitive spelling correction},
  booktitle = {ACL - Workshop on Very Large Corpora},
  year = {1995},
  comment = {good description of other techniques for context-sensitive spell ing}
}

@INPROCEEDINGS{GoldingSc96,
  author = {A. R. Golding and Y. Schabes},
  title = {Combining trigram-based and feature-based methods for context-sensitive
	spelling correction},
  booktitle = ACL,
  year = {1996},
  address = {Santa Cruz, CA}
}

@PHDTHESIS{Goldman90,
  author = {Goldman, Sally},
  title = {Learning Binary Relations, Total Orders, and Read-Once Formulas},
  school = {MIT Dept.\ of Electrical Engineering and Computer Science},
  year = {1990},
  month = Sep
}

@MASTERSTHESIS{Goldman87,
  author = {Sally A. Goldman},
  title = {Efficient Methods for Calculating Maximum Entropy Distributions},
  school = {MIT EECS Department},
  year = {1987},
  month = May
}

@ARTICLE{GoldmanKe95,
  author = {Sally A. Goldman and Michael J. Kearns},
  title = {On the complexity of teaching},
  journal = {J. of Comput. Syst. Sci.},
  year = {1995},
  volume = {50},
  pages = {20--31},
  number = {1},
  note = {Earlier version in 4th COLT, 1991}
}

@INPROCEEDINGS{GoldmanKe91,
  author = {Goldman, Sally A. and Kearns, Michael J.},
  title = {On the Complexity of teaching},
  booktitle = COLT,
  year = {1991},
  pages = {303--314},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{GoldmanKeSc93,
  author = {S. A. Goldman and M. J. Kearns and R. E. Schapire},
  title = {Exact identification of circuits using fixed points of amplification
	functions},
  journal = {SIAM J. Comput.},
  year = {1993},
  volume = {22},
  pages = {705--726},
  number = {4},
  month = aug,
  annote = {Earlier version in FOCS90}
}

@INPROCEEDINGS{GoldmanKeSc90,
  author = {Goldman, Sally A. and Kearns, Michael J. and Schapire, Robert E.},
  title = {Exact Identification of Circuits Using Fixed Points of Amplification
	Functions},
  booktitle = FOCS,
  year = {1990},
  pages = {193--202},
  month = Oct,
  publisher = {IEEE},
  tag = {TOC-display}
}

@INPROCEEDINGS{GoldmanKeSc90a,
  author = {S. A. Goldman and M. J. Kearns and R. E. Schapire},
  title = {On the sample complexity of weak learning},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1990},
  pages = {217--231},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann},
  note = {To appear, {\em Information and Computation}}
}

@INPROCEEDINGS{GoldmanKw99,
  author = {Sally A. Goldman and Stephen S. Kwek},
  title = {On Learning Unions of Pattern Languages and Tree Patterns},
  booktitle = ALT,
  year = {1999},
  volume = {1720},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {347--363},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{GoldmanKwSc97,
  author = {Sally A. Goldman and Stephen S. Kwek and Stephen D. Scott},
  title = {Agnostic learning of geometric patterns},
  booktitle = COLT,
  year = {1997},
  pages = {325--333},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{GoldmanKwSc97a,
  author = {Sally A. Goldman and Stephen S. Kwek and Stephen D. Scott},
  title = {Learning From Examples With Unspecified Attribute Values},
  booktitle = COLT,
  year = {1997},
  pages = {231--242},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{GoldmanMa96,
  author = {Sally A. Goldman and H. David Mathias},
  title = {Teaching a smarter learner},
  journal = {J. of Comput. Syst. Sci.},
  year = {1996},
  volume = {52},
  pages = {255--267},
  number = {2},
  note = {Earlier version in 6th COLT, 1993}
}

@INPROCEEDINGS{GoldmanMa92,
  author = {S. A. Goldman and H. D. Mathias},
  title = {Learning k-term {DNF} formulas with an incomplete membership oracle},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1992},
  pages = {77--84},
  publisher = {ACM Press, New York, NY}
}

@INCOLLECTION{GoldmanRi88,
  author = {Sally A. Goldman and Ronald L. Rivest},
  title = {Making Maximum Entropy Computations Easier by Adding Extra Constraints
	(Extended Abstract)},
  booktitle = {Maximum--Entropy and Bayesian Methods in Science and Engineering},
  publisher = {Kluwer Academic Publishers},
  year = {1988},
  editor = {G. J. Erickson and C. R. Smith},
  volume = {2},
  pages = {323--340}
}

@INCOLLECTION{GoldmanRi88a,
  author = {S. A. Goldman and R. L. Rivest},
  title = {A Non--Iterative Maximum Entropy Algorithm},
  booktitle = UAI,
  publisher = {Elsevier Science B.V. North-Holland},
  year = {1988},
  volume = {2},
  pages = {133--148}
}

@ARTICLE{GoldmanRiSc93,
  author = {S. A. Goldman and R. L. Rivest and R. E. Schapire},
  title = {Learning binary relations and total orders},
  journal = {SIAM J. Comput.},
  year = {1993},
  volume = {22},
  pages = {1006--1034},
  number = {5},
  month = oct,
  annote = {Earlier version in FOCS89}
}

@ARTICLE{GoldmanSc99,
  author = {Sally A. Goldman and Stephen D. Scott},
  title = {A Theoretical and Empirical Study of a Noise-Tolerant Algorithm to
	Learn Geometric Patterns},
  journal = {Machine Learning},
  year = {1999},
  volume = {37},
  pages = {5--49},
  number = {1},
  comment = {first in 13th ICML '96},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{GoldmanSl95,
  author = {S. A. Goldman and R. H. Sloan},
  title = {Can {PAC} Learning Algorithms Tolerate Random Attribute Noise?},
  journal = algor,
  year = {1995},
  volume = {14},
  pages = {70--84},
  number = {1},
  month = jul
}

@ARTICLE{GoldmanSl94,
  author = {S. A. Goldman and R. H. Sloan},
  title = {The Power of Self-Directed Learning},
  journal = {Machine Learning},
  year = {1994},
  volume = {14},
  pages = {271--294},
  number = {3},
  annote = {Was WUCS-92-49},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{GoldmanWa95,
  author = {Sally A. Goldman and Manfred K. Warmuth},
  title = {Learning binary relations using weighted majority voting},
  journal = {Machine Learning},
  year = {1995},
  volume = {20},
  pages = {245--271},
  number = {3},
  note = {Earlier version in 6th COLT, 1993},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{GoldmanRiSc89,
  author = {Goldman, Sally and Ronald L. Rivest and Robert E. Schapire},
  title = {Learning Binary Relations and Total Orders},
  booktitle = FOCS,
  year = {1989},
  pages = {46--51},
  address = {Research Triangle Park, NC},
  month = Oct,
  publisher = {IEEE Computer Society Press},
  tag = {TOC-display}
}

@TECHREPORT{GoldmanSl91,
  author = {Goldman, Sally and Sloan, Robert},
  title = {The Difficulty of Random Attribute Noise},
  institution = {Washington University Department of Computer Science},
  year = {1991},
  number = {WUCS-91-92},
  month = Jun
}

@INPROCEEDINGS{GoldmanWa93,
  author = {S.~Goldman and M.~Warmuth},
  title = {Learning binary relations using weighted majority voting},
  booktitle = COLT,
  year = {1993},
  pages = {453--462},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{GoldreichGoMi86,
  author = {Goldreich, Oded and Shafi Goldwasser and Silvio Micali},
  title = {How to Construct Random Functions},
  journal = {Journal of the ACM},
  year = {1986},
  volume = {33},
  pages = {792--807},
  number = {4},
  month = Oct
}

@ARTICLE{Goldreich91,
  author = {Oded Goldreich and Silvio Micali and Avi Wigderson},
  title = {Proofs that Yield Nothing But Their Validity or All Languages in
	{NP} Have Zero-Knowledge Proof Systems},
  journal = jacm,
  year = {1991},
  volume = {38},
  pages = {691-729},
  number = {3},
  month = jul,
  keywords = {Theory of Computation; Design; Security; Theory; Verification; cryptographic
	protocols; fault-tolerant distributed computing; graph isomorphism;
	interactive proofs; methodological design of protocols; NP; one-way
	functions; proof systems; zero-knowledge; }
}

@INPROCEEDINGS{GoldreichRuSu95,
  author = {Oded Goldreich and Ronitt Rubinfeld and Madhu Sudan},
  title = {Learning polynomials with queries: the highly noisy case},
  booktitle = FOCS,
  year = {1995},
  pages = {294--303},
  publisher = {IEEE Computer Society Press, Los Alamitos, CA}
}

@INPROCEEDINGS{GSST00,
  author = {Judy Goldsmith and Robert H. Sloan and B. Sz{\"o}r{\'e}nyi and G.
	Tur{\'a}n},
  title = {Improved Algorithms for Theory Revision with Queries},
  booktitle = COLT,
  year = {2000},
  pages = {236--247},
  publisher = {Morgan Kaufmann, San Francisco}
}

@INPROCEEDINGS{GoldwaterGr07,
  author = {Goldwater, Sharon and Griffiths, Tom},
  title = {A fully Bayesian approach to unsupervised part-of-speech tagging},
  booktitle = ACL,
  year = {2007},
  pages = {744--751},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1094}
}

@INBOOK{Golea97,
  chapter = {14},
  pages = {227--243},
  title = {On learning the neural network architecture: a case study},
  publisher = {MIT Press},
  year = {1997},
  author = {Mostefa Golea},
  volume = {IV: Making Learning Systems Practical},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@INPROCEEDINGS{Golea95,
  author = {Mostefa Golea},
  title = {Average case analysis of a learning algorithm for {$\mu$-DNF} expressions},
  booktitle = EuroCOLT,
  year = {1995},
  pages = {342--356},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{GoleaMa94,
  author = {M. Golea and M. Marchand},
  title = {On Learning Simple Deterministic and Probabilistic Neural Concepts},
  booktitle = EuroCOLT,
  year = {1994},
  volume = {New Series Number 53},
  series = {The Institute of Mathematics and its Applications Conference Series},
  pages = {47--60},
  address = {Oxford},
  publisher = {Oxford University Press},
  isbn = {0 19 853492 2}
}

@INPROCEEDINGS{GoleaMa93,
  author = {M. Golea and M. Marchand},
  title = {Average case analysis of the clipped {H}ebb rule for nonoverlapping
	perceptron networks},
  booktitle = COLT,
  year = {1993},
  pages = {151--157},
  publisher = {ACM Press, New York, NY}
}

@BOOK{GolesMa90,
  title = {Neural and automata networks},
  publisher = {Kluwer academic publishers},
  year = {1990},
  author = {Goles, E. and Martinez, S.},
  comment = {QA267.5.c45g65, Cabot}
}

@ARTICLE{GRSS95,
  author = {M. Golin and R. Raman and C. Schwarz and M. Smid},
  title = {Simple randomized algorithms for closest pair problems},
  journal = {Nordic J. Comput.},
  year = {1995},
  volume = {2},
  pages = {3--27}
}

@BOOK{GolubLo96,
  title = {Matrix computations},
  publisher = {Johns Hopkins University Press},
  year = {1996},
  author = {G. H. Golub and C. F. van Loan},
  address = {Baltimore, MD},
  edition = {3nd}
}

@INPROCEEDINGS{CookHo02,
  author = {J. Gonzalez and L.B. Holder and D.J. Cook},
  title = {Graph-Based Relational Concept Learning},
  booktitle = ICML,
  year = {2002}
}

@ARTICLE{GonzalezEdTh76,
  author = {R. C. Gonzalez and J. J. Edwards and M. G. Thomason},
  title = {An algorithm for the inference of tree grammars},
  journal = {Internat. J. Comput. Info. Sci.},
  year = {1976},
  volume = {5},
  pages = {145--164},
  number = {2}
}

@BOOK{GonzalezTh78,
  title = {Syntactic Pattern Recognition, An Introduction},
  publisher = {Addison-Wesley, Reading, Mass.},
  year = {1978},
  author = {R. C. Gonzalez and M. G. Thomason}
}

@ARTICLE{Gonzalez85,
  author = {T. Gonzalez},
  title = {Clustering to minimize the maximum intercluster distance},
  journal = {Theoret. Comput. Sci.},
  year = {1985},
  volume = {38},
  pages = {293--306}
}

@ARTICLE{Good66,
  author = {Good, I.J.},
  title = {A Derivation of the Probabilistic Explication of Information},
  journal = {Journal of the Royal Statistical Society (Series B)},
  year = {1966},
  volume = {28},
  pages = {578--581},
  comment = {Argues from an axiomatic framework that I(H:E|G), the information
	concerning H provided by E given G, should be log( P(H.E|G) / (P(H|G)P(E|G))
	) or some monotonic variation of this.}
}

@ARTICLE{Good63,
  author = {Good, I.J.},
  title = {Maximum entropy for hypothesis formulation, especially for multidimensional
	contingency tables},
  journal = {Annals of Mathematical Statistics},
  year = {1963},
  volume = {34},
  pages = {911-934},
  comment = {Uses maximum entropy to judge order of interactions, and the order
	of a Markov chain.}
}

@INPROCEEDINGS{Good70,
  author = {Good, I. J.},
  title = {The Probabilistic Explication of Information, Evidence, Surprise,
	Causality, Explanation, and Utility},
  booktitle = {Foundations of Statistical Inference},
  year = {1971},
  editor = {V. P. Godame and D. A. Sprott},
  pages = {108--141},
  publisher = {Holt, Reinhart, and Winston}
}

@ARTICLE{Good59,
  author = {Good, I. J.},
  title = {Kinds of Probability},
  journal = {Science},
  year = {1959},
  volume = {129},
  pages = {443--447},
  number = {3347},
  month = Feb
}

@ARTICLE{Good53,
  author = {I. J. Good},
  title = {The population frequencies of species and the estimation of population
	parameters},
  journal = {Biometrika},
  year = {1953},
  volume = {40},
  pages = {237--264}
}

@INPROCEEDINGS{GordonSw07,
  author = {Gordon, Andrew and Swanson, Reid},
  title = {Generalizing semantic role annotations across syntactically similar
	verbs},
  booktitle = ACL,
  year = {2007},
  pages = {192--199},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1025}
}

@INPROCEEDINGS{Gordon98,
  author = {Diana F. Gordon},
  title = {Well-behaved {B}orgs, {B}olos, and {B}erserkers},
  booktitle = ICML,
  year = {1998},
  pages = {224--232},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{Gordon99,
  author = {Geoffrey J. Gordon},
  title = {Regret bounds for prediction problems},
  booktitle = COLT,
  year = {1999},
  pages = {29--40},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{Gordon95,
  author = {Geoffrey J. Gordon},
  title = {Stable function approximation in dynamic programming},
  booktitle = ICML,
  year = {1995},
  pages = {261--268},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{GordonSe96,
  author = {Geoffrey J. Gordon and Alberto Maria Segre},
  title = {Nonparametric statistical methods for experimental evaluations of
	speedup learning},
  booktitle = ICML,
  year = {1996},
  pages = {200--206},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{GordonSh85,
  author = {J. Gordon and E. H. Shortliffe},
  title = {A Method for Managing Evidential Reasoning in a Hierarchical Hypothesis
	Space},
  journal = {Artificial Intelligence},
  year = {1985},
  volume = {26},
  pages = {323--357},
  number = {3},
  month = jul,
  comment = {Dempster-Shafer theory explained and generalized.}
}

@MISC{GordonLoLuRi,
  author = {Lawrence A. Gordon and Martin P. Loeb and William Lucyshyn and Robert
	Richardson},
  title = {{CSI/FBI} Computer Crime and Security Survey 2006},
  howpublished = {Computer Security Institute Publications}
}

@ARTICLE{GoriTe92,
  author = {Marco Gori and Alberto Tesi},
  title = {On the Problem of Local Minima in Backpropagation},
  journal = {IEEE Transaction on Pattern Analysis and Machine Intelligence},
  year = {1992},
  volume = {14},
  pages = {76--86},
  number = {1},
  abstract = {Supervised Learning in Multi-Layered Neural Networks (MLNs) has been
	recently proposed through the well-known Backpropagation algorithm.
	This is a gradient method which can get stuck in local minima, as
	simple examples can show. In this paper, some conditions on the network
	architecture and the learning environment are proposed which ensure
	the convergence of the Backpropagation algorithm. It is proven in
	particular that the convergence holds if the classes are linearly-separable.
	In this case, the experience gained in several experiments shows
	that $MLNs$ exceed perceptrons in generalization to new examples.},
  keywords = {Multi-Layered Networks, learning environment, Backpropagation, pattern
	recognition, linearly-separable classes}
}

@ARTICLE{GormanSe88,
  author = {R. P. Gorman and T. J. Sejnowski},
  title = {Analysis of Hidden Units in a Layered Network Trained to Classify
	Sonar Targets},
  journal = {Neural Networks},
  year = {1988},
  volume = {1},
  pages = {75--89}
}

@INPROCEEDINGS{GottschalkLiMa96,
  author = {S. Gottschalk AND M. C. Lin and D. Manocha},
  title = {{OBB}-tree: A hierarchical structure for rapid interference detection},
  booktitle = {SIGGRAPH},
  year = {1996},
  pages = {171-180}
}

@INPROCEEDINGS{Grabowski86,
  author = {J. Grabowski},
  title = {Inductive Inference of Functions From Noised Observations},
  booktitle = {International Workshop on Analogical and Inductive Inference},
  year = {1986},
  volume = {265},
  series = {Lecture Notes in Computer Science},
  pages = {55--60},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{GracaGaTa07,
  author = {Graca, J. V. and Ganchev, K. and Taskar, B. },
  title = {Expectation Maximization and Posterior Constraints},
  booktitle = NIPS,
  year = {2007},
  volume = {20},
  citeulike-article-id = {3152619},
  keywords = {em, nips, semi-supervised},
  posted-at = {2008-08-25 04:24:56},
  priority = {4}
}

@BOOK{GradshteynRy80,
  title = {Table of Integrals, Series, and Products},
  publisher = {Academic Press},
  year = {1980},
  author = {I. S. Gradshteyn and I. M. Ryzhik}
}

@INPROCEEDINGS{GraepelHeSh00,
  author = {T. Graepel and R. Herbrich and J.Shawe-Taylor},
  title = {Generalisation Error Bounds for Sparse Linear Classifiers},
  booktitle = COLT,
  year = {2000},
  pages = {298--303},
  publisher = {Morgan Kaufmann, San Francisco}
}

@INPROCEEDINGS{GrafSaTs89,
  author = {H. P. Graf and S. Satyanarayana and Y. Tsividis},
  title = {A Reconfigurable Analog ({VLSI} Neural Network Chip},
  booktitle = NIPS,
  year = {1989},
  pages = {758--768}
}

@ARTICLE{Graham90,
  author = {Marc H. Graham and Ke Wang},
  title = {On the Equivalence of an Egd to a Set of Fd's},
  journal = jacm,
  year = {1990},
  volume = {37},
  pages = {474-490},
  number = {3},
  month = jul,
  keywords = {Database Theory; Languages; Theory; data dependencies; database theory;
	weak instances; }
}

@INPROCEEDINGS{GHHMNH94,
  author = {L. Grate and M. Herbster and R. Hughey and I. S. Mian and H. Noller
	and D. Haussler},
  title = {{RNA} Modeling Using {Gibbs} Sampling and Stochastic Context Free
	Grammars},
  booktitle = {International Conference on Intelligent Systems for Molecular},
  year = {1994},
  pages = {138--146},
  address = {Menlo Park, CA},
  month = aug,
  publisher = {AAAI/MIT Press}
}

@INPROCEEDINGS{GBCHW07,
  author = {Gravano, Agustin and Benus, Stefan and Chavez, Hector and Hirschberg,
	Julia and Wilcox, Lauren},
  title = {On the role of context and prosody in the interpretation of 'okay'},
  booktitle = ACL,
  year = {2007},
  pages = {800--807},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1101}
}

@INPROCEEDINGS{GreenPeDoRe01,
  author = {R. Green and L. Pearl and B. J. Dorr and P. Resnik},
  title = {Lexical Resource Integration Across the Syntax-Semantics Interface},
  booktitle = {NAACL - WordNet and Other Lexical Resources Workshop},
  year = {2001},
  address = {Pittsburg},
  month = {June}
}

@ARTICLE{Greenberg92,
  author = {Albert G. Greenberg and Neal Madras},
  title = {How Fair is Fair Queuing},
  journal = jacm,
  year = {1992},
  volume = {39},
  pages = {568-598},
  number = {3},
  month = jul,
  keywords = {System Modeling and Analysis; Design; Management; Performance; Theory;
	Verification; }
}

@INPROCEEDINGS{GreenePaYa94,
  author = {D. Greene and M. Parnas and F. Yao},
  title = {Multi-index hashing for information retrieval},
  booktitle = FOCS,
  year = {1994},
  pages = {722--731}
}

@INPROCEEDINGS{GreeneYa86,
  author = {D. H. Greene and F. F. Yao},
  title = {Finite-resolution computational geometry},
  booktitle = FOCS,
  year = {1986},
  pages = {143--152}
}

@ARTICLE{GreeneSm93,
  author = {David Perry Greene and Stephen F. Smith},
  title = {Competition-Based Induction of Decision Models from Examples},
  journal = {Machine Learning},
  year = {1993},
  volume = {13},
  pages = {229--257},
  publisher = {Kluwer Academic Publishers, Boston}
}

@BOOK{Greengard88,
  title = {The rapid evaluation of potential fields in particle systems},
  publisher = {MIT Press},
  year = {1988},
  author = {L. Greengard},
  address = {Cambridge}
}

@INPROCEEDINGS{GrefenstetteTe95,
  author = {G. Grefenstette and S. Teufel},
  title = {Corpus-based method for automatic identification of support verbs
	for nominalizations},
  booktitle = EACL,
  year = {1995},
  pages = {27--31}
}

@INPROCEEDINGS{Grefenstette93,
  author = {J. Grefenstette},
  title = {Genetic algorithms and machine learning},
  booktitle = COLT,
  year = {1993},
  pages = {3--4},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{Grefenstette88,
  author = {John J. Grefenstette},
  title = {Credit Assignment in Rule Discovery Systems Based on Genetic Algorithms},
  journal = {Machine Learning},
  year = {1988},
  volume = {3},
  pages = {225--245},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{GrefenstetteRaSc90,
  author = {John J. Grefenstette and Connie Loggia Ramsey and Alan C. Schultz},
  title = {Learning Sequential Decision Rules Using Simulation Models and Competition},
  journal = {Machine Learning},
  year = {1990},
  volume = {5},
  pages = {355--381},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{Greffenstette93,
  author = {G. Greffenstette},
  title = {Evaluation techniques for automatic semantic extraction: comparing
	semantic and window based approaches},
  booktitle = {ACL workshop on the Acquisition of Lexical Knowledge from Text},
  year = {1993}
}

@ARTICLE{Gregor94,
  author = {J. Gregor},
  title = {Data-driven inductive inference of finite-state automata},
  journal = {International Journal of Pattern Recognition and Artificial Intelligence},
  year = {1994},
  volume = {8},
  pages = {305--322},
  number = {1}
}

@ARTICLE{Greiner96,
  author = {Russell Greiner},
  title = {{PALO}: {A} probabilistic hill-climbing algorithm},
  journal = {Artificial Intelligence},
  year = {1996},
  volume = {83},
  number = {1--2},
  month = jul,
  publisher = {Elsevier}
}

@INPROCEEDINGS{Greiner95,
  author = {Russell Greiner},
  title = {The challenge of revising an impure theory},
  booktitle = ICML,
  year = {1995},
  pages = {269--277},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{Greiner95a,
  author = {Russell Greiner},
  title = {The Complexity of Theory Revision},
  booktitle = IJCAI,
  year = {1995},
  addres = {Montreal}
}

@INPROCEEDINGS{Greiner92,
  author = {Russell Greiner},
  title = {Probabilistic Hill-Climbing: Theory and Applications},
  booktitle = {Canadian Conference on Artificial Intelligence},
  year = {1992},
  pages = {60--67},
  address = {Vancouver},
  month = jun,
  publisher = {Morgan Kaufmann},
  note = {(Awarded ``AIJ Best Paper Prize'')}
}

@INPROCEEDINGS{GreinerGrKo96,
  author = {Russell Greiner and Adam J. Grove and Alexander Kogan},
  title = {Exploiting the omission of irrelevant data},
  booktitle = ICML,
  year = {1996},
  pages = {216--224},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{GreinerIs96,
  author = {Russell Greiner and Ramana Isukapalli},
  title = {Learning to Select Useful Landmarks},
  journal = {IEEE Transactions on Systems, Man and Cybernetics, Part B},
  year = {1996},
  volume = {26},
  number = {3},
  month = JUN,
  note = {Special issue on Learning Approaches to Autonomous Robots Control
	(ed., Marco Dorigo). Prior version in AAAI-94}
}

@INPROCEEDINGS{GreinerJu92,
  author = {Russell Greiner and Igor Juri\v{s}ica},
  title = {A Statistical Approach to Solving the {EBL} Utility Problem},
  booktitle = AAAI,
  year = {1992},
  address = {San Jose}
}

@INPROCEEDINGS{GreinerOr91,
  author = {Russell Greiner and Pekka Orponen},
  title = {Probably Approximately Optimal Derivation Strategies},
  booktitle = {International Joint Conference on Knowledge Representation},
  year = {1991},
  editor = {J. A.~Allen and R.~Fikes and E.~Sandewall},
  address = {Rochester, NJ},
  month = apr,
  publisher = {Morgan Kaufmann}
}

@ARTICLE{GreinerOr96,
  author = {Russell Greiner and Pekka Orponen},
  title = {Probably Approximately Optimal Satisficing Strategies},
  journal = {Artificial Intelligence},
  year = {1996},
  volume = {82},
  pages = {21--44},
  number = {1--2},
  month = apr
}

@INCOLLECTION{GreinerSc94,
  author = {Russell Greiner and Dale Schuurmans},
  title = {Learning an Optimally Accurate Representation System},
  booktitle = {Foundations of Knowledge Representation and Reasoning},
  publisher = {Springer-Verlanger},
  year = {1994},
  editor = {Gerhard Lakemeyer and Bernard Nebel},
  volume = {810},
  pages = {145--59},
  month = JUN,
  note = {Extended from article in {\em ECAI Workshop on Theoretical Foundations
	of Knowledge Representation and Reasoning}, Vienna, August 1992.}
}

@INPROCEEDINGS{GreinerSc92,
  author = {Russell Greiner and Dale Schuurmans},
  title = {Learning useful {H}orn approximations},
  booktitle = {International Joint Conference on Knowledge Representation},
  year = {1992},
  address = {Cambridge, MA},
  month = oct
}

@ARTICLE{GSBG88,
  author = {R. Greiner and B. Silver and S. Becker and M. Gr{\"u}ninger},
  title = {A Review of Machine Learning at {AAAI}-87},
  journal = {Machine Learning},
  year = {1988},
  volume = {3},
  pages = {79--92},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{GrenagerKlMa05,
  author = {T. Grenager and D. Klein and C. Manning},
  title = {Unsupervised Learning of Field Segmentation Models for Information
	Extraction.},
  booktitle = ACL,
  year = {2005}
}

@BOOK{Grenander81,
  title = {Abstract Inference},
  publisher = {John Wiley and Sons, Inc.},
  year = {1981},
  author = {U. Grenander}
}

@INPROCEEDINGS{Grieser96,
  author = {Gunter Grieser},
  title = {Reflecting inductive inference machines and its improvement by therapy},
  booktitle = ALT,
  year = {1996},
  volume = {1160},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {325--336},
  publisher = {Springer-Verlag}
}

@INCOLLECTION{Grieser95,
  author = {Gunter Grieser},
  title = {{T\kern-.1em\lower.7ex\hbox{L}\kern-.31emP\kern-.1em\raise.4ex\hbox{S}}
	-- a Term Rewriting Laboratory (not only) for Experiments in Automatic
	Program Synthesis},
  booktitle = {Algorithmic Learning for Knowledge-Based Systems},
  publisher = {Springer--Verlag},
  year = {1995},
  volume = {961},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {467--481}
}

@INPROCEEDINGS{GrieserJaLa98,
  author = {Gunter Grieser and Klaus P. Jantke and Steffen Lange},
  title = {Characterizing Sufficient Expertise for Learning System Validation},
  booktitle = FLAIRS,
  year = {1998},
  pages = {452--456},
  publisher = {AAAI Press, Menlo Park}
}

@INPROCEEDINGS{GrieserJaLa98a,
  author = {G. Grieser and K. P. Jantke and S. Lange},
  title = {Towards the Validation of Inductive Learning Systems},
  booktitle = ALT,
  year = {1998},
  volume = {1501},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {409--423},
  publisher = {Springer-Verlag}
}

@ARTICLE{GriffithsStTe07,
  author = {T. Griffiths and M. Steyvers and J. Tenenbaum},
  title = {Topics in Semantic Representation},
  journal = {Psychological Review},
  year = {2007},
  volume = {114},
  pages = {211-244},
  number = {2}
}

@ARTICLE{GriffithsSt04,
  author = {Griffiths, T. L. and Steyvers, M.},
  title = {Finding scientific topics.},
  journal = {Proc Natl Acad Sci U S A},
  year = {2004},
  volume = {101 Suppl 1},
  pages = {5228--5235},
  month = {April},
  address = {Department of Psychology, Stanford University, Stanford, CA 94305,
	USA.},
  citeulike-article-id = {698680},
  doi = {10.1073/pnas.0307752101},
  issn = {0027-8424},
  keywords = {dirichlet, lda, plsa, topic\_models},
  posted-at = {2008-09-11 07:43:06},
  priority = {3},
  url = {http://dx.doi.org/10.1073/pnas.0307752101}
}

@INPROCEEDINGS{GriraHo07,
  author = {N. Grira and M. Houle},
  title = {Best of both: a hybridized centroid-medoid clustering heuristic},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {313--320},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INCOLLECTION{Grishman95,
  author = {R. Grishman},
  title = {The {NYU} system for {MUC-6} or where's syntax?},
  booktitle = MUC,
  publisher = {Morgan Kaufmann Publishers},
  year = {1995},
  editor = {Sundheim, B.}
}

@BOOK{Grishman86,
  title = {Computational Linguistics -- An Introduction},
  publisher = Cambridge,
  year = {1986},
  author = {Ralph Grishman}
}

@ARTICLE{GrishmanHiNh86,
  author = {R. Grishman and L. Hirschman and Ngo Thanh Nhan},
  title = {Discovery procedures for sublanguage selectional patterns -- initial
	experiments},
  journal = CL,
  year = {1986},
  volume = {12},
  pages = {205--214}
}

@ARTICLE{GritzmannKl94,
  author = {P. Gritzmann and V. Klee},
  title = {On the complexity of some basic problems in computational convexity:
	I. Containment problems},
  journal = {Discrete Math.},
  year = {1994},
  volume = {136},
  pages = {129--174}
}

@ARTICLE{GritzmannKl93,
  author = {P. Gritzmann and V. Klee},
  title = {Computational complexity of inner and outer $j$-radii of polytopes
	in finite-dimensional normed spaces},
  journal = {Math. Program.},
  year = {1993},
  volume = {59},
  pages = {163--213}
}

@ARTICLE{GritzmannKl92,
  author = {P. Gritzmann and V. Klee},
  title = {Inner and outer $j$-radii of convex bodies in finite-dimensional
	normed spaces},
  journal = DCG,
  year = {1992},
  volume = {7},
  pages = {255--280}
}

@INPROCEEDINGS{GrolimundGa96,
  author = {Stephan Grolimund and Jean-Gabriel Ganascia},
  title = {Speeding-up nearest neighbour memories: the template tree case memory
	organisation},
  booktitle = ICML,
  year = {1996},
  pages = {225--233},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{GroveHaKo92a,
  author = {Grove, Adam and Joseph Y. Halpern and Daphne Koller},
  title = {Asymptotic conditional probabilities for first-order logic},
  booktitle = STOC,
  year = {1992}
}

@INPROCEEDINGS{GroveHaKo92b,
  author = {Grove, Adam and Joseph Y. Halpern and Daphne Koller},
  title = {Random Worlds and Maximum Entropy},
  booktitle = LICS,
  year = {1992}
}

@INPROCEEDINGS{GroveLiSc97,
  author = {Adam J. Grove and Nick Littlestone and Dale Schuurmans},
  title = {General Convergence Results for Linear Discriminant Updates},
  booktitle = COLT,
  year = {1997},
  pages = {171--183},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{GruberRoWe07,
  author = {Amit Gruber and Michal Rosen-Zvi and Yair Weiss},
  title = {Hidden Topic Markov Model},
  booktitle = AISTAT,
  year = {2007}
}

@INCOLLECTION{Gruber93,
  author = {P. M. Gruber},
  title = {Aspects of approximation of convex bodies},
  booktitle = {Handbook of Convex Geometry},
  publisher = {North-Holland},
  year = {1993},
  editor = {Peter M. Gruber and J. M. Wills},
  volume = {A},
  chapter = {1.10},
  pages = {319--345},
  address = {Amsterdam, Netherlands},
  annote = {584}
}

@ARTICLE{Gruber89,
  author = {Thomas R. Gruber},
  title = {Automated Knowledge Acquisition for Strategic Knowledge},
  journal = {Machine Learning},
  year = {1989},
  volume = {4},
  pages = {293--336},
  publisher = {Kluwer Academic Publishers, Boston}
}

@BOOK{GrotschelLoSc88,
  title = {Geometric Algorithms and Combinatorial Optimization},
  publisher = {Springer-Verlag},
  year = {1988},
  author = {M. Gr{\"o}tschel and L. Lov{\'a}sz and A. Schrijver},
  volume = {2},
  series = {Algorithms and Combinatorics},
  address = {Berlin Heidelberg},
  edition = {2nd},
  note = {2nd edition 1994}
}

@INPROCEEDINGS{Grunwald99,
  author = {Peter Gr{\"u}nwald},
  title = {Viewing all models as `probabilistic'},
  booktitle = COLT,
  year = {1999},
  pages = {171--182},
  publisher = {ACM Press, New York, NY}
}

@INCOLLECTION{Guibas98,
  author = {L. J. Guibas},
  title = {Kinetic data structures --- a state of the art report},
  booktitle = {WAFR},
  publisher = {A. K. Peters},
  year = {1998},
  editor = {P. K. Agarwal and L. E. Kavraki and M. Mason},
  pages = {191--209},
  address = {Wellesley, MA},
  url = {http://graphics.stanford.edu/~guibas/g-kds.ps}
}

@ARTICLE{GuibasHe89,
  author = {L. J. Guibas and J. Hershberger},
  title = {Optimal shortest path queries in a simple polygon},
  journal = {J. Comput. Syst. Sci.},
  year = {1989},
  volume = {39},
  pages = {126--152},
  number = {2},
  month = oct
}

@ARTICLE{GHLST87,
  author = {L. J. Guibas and J. Hershberger and D. Leven and M. Sharir and R.
	E. Tarjan},
  title = {Linear-time algorithms for visibility and shortest path problems
	inside triangulated simple polygons},
  journal = {Algorithmica},
  year = {1987},
  volume = {2},
  pages = {209--233},
  keywords = {polygons, simple, shortest paths, visibility, finger search trees}
}

@ARTICLE{GuibasHeSn91,
  author = {L. J. Guibas and J. Hershberger and J. Snoeyink},
  title = {Compact interval trees: a data structure for convex hulls},
  journal = IJCGA,
  year = {1991},
  volume = {1},
  pages = {1--22},
  number = {1},
  keywords = {data structures, convex hull, lower bounds, common tangents},
  url = {http://portal.acm.org/citation.cfm?id=320195&coll=portal&dl=ACM&CFID=11111111&CFTOKEN=2222222&ret=1#}
}

@INPROCEEDINGS{GuibasRaSt83,
  author = {L. J. Guibas and L. Ramshaw and J. Stolfi.},
  title = {{A kinetic framework for computational geometry}},
  booktitle = FOCS,
  year = {1983},
  pages = {100--111}
}

@ARTICLE{GuibasShSi89,
  author = {L. J. Guibas and M. Sharir and S. Sifrony.},
  title = {{On the general motion-planning problem with two degrees of freedom}},
  journal = DCG,
  year = {1989},
  volume = {4},
  pages = {491--521}
}

@ARTICLE{GuijarroLaRa99,
  author = {D. Guijarro and V. Lavin and V. Raghavan},
  title = {Exact learning when irrelevant variables abound},
  journal = {Inform. Process. Lett.},
  year = {1999},
  volume = {70},
  pages = {233--239},
  number = {5}
}

@INPROCEEDINGS{GuijarroLaRa97,
  author = {David Guijarro and Victor Lavin and Vijay Raghavan},
  title = {Learning monotone term decision lists},
  booktitle = EuroCOLT,
  year = {1997},
  pages = {16--26},
  publisher = {Springer-Verlag}
}

@ARTICLE{GunettiPi05,
  author = {D. Gunetti and C. Picardi},
  title = {Keystroke Analysis of Free Text.},
  journal = {ACM Transactions on Information and System Security},
  year = {2005}
}

@ARTICLE{GKMSTS03,
  author = {D. Gunopulos and R. Khardon and H. Mannila and S. Saluja and H. Toivonen
	and R. Sewak Sharm},
  title = {Discovering all most specific sentences},
  journal = {ACM Trans. Database Syst.},
  year = {2003},
  volume = {28},
  pages = {140-174},
  number = {2}
}

@INPROCEEDINGS{GHFX07,
  author = {F. Guo and S. Hanneke and W. Fu and E. Xing},
  title = {Recovering temporally rewiring networks: a model-based approach},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {321--328},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{GBSW99,
  author = {Ying Guo and Peter L. Bartlett and John Shawe-Taylor and Robert C.
	Williamson},
  title = {Covering numbers for support vector machines},
  booktitle = COLT,
  year = {1999},
  pages = {267--277},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{GuoWaGe07,
  author = {Guo, Yuqing and Wang, Haifeng and van Genabith, Josef},
  title = {Recovering Non-Local Dependencies for {C}hinese},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {257--266},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1027}
}

@ARTICLE{GuptaJaSm99,
  author = {P. Gupta and R. Janardan and M. Smid},
  title = {Efficient algorithms for counting and reporting pairwise intersections
	between convex polygons},
  journal = IPL,
  year = {1999},
  volume = {69},
  pages = {7--13}
}

@INPROCEEDINGS{GuptaDiSa07,
  author = {R. Gupta and A. Diwan and S. Sarawagi},
  title = {Efficient inference with cardinality-based clique potentials},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {329--336},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{GuptaKo04,
  author = {R. Gupta and M. Kochenderfer},
  title = {Common Sense Data Acquisition for Indoor Mobile Robots},
  booktitle = AAAI,
  year = {2004}
}

@ARTICLE{Gupta92,
  author = {V. Gupta and M. Lennig and P. Mermelstein},
  title = {A language model for very large-vocabulary speech recognition},
  journal = CSL,
  year = {1992},
  volume = {6},
  pages = {331--344}
}

@ARTICLE{GuptaLeMe92,
  author = {V. Gupta and M. Lennig and P. Mermelstein},
  title = {A language model for very large-vocabulary speech recognition},
  journal = CSL,
  year = {1992},
  volume = {6},
  pages = {331--344}
}

@ARTICLE{Gurevich90,
  author = {Yuri Gurevich and Saharon Shelah},
  title = {Nondeterministic Linear-Time Tasks May Require Substantially Nonlinear
	Deterministic Time in the Case of Sublinear Work Space},
  journal = jacm,
  year = {1990},
  volume = {37},
  pages = {674-687},
  number = {3},
  month = jul,
  keywords = {Theory of Computation; Algorithms; Performance; clique problem; lower
	bounds; nondeterminism; nonlinear time; time-space trade-off; }
}

@INPROCEEDINGS{GurevychMZe07,
  author = {Gurevych, Iryna and M\"{u}ller, Christof and Zesch, Torsten},
  title = {What to be? - Electronic Career Guidance Based on Semantic Relatedness},
  booktitle = ACL,
  year = {2007},
  pages = {1032--1039},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1130}
}

@INPROCEEDINGS{GuruswamiSa99,
  author = {Venkatesan Guruswami and Amit Sahai},
  title = {Multiclass learning, boosting, and error-correcting codes},
  booktitle = COLT,
  year = {1999},
  pages = {145--155},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{Gurvits97,
  author = {Leonid Gurvits},
  title = {Linear algebraic proofs of {VC}-dimension based inequalities},
  booktitle = EuroCOLT,
  year = {1997},
  pages = {238--250},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Gurvits97a,
  author = {Leonid Gurvits},
  title = {A note on a scale-sensitive dimension of linear bounded functionals
	in {B}anach spaces},
  booktitle = ALT,
  year = {1997},
  volume = {1316},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {352--363},
  publisher = {Springer-Verlag}
}

@ARTICLE{GurvitsKo97,
  author = {Leonid Gurvits and Pascal Koiran},
  title = {Approximation and Learning of Convex Superpositions},
  journal = {J. Comput. Syst. Sci.},
  year = {1997},
  volume = {55},
  pages = {161--170},
  number = {1},
  note = {First appeared in EuroCOLT '95}
}

@INPROCEEDINGS{Guttman84,
  author = {A. Guttman},
  title = {R-Trees: {A} Dynamic Index Structure for Spatial Searching},
  booktitle = {ACM SIGMOD Conference Principles Database System},
  year = {1984},
  pages = {47--57},
  annote = {{564}}
}

@ARTICLE{GuyonEl03,
  author = {Guyon, I. and Elisseeff, A.},
  title = {An introduction to variable and feature selection},
  journal = JMLR,
  year = {2003}
}

@ARTICLE{GuyonEl03a,
  author = {Guyon, Isabelle and Elisseeff, Andr\'{e}},
  title = {An introduction to variable and feature selection},
  journal = {JMLR},
  year = {2003},
  owner = {dxquang},
  publisher = {JMLR.org},
  timestamp = {2010.12.12}
}

@INPROCEEDINGS{GyorgiTi90,
  author = {G{'e}za {Gy\"orgi} and Naftali Tishby},
  title = {Statistical Theory of Learning a Rule},
  booktitle = {STATPHYS Workshop on Neural Networks and Spin Glasses},
  year = {1990},
  editor = {W. K. Theumann and R. {K\"oberle}},
  address = {Singapore, Teaneck NJ, London, Hong Kong},
  publisher = {World Scientific Publishing Co.},
  comment = {Workshop was in 1989}
}

@ARTICLE{Gyorgyi90,
  author = {G. Gyorgyi},
  title = {Inference of a rule by a neural network with thermal noise},
  journal = {Phys. Rev. Lett.},
  year = {1990},
  volume = {64},
  pages = {2957}
}

@ARTICLE{Gyssens89,
  author = {Marc Gyssens and Jan Paredaens and Dirk {Van Gucht}},
  title = {A Uniform Approach toward Handling Atomic and Structured Information
	in the Nested Relational Database Model},
  journal = jacm,
  year = {1989},
  volume = {36},
  pages = {790-825},
  number = {4},
  month = oct,
  keywords = {Database Theory; Design; Languages; Theory; Verification; algebra;
	atomic and nonatomic values; copying; expressiveness; nested and
	flat relations and databases; prime values; relation classes; }
}

@ARTICLE{Gartner95,
  author = {B. G{\"a}rtner},
  title = {A Subexponential Algorithm for Abstract Optimization Problems},
  journal = SICOMP,
  year = {1995},
  volume = {24},
  pages = {1018--1035},
  keywords = {geometric optimization, randomized algorithm, smallest enclosing ball,
	distance of convex polyhedra},
  url = {http://www.inf.ethz.ch/personal/gaertner/texts/own_work/GART_aop.ps.gz}
}

@ARTICLE{GuvenirSi96,
  author = {H. Altay G{\"u}venir and Izzet Sirin},
  title = {Classification by feature partitioning},
  journal = {Machine Learning},
  year = {1996},
  volume = {23},
  pages = {47--67},
  number = {1},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{G'aborKaSz98,
  author = {Zolt{\'a}n G{\'a}bor and Zsolt Kalm{\'a}r and Csaba Szepesv{\'a}ri},
  title = {Multi-criteria reinforcement learning},
  booktitle = ICML,
  year = {1998},
  pages = {197--205},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{H'eraultGr07,
  author = {R. H\'{e}rault and Y. Grandvalet},
  title = {Sparse probabilistic classifiers},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {337--344},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{HGRKM07,
  author = {Habash, Nizar and Gabbard, Ryan and Rambow, Owen and Kulick, Seth
	and Marcus, Mitch},
  title = {Determining Case in {A}rabic: Learning Complex Linguistic Behavior
	Requires Complex Linguistic Features},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {1084--1092},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1116}
}

@TECHREPORT{HPKWMJ03,
  author = {K. Hacioglu and S. Pradhan and V. Krugler and W. Ward and J. Martin
	and D. Jurafsky},
  title = {Shallow Semantic Parsing Using Support Vector Machines},
  institution = {Center for Spoken Language Research at the University of Colorado},
  year = {2003},
  number = {TR-CSLR-2003-1}
}

@INPROCEEDINGS{HPWMJ04,
  author = {K. Hacioglu and S. Pradhan and W. Ward and J. H. Martin and D. Jurafsky},
  title = {{Semantic Role Labeling by Tagging Syntactic Chunks}},
  booktitle = CoNLL,
  year = {2004},
  pages = {110--113},
  owner = {mchang21},
  timestamp = {2007.01.30}
}

@INPROCEEDINGS{Haddawy94,
  author = {P. Haddawy},
  title = {Generating {Bayesian} Networks From Probability Logic Knowledge Bases},
  booktitle = UAI,
  year = {1994},
  editor = {R. Lopez de Mantaras and Poole, D.},
  pages = {262-269},
  publisher = {Morgan Kaufmann},
  url = {citeseer.nj.nec.com/article/haddawy94generating.html}
}

@ARTICLE{HagerupRu90,
  author = {T. Hagerup and C. Rub},
  title = {A guided tour of {C}hernov bounds},
  journal = {Inform. Proc. Lett.},
  year = {1990},
  volume = {33},
  pages = {305--308}
}

@INPROCEEDINGS{HaghighiKl07,
  author = {Haghighi, Aria and Klein, Dan},
  title = {Unsupervised Coreference Resolution in a Nonparametric Bayesian Model},
  booktitle = ACL,
  year = {2007},
  pages = {848--855},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1107}
}

@INPROCEEDINGS{HaghighiKl06,
  author = {A. Haghighi and D. Klein},
  title = { Prototype-driven Learning for Sequence Models},
  booktitle = HLT-NAACL,
  year = {2006}
}

@INPROCEEDINGS{HaghighiKl06a,
  author = {A. Haghighi and D. Klein},
  title = {Prototype-Driven Grammar Induction},
  booktitle = ACL,
  year = {2006}
}

@INPROCEEDINGS{HaghighiNgMa05,
  author = {A. Haghighi and A. Ng and C. Manning},
  title = {Robust Textual Inference via Graph Matching},
  booktitle = HLT,
  year = {2005}
}

@INPROCEEDINGS{HaghighiNMa05,
  author = {Haghighi, A. and A. Ng and C. Manning},
  title = {Robust Textual Inference via Graph Matching},
  booktitle = HLT-EMNLP,
  year = {2005},
  pages = {387--394},
  address = {Vancouver, British Columbia, Canada},
  month = {October},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/H/H05/H05-1049}
}

@ARTICLE{Hagiya95,
  author = {Masami Hagiya},
  title = {A typed $\lambda$-calculus for proving-by-example and bottom-up generalization
	procedure},
  journal = {Theoret. Comput. Sci.},
  year = {1995},
  volume = {137},
  pages = {3--23},
  number = {1},
  note = {Special Issue for ALT '93}
}

@ARTICLE{Hagiya91,
  author = {M. Hagiya},
  title = {Synthesis of Rewrite Programs by Higher-Order and Semantic Unification},
  journal = {New Generation Computing},
  year = {1991},
  volume = {8},
  pages = {403--420},
  number = {4}
}

@INPROCEEDINGS{HaiderBrSc07,
  author = {P. Haider and U. Brefeld and T. Scheffer},
  title = {Supervised clustering of streaming data for email batch detection},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {345--352},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{Haigh88,
  author = {Robin Haigh and Geoffrey Sampson and Eric Atwell},
  title = {Project {APRIL} -- a progress report},
  booktitle = ACL,
  year = {1988}
}

@INPROCEEDINGS{HaighSaAt88,
  author = {Robin Haigh and Geoffrey Sampson and Eric Atwell},
  title = {Project {APRIL} -- a progress report},
  booktitle = ACL,
  year = {1988}
}

@ARTICLE{Haken85,
  author = {Haken, A.},
  title = {The intractability of resolution.},
  journal = {Theoretical Computer Science},
  year = {1985},
  volume = {39},
  pages = {297--308}
}

@OTHER{HATKSH00,
  author = {S. Haker and S. Angenent and A. Tannenbaum and R. Kikinis and G.
	Sapiro and M. Halle},
  journal = {IEEE Trans. Visualizat. Comput. Graph.},
  number = {2},
  pages = {181--187},
  title = {Conformal surface parameterization for texture mapping},
  volume = {6},
  year = {2000}
}

@INPROCEEDINGS{HNNEMNS07,
  author = {Hall, Johan and Nilsson, Jens and Nivre, Joakim and Eryigit, G\"ulsen
	and Megyesi, Be\'ata and Nilsson, Mattias and Saers, Markus},
  title = {Single Malt or Blended? A Study in Multilingual Parser Optimization},
  booktitle = {CoNLL Shared Task Session of EMNLP-CoNLL},
  year = {2007},
  pages = {933--939},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1097}
}

@INPROCEEDINGS{Hall07,
  author = {Hall, Keith},
  title = {K-best Spanning Tree Parsing},
  booktitle = ACL,
  year = {2007},
  pages = {392--399},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1050}
}

@INPROCEEDINGS{HallHaSm07,
  author = {Hall, Keith and Havelka, Jiri and Smith, David A.},
  title = {Log-Linear Models of Non-Projective Trees, $k$-best {MST} Parsing
	and Tree-Ranking},
  booktitle = {CoNLL Shared Task Session of EMNLP-CoNLL},
  year = {2007},
  pages = {962--966},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1102}
}

@TECHREPORT{HWKL85,
  author = {R. Hall and E. Wenger and D. Kibler and P. Langley},
  title = {The Effect of Multiple Knowledge Sources on Learning and Teaching},
  institution = {University of California, Irvine},
  year = {1985},
  number = {85-11}
}

@ARTICLE{Hall88,
  author = {Robert J. Hall},
  title = {Learning by Failing to Explain: Using Partial Explanations to Learn
	in Incomplete or Intractable Domains},
  journal = {Machine Learning},
  year = {1988},
  volume = {3},
  pages = {45--77},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{HFFHRSST87,
  author = {R. P. Hall and B. Falkenhainer and N. Flann and S. Hampson and R.
	Reinke and J. Shrager and M. H. Sims and P. Tadepalli},
  title = {A Review of the Fourth International Workshop on Machine Learning},
  journal = {Machine Learning},
  year = {1987},
  volume = {2},
  pages = {173--190},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INBOOK{Halmos73,
  pages = {19--48},
  title = {How to Write Mathematics},
  publisher = {American Mathematical Society},
  year = {1973},
  author = {Paul R. Halmos},
  note = {In book entitled {\sl How to Write Mathematics}, by N.E. Steenrod,
	Paul R. Halmos, M.M. Schiffer, and J.A. Dieudonn\'e}
}

@INCOLLECTION{Halperin97,
  author = {D. Halperin},
  title = {Arrangements},
  booktitle = {Handbook of Discrete and Computational Geometry},
  publisher = {CRC Press LLC},
  year = {1997},
  editor = {J. E. Goodman and J. O'Rourke},
  chapter = {21},
  pages = {389--412},
  address = {Boca Raton, FL}
}

@INCOLLECTION{HalperinKaLa97,
  author = {D. Halperin and L. E. Kavraki and J.-C. Latombe},
  title = {Robotics},
  booktitle = {Handbook of Discrete and Computational Geometry},
  publisher = {CRC Press LLC},
  year = {1997},
  editor = {J. E. Goodman and J. O'Rourke},
  chapter = {41},
  pages = {755--778},
  address = {Boca Raton, FL}
}

@INPROCEEDINGS{Halpern90,
  author = {Halpern, J. Y. },
  title = {An analysis of first-order logics of probability},
  booktitle = IJCAI,
  year = {1990},
  pages = {1375--1381},
  address = {Detroit, US},
  url = {citeseer.nj.nec.com/halpern90analysis.html}
}

@ARTICLE{Halpern90a,
  author = {Joseph Y. Halpern and Yoram Moses},
  title = {Knowledge and Common Knowledge in a Distributed Environment},
  journal = jacm,
  year = {1990},
  volume = {37},
  pages = {549-587},
  number = {3},
  month = jul,
  keywords = {Distributed Computing; Algorithms; Reliability; Theory; Verification;
	common knowledge; distributed knowledge; knowledge; knowledge and
	action; variants of common knowledge; }
}

@ARTICLE{Halpern91,
  author = {Joseph Y. Halpern and Yoav Shoham},
  title = {A Propositional Modal Logic of Time Intervals},
  journal = jacm,
  year = {1991},
  volume = {38},
  pages = {935-962},
  number = {4},
  month = oct,
  keywords = {Logic; Theory; axiomatizability; modal logic; temporal logic; temporal
	reasoning; time intervals; }
}

@ARTICLE{HalpernWiWi90,
  author = {Joseph Y. Halpern and John H. Williams and Edward L. Wimmers},
  title = {Completeness of Rewrite Rules and Rewrite Strategies for {FP}},
  journal = jacm,
  year = {1990},
  volume = {37},
  pages = {86-143},
  number = {1},
  month = jan,
  keywords = {Programming Languages and Methodology; Languages; Theory; completeness
	of rewriting rules; strategies for rewriting; }
}

@ARTICLE{Halpern92,
  author = {Joseph Y. Halpern and Lenore D. Zuck},
  title = {A Little Knowledge Goes a Long Way: Knowledge-Based Derivations and
	Correctness Proofs for a Family of Protocols},
  journal = jacm,
  year = {1992},
  volume = {39},
  pages = {449-478},
  number = {3},
  month = jul,
  keywords = {Distributed Computing; Algorithms; Reliability; Theory; Verification;
	reasoning about knowledge; }
}

@INCOLLECTION{HamburgerWe73,
  author = {H. Hamburger and K. Wexler},
  title = {Identifiability of a Class of Transformational Grammars},
  booktitle = {Approaches to Natural Language},
  publisher = {Dordecht, D. reidel},
  year = {1973}
}

@BOOK{Hamming80,
  title = {Coding and Information Theory},
  publisher = {Prentice-Hall},
  year = {1980},
  author = {Hamming, Richard W.}
}

@ARTICLE{HCMS93,
  author = {K. Hammond and T. Converse and M. Marks and C. M. Seifert},
  title = {Opportunism and Learning},
  journal = {Machine Learning},
  year = {1993},
  volume = {10},
  pages = {279--309},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{HampsonKi99,
  author = {Steven Hampson and Dennis Kibler},
  title = {Minimum Generalization Via Reflection: {A} Fast Linear Threshold
	Learner},
  journal = {Machine Learning},
  year = {1999},
  volume = {37},
  pages = {51--73},
  number = {1},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{HampsonKi83,
  author = {S. Hampson and D. Kibler},
  title = {A Boolean Complete Neural Model of Adaptive Behavior},
  journal = {Biol. Cybern.},
  year = {1983},
  volume = {49},
  pages = {9--19}
}

@ARTICLE{HampsonVo86,
  author = {S. E. Hampson and D. J. Volper},
  title = {Linear Function Neurons: Structure and Training},
  journal = {Biol. Cybern.},
  year = {1986},
  volume = {53},
  pages = {203--217}
}

@ARTICLE{Han90,
  author = {Yijie Han and Robert A. Wagner},
  title = {An Efficient and Fast Parallel-Connected Component Algorithm},
  journal = jacm,
  year = {1990},
  volume = {37},
  pages = {626-642},
  number = {3},
  month = jul,
  keywords = {Parallel Algorithms; Algorithms; Design; Theory; connectivity; optimal
	algorithms; parallel algorithms; }
}

@INPROCEEDINGS{Hancock93,
  author = {T. Hancock},
  title = {Learning $k \mu$ decision trees on the uniform distribution},
  booktitle = COLT,
  year = {1993},
  pages = {352--360},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{Hancock91,
  author = {Hancock, T.},
  title = {Learning {$2\mu$} {DNF} Formulas and$k\mu$ Decision Trees},
  booktitle = COLT,
  year = {1991},
  pages = {199--209},
  address = {Santa Cruz, California},
  month = Aug,
  publisher = {Morgan Kaufmann}
}

@UNPUBLISHED{Hancock89,
  author = {T. Hancock},
  title = {Identifying decision trees with equivalence queries},
  note = {Manuscript, Harvard University},
  year = {1989}
}

@INPROCEEDINGS{HancockHe91,
  author = {T. Hancock and L. Hellerstein},
  title = {Learning read-once formulas over fields and extended bases},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1991},
  pages = {326--336},
  publisher = {Morgan Kaufmann, San Mateo, CA}
}

@ARTICLE{HJLT96,
  author = {Thomas Hancock and Tao Jiang and Ming Li and John Tromp},
  title = {Lower bound on learning decision lists and trees},
  journal = {Inform. Comput.},
  year = {1996},
  volume = {126},
  pages = {114--122},
  number = {2}
}

@INPROCEEDINGS{HancockMa91,
  author = {Hancock, T. and Y. Mansour},
  title = {Learning Monotone {$k\mu$} {DNF} Formulas on ProductDistributions},
  booktitle = COLT,
  year = {1991},
  pages = {179--183},
  address = {Santa Cruz, California},
  month = Aug
}

@INPROCEEDINGS{Hancock90,
  author = {T. R. Hancock},
  title = {Identifying $\mu$-formula decision trees with queries},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1990},
  pages = {23--37},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann},
  annote = {Expanded in Harvard TR-16-90. The TR version has Threshold result
	which the conference version does not have.}
}

@ARTICLE{HancockGoMa94,
  author = {Thomas R. Hancock and Mostefa Golea and Mario Marchand},
  title = {Learning nonoverlapping perceptron networks from examples and membership
	queries},
  journal = {Machine Learning},
  year = {1994},
  volume = {16},
  pages = {161--183},
  number = {3},
  annote = {Was Harvard TR-26-91}
}

@INPROCEEDINGS{HanksMc86,
  author = {Hanks, S. and McDermott, D.},
  title = {Temporal reasoning and default logics},
  booktitle = AAAI,
  year = {1986}
}

@BOOK{Hann92,
  title = {The Key to Technical Translation},
  publisher = {John Benjamins Publishing Company},
  year = {1992},
  author = {Michael Hann},
  volume = {1}
}

@INPROCEEDINGS{Hanneke07,
  author = {S. Hanneke},
  title = {A bound on the label complexity of agnostic active learning},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {353--360},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@ARTICLE{HanselSo90,
  author = {D. Hansel and H. Sompolinsky},
  title = {Learning from Examples in a Single-Layer Neural Network},
  journal = {Europhys. Lett.},
  year = {1990},
  volume = {11},
  pages = {687--692},
  number = {7}
}

@ARTICLE{HansonBa89,
  author = {Stephen Jos{\'{e}} Hanson and Malcolm Bauer},
  title = {Conceptual Clustering, Categorization, and Polymorphy},
  journal = {Machine Learning},
  year = {1989},
  volume = {3},
  pages = {343--372},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{HansonBu90,
  author = {S. J. Hanson and D. J. Burr},
  title = {What Connectionist Models Learn: Learning and Representation in Connectionist
	Networks},
  journal = {Behavioral and Brain Sciences},
  year = {1990},
  volume = {13},
  pages = {471--518}
}

@BOOK{HansonReRi93,
  title = {Machine Learning: From Theory to Applications; Cooperative Research
	at Siemens and MIT},
  publisher = {Springer-Verlag},
  year = {1993},
  author = {S. J. Hanson and W. Remmele and R. L. Rivest (editors)},
  number = {Lecture Notes in Computer Science No. 661}
}

@UNPUBLISHED{Har-Peled03,
  author = {S. {Har-Peled}},
  title = {On Core-sets and Slabs},
  note = {menuscript},
  year = {2003}
}

@INPROCEEDINGS{Har-Peled01,
  author = {S. {Har-Peled}},
  title = {Clustering Motion},
  booktitle = FOCS,
  year = {2001},
  pages = {84--93},
  url = {http://www.uiuc.edu/~sariel/research/papers/01/cluster/}
}

@INPROCEEDINGS{Har-Peled01a,
  author = {S. {Har-Peled}},
  title = {A Practical Approach for Computing the Diameter of a Point-Set},
  booktitle = {SOCG},
  year = {2001},
  pages = {177--186}
}

@INPROCEEDINGS{Har-Peled01b,
  author = {S. {Har-Peled}},
  title = {A Replacement for {Voronoi} Diagrams of Near Linear Size},
  booktitle = FOCS,
  year = {2001},
  pages = {94--103}
}

@ARTICLE{Har-Peled00,
  author = {S. {Har-Peled}},
  title = {Constructing planar cuttings in theory and practice},
  journal = SICOMP,
  year = {2000},
  volume = {29},
  pages = {2016--2039},
  number = {6}
}

@MISC{Har-Peled00a,
  author = {S. {Har-Peled}},
  title = {Source code of program for computing and approximating the diameter
	of a point-set in 3d},
  year = {2000},
  note = {\href{http://www.uiuc.edu/ sariel/papers/00/diameter/diam_prog.html}{{\tt
	http://www.uiuc.edu/\tildegen{}sariel/papers/00/diameter} {\tt/diam\_prog.html}}}
}

@ARTICLE{Har-Peled00b,
  author = {S. {Har-Peled}},
  title = {Taking a Walk in a Planar Arrangement},
  journal = SICOMP,
  year = {2000},
  volume = {30},
  pages = {1341--1367},
  number = {4}
}

@ARTICLE{Har-Peled99,
  author = {S. {Har-Peled}},
  title = {{Constructing approximate shortest path maps in three dimensions}},
  journal = SICOMP,
  year = {1999},
  volume = {28},
  pages = {1182--1197},
  number = {4}
}

@ARTICLE{Har-Peled99a,
  author = {S. {Har-Peled}},
  title = {The Complexity of Many Cells in the Overlay of Many Arrangements},
  journal = CGTA,
  year = {1999},
  note = {in press}
}

@PHDTHESIS{Har-Peled99c,
  author = {S. {Har-Peled}},
  title = {Geometric Approximation Algorithms and Randomized Algorithms for
	Planar Arrangements},
  school = {Dept. Computer Science, Tel Aviv University},
  year = {1999},
  address = {Tel Aviv, Israel}
}

@ARTICLE{Har-Peled99d,
  author = {S. {Har-Peled}},
  title = {Multicolor Combination Lemma},
  journal = CGTA,
  year = {1999},
  volume = {12},
  pages = {155--176}
}

@INPROCEEDINGS{Har-Peled99e,
  author = {S. {Har-Peled}},
  title = {Taking a Walk in a Planar Arrangement},
  booktitle = FOCS,
  year = {1999},
  note = {100-110},
  nickname = {FOCS '99}
}

@ARTICLE{Har-Peled99f,
  author = {S. {Har-Peled}},
  title = {Approximate shortest paths and geodesic diameters on convex polytopes
	in three dimensions},
  journal = DCG,
  year = {1999},
  volume = {21},
  pages = {216--231}
}

@INPROCEEDINGS{Har-Peled98,
  author = {S. {Har-Peled}},
  title = {Constructing cuttings in theory and practice},
  booktitle = {SOCG},
  year = {1998},
  pages = {327--336}
}

@INPROCEEDINGS{Har-Peled98a,
  author = {S. {Har-Peled}},
  title = {{Constructing approximate shortest path maps in three dimensions}},
  booktitle = {SOCG},
  year = {1998},
  pages = {383--391}
}

@UNPUBLISHED{Har-Peled98b,
  author = {S. {Har-Peled}},
  title = {Cuttings --- demo program},
  note = {{\tt http://www.math.tau.ac.il/\tildegen{}} {\tt {sariel/CG/cutting/cuttings.html}}},
  year = {1998}
}

@TECHREPORT{Har-Peled98c,
  author = {S. {Har-Peled}},
  title = {On Random and Discrete Convex Hulls in the Plane},
  institution = {School Math. Sci., Tel-Aviv Univ.},
  year = {1998},
  type = {Technical {Report}},
  number = {330/98},
  address = {Tel-Aviv, Israel},
  keywords = {convex-hull, discrete-hull}
}

@INPROCEEDINGS{Har-Peled98d,
  author = {S. {Har-Peled}},
  title = {An Output Sensitive Algorithm for Discrete Convex Hulls},
  booktitle = {SOCG},
  year = {1998},
  pages = {357--364}
}

@ARTICLE{Har-Peled98e,
  author = {S. {Har-Peled}},
  title = {An Output Sensitive Algorithm for Discrete Convex Hulls},
  journal = CGTA,
  year = {1998},
  volume = {10},
  pages = {125--138}
}

@UNPUBLISHED{Har-Peled98f,
  author = {S. {Har-Peled}},
  title = {On the Expected Complexity of a random Convex Hull},
  note = {manuscript},
  year = {1998}
}

@INPROCEEDINGS{Har-Peled97a,
  author = {S. {Har-Peled}},
  title = {{Approximate shortest paths and Geodesic diameters on convex polytopes
	in three dimensions}},
  booktitle = {SOCG},
  year = {1997},
  pages = {359--365}
}

@MASTERSTHESIS{Har-Peled95,
  author = {S. {Har-Peled}},
  title = {The Complexity of Many Cells in the Overlay of Many Arrangements},
  school = {Dept. Computer Science, Tel Aviv University},
  year = {1995},
  type = {{M. S.} Thesis},
  address = {Tel Aviv, Israel},
  keywords = {master thesis}
}

@INPROCEEDINGS{HCAHS95,
  author = {S. {Har-Peled} and T. M. Chan and B. Aronov and D. Halperin and J.
	Snoeyink},
  title = {{The complexity of a single face of a Minkowski Sum}},
  booktitle = {CCCG},
  year = {1995},
  pages = {91--96},
  address = {Universit{\'e} Laval, Quebec},
  cvsection = {unrefconf}
}

@INPROCEEDINGS{Har-PeledIn00,
  author = {S. {Har-Peled} and P. Indyk},
  title = {When Crossings Count - Approximating the Minimum Spanning Tree},
  booktitle = {SOCG},
  year = {2000},
  pages = {166--175},
  url = {http://www.cs.duke.edu/\tildegen{}sariel/papers/99/mst.html}
}

@INPROCEEDINGS{HKSG03,
  author = {S. {Har-Peled} and V. Koltun and D. Song and K. Goldberg},
  title = {Efficient Algorithms for Shared Camera Control},
  booktitle = {SOCG},
  year = {2003},
  pages = {68--77},
  url = {http://www.uiuc.edu/~sariel/research/papers/02/camera/}
}

@UNPUBLISHED{Har-PeledMa03,
  author = {S. {Har-Peled} and S.~{Mazumdar}},
  title = {Fast Algorithms for Computing the Smallest $k$-Enclosing Disc},
  note = {submitted},
  year = {2003}
}

@INPROCEEDINGS{Har-PeledSh01,
  author = {S. {Har-Peled} and M. Sharir},
  title = {On-line Point Location in Planar Arrangements and Its Applications},
  booktitle = SODA,
  year = {2001},
  pages = {57--66}
}

@ARTICLE{Har-PeledSh01a,
  author = {S. {Har-Peled} and M. Sharir},
  title = {Online Point Location in Planar Arrangements and Its Applications},
  journal = DCG,
  year = {2001},
  volume = {26},
  pages = {19--40},
  url = {http://www.uiuc.edu/~sariel/research/papers/99/run.html}
}

@INPROCEEDINGS{Har-PeledShVa96,
  author = {S. {Har-Peled} and M. Sharir and K. R. Varadarajan},
  title = {{Approximate shortest paths on a convex polytope in three dimensions}},
  booktitle = {SOCG},
  year = {1996},
  pages = {329--338}
}

@INPROCEEDINGS{Har-PeledSm03,
  author = {S. {Har-Peled} and S. Smorodinsky},
  title = {On Conflict-Free Coloring of Points and Simple Regions in the Plane},
  booktitle = {SOCG},
  year = {2003},
  pages = {114--123},
  url = {http://www.uiuc.edu/~sariel/research/papers/02/coloring}
}

@UNPUBLISHED{Har-PeledVa02,
  author = {S. {Har-Peled} and K.R. Varadarajan},
  title = {High-Dimensional Shape Fitting in Linear Time},
  note = {manuscript},
  year = {2002},
  url = {http://www.uiuc.edu/~sariel/research/papers/02/pcluster/}
}

@INPROCEEDINGS{Har-PeledVa02b,
  author = {S. {Har-Peled} and K. R. Varadarajan},
  title = {Projective Clustering in High Dimensions using Core-Sets},
  booktitle = {SOCG},
  year = {2002},
  pages = {312--318},
  url = {http://www.uiuc.edu/~sariel/research/papers/01/kflat/}
}

@INPROCEEDINGS{Har-PeledVa01,
  author = {S. {Har-Peled} and K. R. Varadarajan},
  title = {Approximate Shape Fitting via Linearization},
  booktitle = FOCS,
  year = {2001},
  pages = {66--73},
  url = {http://www.uiuc.edu/~sariel/research/papers/01/linearize.html}
}

@INPROCEEDINGS{Har-PeledWa02,
  author = {S. {Har-Peled} and Y. Wang},
  title = {Shape Fitting with Outliers},
  booktitle = {SOCG},
  year = {2002},
  pages = {29--38},
  url = {http://www.uiuc.edu/~sariel/research/papers/02/outliers/}
}

@INPROCEEDINGS{HarabagiuHi06,
  author = {Harabagiu, S. and Hickl, A.},
  title = {{Methods for Using Textual Entailment in Open-Domain Question Answering}},
  booktitle = COLING-ACL,
  year = {2006},
  pages = {905--912},
  address = {Sydney, Australia},
  month = {July},
  publisher = {Association for Computational Linguistics},
  doi = {10.3115/1220175.1220289},
  url = {http://www.aclweb.org/anthology/P06-1114}
}

@INPROCEEDINGS{HarabagiuHickl06,
  author = {Harabagiu, Sanda and Hickl, Andrew},
  title = {Methods for Using Textual Entailment in Open-Domain Question Answering},
  booktitle = COLING-ACL,
  year = {2006},
  pages = {905--912},
  address = {Sydney, Australia},
  month = {July},
  publisher = {Association for Computational Linguistics},
  doi = {10.3115/1220175.1220289},
  url = {http://www.aclweb.org/anthology/P06-1114}
}

@INPROCEEDINGS{HarabagiuHickl06_short,
  author = {S. Harabagiu and A. Hickl},
  title = {{Methods for Using Textual Entailment in Open-Domain Question Answering}},
  booktitle = ACL,
  year = {2006},
  pages = {905--912}
}

@INPROCEEDINGS{HaMoNAACL2001,
  author = {Sanda Harabagiu and Dan Moldovan},
  title = {Open-Domain Textual Question Answering},
  booktitle = {Tuturial of the Second Meeting of the North American Chapter of the
	Association for Computational Linguistics},
  year = {2001}
}

@INPROCEEDINGS{HarabagiuMo01,
  author = {Sanda Harabagiu and Dan Moldovan},
  title = {Open-Domain Textual Question Answering},
  booktitle = {Tuturial of the Second Meeting of the North American Chapter of the
	Association for Computational Linguistics},
  year = {2001}
}

@INPROCEEDINGS{Harabagiu01,
  author = {S. Harabagiu and D. Moldovan and M. Pasca and R. Mihalcea and M.
	Surdeanu and R. Bunescu and R. Girju and V. Rus and P. Morarescu},
  title = {FALCON: Boosting Knowledge for Answer Engines},
  booktitle = TREC,
  year = {2001}
}

@INPROCEEDINGS{HMPMSBGRM01,
  author = {S. Harabagiu and D. Moldovan and M. Pasca and R. Mihalcea and M.
	Surdeanu and R. Bunescu and R. Girju and V. Rus and P. Morarescu},
  title = {FALCON: Boosting Knowledge for Answer Engines},
  booktitle = TREC,
  year = {2001}
}

@INPROCEEDINGS{HarabagiuMo00,
  author = {S. Harabagiu and D. Moldovan and M. Pasca and R. Mihalcea and M.
	Surdeanu and R. Bunescu and R. Girju and V. Rus and P. Morerescu},
  title = {FALCON - Boosting Knowledge for Answer Engines},
  booktitle = TREC,
  year = {2000}
}

@INPROCEEDINGS{HarabagiuMiMo99,
  author = {S. M. Harabagiu and G. A. Miller and D. I. Moldovan},
  title = {WordNet2 - A Morphologically and Semantically Enhanced Resources},
  booktitle = {ACL-SIGLEX},
  year = {1999},
  pages = {1--8},
  address = {Maryland}
}

@INPROCEEDINGS{Haraguchi92,
  author = {M. Haraguchi},
  title = {A form of analogy as an abductive inference},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1992},
  pages = {266--276},
  publisher = {IOS Press}
}

@INPROCEEDINGS{HaraguchiAr86,
  author = {Makoto Haraguchi and Setsuo Arikawa},
  title = {Reasoning by Analogy as a Partial Identity between Models},
  booktitle = {International Workshop on Analogical and Inductive Inference},
  year = {1986},
  volume = {265},
  series = {Lecture Notes in Computer Science},
  pages = {61--87},
  publisher = {Springer-Verlag}
}

@TECHREPORT{Harding82,
  author = {P. Harding},
  title = {Automatic Indexing and Classification for Mechanized Information
	Retrieval},
  institution = {British Library R \& D Department},
  year = {1982},
  type = {BLRDD Report No.},
  number = {5723},
  address = {London},
  month = feb
}

@BOOK{HardyWr65,
  title = {The Theory of Numbers},
  publisher = {Oxford University Press},
  year = {1965},
  author = {G. Hardy and E. Wright},
  address = {London, England},
  edition = {4th}
}

@BOOK{Hardy49,
  title = {Divergent Series},
  publisher = {Oxford at the Clarendon Press},
  year = {1949},
  author = {G. H. Hardy}
}

@BOOK{HardyWr60,
  title = {An Introduction to the Theory of Numbers},
  publisher = {Oxford University Press},
  year = {1960},
  author = {G. H. Hardy and E. M. Wright},
  edition = {4th}
}

@INPROCEEDINGS{Hardy75,
  author = {S. Hardy},
  title = {Synthesis of {LISP} programs from examples},
  booktitle = ICGI,
  year = {1975},
  pages = {268--273},
  organization = {IJCAI}
}

@MISC{Harman94,
  author = {Donna Harman},
  title = {Overview of the Third {T}ext {RE}trieval {C}onference ({TREC}-3)},
  year = {1994}
}

@BOOK{Harman86,
  title = {Change in View:principles of reasoning},
  publisher = {MIT Press},
  year = {1986},
  author = {Harman, G.},
  address = {Cambridge, MA.}
}

@ARTICLE{Harper93,
  author = {Robert Harper and Furio Honsell and Gordon Plotkin},
  title = {A Framework for Defining Logics},
  journal = jacm,
  year = {1993},
  volume = {40},
  pages = {143-184},
  number = {1},
  month = jan,
  keywords = {Logic in Computer Science; Algorithms; Theory; Verification; formal
	systems; interactive theorem proving; proof checking; typed lambda
	calculus; }
}

@INPROCEEDINGS{Harries99,
  author = {Michael Harries},
  title = {Boosting a strong learner: evidence against the minimum margin},
  booktitle = ICML,
  year = {1999},
  pages = {171--180},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@BOOK{Harris68,
  title = {Mathematical structures of language},
  publisher = {Wiley},
  year = {1968},
  author = {Zellig S. Harris}
}

@ARTICLE{Harris57,
  author = {Z. S. Harris},
  title = {Co-Occurrence and Transformation in Linguistic Structure.},
  journal = {Language},
  year = {1957},
  volume = {33},
  pages = {283--340},
  number = {3}
}

@ARTICLE{Harrison90,
  author = {Peter G. Harrison and Naresh M. Patel},
  title = {The Representation of Multistage Interconnection Networks in Queuing
	Models of Parallel Systems},
  journal = jacm,
  year = {1990},
  volume = {37},
  pages = {863-898},
  number = {4},
  month = oct,
  keywords = {System Modeling and Analysis; Design; Parallelism; Performance; closed
	queuing network; crossbar switch; delta network; flow-equivalient
	server; Markov process; multistage interconnection network; performance
	evaluation; }
}

@PHDTHESIS{Hart87,
  author = {Hart, George W.},
  title = {Minimum Information Estimation of Structure},
  school = {MIT Dept.\ of Electrical Engineering and Computer Science},
  year = {1987},
  month = Apr,
  note = {Appears as LIDS-TH-1664.},
  comment = {Studies and applies Rissanen's MDLP.}
}

@TECHREPORT{Hart85,
  author = {Hart, George W.},
  title = {Prototype Nonintrusive Appliance Load Monitor},
  institution = {MIT Energy Laboratory},
  year = {1985},
  number = {Progress Report \#2},
  month = Sep,
  comment = {Finite-state automaton inference to determine appliances present.}
}

@ARTICLE{HartSh86,
  author = {S. Hart and M. Sharir},
  title = {{Nonlinearity of Davenport-Schinzel sequences and of generalized
	path compression schemes}},
  journal = {Combinatorica},
  year = {1986},
  volume = {6},
  pages = {151--177}
}

@BOOK{HartmanisSt66,
  title = {Algebraic Structure Theory of Sequential Machines},
  publisher = {Prentice-Hall},
  year = {1966},
  author = {Hartmanis, J.\ and R. E. Stearns}
}

@ARTICLE{HarunoShOo99,
  author = {Masahiko Haruno and Satoshi Shirai and Yoshifumi Ooyama},
  title = {Using Decision Trees to Construct a Practical Parser},
  journal = {Machine Learning},
  year = {1999},
  volume = {34},
  pages = {131--149},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{HasegawaImIs95,
  author = {Susumu Hasegawa and Hiroshi Imai and Masaki Ishiguro},
  title = {$\varepsilon$-approximations of $k$-label spaces},
  journal = {Theoret. Comput. Sci.},
  year = {1995},
  volume = {137},
  pages = {145--157},
  number = {1},
  note = {Special Issue for ALT '93}
}

@INPROCEEDINGS{HassanSiWa07,
  author = {Hassan, Hany and Sima'an, Khalil and Way, Andy},
  title = {Supertagged Phrase-Based Statistical Machine Translation},
  booktitle = ACL,
  year = {2007},
  pages = {288--295},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1037}
}

@ARTICLE{HassibiSaKa96,
  author = {B.~Hassibi and A.~H. Sayed and T.~Kailath},
  title = {${H}^{\infty}$ Optimality of the {LMS} Algorithm},
  journal = {IEEE Trans. on Signal Processing},
  year = {1996},
  volume = {44}
}

@ARTICLE{HassibiSaKa96a,
  author = {B.~Hassibi and A. H. Sayed and T.~Kailath},
  title = {Linear estimation in {K}rein spaces - part {I}: {T}heory},
  journal = {IEEE Trans. on Automatic Control},
  year = {1996},
  volume = {41},
  pages = {18--33},
  number = {1}
}

@ARTICLE{HassinMe91,
  author = {R. Hassin and N. Megiddo},
  title = {Approximation algorithms for hitting objects by straight lines},
  journal = {Discrete Appl. Math.},
  year = {1991},
  volume = {30},
  pages = {29--42},
  keywords = {NP-Completeness, stabbing, approximation}
}

@ARTICLE{Hastings70,
  author = {W. K. Hastings},
  title = {Monte Carlo Sampling Methods Using Markov Chains and Their Applications},
  journal = {Biometrika},
  year = {1970},
  volume = {57},
  pages = {97-109},
  number = {1},
  month = {April}
}

@ARTICLE{HatcherGo05,
  author = {Hatcher, E. and Gospodnetic, O.},
  title = {{Lucene in Action}},
  journal = {America: Manning Publications Co},
  year = {2005}
}

@ARTICLE{HauCo97,
  author = {David T. Hau and Enrico W. Coiera},
  title = {Learning Qualitative Models of Dynamic Systems},
  journal = {Machine Learning},
  year = {1997},
  volume = {26},
  pages = {177--211},
  publisher = {Kluwer Academic Publishers, Boston}
}

@TECHREPORT{Haussler99,
  author = {D. Haussler},
  title = {Convolution Kernels on Discrete Structures},
  institution = {Univerisity of California - Santa Cruz},
  year = {1999},
  number = {UCSC-CRL-99-10},
  month = Jul
}

@ARTICLE{Haussler98,
  author = {Haussler, D.},
  title = {Computational Genefinding},
  journal = {Trends in Biochemical Sciences, Supplementary Guide to Bioinformatics},
  year = {1998},
  pages = {12--15},
  url = {http://www.cse.ucsc.edu/~haussler/genefindingpaper/paper.html}
}

@INPROCEEDINGS{Haussler97,
  author = {David Haussler},
  title = {A brief look at some machine learning problems in genomics},
  booktitle = COLT,
  year = {1997},
  pages = {109--113},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{Haussler95,
  author = {D. Haussler},
  title = {Sphere packing numbers for subsets of the {B}oolean $n$-cube with
	bounded {V}apnik-{C}hervonenkis dimension},
  journal = {J. Combinatorial Theory (A)},
  year = {1995},
  volume = {69},
  pages = {217--232},
  number = {2},
  note = {Was University of CA at Santa Cruz TR UCSC-CRL-91-41}
}

@ARTICLE{Haussler92,
  author = {Haussler, D.},
  title = {Decision Theoretic Generalizations of the {PAC} Modelfor Neural Net
	and Other Learning Applications},
  journal = {Information and Computation},
  year = {1992},
  volume = {100},
  pages = {78--150},
  number = {1},
  month = Sep
}

@INPROCEEDINGS{Haussler90,
  author = {D. Haussler},
  title = {Probably Approximately Correct Learning},
  booktitle = {National Conference on Artificial Intelligence},
  year = {1990},
  pages = {1101--1108},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{Haussler89,
  author = {Haussler, D.},
  title = {Learning Conjunctive Concepts in Structural Domains},
  journal = {Machine Learning},
  year = {1989},
  volume = {4},
  pages = {7--40}
}

@INPROCEEDINGS{Haussler89a,
  author = {D. Haussler},
  title = {Generalizing the {PAC} model: sample size bounds from metric dimension-based
	uniform convergence results},
  booktitle = FOCS,
  year = {1989},
  pages = {40--45},
  publisher = {IEEE Computer Society Press, Los Alamitos, CA}
}

@TECHREPORT{Haussler89b,
  author = {D. Haussler},
  title = {Generalizing the {PAC} Model for Neural Net and Other Learning Applications},
  institution = {University of California Santa Cruz},
  year = {1989},
  number = {UCSC-CRL-89-30},
  month = sep
}

@ARTICLE{Haussler88,
  author = {Haussler, D.},
  title = {Quantifying Inductive Bias: {AI} Learning Algorithms and {V}aliant's
	Learning Framework},
  journal = {Artificial Intelligence},
  year = {1988},
  volume = {36},
  pages = {177--221}
}

@ARTICLE{Haussler88a,
  author = {D. Haussler},
  title = {New Theoretical Directions in Machine Learning},
  journal = {Machine Learning},
  year = {1988},
  volume = {2},
  pages = {281--284},
  publisher = {Kluwer Academic Publishers, Boston}
}

@TECHREPORT{Haussler88b,
  author = {D. Haussler},
  title = {Space Efficient Learning Algorithms},
  institution = {University of Calif. Computer Research Laboratory},
  year = {1988},
  number = {UCSC-CRL-88-2},
  address = {Santa Cruz, CA}
}

@TECHREPORT{Haussler87,
  author = {D. Haussler},
  title = {Applying Valiant's Learning Framework to {AI} Concept Learning Problems},
  institution = {UCSC},
  year = {1987},
  number = {UCSC-CRL-87-11}
}

@INPROCEEDINGS{Haussler87a,
  author = {D. Haussler},
  title = {Bias, Version Spaces, and {V}aliant's Learning Framework},
  booktitle = {International Workshop on Machine},
  year = {1987},
  pages = {324--336},
  address = {San Mateo, CA},
  month = jun,
  publisher = {Morgan Kaufmann}
}

@TECHREPORT{Haussler87b,
  author = {Haussler, D.},
  title = {Learning Conjunctive Concepts in Structural Domains},
  institution = {Computer Research Laboratory, University of Santa Cruz},
  year = {1987},
  number = {UCSC-CRL-87-1},
  month = Feb
}

@INPROCEEDINGS{Haussler86,
  author = {Haussler, D.},
  title = {Quantifying the inductive bias in concept learning},
  booktitle = AAAI,
  year = {1986},
  pages = {485--489},
  month = aug,
  organization = {American Association for Artificial Intelligence},
  comment = {Defines bias= Vapnik-Chervonenkis dimension. Algorithms for learning
	k-CNF, k-DNF. Many ideas for extensions, generalizations.}
}

@ARTICLE{HKLW91,
  author = {D. Haussler and M. Kearns and N. Littlestone and M. K. Warmuth},
  title = {Equivalence of Models for Polynomial Learnability},
  journal = {Inform. Comput.},
  year = {1991},
  volume = {95},
  pages = {129--161},
  number = {2},
  month = dec,
  annote = {Earlier version was UCSC-CRL-88-06. Was also in COLT88}
}

@INPROCEEDINGS{HausslerKeLiWa88,
  author = {Haussler, D. and M. Kearns and N. Littlestone and M. K. Warmuth},
  title = {Equivalence of Models for Polynomial Learnability},
  booktitle = {Workshop on Computational Learning Theory},
  year = {1988},
  pages = {42--55},
  address = {Cambridge, MA},
  month = Aug,
  publisher = {Morgan-Kaufmann}
}

@ARTICLE{HausslerKeSc94,
  author = {David Haussler and Michael Kearns and Robert E. Schapire},
  title = {Bounds on the sample complexity of {B}ayesian learning using information
	theory and the {VC} dimension},
  journal = {Machine Learning},
  year = {1994},
  volume = {14},
  pages = {83--113},
  number = {1},
  annote = {Was in COLT 1991},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{HKST94,
  author = {D. Haussler and M. Kearns and H. S. Seung and N. Tishby},
  title = {Rigorous learning curve bounds from statistical mechanics},
  booktitle = COLT,
  year = {1994},
  pages = {76--87}
}

@INPROCEEDINGS{HausslerKiWa95,
  author = {David Haussler and Jyrki Kivinen and Manfred K. Warmuth},
  title = {Tight worst-case loss bounds for predicting with expert advice},
  booktitle = EuroCOLT,
  year = {1995},
  pages = {69--83},
  publisher = {Springer-Verlag},
  note = {Early version in U. of CA, Santa Cruz, TR UCSC-CRL-94-36}
}

@ARTICLE{HausslerLiWa94,
  author = {D. Haussler and N. Littlestone and M. K. Warmuth},
  title = {Predicting $\{0,1\}$ Functions on Randomly Drawn Points},
  journal = {Inform. Comput.},
  year = {1994},
  volume = {115},
  pages = {284--293},
  number = {2},
  note = {Was in FOCS88, COLT88, and Univ. of California at Santa Cruz TR UCSC-CRL-90-54}
}

@INPROCEEDINGS{HausslerLiWa89,
  author = {Haussler, David and Nick Littlestone and Manfred K. Warmuth},
  title = {Predicting $\{0,1\}$-Functions on Randomly Drawn Points},
  booktitle = COLT,
  year = {1989},
  number = {2},
  pages = {280--296},
  publisher = {Morgan Kaufmann}
}

@UNPUBLISHED{HausslerLiWa87,
  author = {Haussler, David and Nick Littlestone and Manfred K. Warmuth},
  title = {Expected mistake bounds for on-line learning algorithms},
  note = {(Unpublished)},
  month = Apr,
  year = {1987}
}

@INPROCEEDINGS{HausslerOp95,
  author = {David Haussler and Manfred Opper},
  title = {General bounds on the mutual information between a parameter and
	$n$ conditionally independent observations},
  booktitle = COLT,
  year = {1995},
  pages = {402--411},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{HausslerOp95a,
  author = {David Haussler and Manfred Opper},
  title = {Mutual Information and {B}ayes Methods for Learning a Distribution},
  booktitle = {Workshop on the Theory of Neural Networks: The Statistical Mechanics
	Perspective},
  year = {1995},
  publisher = {World Scientific}
}

@TECHREPORT{HausslerLo90,
  author = {Haussler, D. and P.Long},
  title = {A generalization of Sauer's Lemma},
  institution = {U.C. Santa Cruz Computer Research Laboratory},
  year = {1990},
  number = {UCSC-CRL-90-15},
  month = Apr
}

@INCOLLECTION{HausslerWa93,
  author = {D. Haussler and M. K. Warmuth},
  title = {The Probably Approximately Correct ({PAC}) and Other Learning Models},
  booktitle = {Machine Learning: Induction, Analogy and Discovery},
  publisher = {Kluwer Academic Publishers},
  year = {1993},
  editor = {A. Meyrowitz and S. Chipman},
  address = {Boston, MA}
}

@ARTICLE{HausslerWe87,
  author = {D. Haussler and E. Welzl},
  title = {$\varepsilon$-nets and simplex range queries},
  journal = DCG,
  year = {1987},
  volume = {2},
  pages = {127--151},
  keywords = {combinatorial geometry, probabilistic geometry, probability theory,
	reporting, counting, half spaces, simplices, $d$-dimensional}
}

@INPROCEEDINGS{HGKI02,
  author = {T.~Haveliwala and A.~Gionis and D.~Klein and P.~Indyk},
  title = {Evaluating strategies for similarity search on the web},
  booktitle = WWW,
  year = {2002},
  url = {http://www2002.org/CDROM/refereed/75/}
}

@INPROCEEDINGS{SimSrchStrategy,
  author = {Taher H. Haveliwala and Aristides Gionis and Dan Klein and Piotr
	Indyk},
  title = {Evaluating Strategies for Similarity Search on the {W}eb},
  booktitle = WWW,
  year = {2002},
  pages = {432--442}
}

@INPROCEEDINGS{Havelka07,
  author = {Havelka, Jiri},
  title = {Beyond Projectivity: Multilingual Evaluation of Constraints and Measures
	on Non-Projective Structures},
  booktitle = ACL,
  year = {2007},
  pages = {608--615},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1077}
}

@INPROCEEDINGS{HMST98,
  author = {Yosuke Hayashi and Satoshi Matsumoto and Ayumi Shinohara and Masayuki
	Takeda},
  title = {Uniform Characterizations of polynomial-query learnabilities},
  booktitle = {International Conference on Discovery Science},
  year = {1998},
  volume = {1532},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {84--92},
  publisher = {Springer-Verlag}
}

@MISC{Hayes-weinstein90,
  author = {P. Hayes and S. Weinstein},
  title = {Construe-TIS: A system for content-based indexing of a database of
	news stories},
  year = {1990}
}

@MISC{HayesWe90,
  author = {P. Hayes and S. Weinstein},
  title = {Construe-TIS: A system for content-based indexing of a database of
	news stories},
  year = {1990}
}

@INCOLLECTION{Hayes85,
  author = {Hayes, P. J.},
  title = {The second naive physics manifesto},
  booktitle = {Readings in Knowledge Representation},
  publisher = {Morgan Kaufman},
  year = {1985},
  editor = {R. Brachman and H. Levesque}
}

@BOOK{Haykin94,
  title = {Neural Networks: a Comprehensive Foundation},
  publisher = {Macmillan},
  year = {1994},
  author = {S. Haykin},
  address = {New York, NY}
}

@BOOK{Haykin91,
  title = {Adaptive Filter Theory},
  publisher = {Prentice-Hall},
  year = {1991},
  author = {S. Haykin},
  address = {Englewood Cliffs, NJ},
  note = {Second edition.}
}

@INPROCEEDINGS{HeadKoYo98,
  author = {T. Head and S. Kobayashi and T. Yokomori},
  title = {Locality, Reversibility, and Beyond: {L}earning Languages from Positive
	Data},
  booktitle = ALT,
  year = {1998},
  volume = {1501},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {191--204},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Hearst91,
  author = {Marti Hearst},
  title = {Noun homograph disambiguation using local context in large text corpora},
  booktitle = UWOED,
  year = {1991},
  pages = {1--22}
}

@INPROCEEDINGS{Hearst92,
  author = {Hearst, M. A. },
  title = {Automatic acquisition of hyponyms from large text corpora},
  booktitle = COLING,
  year = {1992},
  pages = {539--545},
  address = {Morristown, NJ, USA},
  publisher = {Association for Computational Linguistics},
  doi = {http://dx.doi.org/10.3115/992133.992154},
  keywords = {corpus, hyponym, statistical-nlp, text-mining},
  url = {http://dx.doi.org/10.3115/992133.992154}
}

@INPROCEEDINGS{Hearst92a,
  author = {Hearst, M. A. },
  title = {Acquisition of Hyponyms from Large Text Corpora},
  booktitle = {COLING},
  year = {1992},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@INCOLLECTION{HearstSc94,
  author = {M. A. Hearst and H. Sch\"{u}tze},
  title = {Customizing a Lexicon to Better Suit a Computational Task},
  booktitle = {Corpus Processing for Lexical Acquisition},
  publisher = {MIT Press},
  year = {1994},
  editor = {Branimir Boguraev and James Pustejovsky},
  address = {Cambridge MA}
}

@INCOLLECTION{HearstSc98,
  author = {M. A. Hearst and H. Schutze},
  title = {Customizing a Lexicon to Better Suit a Computational Task},
  booktitle = {Corpus Processing for Lexical Acquisition},
  publisher = {MIT Press},
  year = {1998},
  editor = { B. Boguraev and J. Pustejovsky}
}

@ARTICLE{Heath92,
  author = {Lenwood S. Heath and Sorin Istrail},
  title = {The Pagemember of Genus $g$ Graphs is $\uppercase{O}$($g$)},
  journal = jacm,
  year = {1992},
  volume = {39},
  pages = {479-501},
  number = {3},
  month = jul,
  keywords = {Graph Theory; Algorithms; Theory; book embeddings; graph genus; homotopy
	classes; planar-nonplanar decomposition; surface embeddings; }
}

@TECHREPORT{HeckbertGa97,
  author = {P. S. Heckbert and M. Garland},
  title = {Survey of Polygonal Surface Simplification Algorithms},
  institution = {CMU-CS},
  year = {1997},
  note = {\href{http://www.uiuc.edu/ garland/papers.html} {http://www.uiuc.edu/\tildegen{}garland/papers.html}}
}

@INCOLLECTION{Heckerman86,
  author = {Heckerman, David},
  title = {Probabilistic Interpretation for {MYCIN}'s Certainty Factors},
  booktitle = UAI,
  publisher = {Kluwer Science Publishers},
  year = {1986},
  editor = {Kanal, L. N. and Lemmer, J.F.},
  pages = {167--196}
}

@ARTICLE{HCMRK00,
  author = {D. Heckerman and D. M. Chickering and C. Meek and R. Rounthwaite
	and C. M. Kadie},
  title = {Dependency Networks for Inference, Collaborative Filtering, and Data
	Visualization},
  journal = {Journal of Machine Learning Research},
  year = {2000},
  volume = {1},
  pages = {49-75}
}

@ARTICLE{HeckermanGeCh95,
  author = {David Heckerman and Dan Geiger and David M. Chickering},
  title = {Learning {B}ayesian networks: the combination of knowledge and statistical
	data},
  journal = {Machine Learning},
  year = {1995},
  volume = {20},
  pages = {197--243},
  number = {3},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{HegedHus93,
  author = {T. Heged\H{u}s},
  title = {Can complexity theory benefit from learning theory? (Extended Abstract)},
  booktitle = ECML,
  year = {1993},
  volume = {LNCS 667 (subseries Lecture Notes in AI)},
  pages = {354--359},
  address = {Berlin},
  publisher = {Springer Verlag}
}

@INPROCEEDINGS{Hegedus95,
  author = {Tibor Heged{\"u}s},
  title = {Generalized teaching dimensions and the query complexity of learning},
  booktitle = COLT,
  year = {1995},
  pages = {108--117},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{Hegedus94,
  author = {T. Heged{\"u}s},
  title = {Geometrical concept learning and convex polytopes},
  booktitle = COLT,
  year = {1994},
  pages = {228--236},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{Hegedus94a,
  author = {T. Heged{\"u}s},
  title = {On Training Simple Neural Networks and Small-weight Neurons},
  booktitle = EuroCOLT,
  year = {1994},
  volume = {New Series Number 53},
  series = {The Institute of Mathematics and its Applications Conference Series},
  pages = {69--82},
  address = {Oxford},
  publisher = {Oxford University Press},
  isbn = {0 19 853492 2}
}

@INPROCEEDINGS{HegedHIn97,
  author = {Tibor Heged{\H u}s and Piotr Indyk},
  title = {On learning disjunctions of zero-one threshold functions with queries},
  booktitle = ALT,
  year = {1997},
  volume = {1316},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {446--460},
  publisher = {Springer-Verlag}
}

@ARTICLE{Heger96,
  author = {Matthias Heger},
  title = {The loss from imperfect value functions in expectation-based and
	minimax-based tasks},
  journal = {Machine Learning},
  year = {1996},
  volume = {22},
  pages = {197--225},
  number = {1/2/3},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{Heger94,
  author = {Matthias Heger},
  title = {Consideration of risk in reinforcement learning},
  booktitle = ICML,
  year = {1994},
  pages = {105--111},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{Hekanaho96,
  author = {Jukka Hekanaho},
  title = {Background knowledge in {GA}-based concept learning},
  booktitle = ICML,
  year = {1996},
  pages = {234--242},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{Hekanaho95,
  author = {Jukka Hekanaho},
  title = {Symbiosis in multimodal concept learning},
  booktitle = ICML,
  year = {1995},
  pages = {278--285},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{HelmboldLiLo92,
  author = {Helbold, David P. and Nicholas LIttlestone and Philip M. Long},
  title = {Apple Tasting and Nearly One-Sided Learning},
  booktitle = FOCS,
  year = {1992},
  pages = {493--502},
  address = {St. Louis, Missouri},
  month = Oct,
  publisher = {IEEE}
}

@INPROCEEDINGS{HeldKlMi95,
  author = {M. Held and J. T. Klosowski and J. S.B. Mitchell},
  title = {Evaluation of Collision Detection Methods for Virtual Reality Fly-Throughs},
  booktitle = {CCCG},
  year = {1995},
  pages = {205--210}
}

@ARTICLE{Hellerstein93,
  author = {Lisa Hellerstein},
  title = {Book {R}eview: Machine Learning: {A} Theoretical Approach},
  journal = {Machine Learning},
  year = {1993},
  volume = {13},
  pages = {145--149},
  publisher = {Kluwer Academic Publishers, Boston}
}

@UNPUBLISHED{Hellerstein92,
  author = {Hellerstein, Lisa},
  title = {Functions that are read-once on a subset of their inputs},
  note = {(To appear in Discrete Applied Mathematics)},
  year = {1992}
}

@PHDTHESIS{Hellerstein89,
  author = {L. Hellerstein},
  title = {On {C}haracterizing and {L}earning {S}ome {C}lasses of {R}ead-once
	{F}unctions},
  school = {University of California, Berkeley},
  year = {1989}
}

@INCOLLECTION{Hellerstein87,
  author = {Hellerstein, Lisa},
  title = {A Concurrent Prolog based region finding algorithm},
  booktitle = {Concurrent Prolog: Collected Papers},
  publisher = {MIT Press},
  year = {1987},
  volume = {I},
  pages = {291--317}
}

@TECHREPORT{HellersteinKa91,
  author = {L. Hellerstein and M. Karpinski},
  title = {Computational complexity of learning read-once formulas over different
	bases},
  institution = {International Computer Science Institute, Berkeley, CA, TR-91-014},
  year = {1991}
}

@INPROCEEDINGS{HellersteinKa89,
  author = {L. Hellerstein and M. Karpinski},
  title = {Learning read-once formulas using membership queries},
  booktitle = {Annual Workshop on Computational Learning Theory},
  year = {1989},
  pages = {146--161},
  publisher = {Morgan Kaufmann},
  annote = {Preliminary version appeared as ICSI TR-89-021. Expanded version
	with Angluin as a co-author apperaed in {\it J. ACM } in 1993}
}

@ARTICLE{HellersteinKlWi90,
  author = {Hellerstein, Lisa and Philip Klein and Robert Wilber},
  title = {On the time-space complexity of reachability queries forpreprocessed
	graphs},
  journal = {Information Processing Letters},
  year = {1990},
  volume = {35},
  pages = {261--267}
}

@INPROCEEDINGS{HPRW95,
  author = {Lisa Hellerstein and Krishnan Pillaipakkamnatt and Vijay Raghavan
	and Dawn Wilkins},
  title = {How many queries are needed to learn?},
  booktitle = STOC,
  year = {1995},
  pages = {190--199},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{HellersteinSaShTa87,
  author = {Hellerstein, Lisa and Shmuel Safra and Ehud Shapiro and Stephen Taylor},
  title = {Commutative One-Counter Languages Are Regular},
  journal = {J. Parallel and Distributed Computing},
  year = {1987},
  volume = {4},
  pages = {250--265}
}

@ARTICLE{HellersteinSh85,
  author = {Hellerstein, Lisa and Ehud Shapiro},
  title = {Implementing parallel algorithms in Concurent Prolog: The MAXFLOW
	experience},
  journal = {Journal of Logic Programming},
  year = {1985},
  volume = {3},
  pages = {157--184}
}

@ARTICLE{Hellman77,
  author = {Martin E. Hellman},
  title = {An Extension of the Shannon Theory Approach to Cryptography},
  journal = {IEEE Transactions on Information Theory},
  year = {1977},
  volume = {IT-23},
  pages = {289--294},
  number = {3},
  month = May
}

@ARTICLE{Helman89,
  author = {Paul Helman},
  title = {A Common Schema for Dynamic Programming and Branch and Bound Algorithms},
  journal = jacm,
  year = {1989},
  volume = {36},
  pages = {97-128},
  number = {1},
  month = jan,
  keywords = {Operations Research; Algorithms; Theory; Verification; branch-andbound;
	combinatorial optimization; complexity analysis; dynamic programming;
	formal models of algorithms; parallel algorithms; search strategies;}
}

@INPROCEEDINGS{HelmboldKwPi97,
  author = {David Helmbold and Stephen Kwek and Leonard Pitt},
  title = {Learning when to trust which experts},
  booktitle = EuroCOLT,
  year = {1997},
  pages = {134--149},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{HelmboldPa97,
  author = {David Helmbold and Sandra Panizza},
  title = {Some Label Efficient Learning Results},
  booktitle = COLT,
  year = {1997},
  pages = {218--230},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{HSSW97,
  author = {D. Helmbold and R. E. Schapire and Y. Singer and M. K. Warmuth},
  title = {A comparison of new and old algorithms for a mixture estimation problem},
  journal = {Machine Learning},
  year = {1997},
  pages = {97--119},
  note = {Earlier versions appeared as techreport UCSC-CRL-95-50, Dep. of Comp.
	Sc, UC Santa Cruz, October 95, and in COLT95}
}

@ARTICLE{HelmboldSlWa92,
  author = {Helmbold, David and Robert Sloan and Manfred K. Warmuth},
  title = {Learning Integer Lattices},
  journal = {{SIAM} Journal on Computing},
  year = {1992},
  volume = {21},
  pages = {240--266},
  number = {2}
}

@INPROCEEDINGS{HelmboldSlWa90,
  author = {Helmbold, David and Robert Sloan and Manfred K. Warmuth},
  title = {Learning Integer Lattices},
  booktitle = COLT,
  year = {1990},
  number = {3},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{HelmboldSlWa90a,
  author = {D. Helmbold and R. Sloan and M. K. Warmuth},
  title = {Learning Nested Differences of Intersection Closed Concept Classes},
  journal = {Machine Learning},
  year = {1990},
  volume = {5},
  pages = {165--196},
  number = {2},
  note = {Special Issue on Computational Learning Theory; first appeared in
	2nd COLT conference (1989)},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{HelmboldSlWa89,
  author = {Helmbold, David and Robert Sloan and Manfred K. Warmuth},
  title = {Learning Nested Differences of Intersection-Closed Concept Classes},
  booktitle = {Annual Workshop on Computational Learning Theory},
  year = {1989},
  pages = {41--56},
  address = {Santa Cruz, CA},
  month = Jul
}

@ARTICLE{HelmboldWa95,
  author = {D. Helmbold and M. K. Warmuth},
  title = {On Weak Learning},
  journal = {Journal of Computer and System Sciences},
  year = {1995},
  volume = {50},
  pages = {551--573},
  number = {3},
  month = jun
}

@INPROCEEDINGS{HelmboldKiWa96,
  author = {D. P. Helmbold and J. Kivinen and M. K. Warmuth},
  title = {Worst-Case Loss Bounds for Sigmoided Linear Neurons},
  booktitle = NIPS,
  year = {1996},
  note = {To appear}
}

@TECHREPORT{HelmboldKiWa96a,
  author = {D. P. Helmbold and J. Kivinen and M. K. Warmuth},
  title = {Worst-case Loss Bounds for Single Neurons},
  institution = {Univ. of Calif. Computer Research Lab},
  year = {1996},
  number = {UCSC-CRL-96-2},
  address = {Santa Cruz, CA},
  note = {In preparation.}
}

@ARTICLE{HelmboldLo94,
  author = {David P. Helmbold and Philip M. Long},
  title = {Tracking drifting concepts by minimizing disagreements},
  journal = {Machine Learning},
  year = {1994},
  volume = {14},
  pages = {27--45},
  number = {1},
  annote = {Was in COLT 1991 and was UC Santa Cruz TR 91-26},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{HelmboldLo91,
  author = {Helmbold, David P. and Philip M. Long},
  title = {Tracking Drifting Concepts Using Random Examples},
  booktitle = COLT,
  year = {1991},
  pages = {13--23},
  address = {Santa Cruz, California},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{HelmboldPaWa99,
  author = {David P. Helmbold and Sandra Panizza and Manfred K. Warmuth},
  title = {Direct and Indirect Algorithms or On-line Learning of Disjunctions},
  booktitle = EuroCOLT,
  year = {1999},
  volume = {1572},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {138--152},
  publisher = {Springer-Verlag}
}

@ARTICLE{HelmboldSc97,
  author = {D. P. Helmbold and R. E. Schapire},
  title = {Predicting nearly as well as the best pruning of a decision tree},
  journal = {Machine Learning},
  year = {1997},
  pages = {51--68},
  note = {Earlier version in COLT95}
}

@INPROCEEDINGS{HSSW96,
  author = {David P. Helmbold and Robert E. Schapire and Yoram Singer and Manfred
	K. Warmuth},
  title = {On-line portfolio selection using multiplicative updates},
  booktitle = ICML,
  year = {1996},
  pages = {243--251},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{HelmboldSiWa97,
  author = {David P. Helmbold and Robert E. Schapire andYoram Singer and Manfred
	K. Warmuth},
  title = {A Comparison of New and Old Algorithms for a Mixture Estimation Problem},
  journal = {Machine Learning},
  year = {1997},
  volume = {27},
  pages = {97--119},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{HelmboldWa92,
  author = {D. P. Helmbold and M. K. Warmuth},
  title = {Some weak learning results},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1992},
  pages = {399--412},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{Hendel79,
  author = {R. J. Hendel},
  title = {Mathematical learning theory: a formalized, axiomatic, abstract approach},
  journal = {Inform. Control},
  year = {1979},
  volume = {41},
  pages = {67--117}
}

@BOOK{Hennie68,
  title = {Finite-State Models for Logical Machines},
  publisher = {John Wiley and Sons},
  year = {1968},
  author = {Hennie, Frederick C.}
}

@INPROCEEDINGS{Henrion91,
  author = {Max Henrion},
  title = {Search-based methods to bound diagnostic probabilities in very large
	belief nets},
  booktitle = UAI,
  year = {1991},
  pages = {142--150},
  address = {San Francisco, CA, USA},
  publisher = {Morgan Kaufmann Publishers Inc.},
  isbn = {1-55860-203-8},
  location = {Los Angeles, California, United States}
}

@BOOK{Herbrich02,
  title = {Learning Kernel Classifiers},
  publisher = { MIT Press},
  year = {2002},
  author = {R. Herbrich}
}

@INPROCEEDINGS{HerbrichGr01,
  author = {R. Herbrich and T. Graepel},
  title = {A PAC-Bayesian Margin Bound for Linear Classifiers: Why SVMs work},
  booktitle = NIPS,
  year = {2001},
  pages = {224--230}
}

@INPROCEEDINGS{HerbrichGrSh00,
  author = {Ralf Herbrich and Thore Graepel and John Shawe-Taylor},
  title = {Sparsity vs. Large Margins for Linear Classifiers},
  booktitle = COLT,
  year = {2000},
  pages = {304--308},
  publisher = {Morgan Kaufmann, San Francisco}
}

@INPROCEEDINGS{HerbsterWa95,
  author = {M. Herbster and M. Warmuth},
  title = {Tracking the best expert},
  booktitle = ICML,
  year = {1995},
  pages = {286--294},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{HerbsterWa98,
  author = {Mark Herbster and Manfred K. Warmuth},
  title = {Tracking the best regressor},
  booktitle = COLT,
  year = {1998},
  pages = {24--31},
  publisher = {ACM Press, New York, NY}
}

@INBOOK{HergertFiZi95,
  chapter = {17},
  pages = {323--343},
  title = {Improving model selection by dynamic regularization methods},
  publisher = {MIT Press},
  year = {1995},
  author = {Ferdinand Hergert and William Finnoff and Hans-Georg Zimmermann},
  volume = {III: Selecting Good Models},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@ARTICLE{Herlihy90,
  author = {Maurice Herlihy},
  title = {Concurrency and Availability as Dual Properties of Replicated Atomic
	Data},
  journal = jacm,
  year = {1990},
  volume = {37},
  pages = {257-278},
  number = {2},
  month = apr,
  keywords = {Distributed Computing; Algorithms; Reliability; quorum consensus;
	replication; }
}

@ARTICLE{Herlihy92,
  author = {Maurice Herlihy and Nancy Lynch and Michael Merritt and William Weihl},
  title = {On the Correctness of Orphan Management Algorithms},
  journal = jacm,
  year = {1992},
  volume = {39},
  pages = {881-930},
  number = {4},
  month = oct,
  keywords = {Distributed Computing; Algorithms; Languages; Reliability; Theory;
	Verification; argus; avalon; atomic actions; camelot; input-output
	automata; recovery; serializability; }
}

@INPROCEEDINGS{Hermjakob01,
  author = {U. Hermjakob},
  title = {Parsing and question classification for question answering},
  booktitle = {ACL Workshop on Open-Domain Question Answering},
  year = {2001}
}

@INPROCEEDINGS{HermjakobKnDa08,
  author = {Hermjakob, U. and Knight, K. and Daum\'{e} III, H.},
  title = {Name Translation in Statistical Machine Translation - Learning When
	to Transliterate},
  booktitle = {ACL-HLT},
  year = {2008},
  pages = {389--397},
  address = {Columbus, Ohio},
  month = {June},
  url = {http://www.aclweb.org/anthology/P/P08/P08-1045}
}

@INPROCEEDINGS{HermoLa99,
  author = {Montserrat Hermo and Vitor Lavin},
  title = {Learning Minimal Covers of Functional Dependencies with Queries},
  booktitle = ALT,
  year = {1999},
  volume = {1720},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {291--300},
  publisher = {Springer-Verlag}
}

@INCOLLECTION{Herrenstein90,
  author = {Herrenstein, J. Richard},
  title = {Levels of Categorization},
  booktitle = {Signal and Sense: Local and Global Order in Perceptual Maps},
  publisher = {Wiley-Liss},
  year = {1990},
  editor = {Edelman, M. Gerald and W. Einar Gall and W. Maxwell Cowan}
}

@INPROCEEDINGS{HershbergerSu01,
  author = {J. Hershberger and S. Suri},
  title = {Simplified Kinetic Connectivity for Rectangles and Hypercubes},
  booktitle = SODA,
  year = {2001},
  pages = {158--167}
}

@INPROCEEDINGS{HershbergerSu99,
  author = {J. Hershberger and S. Suri},
  title = {Kinetic Connectivity of Rectangles},
  booktitle = {SOCG},
  year = {1999},
  pages = {237-246}
}

@ARTICLE{HershbergerSu98,
  author = {J. Hershberger and S. Suri},
  title = {Practical Methods for Approximating Shortest Paths on a Convex Polytope
	in {$\Re^3$}},
  journal = CGTA,
  year = {1998},
  volume = {10},
  pages = {31--46},
  number = {1}
}

@INPROCEEDINGS{HershbergerSu95,
  author = {J. Hershberger and S. Suri},
  title = {Practical Methods for Approximating Shortest Paths on a Convex Polytope
	in {$\Re^3$}},
  booktitle = SODA,
  year = {1995},
  pages = {447--456},
  keywords = {geodesic paths, shortest paths, approximation algorithm}
}

@BOOK{HertzKrPa91,
  title = {Introduction to the Theory of Neural Computation},
  publisher = {Addison-Welsly},
  year = {1991},
  author = {Hertz, J. and A. Krogh and R. G. Palmer}
}

@INPROCEEDINGS{Heskes98,
  author = {Tom Heskes},
  title = {Solving a huge number of similar tasks: a combination of multi-task
	learning and a hierarchical {B}ayesian approach},
  booktitle = ICML,
  year = {1998},
  pages = {233--241},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{HicklBe07,
  author = {Hickl, A. and Bensley, J.},
  title = {{A Discourse Commitment-Based Framework for Recognizing Textual Entailment}},
  booktitle = {ACL-PASCAL Workshop on Textual Entailment and Paraphrasing},
  year = {2007},
  pages = {171--176},
  address = {Prague},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/W/W07/W07-1428}
}

@INPROCEEDINGS{HicklBensley07,
  author = {Hickl, Andrew and Bensley, Jeremy},
  title = {A Discourse Commitment-Based Framework for Recognizing Textual Entailment},
  booktitle = {ACL-PASCAL Workshop on Textual Entailment and Paraphrasing},
  year = {2007},
  pages = {171--176},
  address = {Prague},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/W/W07/W07-1428}
}

@INPROCEEDINGS{HicklBensley07_short,
  author = {A. Hickl and J. Bensley},
  title = {{A Discourse Commitment-Based Framework for Recognizing Textual Entailment}},
  booktitle = ACL,
  year = {2007},
  pages = {171--176},
  url = {http://www.aclweb.org/anthology/W/W07/W07-1428}
}

@INPROCEEDINGS{HWBRRS05,
  author = {A. Hickl and J. Williams and J. Bensley and K. Roberts and B. Rink
	and Y. Shi},
  title = {Recognizing Textual Entailment with LCC's GROUNDHOG System},
  booktitle = {PASCAL Challenges Workshop on Recognizing Textual Entailment},
  year = {2006}
}

@INPROCEEDINGS{Higuera98,
  author = {Colin de la Higuera},
  title = {Learning stochastic finite automata from experts},
  booktitle = {International Workshop on Algorithmic Learning},
  year = {1998},
  volume = {1433},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {79--89},
  publisher = {Springer-Verlag}
}

@ARTICLE{Higuera97,
  author = {Colin de la Higuera},
  title = {Characterisitc Sets for Polynomial Grammatical Inference},
  journal = {Machine Learning},
  year = {1997},
  volume = {27},
  pages = {125--138},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{Hindle90,
  author = {Hindle, D.},
  title = {Noun Classification from Predicate-Argument Structures},
  booktitle = ACL,
  year = {1990},
  pages = {268--275}
}

@INPROCEEDINGS{Hindle89,
  author = {Hindle, D.},
  title = {Acquiring disambiguation rules from text},
  booktitle = ACL,
  year = {1989}
}

@INPROCEEDINGS{Hindle83,
  author = {Hindle, D.},
  title = {Deterministic parsing of syntactic non-fluencies},
  booktitle = ACL,
  year = {1983}
}

@ARTICLE{Hindle93,
  author = {Donald Hindle and Mats Rooth},
  title = {Structural Ambiguity and Lexical Relations},
  journal = CL,
  year = {1993},
  volume = {19},
  pages = {103--120},
  number = {1}
}

@ARTICLE{HindleRo93,
  author = {Donald Hindle and Mats Rooth},
  title = {Structural Ambiguity and Lexical Relations},
  journal = CL,
  year = {1993},
  volume = {19},
  pages = {103--120},
  number = {1}
}

@INPROCEEDINGS{Hindle91,
  author = {D. Hindle and M. Rooth},
  title = {Structural Ambiguity and Lexical Relations},
  booktitle = ACL,
  year = {1991},
  pages = {229--236}
}

@INPROCEEDINGS{HindleRo91,
  author = {D. Hindle and M. Rooth},
  title = {Structural Ambiguity and Lexical Relations},
  booktitle = ACL,
  year = {1991},
  pages = {229--236}
}

@INPROCEEDINGS{Hinton99,
  author = {G.E. Hinton},
  title = {Products of experts},
  booktitle = {International Conference on Artificial Neural Networks},
  year = {1999},
  pages = {1-6},
  url = {citeseer.ist.psu.edu/hinton99product.html}
}

@INPROCEEDINGS{HintonCa93,
  author = {G. Hinton and D. van Camp},
  title = {Keeping neural networks simple by minimizing the description length
	of the weights},
  booktitle = COLT,
  year = {1993},
  pages = {5--13},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{Hinton89,
  author = {G. E. Hinton},
  title = {Deterministic {B}oltzmann Learning Performs Steepest Descent in Weight-Space},
  journal = {Neural Computation},
  year = {1989},
  volume = {1},
  pages = {143--150},
  number = {1}
}

@INPROCEEDINGS{Hinton86,
  author = {G. E. Hinton},
  title = {Learning Distributed Representations of Concepts},
  booktitle = CogSci,
  year = {1986},
  pages = {1--12},
  address = {Hillsdale},
  publisher = {Erlbaum}
}

@INCOLLECTION{HintonSe86,
  author = {Hinton, G. E. and T. J. Sejnowski},
  title = {Learning and re-learning in {B}otzmann Machines},
  booktitle = {Parallel Distributed Processing},
  publisher = {MIT Press},
  year = {1986},
  editor = {D. E. Rumelhart and J. L. McClelland},
  pages = {282--317}
}

@TECHREPORT{HintonSeAc84,
  author = {Hinton, G. E. and T. J. Sejnowski and D. H. Ackley},
  title = {Boltzmann Machines: Constraint Satisfaction Networks that Learn},
  institution = {CMU Computer Science Department},
  year = {1984},
  number = {CMS-CS-84-119},
  month = May,
  comment = {Uses simulated annealing to update propositional states in a connectionist
	Hopfield-like neural network.}
}

@INPROCEEDINGS{HiranoMaKi07,
  author = {T. Hirano and Y. Matsuo and G. Kikui},
  title = {Detecting Semantic Relations between Named Entities in Text Using
	Contextual Features},
  booktitle = ACL,
  year = {2007},
  pages = {157--160}
}

@ARTICLE{HiraokaAm98,
  author = {K. Hiraoka and S. Amari},
  title = {Strategy Under the Unknown Stochastic Environment: {T}he Nonparametric
	Lob-Pass Problem},
  journal = {Algorithmica},
  year = {1998},
  volume = {22},
  pages = {138--156},
  number = {1/2}
}

@INPROCEEDINGS{Hirata99,
  author = {Kouichi Hirata},
  title = {Flattening and Implication},
  booktitle = ALT,
  year = {1999},
  volume = {1720},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {157--168},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Hirata94,
  author = {K. Hirata},
  title = {Rule-generating abduction for recursive {P}rolog},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1994},
  pages = {121--136},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{HirowatariAr98,
  author = {E. Hirowatari and S. Arikawa},
  title = {A Comparison of Identification Criteria for Inductive Inference of
	Recursive Real-Valued Functions},
  booktitle = ALT,
  year = {1998},
  volume = {1501},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {262--275},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{HirowatariAr97,
  author = {Eiju Hirowatari and Setsuo Arikawa},
  title = {Inferability of recursive real-valued functions},
  booktitle = ALT,
  year = {1997},
  volume = {1316},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {18--31},
  publisher = {Springer-Verlag}
}

@INBOOK{HirschbergPaAl94,
  chapter = {2},
  pages = {15--28},
  title = {Average case analysis of k-{CNF} and k-{DNF} learning algorithms},
  publisher = {MIT Press},
  year = {1994},
  author = {Daniel S. Hirschberg and Michael J. Pazzani and Kamal M. Ali},
  volume = {II: Intersections Between Theory and Experiment},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@INCOLLECTION{Hirschman86,
  author = {L. Hirschman},
  title = {Discovering sublanguage structures},
  booktitle = {Analyzing Language in Restricted Domains: Sublanguage Description
	and Processing},
  publisher = {Lawrence Erlbaum Associates},
  year = {1986},
  editor = {R. Grishman and R. Kittredge},
  pages = {211--234}
}

@INPROCEEDINGS{HL00,
  author = {L. Hirschman and M. Light and E. Breck and J. Burger},
  title = {Deep Read: A Reading Comprehension System},
  booktitle = ACL,
  year = {1999}
}

@INPROCEEDINGS{HLBB99,
  author = {L. Hirschman and M. Light and E. Breck and J. Burger},
  title = {Deep Read: A Reading Comprehension System},
  booktitle = ACL,
  year = {1999}
}

@ARTICLE{Hirsh94,
  author = {Haym Hirsh},
  title = {Generalizing version spaces},
  journal = {Machine Learning},
  year = {1994},
  volume = {17},
  pages = {5--46},
  number = {1},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{Hirsh92,
  author = {Haym Hirsh},
  title = {Polynomial time learning with version spaces},
  booktitle = AAAI,
  year = {1992}
}

@INBOOK{HirshCo94,
  chapter = {12},
  pages = {355--380},
  title = {Learning from data with bounded inconsistency: theoretical and experimental
	results},
  publisher = {MIT Press},
  year = {1994},
  author = {Haym Hirsh and William W. Cohen},
  volume = {I: Constraints and Prospects},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@INPROCEEDINGS{Hirsh-noordewier94,
  author = {H. Hirsh and M. Noordewier},
  title = {Using Background Knowledge to Improve Learning of DNA Sequences},
  booktitle = {IEEE Conference on Artificial Intelligence for Applications},
  year = {1994}
}

@INPROCEEDINGS{HirshNo94,
  author = {H. Hirsh and M. Noordewier},
  title = {Using Background Knowledge to Improve Learning of DNA Sequences},
  booktitle = {IEEE Conference on Artificial Intelligence for Applications},
  year = {1994}
}

@ARTICLE{Hirst88,
  author = {Graeme Hirst},
  title = {Semantic interpretation and ambiguity},
  journal = AI,
  year = {1988},
  volume = {34},
  pages = {131--177}
}

@BOOK{Hirst87,
  title = {Semantic interpretation and the Disambiguation of Ambiguity},
  publisher = {Cambridge University Press},
  year = {1987},
  author = {Hirst, G.}
}

@INCOLLECTION{HirstSt98,
  author = {Hirst, G and St-Onge, D.},
  title = {Lexical chains as representations of context for the detection and
	correction of malapropisms},
  booktitle = {WordNet: An electronic lexical database},
  publisher = {MIT Press},
  year = {1998},
  editor = {C. Fellbaum},
  pages = {305--332}
}

@ARTICLE{HobbsStMaEd93,
  author = {Hobbs, J, R. and M. Stickel and P. Martin and D. Edwards},
  title = {Interpretation as Abduction},
  journal = {Artificial Intelligence},
  year = {1993},
  volume = {63},
  pages = {69-142}
}

@ARTICLE{HSME93,
  author = {Hobbs, J, R. and M. Stickel and P. Martin and D. Edwards},
  title = {Interpretation as Abduction},
  journal = {Artificial Intelligence},
  year = {1993},
  volume = {63},
  pages = {69-142}
}

@TECHREPORT{HobbsStMaEd90t,
  author = {Hobbs, J, R. and M. Stickel and P. Martin and D. Edwards},
  title = {Interpretation as Abduction},
  institution = {SRI International},
  year = {1990},
  number = {Technical Note 499},
  month = Dec
}

@INPROCEEDINGS{Hobbs92,
  author = {Hobbs, J, R. et al.},
  title = {Description of the {FASTUS} system used for {MUC}-4},
  booktitle = MUC,
  year = {1992},
  pages = {268-275}
}

@INPROCEEDINGS{Hobbsetal92,
  author = {Hobbs, J, R. et al.},
  title = {Description of the {FASTUS} system used for {MUC}-4},
  booktitle = MUC,
  year = {1992},
  pages = {268-275}
}

@INPROCEEDINGS{Hobbs90,
  author = {Jerry Hobbs and John Bear},
  title = {Two principles of parse preference},
  booktitle = COLING,
  year = {1990}
}

@INPROCEEDINGS{HobbsBe90,
  author = {Jerry Hobbs and John Bear},
  title = {Two principles of parse preference},
  booktitle = COLING,
  year = {1990}
}

@ARTICLE{Hobbs78,
  author = {Hobbs, J. R.},
  title = {Resolving pronoun references},
  journal = {Lingua},
  year = {1978},
  volume = {44},
  pages = {311--338}
}

@INPROCEEDINGS{Hobbs:88AC,
  author = {J. R. Hobbs and M. Stickel and P. Martin and D. Edwards},
  title = {Interpretation as Abduction},
  booktitle = ACL,
  year = {1988},
  pages = {95-103},
  keywords = {n-l-p, ling}
}

@INPROCEEDINGS{HSME88,
  author = {J. R. Hobbs and M. Stickel and P. Martin and D. Edwards},
  title = {Interpretation as Abduction},
  booktitle = ACL,
  year = {1988},
  pages = {95-103},
  keywords = {n-l-p, ling}
}

@ARTICLE{Hobby93,
  author = {John D. Hobby},
  title = {Generating Automatically Tuned Bitmaps from Outlines},
  journal = jacm,
  year = {1993},
  volume = {40},
  pages = {48-94},
  number = {1},
  month = jan,
  keywords = {Graphics; Algorithms; feature recognition; fonts; Lovasz basis reduction;
	scan-conversion; }
}

@ARTICLE{Hobby89,
  author = {John D. Hobby},
  title = {Rasterizing Curves of Constant Width},
  journal = jacm,
  year = {1989},
  volume = {36},
  pages = {209-229},
  number = {2},
  month = apr,
  keywords = {Computational Geometry; Algorithms; Verification; curve generation;
	scan conversion; }
}

@MISC{Hochbaum96,
  author = {D. Hochbaum},
  title = {Approximation Algorithms for NP-hard Problems},
  year = {1996},
  publisher = {PWS Publishing}
}

@ARTICLE{HochbaumPa98,
  author = {D. Hochbaum and A. Pathria},
  title = {Analysis of the Greedy Approach in Covering Problems},
  journal = {Naval Research Quarterly},
  year = {1998},
  volume = {45},
  pages = {615--627}
}

@ARTICLE{Hochbaum90,
  author = {Dorit S. Hochbaum and J. George Shanthikumar},
  title = {Convex Seperable Optimization is Not Much Harder than Linear Optimization},
  journal = jacm,
  year = {1990},
  volume = {37},
  pages = {843-862},
  number = {4},
  month = oct,
  keywords = {Operations Research; Algorithms; Decision; Theory; nonlinear optimization;
	proximity results; scaling algorithms; }
}

@ARTICLE{Hodges55,
  author = {J. Hodges},
  title = {A bivariate sign test},
  journal = {Annals of Math. Stat.},
  year = {1955},
  volume = {26},
  pages = {523-527}
}

@ARTICLE{Hoeffding63,
  author = {Wassily Hoeffding},
  title = {Probability inequalities for sums of bounded random variables},
  journal = {Journal of the American Statistical Association},
  year = {1963},
  volume = {58},
  pages = {13--30},
  number = {301},
  month = mar
}

@INPROCEEDINGS{Hofmann99,
  author = {T. Hofmann},
  title = {Probabilistic {L}atent {S}emantic {I}ndexing},
  booktitle = SIGIR,
  year = {1999},
  pages = {50--57},
  comments = {PLSI}
}

@INPROCEEDINGS{PLSI,
  author = {Thomas Hofmann},
  title = {Probabilistic {L}atent {S}emantic {I}ndexing},
  booktitle = SIGIR,
  year = {1999},
  pages = {50--57}
}

@INPROCEEDINGS{Hofmeister99,
  author = {Thomas Hofmeister},
  title = {An Application of Codes to Attribute-Efficient Learning},
  booktitle = EuroCOLT,
  year = {1999},
  volume = {1572},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {101--110},
  publisher = {Springer-Verlag}
}

@TECHREPORT{Hofstadter84,
  author = {Douglas Hofstadter},
  title = {The Copycat Project: An Experiment in Nondeterminism and Creative
	Analogies},
  institution = {MIT Artificial Intelligence Laboratory},
  year = {1984},
  number = {AIM-755},
  pages = {47},
  url = {citeseer.ist.psu.edu/hofstadter84copycat.html}
}

@INPROCEEDINGS{Hogan07,
  author = {Hogan, Deirdre},
  title = {Coordinate Noun Phrase Disambiguation in a Generative Parsing Model},
  booktitle = ACL,
  year = {2007},
  pages = {680--687},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1086}
}

@INPROCEEDINGS{HCCG07,
  author = {Hogan, Deirdre and Cafferkey, Conor and Cahill, Aoife and van Genabith,
	Josef},
  title = {Exploiting Multi-Word Units in History-Based Probabilistic Generation},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {267--276},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1028}
}

@BOOK{HoggCr95,
  title = {Introduction to Mathematical Statistics},
  publisher = {Prentice-Hall},
  year = {1995},
  author = {R. V. Hogg and A. T. Craig}
}

@INPROCEEDINGS{HoiJiLy07,
  author = {S. Hoi and R. Jin and M. Lyu},
  title = {Learning nonparametric kernel matrices from pairwise constraints},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {361--368},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{Holden96,
  author = {Sean B. Holden},
  title = {{PAC}-like upper bounds for the sample complexity of leave-one-out
	cross-validation},
  booktitle = COLT,
  year = {1996},
  pages = {41--50},
  publisher = {ACM Press, New York, NY}
}

@BOOK{Holland75,
  title = {Adaptation in Natural and Artificial Systems},
  publisher = {The University of Michigan Press},
  year = {1975},
  author = {John H. Holland}
}

@INPROCEEDINGS{HollingsheadRo07,
  author = {Hollingshead, Kristy and Roark, Brian},
  title = {Pipeline Iteration},
  booktitle = ACL,
  year = {2007},
  pages = {952--959},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1120}
}

@ARTICLE{Holte93,
  author = {Robert C. Holte},
  title = {Very Simple Classification Rules Perform Well on Most Commonly Used
	Datasets},
  journal = {Machine Learning},
  year = {1993},
  volume = {11},
  pages = {63--91},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{HolteAcPo89,
  author = {R. C. Holte and L. E. Acker and B. W. Porter},
  title = {Concept Learning and the Problem of Small Disjuncts},
  booktitle = IJCAI,
  year = {1989},
  address = {Detroit}
}

@BOOK{Holtzman89,
  title = {Intelligent Decision Systems},
  publisher = {Addison-Wesley},
  year = {1989},
  author = {Holtzman, S.},
  address = {Reading, MA}
}

@ARTICLE{Honavar92,
  author = {Vasant Honavar},
  title = {Neural Network Design and the Complexity of Learning},
  journal = {Machine Learning},
  year = {1992},
  volume = {9},
  pages = {95--98},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INCOLLECTION{Hopcroft71,
  author = {Hopcroft, John},
  title = {An $n\log(n)$ Algorithm for Minimizing States in a Finite Automaton},
  booktitle = {Theory of Machines and Computations},
  publisher = {Academic Press},
  year = {1971},
  editor = {Zvi Kohavi and Azaria Paz},
  pages = {189--196}
}

@BOOK{HopcroftUl79,
  title = {Introduction to Automata Theory, Languages, and Computation},
  publisher = {Addison-Wesley},
  year = {1979},
  author = {John Hopcroft and Jeffrey Ullman},
  address = {Reading, Mass.\ }
}

@ARTICLE{Hopfield82,
  author = {J. J. Hopfield},
  title = {Neural networks and physical systems with emergent collective computational
	abilities},
  journal = {Proc. Natl. Acad Sci. USA},
  year = {1982},
  volume = {79},
  pages = {2554--2558},
  month = apr
}

@BOOK{Hornby86,
  title = {Oxford Student's Dictionary for Hebrew Speakers},
  publisher = {Kernerman Publishing Ltd., Lonnie Kahn \& Co. Ltd.},
  year = {1986},
  author = {Hornby, A. S. and C. Ruse and J. A. Reif and Y. Levy}
}

@BOOK{HRRL86,
  title = {Oxford Student's Dictionary for Hebrew Speakers},
  publisher = {Kernerman Publishing Ltd., Lonnie Kahn \& Co. Ltd.},
  year = {1986},
  author = {Hornby, A. S. and C. Ruse and J. A. Reif and Y. Levy}
}

@ARTICLE{HornikStWh90,
  author = {K. Hornik and M. Stinchcombe and H. White},
  title = {Universal Approximation of an Unknown Mapping and Its Derivatives
	Using Multilayer Feedforward Networks},
  journal = {Neural Networks},
  year = {1990},
  volume = {3},
  pages = {551--560}
}

@PHDTHESIS{Horning69,
  author = {J. J. Horning},
  title = {A {S}tudy of {G}rammatical {I}nference},
  school = {Stanford University},
  year = {1969}
}

@INPROCEEDINGS{HortyTh88,
  author = {Horty, J. and R.Thomason},
  title = {Mixing strict and Defeasible Inference},
  booktitle = AAAI,
  year = {1988},
  publisher = {Morgan Kaufman}
}

@ARTICLE{HortyThTo90,
  author = {Horty, J. and R. Thomason and D. Touretzky},
  title = {A skeptical Theory of Inheritance in Nonmonotonic Semantic Networks},
  journal = {Artificial Intelligence},
  year = {1990},
  volume = {42},
  pages = {311--348}
}

@INPROCEEDINGS{HortyThTo87,
  author = {Horty, J. and R. Thomason and D. Touretzky},
  title = {A skeptical Theory of Inheritance in Nonmonotonic Semantic Networks},
  booktitle = AAAI,
  year = {1987},
  publisher = {Morgan Kaufman}
}

@INPROCEEDINGS{HorvitzSuCo89,
  author = {Eric Horvitz and Henri Jacques Suermondt and Gregory F. Cooper},
  title = {Bounded Conditioning: Flexible inference for decisions under scarce
	resources},
  booktitle = UAI,
  year = {1989},
  pages = {182-193},
  address = {Mountain View, CA},
  publisher = {Association for Uncertainty in Artificial Intelligence}
}

@INPROCEEDINGS{Horv'athSlTu97,
  author = {Tam{\'a}s Horv{\'a}th and Robert H. Sloan and Gy{\"o}rgy Tur{\'a}n},
  title = {Learning Logic Programs by using the Product Homomorphism Method},
  booktitle = COLT,
  year = {1997},
  pages = {10--20},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{Horv'ath:99,
  author = {M{\'a}rta Horv{\'a}th:},
  title = {On Error Estimation for the Partitioning Classification Rule},
  booktitle = EuroCOLT,
  year = {1999},
  volume = {1572},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {253--262},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{HothoStSt03,
  author = {A. Hotho and S. Staab and G. Stumme},
  title = {Ontologies Improve Text Document Clustering},
  booktitle = {ICDM},
  year = {2003},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@ARTICLE{HouleTo88,
  author = {M. E. Houle and G. T. Toussaint},
  title = {Computing the width of a set},
  journal = {IEEE Trans. Pattern Anal. Mach. Intell.},
  year = {1988},
  volume = {PAMI-10},
  pages = {761--765},
  number = {5}
}

@INPROCEEDINGS{HGHLR01,
  author = {E. Hovy and L. Gerber and U. Hermjakob and C. Lin and D. Ravichandran},
  title = {Toward Semantics-Based Answer Pinpointing},
  booktitle = HLT,
  year = {2001}
}

@INPROCEEDINGS{HovyGerber01,
  author = {E. Hovy and L. Gerber and U. Hermjakob and C. Lin and D. Ravichandran},
  title = {Toward Semantics-Based Answer Pinpointing},
  booktitle = HLT,
  year = {2001}
}

@INPROCEEDINGS{HMPRW06,
  author = {Hovy, E. and Marcus, M. and Palmer, M. and Ramshaw, L. and Weischedel,
	R.},
  title = {OntoNotes: The 90\% Solution},
  booktitle = HLT-NAACL,
  year = {2006},
  address = {New York}
}

@ARTICLE{Hsiang91,
  author = {Jieh Hsiang and Micha{\"e}l Rusinowitch},
  title = {Proving Refutational Completeness of Theorem-Proving Strategies:
	The Transfinite Semantic Tree Method},
  journal = jacm,
  year = {1991},
  volume = {38},
  pages = {559-587},
  number = {3},
  month = jul,
  keywords = {Logic; Theory; refutational theorem proving strategies; transfinite
	ordinals; transfinite semantic trees; resolution; complete simplification
	orderings; completeness; first-order logic with equality; functional
	reflexive axioms; paramodulation; }
}

@INPROCEEDINGS{HCLKS08,
  author = {C.-J. Hsieh and K.-W. Chang and C.-J. Lin and S. S. Keerthi and S.
	Sundararajan},
  title = {A dual coordinate descent method for large-scale linear SVM},
  booktitle = ICML,
  year = {2008},
  address = {New York, NY, USA},
  publisher = {ACM},
  doi = {http://doi.acm.org/10.1145/1390156.1390208},
  isbn = {978-1-60558-205-4},
  location = {Helsinki, Finland}
}

@TECHREPORT{HsuChLi06,
  author = {C. Hsu and C. Chang and C. Lin},
  title = {A Practical Guide to Support Vector Classification},
  institution = {Dept of Computer Science, National Taiwan University},
  year = {2006}
}

@INPROCEEDINGS{HsuKn94,
  author = {Chun-Nan Hsu and Craig A. Knoblock},
  title = {Rule induction for semantic query optimization},
  booktitle = ICML,
  year = {1994},
  pages = {112--120},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{HsuRaWi00,
  author = {William H. Hsu and Sylvian R. Ray and David C. Wilkins},
  title = {A Multistrategy Approach to Classifier Learning from Time Series},
  journal = {Machine Learning},
  year = {2000},
  volume = {38},
  pages = {213--236},
  number = {1/2},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{HsuehMo07,
  author = {Hsueh, Pei-Yun and Moore, Johanna D.},
  title = {Combining Multiple Knowledge Sources for Dialogue Segmentation in
	Multimedia Archives},
  booktitle = ACL,
  year = {2007},
  pages = {1016--1023},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1128}
}

@INPROCEEDINGS{HuWe98,
  author = {Junling Hu and Michael P. Wellman},
  title = {Multiagent reinforcement learning: theoretical framework and an algorithm},
  booktitle = ICML,
  year = {1998},
  pages = {242--250},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{HuWaWu07,
  author = {Hu, Xiaoguang and Wang, Haifeng and Wu, Hua},
  title = {Using {RBMT} Systems to Produce Bilingual Corpus for {SMT}},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {287--295},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1030}
}

@INPROCEEDINGS{HuSaKi99,
  author = {Yuh-Jyh Hu and Suzanne Sandmeyer and Dennis Kibler},
  title = {Detecting motifs from sequences},
  booktitle = ICML,
  year = {1999},
  pages = {181--190},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@TECHREPORT{HuaKo84,
  author = {C. Hua and K. Ko},
  title = {A note on the Pattern-finding Problem},
  institution = {Department of Computer Science, University of Houston},
  year = {1984},
  number = {UH-CS-84-4}
}

@INPROCEEDINGS{HuangPa07,
  author = {Huang, Fei and Papineni, Kishore},
  title = {Hierarchical System Combination for Machine Translation},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {277--286},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1029}
}

@INPROCEEDINGS{HuangYa09,
  author = {Huang, Fei and Yates, Alexander},
  title = {Distributional Representations for Handling Sparsity in Supervised
	Sequence-Labeling},
  booktitle = ACL,
  year = {2009},
  pages = {495--503},
  address = {Suntec, Singapore},
  month = {August},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P09/P09-1056}
}

@INPROCEEDINGS{Huang08,
  author = {L. Huang},
  title = {Forest reranking: Discriminative parsing with non-local features},
  booktitle = ACL,
  year = {2008}
}

@INPROCEEDINGS{HuangCh07,
  author = {Huang, Liang and Chiang, David},
  title = {Forest Rescoring: Faster Decoding with Integrated Language Models},
  booktitle = ACL,
  year = {2007},
  pages = {144--151},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1019}
}

@INPROCEEDINGS{HuangHaWa07,
  author = {Huang, Zhongqiang and Harper, Mary and Wang, Wen},
  title = {{Mandarin} Part-of-Speech Tagging and Discriminative Reranking},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {1093--1102},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1117}
}

@ARTICLE{Hubbard95,
  author = {P. M. Hubbard},
  title = {Collision detection for interactive graphics applications},
  journal = {IEEE Trans. Visualization and Computer Graphics},
  year = {1995},
  volume = {1},
  pages = {218--230},
  number = {3},
  month = sep,
  keywords = {collision detection, intersection detection, sphere trees}
}

@ARTICLE{Huber,
  author = {Peter J. Huber},
  title = {Projection Pursuit},
  journal = {Annals of Statistics},
  volume = {13},
  pages = {435--475},
  number = {2}
}

@INPROCEEDINGS{Huckle95,
  author = {C. C. Huckle},
  title = {Grouping Words Using Statistical Context},
  booktitle = EACL,
  year = {1995},
  comment = {Gives a good intro on the importance and psychological plausibility
	of word grouping}
}

@INPROCEEDINGS{HughesRa07,
  author = {Hughes, Thad and Ramage, Daniel},
  title = {Lexical Semantic Relatedness with Random Graph Walks},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {581--589},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1061}
}

@MISC{Hume1737,
  author = {D. Hume},
  title = {{T}reatise on {H}uman {N}ature},
  year = {1737}
}

@INPROCEEDINGS{HuttenlocherKeKl92,
  author = {D. Huttenlocher and K. Kedem and J. Kleinberg.},
  title = {{On dynamic {Voronoi} diagrams and the minimum Hausdorff distance
	for point sets under Euclidean motion in the plane}},
  booktitle = {SOCG},
  year = {1992},
  pages = {110--119}
}

@ARTICLE{HuttenlocherKeKl92a,
  author = {D. P. Huttenlocher and K. Kedem and J. M. Kleinberg},
  title = {Voronoi diagrams of rigidly moving sets of points},
  journal = IPL,
  year = {1992},
  volume = {43},
  pages = {217--223}
}

@ARTICLE{HuttenlocherKeSh93,
  author = {D. P. Huttenlocher and K. Kedem and M. Sharir},
  title = {The upper envelope of {Voronoi} surfaces and its applications},
  journal = DCG,
  year = {1993},
  volume = {9},
  pages = {267--291}
}

@ARTICLE{HwangLeCh93,
  author = {R. Z. Hwang and R. C. T. Lee and R. C. Chang},
  title = {The slab dividing approach to solve the {Euclidean} $p$-center problem},
  journal = {Algorithmica},
  year = {1993},
  volume = {9},
  pages = {1--22}
}

@ARTICLE{HyafilRi76,
  author = {Hyafil, Laurent and Ronald L. Rivest},
  title = {Constructing Optimal Binary Decision Trees is {NP}-Complete},
  journal = {Information Processing Letters},
  year = {1976},
  volume = {5},
  pages = {15--17},
  number = {1},
  month = May,
  comment = {Proof based on exact-cover by 3-subsets.}
}

@INPROCEEDINGS{Hoffgen93,
  author = {K. H{\"o}ffgen},
  title = {Learning and robust learning of product distributions},
  booktitle = COLT,
  year = {1993},
  pages = {77--83},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{HoffgenSi92,
  author = {K. H{\"o}ffgen and H. Simon},
  title = {Robust trainability of single neurons},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1992},
  pages = {428--439},
  address = {New York, New York},
  publisher = {ACM Press}
}

@ARTICLE{HoffgenSiHo95,
  author = {Klaus-U. H{\"o}ffgen and Hans-U. Simon and Kevin S. Van Horn},
  title = {Robust trainability of single neurons},
  journal = {J. of Comput. Syst. Sci.},
  year = {1995},
  volume = {50},
  pages = {114--125},
  number = {1}
}

@ARTICLE{Iba89,
  author = {Glenn A. Iba},
  title = {A Heuristic Approach to the Discovery of Macro-operators},
  journal = {Machine Learning},
  year = {1989},
  volume = {3},
  pages = {285--317},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{IbarraJi88,
  author = {O. H. Ibarra and T. Jiang},
  title = {Learning regular languages from counterexamples},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1988},
  pages = {371--385},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{Idestam-Almquist97,
  author = {Peter Idestam-Almquist},
  title = {Generalization of Clauses Relative to a Theory},
  journal = {Machine Learning},
  year = {1997},
  volume = {26},
  pages = {213--226},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{IfteneMo09,
  author = {Iftene, A. and Moruz, M.-A.},
  title = {UAIC Participation at RTE5},
  booktitle = TAC,
  year = {2009},
  pages = {367--376}
}

@INPROCEEDINGS{DaumMa05,
  author = {Hal Daum\'{e} III and Daniel Marcu},
  title = {Learning as Search Optimization: Approximate Large Margin Methods
	for Structured Prediction},
  booktitle = ICML,
  year = {2005},
  address = {Bonn, Germany},
  url = {http://pub.hal3.name/#daume05laso}
}

@INPROCEEDINGS{IYYK99,
  author = {Daisuke Iijima and Wenwei Yu and Hiroshi Yokoi and Yukinori Kakazu},
  title = {Distributed robotic learning: adaptive behavior acquisition for distributed
	autonomous swimming robot in real-world},
  booktitle = ICML,
  year = {1999},
  pages = {191--199},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INCOLLECTION{ImaiIr88,
  author = {H. Imai and M. Iri},
  title = {Polygonal approximations of a curve-formulations and algorithms },
  booktitle = {Computational Morphology},
  publisher = {North-Holland},
  year = {1988},
  editor = {G. T. Toussaint},
  pages = {71--86},
  address = {Amsterdam, Netherlands},
  antnote = {curve simplification}
}

@ARTICLE{Imielinski91,
  author = {Tinasz Imielinski},
  title = {Abstraction in Query Processing},
  journal = jacm,
  year = {1991},
  volume = {38},
  pages = {534-558},
  number = {3},
  month = jul,
  keywords = {Database Theory; Management; Theory; chase procedure; data dependencies;
	incomplete information; }
}

@INPROCEEDINGS{InabaKaIm94,
  author = {M.~Inaba and N.~Katoh and H.~Imai},
  title = {Applications of weighted Voronoi diagrams and randomization to variance-based
	$k$-clustering},
  booktitle = {SOCG},
  year = {1994},
  pages = {332--339}
}

@ARTICLE{Indurkhya91,
  author = {B. Indurkhya},
  title = {On the Role of Interpretive Analogy in Learning},
  journal = {New Generation Computing},
  year = {1991},
  volume = {8},
  pages = {385--402},
  number = {4}
}

@INPROCEEDINGS{Indyk01,
  author = {P. Indyk},
  title = {Algorithmic applications of low-distortion geometric embeddings},
  booktitle = FOCS,
  year = {2001},
  pages = {10--31},
  note = {Tutorial}
}

@INPROCEEDINGS{Indyk00,
  author = {P. Indyk},
  title = {Dimensionality Reduction Techniques for Proximity Problems},
  booktitle = SODA,
  year = {2000},
  pages = {371--378},
  url = {http://theory.lcs.mit.edu/~indyk/proxy99.ps}
}

@INPROCEEDINGS{Indyk99,
  author = {P. Indyk},
  title = {Sublinear time algorithms for metric space problems},
  booktitle = STOC,
  year = {1999},
  pages = {154--159}
}

@INPROCEEDINGS{Indyk99a,
  author = {Piotr Indyk},
  title = {A {PTAS} for Clustering in Metric Spaces},
  booktitle = FOCS,
  year = {1999},
  pages = {??--??},
  publisher = {IEEE Computer Society Press, Los Alamitos, CA}
}

@INPROCEEDINGS{Indyk99b,
  author = {P. Indyk},
  title = {A sublinear time approximation scheme for clustering in metric spaces},
  booktitle = FOCS,
  year = {1999},
  note = {100-110},
  nickname = {FOCS '99}
}

@INPROCEEDINGS{IndykMo98,
  author = {P. Indyk and R. Motwani},
  title = {Approximate Nearest Neighbors: {Towards} Removing the Curse of Dimensionality},
  booktitle = STOC,
  year = {1998},
  pages = {604--613},
  url = {http://theory.lcs.mit.edu/~indyk/nndraft.ps}
}

@UNPUBLISHED{IndykTh00,
  author = {P. Indyk and M. Thorup},
  title = {Approximate $1$-median},
  note = {manuscript},
  year = {2000}
}

@INPROCEEDINGS{Intrator90,
  author = {N. Intrator},
  title = {Feature Extraction Using an Unsupervised Neural Network},
  booktitle = {Connectionist Models Summer School},
  year = {1990},
  pages = {310--318},
  publisher = {Morgan Kaufmann.},
  comment = {this article uses exploratory projection pursuit, it gives a model
	for the behaviour of BCM neurons described by Bienestock, Cooper
	and Munro}
}

@ARTICLE{Ioannidis91,
  author = {Yannis E. Ioannidis and Eugene Wong},
  title = {Towards and Algebraic Theory of Recursion},
  journal = jacm,
  year = {1991},
  volume = {38},
  pages = {329-381},
  number = {2},
  month = apr,
  keywords = {Database Theory; Languages; Theory; closed semirings; deductive databases;
	query optimization; recursion; }
}

@ARTICLE{IoergerReSu95,
  author = {Thomas R. Ioerger and Larry A. Rendell and Shankar Subramaniam},
  title = {Searching for Representations to Improve Protein Sequence Fold-Class
	Prediction},
  journal = {Machine Learning},
  year = {1995},
  volume = {21},
  pages = {151--175},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{IrelandKu68,
  author = {Ireland, C.T. and S. Kullback},
  title = {Contingency tables with given marginals},
  journal = {Biometrika},
  year = {1968},
  volume = {55},
  pages = {179--188},
  number = {1},
  comment = {Proves geometric convergence of Deming/Stephan procedure for computing
	maximum entropy solution.}
}

@BOOK{IsaacsonMa76,
  title = {Markov Chains: Theory and Applications},
  publisher = {John Wiley \& Sons},
  year = {1976},
  author = {Isaacson, Dean L. and Richard W. Madsen}
}

@INPROCEEDINGS{Isabelle92,
  author = {P. Isabelle},
  title = {Bi-textual aids for translators},
  booktitle = UWOED,
  year = {1992}
}

@INPROCEEDINGS{IDFJMPRS93,
  author = {Isabelle, P. and M. Dymetman and G. Foster and J.-M. Jutras and E.
	Macklovitch and F. Perrault and X. Ren and M. Simard},
  title = {Translation Analysis and Translation Automation},
  booktitle = TMI,
  year = {1993},
  pages = {201--217},
  place = {Kyoto}
}

@INPROCEEDINGS{Isabelle93,
  author = {Isabelle, P. and M. Dymetman and G. Foster and J.-M. Jutras and E.
	Macklovitch and F. Perrault and X. Ren and M. Simard},
  title = {Translation Analysis and Translation Automation},
  booktitle = TMI,
  year = {1993},
  pages = {201--217},
  place = {Kyoto}
}

@INPROCEEDINGS{IshigamiTa93,
  author = {Y. Ishigami and S. Tani},
  title = {The {VC} dimensions of finite automata with $n$ states},
  booktitle = {International Workshop on Analogical and Inductive Inference and
	International Workshop on Algorithmic Learning Theory},
  year = {1993},
  volume = {744},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {328--341},
  publisher = {Springer-Verlag}
}

@ARTICLE{IshinoYa97,
  author = {A. Ishino and A. Yamamoto},
  title = {Generalizations in Typed Equational Programming and Their Application
	to Learning Functions},
  journal = {New Generation Computing},
  year = {1997},
  volume = {15},
  pages = {85--104},
  number = {1},
  note = {Special issue for AII '94 and ALT '94}
}

@INPROCEEDINGS{IshinoYa94,
  author = {A. Ishino and A. Yamamoto},
  title = {Learning from examples with typed equational programming},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1994},
  pages = {301--316},
  publisher = {Springer-Verlag}
}

@ARTICLE{Ishizaka90,
  author = {H. Ishizaka},
  title = {Polynomial time learnability of simple deterministic languages},
  journal = {Machine Learning},
  year = {1990},
  volume = {5},
  pages = {151--164},
  number = {2},
  note = {Special Issue on Computational Learning Theory; first appeared in
	2nd COLT conference (1989)},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{Ishizaka89,
  author = {H. Ishizaka},
  title = {Learning simple deterministic languages},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1989},
  pages = {162--174},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{IshizakaArSh98,
  author = {Hiroki Ishizaka and Hiroki Arimura and Takeshi Shinohara},
  title = {Finding tree patterns consistent with positive and negative examples
	using queries},
  journal = {Annals of Mathematics and Artificial Intelligence},
  year = {1998},
  volume = {23},
  pages = {101--115},
  number = {1/2},
  note = {Special issue for AII '94 and ALT '94}
}

@INPROCEEDINGS{IshizakaArSh93,
  author = {H. Ishizaka and H. Arimura and T. Shinohara},
  title = {Efficient inductive inference of primitive prologs from positive
	data},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1993},
  volume = {743},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {135--146},
  publisher = {Springer-Verlag}
}

@INCOLLECTION{Israel85,
  author = {Israel, D.},
  title = {A short companion to the Naive Physics Manifesto},
  booktitle = {Formal theories of the commonsense world},
  publisher = {Ablex Publishing Corporation},
  year = {1985},
  editor = {J. R. Hobbs and R. C. Moore}
}

@ARTICLE{ItoAmKo92,
  author = {H. Ito and S.-I. Amari and K. Kobayashi},
  title = {Identifiability of Hidden {M}arkov Information Sources and their
	Minimum Degrees of Freedom},
  journal = {IEEE Trans. Information Theory},
  year = {1992},
  volume = {38},
  pages = {324--333},
  number = {2},
  month = Mar
}

@INPROCEEDINGS{ItoYa93,
  author = {K. Ito and A. Yamamoto},
  title = {Polynomial-time {MAT} learning of multilinear logic programs},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1993},
  volume = {743},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {63--74},
  publisher = {Springer-Verlag}
}

@ARTICLE{Itoga81,
  author = {S. Y. Itoga},
  title = {A new heuristic for inferring regular grammars},
  journal = {IEEE Trans. Pattern Anal. Mach. Intell.},
  year = {1981},
  volume = {TPAMI-3},
  pages = {191--197}
}

@INPROCEEDINGS{IttnerSc96,
  author = {Andreas Ittner and Michael Schlosser},
  title = {Non-linear decision trees -- {NDT}},
  booktitle = ICML,
  year = {1996},
  pages = {252--258},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{ItFrZhRa00,
  author = {A. Ittycheriah and M. Franz and W. Zhu and A. Ratnaparkhi},
  title = {IBM's Statistical Question Answering System},
  booktitle = TREC,
  year = {2000}
}

@INPROCEEDINGS{IFZRM01,
  author = {A. Ittycheriah and M. Franz and W-J Zhu and A. Ratnaparkhi and R.J.
	Mammone},
  title = {{IBM}'s Statistical Question Answering System},
  booktitle = TREC,
  year = {2001}
}

@INPROCEEDINGS{Ittycheriah01,
  author = {A. Ittycheriah and M. Franz and W-J Zhu and A. Ratnaparkhi and R.J.
	Mammone},
  title = {{IBM}'s Statistical Question Answering System},
  booktitle = TREC,
  year = {2001}
}

@INPROCEEDINGS{ITIO94,
  author = {T. Iwatani and S. Tano and A. Inoue and W. Okamoto},
  title = {Fuzzy analogy based reasoning and classification of fuzzy analogies},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1994},
  pages = {137--148},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{IwayamaInMo93,
  author = {M. Iwayama and N. Indurkhya and H. Motoda},
  title = {A new algorithm for automatic configuration of hidden {M}arkov models},
  booktitle = {International Workshop on Analogical and Inductive Inference and
	International Workshop on Algorithmic Learning Theory},
  year = {1993},
  volume = {744},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {237--250},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Iwayama-tokunaga94,
  author = {M. Iwayama and T. Tokunaga},
  title = {A probabilistic model for text categorization based on a single random
	variable with multiple values},
  booktitle = {Conference on Applied Natural Language Processing},
  year = {1994}
}

@INPROCEEDINGS{IwayamaTo94,
  author = {M. Iwayama and T. Tokunaga},
  title = {A probabilistic model for text categorization based on a single random
	variable with multiple values},
  booktitle = {Conference on Applied Natural Language Processing},
  year = {1994}
}

@INPROCEEDINGS{J.St98,
  author = { {J. Case, S. Jain, S. Kaufmann, A. Sharma and F. Stephan}},
  title = {Predictive Learning Models for Concept Drift},
  booktitle = ALT,
  year = {1998},
  volume = {1501},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {276--290},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Jackson00,
  author = {Jeffrey Jackson},
  title = {On the Efficiency of Noise-Tolerant {PAC} Algorithms Derived from
	Statistical Queries},
  booktitle = COLT,
  year = {2000},
  pages = {7--15},
  publisher = {Morgan Kaufmann, San Francisco}
}

@INPROCEEDINGS{Jackson94,
  author = {Jackson, J. },
  title = {An Efficient Membership-Query Algorithm for Learning {DNF} with Respect
	to the Uniform Distribution},
  booktitle = FOCS,
  year = {1994},
  pages = {42--53}
}

@INPROCEEDINGS{JacksonTo92,
  author = {Jackson, Jeffrey and Tomkins, Andrew},
  title = {A Computational Model of Teaching},
  booktitle = COLT,
  year = {1992},
  pages = {319--326},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{Jackson97,
  author = {Jeffrey C. Jackson},
  title = {An efficient membership-query algorithm for learning {DNF} with respect
	to the uniform distribution},
  journal = {J. Comput. Syst. Sci.},
  year = {1997},
  volume = {55},
  pages = {414--440},
  number = {3},
  note = {Earlier version appeared in FOCS '94}
}

@INPROCEEDINGS{Jacobs92,
  author = {P. Jacobs},
  title = {Joining statistics with {NLP} for text categorization},
  booktitle = {Conference on Applied Natural Language Processing},
  year = {1992}
}

@TECHREPORT{JacobsJoBa90,
  author = {Jacobs, Robert A. and Michael A. Jordan and Andrew G. Barto},
  title = {Task decomposition through competition in a modular connectionist
	architecture: The what and where vision tasks},
  institution = {COINS},
  year = {1990},
  number = {90-27},
  month = Mar,
  tag = {TOC-display}
}

@ARTICLE{JacobsJoHi91,
  author = {Jacobs, R. A. and M. I. Jordan and S. J. Nowlan and G. H. Hinton},
  title = {Adaptive mixture of local experts},
  journal = {Neural Computation},
  year = {1991},
  volume = {108},
  pages = {212--261}
}

@BOOK{Jacobson74,
  title = {Basic Algebra},
  publisher = {W. H. Freeman and Company},
  year = {1974},
  author = {Jacobson, Nathan},
  volume = {1},
  comment = {Classic abstract algebra text}
}

@ARTICLE{JadhavMu94,
  author = {S. Jadhav and A. Mukhopadhyay},
  title = {Computing a centerpoint of a finite planar set of points in linear
	time},
  journal = DCG,
  year = {1994},
  volume = {12},
  pages = {291--312}
}

@INPROCEEDINGS{Jaeger07,
  author = {M. Jaeger},
  title = {Parameter learning for relational {Bayesian} networks},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {369--376},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{Jaeger97,
  author = {Jaeger, M.},
  title = {Relational {{Bayesian}} Networks},
  booktitle = UAI,
  year = {1997},
  editor = {Morgan Kaufmann},
  pages = {266--273},
  url = {citeseer.nj.nec.com/jaeger97relational.html}
}

@ARTICLE{Jaeger06,
  author = {M. Jaeger and J. D. Nielsen and T. Silander},
  title = {Learning probabilistic decision graphs},
  journal = {Int. J. Approx. Reasoning},
  year = {2006},
  volume = {42},
  pages = {84-100},
  number = {1-2}
}

@ARTICLE{Jaffar90,
  author = {Joxan Jaffar},
  title = {Minimal and Complete Word Unification},
  journal = jacm,
  year = {1990},
  volume = {37},
  pages = {47-85},
  number = {1},
  month = jan,
  keywords = {Formal Languages; Algorithms; Theory; unification; word problems;}
}

@INPROCEEDINGS{JagadishMaNg99,
  author = {H. V. Jagadish and J. Madar and R. T. Ng},
  title = {Semantic Compression and Pattern Extraction with Fascicles},
  booktitle = {VLDB'99},
  year = {1999},
  editor = {M.P.~Atkinson and M.E.~Orlowska and P.~Valduriez and S.B. Zdonik
	and M.L.~Brodie},
  pages = {186--198},
  publisher = {Morgan Kaufmann},
  isbn = {1-55860-615-5}
}

@INPROCEEDINGS{JagadishNg00,
  author = {H. V. Jagadish and R. T. Ng},
  title = {Incompleteness in Data Minning},
  booktitle = DMKD,
  year = {2000},
  pages = {1--10}
}

@ARTICLE{Jain99,
  author = {S. Jain},
  title = {On a question of nearly minimal identification of functions},
  journal = {Inform. Process. Lett.},
  year = {1999},
  volume = {70},
  pages = {113--117},
  number = {3}
}

@ARTICLE{Jain99a,
  author = {S. Jain},
  title = {Robust behaviorally correct learning},
  journal = {Inform. Comput.},
  year = {1999},
  volume = {153},
  pages = {238--248},
  number = {2}
}

@ARTICLE{Jain98,
  author = {Sanjay Jain},
  title = {Learning with Refutation},
  journal = {J. Comput. Syst. Sci.},
  year = {1998},
  volume = {57},
  pages = {256--365},
  number = {3},
  note = {First appeared in ALT '98}
}

@ARTICLE{Jain96,
  author = {Sanjay Jain},
  title = {Program Synthesis in the Presence of Infinite Number of Inaccuracies},
  journal = {J. Comput. Syst. Sci.},
  year = {1996},
  volume = {53},
  pages = {583--591},
  number = {3},
  note = {First appeared in ALT '94}
}

@ARTICLE{Jain95,
  author = {S. Jain},
  title = {On a Question about Learning Nearly Minimal Programs},
  journal = {Inform. Proc. Lett.},
  year = {1995},
  volume = {53},
  pages = {1--4},
  number = {1}
}

@PHDTHESIS{Jain90,
  author = {S. Jain},
  title = {Learning in the Presence of Additional Information and Inaccurate
	Information},
  school = {University of Rochester},
  year = {1990}
}

@ARTICLE{JKLWZ00,
  author = {Sanjay Jain and Efim Kinber and Steffen Lange and Rolf Wiehagen and
	Thomas Zeugmann},
  title = {Learning languages and functions by erasing},
  journal = {Theoret. Comput. Sci.},
  year = {2000},
  volume = {241},
  pages = {143--189},
  number = {1-2},
  note = {Special issue for ALT '96}
}

@INPROCEEDINGS{JainKiWi00,
  author = {Sanjay Jain and Efim Kinber and Rolf Wiehagen},
  title = {Language Learning From Texts: {D}egrees of Instrinsic Complexity
	and Their Characterizations},
  booktitle = COLT,
  year = {2000},
  pages = {47--58},
  publisher = {Morgan Kaufmann, San Francisco}
}

@INPROCEEDINGS{JainKiWi96,
  author = {Sanjay Jain and Efim Kinber and Rolf Wiehagen},
  title = {On learning and co-learning of minimal programs},
  booktitle = ALT,
  year = {1996},
  volume = {1160},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {242--255},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{JainLaNe97,
  author = {Sanjay Jain and Steffen Lange and Jochen Nessel},
  title = {Learning of {r.e.} languages from good examples},
  booktitle = ALT,
  year = {1997},
  volume = {1316},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {32--47},
  publisher = {Springer-Verlag}
}

@BOOK{JORS99,
  title = {Systems that Learn: An Introduction to Learning Theory, second edition},
  publisher = {MIT Press},
  year = {1999},
  author = {Sanjay Jain and Daniel Osherson and James S. Royer and Arun Sharma},
  address = {Cambridge, Massachusetts},
  isbn = {0-262-10077-0}
}

@INPROCEEDINGS{JainSh99,
  author = {Sanjay Jain and Arun Sharma},
  title = {On a generalized notion of mistake bounds},
  booktitle = COLT,
  year = {1999},
  pages = {249--256},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{JainSh99a,
  author = {Sanjay Jain and Arun Sharma},
  title = {Mind Change Complexity of Learning Logic Programs},
  booktitle = EuroCOLT,
  year = {1999},
  volume = {1572},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {198--213},
  publisher = {Springer-Verlag}
}

@ARTICLE{JainSh98,
  author = {Sanjay Jain and Arun Sharma},
  title = {Generalization and specialization strategies for learning r.e. languages},
  journal = {Annals of Mathematics and Artificial Intelligence},
  year = {1998},
  volume = {23},
  pages = {1--26},
  number = {1/2},
  note = {Special issue for AII '94 and ALT '94}
}

@INPROCEEDINGS{JainSh96,
  author = {Sanjay Jain and Arun Sharma},
  title = {Elementary formal systems, intrinsic complexity, and procrastination},
  booktitle = COLT,
  year = {1996},
  pages = {181--192},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{JainSh95,
  author = {S. Jain and A. Sharma},
  title = {On Aggregating Teams of Learning Machines},
  journal = {Theoret. Comput. Sci.},
  year = {1995},
  volume = {137},
  pages = {85--108},
  number = {1},
  note = {Special Issue for ALT '93}
}

@INCOLLECTION{JainSh95a,
  author = {Sanjay Jain and Arun Sharma},
  title = {On identification by teams and probabilistic machines},
  booktitle = {Algorithmic Learning for Knowledge-Based Systems},
  publisher = {Springer--Verlag},
  year = {1995},
  volume = {961},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {108--145}
}

@ARTICLE{JainSh95b,
  author = {S. Jain and A. Sharma},
  title = {Prudence in Vacillatory Language Identification},
  journal = {Math. Syst. Theory},
  year = {1995},
  volume = {28},
  annote = {Earlier version in {\it Proc. of the Third Workshop on Algorithmic
	Learning Theory} in 1992}
}

@INPROCEEDINGS{JainSh95c,
  author = {S. Jain and A. Sharma},
  title = {The Structure of Intrinsic Complexity of Learning},
  booktitle = EuroCOLT,
  year = {1995},
  month = mar,
  publisher = {Springer-Verlag}
}

@ARTICLE{JainSh94,
  author = {Sanjay Jain and Arun Sharma},
  title = {Characterizing language identification by standardizing operations},
  journal = {J. of Comput. Syst. Sci.},
  year = {1994},
  volume = {49},
  pages = {96--107},
  number = {1},
  annote = {Was in {\sl Advances in Computing and Information, Proceedings of
	the International Conference on Computing and Information, Niagara
	Falls, Canada} in 1990}
}

@INPROCEEDINGS{JainSh94a,
  author = {S. Jain and A. Sharma},
  title = {On the intrinsic complexity of language identification},
  booktitle = COLT,
  year = {1994},
  pages = {278--286},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{JainSh94b,
  author = {S. Jain and A. Sharma},
  title = {On monotonic strategies for learning r.e.\ languages},
  booktitle = ALT-AII,
  year = {1994},
  pages = {349--364},
  month = oct,
  publisher = {Springer Verlag},
  note = {Lecture Notes in AI 872}
}

@ARTICLE{JainSh94c,
  author = {S. Jain and A. Sharma},
  title = {Program Size Restrictions in Computational Learning},
  journal = {Theoret. Comput. Sci. A},
  year = {1994},
  volume = {127},
  pages = {351--386}
}

@TECHREPORT{JainSh93,
  author = {S. Jain and A. Sharma},
  title = {Computational Limits on Team Identification of Languages},
  institution = {School of Computer Science and Engineering; University of New South
	Wales},
  year = {1993},
  number = {9301}
}

@ARTICLE{JainSh93a,
  author = {S. Jain and A. Sharma},
  title = {Learning with the Knowledge of an Upper Bound on Program Size},
  journal = {Inform. Comput.},
  year = {1993},
  volume = {102--1},
  pages = {118--166},
  note = {Presented at the Workshop on Computational Learning Theory and Natural
	Learning Systems}
}

@ARTICLE{JainSh93b,
  author = {S. Jain and A. Sharma},
  title = {On the non-existence of maximal inference degrees for language identification},
  journal = {Inform. Proc. Lett.},
  year = {1993},
  volume = {47--2},
  pages = {81--88}
}

@INPROCEEDINGS{JainSh93c,
  author = {S. Jain and A. Sharma},
  title = {Probability is more powerful than team for language identification
	from positive data},
  booktitle = COLT,
  year = {1993},
  pages = {192--198},
  address = {New York, New York},
  publisher = {ACM Press}
}

@ARTICLE{JainSh91,
  author = {S. Jain and A. Sharma},
  title = {Learning in the Presence of Partial Explanations},
  journal = {Inform. Comput.},
  year = {1991},
  volume = {95-2},
  pages = {162--191},
  annote = {Also Univ. of Rochester TR 282 in 1989}
}

@INPROCEEDINGS{JainSh91a,
  author = {S. Jain and A. Sharma},
  title = {Restrictions on Grammar Size in Language Identification},
  booktitle = {Proceedings MLNLO'91, Machine Learning of Natural Language and Ontology,
	Stanford University, California. Document {\bf D91-09}, DFKI: Kaiserslautern
	FRG, 1991},
  year = {1991},
  pages = {87--92},
  month = mar
}

@INPROCEEDINGS{JainSh90,
  author = {S. Jain and A. Sharma},
  title = {Finite learning by a {\sl team}},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1990},
  pages = {163--177},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{JainSh90a,
  author = {S. Jain and A. Sharma},
  title = {Hypothesis Formation and Language Acquisition with an Infinitely
	Often Correct Teacher},
  booktitle = {Conference on Theoretical Aspects of Reasoning About Knowledge},
  year = {1990},
  pages = {225--239},
  month = mar,
  publisher = {Morgan Kaufmann, Inc.}
}

@INPROCEEDINGS{JainSh90b,
  author = {S. Jain and A. Sharma},
  title = {Language Learning by a Team},
  booktitle = ICALP,
  year = {1990},
  pages = {153--166},
  month = jul,
  publisher = {Springer-Verlag}
}

@TECHREPORT{JainSh90c,
  author = {S. Jain and A. Sharma},
  title = {Program Size Restrictions in Inductive Learning},
  institution = {University of Delaware, Newark, Delaware},
  year = {1990},
  number = {90-06}
}

@TECHREPORT{JainSh89,
  author = {S. Jain and A. Sharma},
  title = {Knowledge of an Upper Bound on Grammar Size Helps Language Learning},
  institution = {University of Rochester},
  year = {1989},
  number = {283}
}

@TECHREPORT{JainSh89a,
  author = {S. Jain and A. Sharma},
  title = {Recursion Theoretic Characterizations of Language Learning},
  institution = {University of Rochester},
  year = {1989},
  number = {281}
}

@INPROCEEDINGS{JainShCa89,
  author = {S. Jain and A. Sharma and J. Case},
  title = {Convergence to nearly minimal size grammars by vacillating learning
	machines},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1989},
  pages = {189--199},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{JainShVe95,
  author = {Sanjay Jain and Arun Sharma and Mahendran Velauthapillai},
  title = {Finite Identification of Functions by Teams with Success Ratio $\frac{1}{2}$
	and Above},
  journal = {Inform. Comput.},
  year = {1995},
  volume = {121--2},
  pages = {201--213}
}

@INPROCEEDINGS{JainSmWi98,
  author = {Sanjay Jain and Carl Smith and Rolf Wiehagen},
  title = {On the power of learning robustly},
  booktitle = COLT,
  year = {1998},
  pages = {187--197},
  publisher = {ACM Press, New York, NY}
}

@BOOK{JamesPD86,
  title = {PARALLEL DISTRIBUTED PROCESSING Explorations in the Microstructure
	of Cognition Volume 1: Foundations},
  publisher = {The MIT Press},
  year = {1986},
  author = {James L. McClelland, David E. Rumelhart and the PDP Research Group},
  address = {Cambridge, Massachusetts}
}

@ARTICLE{Janikow93,
  author = {Cezary Z. Janikow},
  title = {A Knowledge-Intensive Genetic Algorithm for Supervised Learning},
  journal = {Machine Learning},
  year = {1993},
  volume = {13},
  pages = {189--228},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{Jansche07,
  author = {Jansche, Martin},
  title = {A Maximum Expected Utility Framework for Binary Sequence Labeling},
  booktitle = ACL,
  year = {2007},
  pages = {736--743},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1093}
}

@INPROCEEDINGS{Jantke79,
  author = {K. Jantke},
  title = {Automatic Synthesis of Programs and Inductive Inference of Functions},
  booktitle = FCT,
  year = {1979},
  pages = {219--225},
  address = {Berlin},
  publisher = {Akademie-Verlag}
}

@PHDTHESIS{Jantke79a,
  author = {K. Jantke},
  title = {Leistungsf{\"a}higkeit und {K}ompliziertheit universeller Verfahren
	zur {E}rkennung allgemein-rekursiver Funktionen},
  school = {Humboldt-Universitat, Berlin},
  year = {1979}
}

@ARTICLE{JantkeBe81,
  author = {K. Jantke and H. Beick},
  title = {Combining postulates of naturalness in inductive inference},
  journal = {Elektronische Informationsverarbeitung und Kybernetik},
  year = {1981},
  volume = {17},
  pages = {465--484}
}

@INPROCEEDINGS{Jantke95,
  author = {Klaus P. Jantke},
  title = {Reflecting and self-confident inductive inference machines},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1995},
  pages = {282--297},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Jantke92,
  author = {K. P. Jantke},
  title = {Case based learning in inductive inference},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1992},
  pages = {218--223},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{Jantke91,
  author = {K. P. Jantke},
  title = {Monotonic and Non-monotonic Inductive Inference},
  journal = {New Generation Computing},
  year = {1991},
  volume = {8},
  pages = {349--360},
  number = {4}
}

@INPROCEEDINGS{Jantke90,
  author = {K. P. Jantke},
  title = {Monotonic and Nonmonotonic Inductive Inference of Functions and Patterns},
  booktitle = {Nonmonotonic and Inductive Logic},
  year = {1990},
  pages = {161--177},
  publisher = {Springer Verlag},
  note = {Lecture Notes in Computer Science 543}
}

@INPROCEEDINGS{Jantke86,
  author = {K. P. Jantke},
  title = {An Algebraic Framework for Inductive Program Synthesis},
  booktitle = {International Spring School on Mathematical Methods of Specification
	and Synthesis of Software Systems},
  year = {1986},
  volume = {215},
  series = {Lecture Notes in Computer Science},
  pages = {101--122}
}

@INPROCEEDINGS{Jantke84,
  author = {Jantke, K. P.},
  title = {Polynomial-time inference of general pattern languages},
  booktitle = STACS,
  year = {1984},
  volume = {166},
  pages = {314-325},
  publisher = {Springer}
}

@ARTICLE{Jantke79b,
  author = {K. P. Jantke},
  title = {Natural properties of strategies identifying recursive functions},
  journal = {Elektronische Informationsverarbeitung und Kybernetik},
  year = {1979},
  volume = {15},
  pages = {487--496}
}

@ARTICLE{JantkeLa95,
  author = {K. P. Jantke and S. Lange},
  title = {Case-Based Representation and Learning of Pattern Languages},
  journal = {Theoret. Comput. Sci.},
  year = {1995},
  volume = {137},
  pages = {25--51},
  number = {1},
  note = {Special Issue for ALT '93}
}

@INPROCEEDINGS{JappyNoGa96,
  author = {Pascal Jappy and Richard Nock and Olivier Gascuel},
  title = {Negative robust learning results for {H}orn clause programs},
  booktitle = ICML,
  year = {1996},
  pages = {258--265},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{Jaynes82,
  author = {Jaynes, E. T.},
  title = {On the Rationale of Maximum-Entropy Methods},
  journal = {Proceedings of the IEEE},
  year = {1982},
  volume = {70},
  pages = {939--952},
  number = {9},
  month = Sep,
  comment = {Justification for maximum-entropy methods, and comparison with full
	Bayesian and autoregressive models.}
}

@ARTICLE{Jaynes68,
  author = {Jaynes, E. T.},
  title = {Prior Probabilities},
  journal = {IEEE Transactions on Systems Science and Cybernetics},
  year = {1968},
  volume = {SSC-4},
  pages = {227--241},
  number = {3},
  month = Sep,
  comment = {Presentation and justification for maximum-entropy procedure}
}

@INCOLLECTION{Jelinek90,
  author = {Frederick Jelinek},
  title = {Self-Organized Language Modeling for Speech Recognition},
  booktitle = {Readings in Speech Recognition},
  publisher = {Morgan Kaufmann Publishers, Inc.},
  year = {1990},
  editor = {Alex Waibel and Kai-Fu Lee},
  pages = {450-506},
  address = {San Mateo, California}
}

@BOOK{Jelinek98,
  title = {Statistical Methods for Speech Recognition},
  publisher = {MIT Press},
  year = {1998},
  author = {F. Jelinek}
}

@INPROCEEDINGS{Jelinek91,
  author = {Fred Jelinek},
  title = {Up From Trigrams!},
  booktitle = {Eurospeech},
  year = {1991}
}

@TECHREPORT{Jelinek83,
  author = {Jelinek, Frederick},
  title = {Markov Source Modeling of Text Generation},
  institution = {IBM T.J. Watson Research Center},
  year = {1983},
  comment = {Interpolates 1-, 2-, and 3-gram transistion probabilities.}
}

@ARTICLE{Jelinek85,
  author = {F. Jelinek and R. Mercer},
  title = {Probability distribution estimation from sparse data},
  journal = {IBM Technical Disclosure Bulletin},
  year = {1985},
  volume = {28},
  pages = {2591--2594}
}

@ARTICLE{JelinekMe85,
  author = {F. Jelinek and R. Mercer},
  title = {Probability distribution estimation from sparse data},
  journal = {IBM Technical Disclosure Bulletin},
  year = {1985},
  volume = {28},
  pages = {2591--2594}
}

@INCOLLECTION{Jelinek92,
  author = {Frederick Jelinek and Robert L. Mercer and Salim Roukos},
  title = {Principles of Lexiacal Language Modeling for Speech Recognition},
  booktitle = {Advances in Speech Signal Processing},
  publisher = {Mercer Dekker, Inc.},
  year = {1992},
  editor = {Sadaoki Furui and M. Mohan Sondhi},
  pages = {651-699}
}

@INCOLLECTION{JelinekMeRo92,
  author = {Frederick Jelinek and Robert L. Mercer and Salim Roukos},
  title = {Principles of Lexiacal Language Modeling for Speech Recognition},
  booktitle = {Advances in Speech Signal Processing},
  publisher = {Mercer Dekker, Inc.},
  year = {1992},
  editor = {Sadaoki Furui and M. Mohan Sondhi},
  pages = {651-699}
}

@ARTICLE{JensenGcDa07,
  author = {D. Jensen and C. Giraud-Carrier and N. Davis},
  title = {A Method for Computing Lexical Semantic Distance Using Linear Functionals},
  journal = {Journal of Web Semantics},
  year = {2007},
  url = {http://www.sciencedirect.com}
}

@ARTICLE{JensenCo00,
  author = {David D. Jensen and Paul R. Cohen},
  title = {Multiple Comparisons in Induction Algorithms},
  journal = {Machine Learning},
  year = {2000},
  volume = {38},
  pages = {309--338},
  number = {3},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{JensenLaOl90,
  author = {F. V. Jensen and S. Lauritzen and K. Olesen},
  title = {Bayesian updating in recursive graphical models by local computation},
  journal = {Computational Statistics Quarterly 4},
  year = {1990},
  pages = {269-282}
}

@ARTICLE{JensenLaOl90a,
  author = {Finn Verner Jensen and Steffen Lauritzen and K. Olesen},
  title = {Bayesian updating in recursive graphical models by local computation},
  journal = {Computational Statistics Quarterly 4},
  year = {1990},
  pages = {269-282},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@TECHREPORT{Jensen86,
  author = {K. Jensen},
  title = {PEG 1986: A broad-coverage computational syntax of English},
  institution = {IBM T. J. Watson Research Center},
  year = {1986}
}

@ARTICLE{JensenBi87,
  author = {K. Jensen and J. Binot},
  title = {Disambiguating prepositional phrase attachment by using on-line dictionary
	definitions},
  journal = CL,
  year = {1987},
  volume = {13},
  number = {3--4}
}

@ARTICLE{Jerrum94,
  author = {Jerrum, M.},
  title = {Simple translation-invariant concepts are hard to learn},
  journal = InfComp,
  year = {1994},
  volume = {113},
  pages = {300--311}
}

@ARTICLE{JerrumSi89,
  author = {M. Jerrum and Sinclair, A.},
  title = {Approximating the permanent},
  journal = {SIAM J. Computing},
  year = {1989},
  volume = {48},
  pages = {1149--1178},
  number = {6},
  month = Dec
}

@INPROCEEDINGS{Jesus05,
  author = {Jesu's Herrera, Anselmo Pen~as, Felisa Verdejo},
  title = {Textual Entailment Recognision Based on Dependency Analysis and WordNet.},
  booktitle = RTE,
  year = {2005}
}

@INPROCEEDINGS{JiPs91,
  author = {C. Ji and D. Psaltis},
  title = {The {VC}-dimension vs. the statistical capacity for two layer networks
	with binary weights},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1991},
  pages = {250--256},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{JiWeGr05,
  author = {Heng Ji and David Westbrook and Ralph Grishman},
  title = {Using semantic relations to refine coreference decisions},
  booktitle = {Proceedings of HLT/EMNLP-05},
  year = {2005},
  pages = {17--24},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@INPROCEEDINGS{JiCa07,
  author = {S. Ji and L. Carin},
  title = {Bayesian compressive sensing and projection optimization},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {377--384},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{JTYY08,
  author = {Shuiwang Ji and Lei Tang and Shipeng Yu and Jieping Ye},
  title = {Extracting shared subspace for multi-label classification},
  booktitle = KDD,
  year = {2008},
  pages = {381--389},
  address = {New York, NY, USA},
  publisher = {ACM},
  doi = {http://doi.acm.org/10.1145/1401890.1401939},
  isbn = {978-1-60558-193-4},
  location = {Las Vegas, Nevada, USA}
}

@INPROCEEDINGS{Jiang09,
  author = {Jing Jiang},
  title = {Multi-Task Transfer Learning for Weakly-Supervised Relation Extraction},
  booktitle = {Proceedings of ACL-IJCNLP-09},
  year = {2009},
  pages = {1012--1020},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@INPROCEEDINGS{JiangConrath97,
  author = {J. Jiang and D. Conrath},
  title = {Semantic Similarity Based on Corpus Statistics and Lexical Taxonomy},
  booktitle = {International conference on Research in Computational Linguistics},
  year = {1997},
  pages = {19-33}
}

@INPROCEEDINGS{JiangZh07,
  author = {Jiang, Jing and Zhai, ChengXiang},
  title = {Instance Weighting for Domain Adaptation in NLP},
  booktitle = ACL,
  year = {2007},
  pages = {264--271},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1034}
}

@INPROCEEDINGS{JiangZh07a,
  author = {Jiang, Jing and Zhai, ChengXiang},
  title = {A Systematic Exploration of the Feature Space for Relation Extraction},
  booktitle = NAACL-HLT,
  year = {2007},
  pages = {113--120},
  address = {Rochester, New York},
  month = {April},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/N/N07/N07-1015}
}

@INPROCEEDINGS{JiangZh07b,
  author = {Jing Jiang and ChengXiang Zhai},
  title = {A Systematic Exploration of the Feature Space for Relation Extraction},
  booktitle = {Proceedings of HLT-NAACL-07},
  year = {2007},
  pages = {113--120},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@ARTICLE{JiangLi93,
  author = {T. Jiang and M. Li},
  title = {On the complexity of learning strings and sequences},
  journal = {Theoret. Comput. Sci.},
  year = {1993},
  volume = {119},
  pages = {363--371},
  annote = {Was in COLT91}
}

@INPROCEEDINGS{JijkounRi05,
  author = {V. Jijkoun and M. de Rijke},
  title = {Recognizing Textual Entailment: Is lexical symilarity enough?},
  booktitle = RTE,
  year = {2005}
}

@INPROCEEDINGS{JingKaRo07,
  author = {Jing, Hongyan and Kambhatla, Nanda and Roukos, Salim},
  title = {Extracting Social Networks and Biographical Facts From Conversational
	Speech Transcripts},
  booktitle = ACL,
  year = {2007},
  pages = {1040--1047},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1131}
}

@INPROCEEDINGS{JitnahNi97,
  author = {Nathalie Jitnah and Ann E. Nicholson},
  title = {{treeNets}: A Framework for Anytime Evaluation of Belief Networks},
  booktitle = {International Joint Conference on Qualitative and Quantitative Practical
	Reasoning},
  year = {1997},
  pages = {350-364}
}

@INPROCEEDINGS{Joachims02,
  author = {T. Joachims},
  title = {Unbiased Evaluation of Retrieval Quality Using Clickthrough Data},
  booktitle = {SIGIR - Workshop on Mathematical/Formal Methods in Information Retrieval},
  year = {2002}
}

@INPROCEEDINGS{Joachims99,
  author = {T. Joachims},
  title = {Transductive inference for text classification using support vector
	machines},
  booktitle = ICML,
  year = {1999}
}

@INPROCEEDINGS{Joachims97,
  author = {Thorsten Joachims},
  title = {A probabilistic analysis of the {R}occhio algorithm with {TFIDF}
	for text categorization},
  booktitle = ICML,
  year = {1997},
  pages = {143--151},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{JoachimsFiYu09,
  author = {T. Joachims and T. Finley and Chun-Nam Yu},
  title = {Cutting-Plane Training of Structural SVMs},
  journal = {Machine Learning},
  year = {2009},
  volume = {77},
  pages = {27-59},
  number = {1}
}

@ARTICLE{Johannes97,
  author = {Frnkranz Johannes},
  title = {Pruning Algorithms for Rule Learning},
  journal = {Machine Learning},
  year = {1997},
  volume = {27},
  pages = {139--171},
  publisher = {Kluwer Academic Publishers, Boston}
}

@TECHREPORT{Johansson97,
  author = {P. Johansson},
  title = {On a Weighted Distance Model for Injection Moulding},
  institution = {Division of Applied Mathematics, Link{\"o}ping University},
  year = {1997},
  type = {Link{\"o}ping Studies in Science and Technology, Thesis No. 604},
  number = {LiU-TEK-LIC-1997:05},
  address = {Link{\"o}ping, Sweden},
  month = feb,
  annote = {Licentiate thesis},
  keywords = {shortest paths, injection molding, weighted region problem}
}

@INPROCEEDINGS{JohanssonNu07,
  author = {Johansson, Richard and Nugues, Pierre},
  title = {Incremental Dependency Parsing Using Online Learning},
  booktitle = {CoNLL Shared Task Session of EMNLP-CoNLL},
  year = {2007},
  pages = {1134--1138},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1123}
}

@INPROCEEDINGS{JohnKoPf94,
  author = {George H. John and Ron Kohavi and Karl Pfleger},
  title = {Irrelevant features and the subset selection problem},
  booktitle = ICML,
  year = {1994},
  pages = {121--129},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{JohnsMa07,
  author = {J. Johns and S. Mahadevan},
  title = {Constructing basis functions from directed graphs for value function
	approximation},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {385--392},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@ARTICLE{Johnson84,
  author = {Johnson, D.},
  title = {The NP-Completeness Colunm:An Ongoing Guide},
  journal = {Journal of Algorithms},
  year = {1984},
  volume = {5},
  pages = {284--299}
}

@INPROCEEDINGS{JMFK07,
  author = {Johnson, Howard and Martin, Joel and Foster, George and Kuhn, Roland},
  title = {Improving Translation Quality by Discarding Most of the Phrasetable},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {967--975},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1103}
}

@INPROCEEDINGS{Johnson07,
  author = {Johnson, Mark},
  title = {Why Doesn't {EM} Find Good {HMM} {POS}-Taggers?},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {296--305},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1031}
}

@INPROCEEDINGS{Johnson07a,
  author = {Johnson, Mark},
  title = {Transforming Projective Bilexical Dependency Grammars into efficiently-parsable
	CFGs with Unfold-Fold},
  booktitle = ACL,
  year = {2007},
  pages = {168--175},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1022}
}

@ARTICLE{Johnson79,
  author = {Johnson, Rodney W.},
  title = {Axiomatic Characterization of the Directed Divergences and their
	Linear Combinations},
  journal = {IEEE Transactions on Information Theory},
  year = {1979},
  volume = {IT-25},
  pages = {709--716},
  number = {6},
  month = Nov,
  comment = {Characterized by positivity, additivity, and finiteness. Directed
	divergence also called expected weight of evidence, cross-entropy,
	and discrimination information.}
}

@ARTICLE{JohnsonSh83,
  author = {Johnson, Rodney W. and John E. Shore},
  title = {Comments on and Corrections to `Axiomatic Derivation of the Principle
	of Maximum Entropy and the Principle of Minimum Cross-Entropy},
  journal = {IEEE Transactions on Information Theory},
  year = {1983},
  volume = {IT-29},
  pages = {942--943},
  number = {6},
  month = Nov,
  comment = {Corrects error in previous paper regarding discrete case.}
}

@ARTICLE{JohnsonLi84,
  author = {W. B. Johnson and J. Lindenstrauss},
  title = {Extensions of Lipshitz mapping into Hilbert space},
  journal = {Contemporary Mathematics},
  year = {1984},
  volume = {26},
  pages = {189--206}
}

@INPROCEEDINGS{JohnsonLi84-outdated,
  author = {W. B. Johnson and J. Lindenstrauss},
  title = {Extensions of Lipschitz mappings into a Hilbert space},
  booktitle = {Conference in modern analysis and probability},
  year = {1984},
  pages = {189-206},
  place = {Providence, R}
}

@BOOK{Johnson-Laird83,
  title = {Mental Models},
  publisher = {Harvard Press},
  year = {1983},
  author = {Johnson-Laird, P. N.}
}

@ARTICLE{Johnson-LairdLeLe72,
  author = {Johnson-Laird, P. N. and Legreni, P. and Legreni, M.},
  title = {Reasoning and the sense of reality},
  journal = {British J. of Psychology},
  year = {1972},
  volume = {63},
  pages = {395-400}
}

@BOOK{Johnson-LairdWa77,
  title = {Thinking - Readings in Cognitive science},
  publisher = {Cambridge University Press},
  year = {1977},
  author = {Johnson-Laird, P. N. and Wason, P. C.}
}

@ARTICLE{Johnson-LairdWa70,
  author = {Johnson-Laird, P. N. and Wason, P. C.},
  title = {A theoretical analysis of insight into the reasoningtask},
  journal = {Cognitive Psychology},
  year = {1970},
  volume = {1},
  pages = {134-138}
}

@INPROCEEDINGS{JDLR07,
  author = {Johnston, Michael and D'Haro, Luis Fernando and Levine, Michelle
	and Renger, Bernard},
  title = {A Multimodal Interface for Access to Content in the Home},
  booktitle = ACL,
  year = {2007},
  pages = {376--383},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1048}
}

@BOOK{Jolliffe86,
  title = {Principal Component Analysis},
  publisher = {Springer-Verlag},
  year = {1986},
  author = {I. T. Jolliffe},
  series = {Springer series in statistics.},
  note = {ISBN: 0387962697}
}

@ARTICLE{Jones92,
  author = {L. K. Jones},
  title = {A Simple Lemma on Greedy Approximation in {H}ilbert Space and Convergence
	Rates for Projection Pursuit Regression and Neural Network Training},
  journal = {Annals of Statisctics},
  year = {1992},
  volume = {20},
  pages = {608--613}
}

@INPROCEEDINGS{JonesMcNiRi99,
  author = {R. Jones and McCallum, A. and Nigam, K. and Riloff, E.},
  title = {Bootstrapping for Text Learning Tasks},
  booktitle = {IJCAI Workshop on Text Mining, Foundations, Techniques and Applications},
  year = {1999}
}

@ARTICLE{JonesVa94,
  author = {Randolph M. Jones and Kurt Vanlehn},
  title = {Acquisition of Children's Addition Strategies: {A} Model of Impasse-Free,
	Knowledge-Level Learning},
  journal = {Machine Learning},
  year = {1994},
  volume = {16},
  pages = {11--36},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{JongSpGo93,
  author = {Kenneth A. De Jong and William M. Spears and Diana F. Gordon},
  title = {Using Genetic Algorithms for Concept Learning},
  journal = {Machine Learning},
  year = {1993},
  volume = {13},
  pages = {161--188},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Jong90,
  author = {K. D. Jong},
  title = {Special Issue on Genetic Algorithms},
  journal = {Machine Learning},
  year = {1990},
  volume = {5},
  number = {4},
  month = oct,
  publisher = {Kluwer Academic}
}

@ARTICLE{Jong88,
  author = {Kenneth De Jong},
  title = {Learning with Genetic Algorithms: An Overview},
  journal = {Machine Learning},
  year = {1988},
  volume = {3},
  pages = {121--138},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{JonghKa96,
  author = {Dick de Jongh and Makoto Kanazawa},
  title = {Angluin's theorem for indexed families of r.e. sets and applications},
  booktitle = COLT,
  year = {1996},
  pages = {193--204},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{Jordan94,
  author = {M. I. Jordan},
  title = {A statistical approach to decision tree modeling},
  booktitle = COLT,
  year = {1994},
  pages = {13--20},
  publisher = {ACM Press, New York, NY},
  annote = {Also in Proc. 11th Int.Conf. ML, Learning,1994, 363--370}
}

@TECHREPORT{Jordan88,
  author = {Jordan, Michael I.},
  title = {Supervised learning and systems with excess degrees of freedom},
  institution = {COINS},
  year = {1988},
  number = {88-27},
  month = {May},
  comments = {Working paper},
  tag = {TOC-display}
}

@ARTICLE{JGJS99,
  author = {Michael I. Jordan and Zoubin Ghahramani and Tommi S. Jaakkola and
	Lawrence K. Saul},
  title = {An Introduction to Variational Methods for Graphical Models},
  journal = {Machine Learning},
  year = {1999},
  volume = {37},
  pages = {183--233},
  number = {2},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INCOLLECTION{JordanRo88,
  author = {Jordan, Michael I. and Rosenbaum, David A.},
  title = {Action},
  booktitle = {Handbook of Cognitive Science},
  publisher = {MIT Press},
  year = {1988},
  comment = {COINS Technical Report 88-26.},
  tag = {TOC-display}
}

@ARTICLE{JordanRu92,
  author = {M. I. Jordan and D. E. Rumelhart},
  title = {Forward models: Supervised learning with a distal teacher},
  journal = {Cognitive Science},
  year = {1992},
  volume = {16},
  pages = {307--354}
}

@ARTICLE{JordanXu95,
  author = {M. I. Jordan and L. Xu},
  title = {Convergence results for the {EM} approach to Mixtures of Experts
	Architectures},
  journal = {Neural Networks},
  year = {1995},
  volume = {8},
  pages = {1409--1431},
  number = {9}
}

@INPROCEEDINGS{JouannaudGu79,
  author = {J. P. Jouannaud and G. Guiho},
  title = {Inference of functions with an interactive system},
  booktitle = {Machine Intelligence},
  year = {1979},
  pages = {227--250},
  publisher = {John Wiley and Sons, N. Y.}
}

@ARTICLE{JouannaudKo80,
  author = {J. P. Jouannaud and Y. Kodratoff},
  title = {An automatic construction of {LISP} programs by transformations of
	functions synthesized from their input-output behavior},
  journal = {International J. of Policy Analysis and Information Systems},
  year = {1980},
  volume = {4},
  pages = {331--358}
}

@INPROCEEDINGS{JouannaudKo79,
  author = {J. P. Jouannaud and Y. Kodratoff},
  title = {Characterization of a class of functions synthesized by a Summers-like
	method using a {B}.{M}.{W}. matching technique},
  booktitle = IJCAI,
  year = {1979},
  pages = {440--447},
  organization = {IJCAI}
}

@INPROCEEDINGS{JouannaudTr77,
  author = {J. P. Jouannaud and T. P. Treuil},
  title = {{SISP}/1, an interactive system able to synthesize functions from
	examples},
  booktitle = IJCAI,
  year = {1977},
  pages = {412--418},
  publisher = {IJCAI}
}

@ARTICLE{JuVa01,
  author = {Wen-Hua Ju and Yehuda Vardi},
  title = {A Hybrid High-Order {Markov} Chain Model for Computer Intrusion Detection},
  journal = {Journal of Computational and Graphical Statistics},
  year = {2001},
  volume = {10},
  number = {2},
  url = {citeseer.ist.psu.edu/ju99hybrid.html}
}

@ARTICLE{Juang85,
  author = {B. Juang},
  title = {On the Hidden Markov Model and Dynamic Time Warping for Speech Recognition
	-- {A} Unified View},
  journal = {AT\&T Bell Laboratories Technical Journal},
  year = {1985},
  volume = {63},
  pages = {1213--1242},
  number = {7},
  month = sep,
  comment = {Gaussian autoregressive models; Markov models. Baum's forward-backward
	algorithm. Computing all paths versus computing best path.}
}

@ARTICLE{Judd92,
  author = {J. Stephen Judd},
  title = {A Reply to Honavar's Book Review of Neural Network Design and the
	Complexity of Learning},
  journal = {Machine Learning},
  year = {1992},
  volume = {9},
  pages = {99--100},
  publisher = {Kluwer Academic Publishers, Boston}
}

@BOOK{Judd90,
  title = {Neural Network Design and the Complexity of Learning},
  publisher = {MIT Press},
  year = {1990},
  author = {Judd, J. Stephen}
}

@TECHREPORT{Judd87,
  author = {Judd, J. Stephen},
  title = {Complexity of Connectionist Learning with Various Node Functions},
  institution = {Department of Computer and Information Science, University of Massachusetts
	at Amherst},
  year = {1987},
  number = {87-60},
  month = Jul,
  note = {Also presented at the First IEEE International Conference on Neural
	Networks, June 21--24, 1987, San Diego, California}
}

@INBOOK{Judd94,
  chapter = {3},
  pages = {49--64},
  title = {How loading complexity is affected by node function sets},
  publisher = {MIT Press},
  year = {1994},
  author = {Stephen Judd},
  volume = {I: Constraints and Prospects},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@INPROCEEDINGS{Judd88,
  author = {S. Judd},
  title = {Learning in neural networks},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1988},
  pages = {2--8},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{JuillePo98,
  author = {Hugues Juille and Jordan B. Pollack},
  title = {Coevolutionary learning: a case study},
  booktitle = ICML,
  year = {1998},
  pages = {251--259},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{Juill'ePo98,
  author = {Hugues Juill{\'e} and Jordan B. Pollack},
  title = {A stochastic search approach to grammar induction},
  booktitle = {International Workshop on Algorithmic Learning},
  year = {1998},
  volume = {1433},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {126--137},
  publisher = {Springer-Verlag}
}

@BOOK{Jumarie90,
  title = {Relative information},
  publisher = {Springer-Verlag},
  year = {1990},
  author = {G. Jumarie}
}

@INPROCEEDINGS{JungHoPa00,
  author = {S. Jung and S. Hong and E. Paek},
  title = {An English to Korean Transliteration Model of Extended Markov Window},
  booktitle = COLING,
  year = {2000},
  pages = {383--389}
}

@INPROCEEDINGS{Junker97,
  author = {M. Junker},
  title = {SIGIR Poster: The effectiveness of using Thesauri in IR},
  booktitle = SIGIR,
  year = {1997}
}

@BOOK{JurafsyMa07,
  title = {SPEECH and LANGUAGE PROCESSING: An Introduction to Natural Language
	Processing, Speech Recognition, and Computational Linguistics},
  publisher = {Prentice-Hall},
  year = {2007},
  author = {D. Jurafsky and J. Martin},
  comment = {second edition}
}

@ARTICLE{JustensonKa95,
  author = {J. Justenson and S. Katz},
  title = {Technical terminology: some linguistic properties and an algorithm
	for indentification in text},
  journal = {Natural Language Engineering},
  year = {1995},
  volume = {1},
  pages = {9-27}
}

@ARTICLE{Justeson95,
  author = {John Justeson and Slava Katz},
  title = {Technical terminology: some linguistic properties and an algorithm
	for identification in text},
  journal = {Natural Language Engineering},
  year = {1995},
  volume = {1},
  pages = {9--28},
  number = {1}
}

@ARTICLE{JustesonKa95,
  author = {John Justeson and Slava Katz},
  title = {Technical terminology: some linguistic properties and an algorithm
	for identification in text},
  journal = {Natural Language Engineering},
  year = {1995},
  volume = {1},
  pages = {9--28},
  number = {1}
}

@TECHREPORT{Justeson93,
  author = {John Justeson and Slava Katz},
  title = {Technical terminology: some linguistic properties and an algorithm
	for identification in text},
  institution = {IBM Research Division},
  year = {1993},
  number = {RC 18906}
}

@TECHREPORT{JustesonKa93,
  author = {John Justeson and Slava Katz},
  title = {Technical terminology: some linguistic properties and an algorithm
	for identification in text},
  institution = {IBM Research Division},
  year = {1993},
  number = {RC 18906}
}

@TECHREPORT{K'omlosPa87,
  author = {J. K\'{o}mlos and R. Paturi},
  title = {Convergence Results in the {H}opfield Model},
  institution = {Department of Computer Science and Engineering, University of California,
	San Diego},
  year = {1987},
  number = {Technical Report Number CS-104},
  month = sep
}

@INPROCEEDINGS{KabashimaSh93,
  author = {Y. Kabashima and S. Shinomoto},
  title = {Acceleration of learning in binary choice problems},
  booktitle = COLT,
  year = {1993},
  pages = {446--452},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{Kadous99,
  author = {Mohammed Waleed Kadous},
  title = {Learning comprehensible descriptions of multivariate time series},
  booktitle = ICML,
  year = {1999},
  pages = {454--463},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INCOLLECTION{Kaelbling86,
  author = {Kaelbling, L.},
  title = {An Archutecture for Intelligent Reactive Systems},
  booktitle = {Reasoning about Actions and Plans},
  publisher = {Morgan Kaufman},
  year = {1986},
  editor = {M. P. Georgeff and A. L. Lansky}
}

@TECHREPORT{Kaelbling90,
  author = {Kaelbling, L.},
  title = {Learning in Embedded Systems},
  year = {1990},
  school = {Department of Computer Science, Stanford University}
}

@INBOOK{Kaelbling94,
  chapter = {9},
  pages = {133--153},
  title = {Associative methods in reinforcement learning: an empirical study},
  publisher = {MIT Press},
  year = {1994},
  author = {Leslie Pack Kaelbling},
  volume = {II: Intersections Between Theory and Experiment},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@ARTICLE{Kaelbling94a,
  author = {Leslie Pack Kaelbling},
  title = {Associative Reinforcement Learning: Functions in {\it k}-{DNF}},
  journal = {Machine Learning},
  year = {1994},
  volume = {15},
  pages = {279--298},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Kaelbling94b,
  author = {Leslie Pack Kaelbling},
  title = {Associative Reinforcement Learning: {A} Generate and Test Algorithm},
  journal = {Machine Learning},
  year = {1994},
  volume = {15},
  pages = {299--319},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{KahanSn96,
  author = {S. Kahan and J. Snoeyink},
  title = {{On the bit complexity of minimum link paths: Superquadratic algorithms
	for problems solvable in linear time}},
  booktitle = {SOCG},
  year = {1996},
  pages = {151--158}
}

@INPROCEEDINGS{KahnKaLi88,
  author = {Kahn, J and G. Kalai and N. Linial},
  title = {The influence of variables on boolean functions},
  booktitle = FOCS,
  year = {1988},
  pages = {68--80},
  address = {White Plains, NY},
  month = Oct
}

@TECHREPORT{KahnLi88,
  author = {Kahn, Jeff and Nathan Linial},
  title = {Balancing Extensions via {Brunn-Minkowski}},
  institution = {Rutgers Center for Operations Research},
  year = {1988},
  number = {RRR 57-88},
  month = Nov,
  note = {To appear in {\em Combinatorica}},
  comment = {Proves that in a partial order you can find two elements x,y such
	that 1/2e < Prob(x>y) < 1-1/2e.}
}

@INPROCEEDINGS{Kahn04,
  author = {Joseph M. Kahn},
  title = {A Generative Bayesian Model for Aggregating Experts},
  booktitle = UAI,
  year = {2004},
  pages = {301-308}
}

@INPROCEEDINGS{Kaji92,
  author = {Hiroyuki Kaji and Yuuko Kida and Yasutsugu Morimoto},
  title = {Learning translation templates from bilingual texts},
  booktitle = COLING,
  year = {1992}
}

@INPROCEEDINGS{KajiKi07,
  author = {Kaji, Nobuhiro and Kitsuregawa, Masaru},
  title = {Building Lexicon for Sentiment Analysis from Massive Collection of
	{HTML} Documents},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {1075--1083},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1115}
}

@INPROCEEDINGS{KakasRi97,
  author = {A.C. Kakas and F. Riguzzi},
  title = {Learning with Abduction},
  booktitle = ILP,
  year = {1997},
  number = {1297},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {181--189},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{KakiharaIm93,
  author = {K. Kakihara and H. Imai},
  title = {Notes on the {PAC} learning of geometric concepts with additional
	information},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1993},
  volume = {743},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {252--259},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{KalaiChBlRo99a,
  author = {A. Kalai and S. Chen and A. Blum and R. Rosenfelds},
  title = {On-Line Algorithms for Combining Language Models},
  booktitle = ICASSP,
  year = {1999},
  address = {Phoenix, Arizona}
}

@ARTICLE{KallesMo96,
  author = {Dimitrios Kalles and Tim Morris},
  title = {Efficient Incremental Induction of Decision Trees},
  journal = {Machine Learning},
  year = {1996},
  volume = {24},
  pages = {231--242},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{Kalnishkan99,
  author = {Yuri Kalnishkan},
  title = {General Linear Relations among Different Types of Predictive Complexity},
  booktitle = ALT,
  year = {1999},
  volume = {1720},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {323--334},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Kalnishkan99a,
  author = {Yuri Kalnishkan},
  title = {Linear relations between square-loss and {K}olmogorov complexity},
  booktitle = COLT,
  year = {1999},
  pages = {226--232},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{KalyanasundaramVe95,
  author = {Bala Kalyanasundaram and Mahendran Velauthapillai},
  title = {Simulating teams with many conjectures},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1995},
  pages = {201--214},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Kambhatla04,
  author = {Nanda Kambhatla},
  title = {Combining Lexical, Syntactic, and Semantic Features with Maximum
	Entropy Models for Information Extraction},
  booktitle = {Proceedings of ACL-04},
  year = {2004},
  pages = {178--181},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@INPROCEEDINGS{KamelFa94,
  author = {I. Kamel and C. Faloutsos},
  title = {Hilbert {R}-tree: {A}n improved {R}-tree using fractals},
  booktitle = {VLDB},
  year = {1994},
  pages = {500--510}
}

@ARTICLE{Kamimura98,
  author = {R. Kamimura},
  title = {Minimizing alpha-Information for Generalization and Interpretation},
  journal = {Algorithmica},
  year = {1998},
  volume = {22},
  pages = {173--197},
  number = {1/2}
}

@INPROCEEDINGS{Kamimura93,
  author = {R. Kamimura},
  title = {Competitive learning by entropy minimization},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1993},
  volume = {743},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {111--122},
  publisher = {Springer-Verlag}
}

@ARTICLE{Kaminski89,
  author = {Michael Kaminski},
  title = {A Note on Probabilistically Verifying Integer and Polynomial Products},
  journal = jacm,
  year = {1989},
  volume = {36},
  pages = {142-149},
  number = {1},
  month = jan,
  keywords = {Symbolic Algebra; Algorithms; Theory; Verification; cyclotomic polynomials;
	polynomial and integer multiplication; probabilistic algorithms;}
}

@ARTICLE{Kaminski89a,
  author = {Michael Kaminski and Nader H. Bshouty},
  title = {Multiplicative Complexity of Polynomial Multiplication over Finite
	Fields},
  journal = jacm,
  year = {1989},
  volume = {36},
  pages = {150-170},
  number = {1},
  month = jan,
  keywords = {Symbolic Algebra; Algorithms; Theory; Verification; bilinear algorithms;
	Hankel matrices; linear recurring sequences; polynomial multiplication;}
}

@ARTICLE{KampRe96,
  author = {Kamp, H. and U Reyle},
  title = {A Calculus for First Order Discourse Representation Structures},
  journal = {Logic, Language and Information},
  year = {1996},
  volume = {5},
  pages = {297-348}
}

@INPROCEEDINGS{Kanazawa07,
  author = {Kanazawa, Makoto},
  title = {Parsing and Generation as Datalog Queries},
  booktitle = ACL,
  year = {2007},
  pages = {176--183},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1023}
}

@ARTICLE{KandolaShCr03,
  author = {Kandola, J. and Shawe-Taylor, J. and Cristianini, N.},
  title = {Learning Semantic Similarity},
  journal = {NIPS},
  year = {2003},
  pages = {673--680},
  publisher = {MIT; 1998}
}

@BOOK{Kanerva88,
  title = {Sparse Distributed Memory},
  publisher = {MIT Press},
  year = {1988},
  author = {P. Kanerva},
  address = {Cambridge, Massachusetts},
  comment = {Discusses nearest-neighbor techniques for learning.}
}

@INPROCEEDINGS{KangOh95,
  author = {Kukjin Kang and Jong-Hoon Oh},
  title = {Learning by a population of perceptrons},
  booktitle = COLT,
  year = {1995},
  pages = {297--300},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{KannanVeVe00,
  author = {R. Kannan and S. Vempala and A. Vetta},
  title = {On clusterings: good, bad and spectral},
  booktitle = FOCS,
  year = {2000}
}

@INPROCEEDINGS{Kannan93,
  author = {S. Kannan},
  title = {On the query complexity of learning},
  booktitle = COLT,
  year = {1993},
  pages = {58--66},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{KMNPSW02,
  author = {T.~Kanungo and D.~.M.~Mount and N.~S.~Netanyahu and C.~D.~Piatko
	and R.~Silverman and A.~Y.~Wu},
  title = {A local search approximation algorithm for $k$-means clustering},
  booktitle = {SOCG},
  year = {2002},
  pages = {10--18}
}

@INPROCEEDINGS{KaoReTa93,
  author = {M. Kao and J. H. Reif and S. R. Tate},
  title = {Searching in an Unknown Environment: An Optimal Randomized Algorithm
	for the Cow-Path Problem},
  booktitle = SODA,
  year = {1993},
  pages = {441--447},
  month = jan
}

@INPROCEEDINGS{Kapoor99,
  author = {S. Kapoor},
  title = {Efficient Computation of Geodesic Shortest Paths},
  booktitle = STOC,
  year = {1999},
  pages = {770--779}
}

@ARTICLE{Kapoor89,
  author = {Sanjiv Kapoor and Edward M. Reingold},
  title = {Optimum Lopsided Binary Trees},
  journal = jacm,
  year = {1989},
  volume = {36},
  pages = {573-590},
  number = {3},
  month = jul,
  keywords = {Data Structures and Algorithms; Algorithms; Discrete Mathematics;
	Theory; Verification; algorithmic analysis; binary search; binary
	search trees; binary trees; coding theory; data structure; edge-weighted
	trees; Fibonacci numbers; Fibonacci trees; information theory; Kraft's
	inequality; minimax recurrence relations; optimal trees; path lengths;
	prefix-free codes; unbounded search; }
}

@INPROCEEDINGS{KapurNA86,
  author = {Kapur, D. and P. Narendran},
  title = {{NP}-completeness of the set unification and matching problmes.},
  booktitle = {Proceedings of the 8th conference on {A}utomated {D}deduction},
  year = {1986},
  volume = {230},
  pages = {489--495},
  publisher = {Springer Verlag}
}

@BOOK{KapurKe92,
  title = {Entropy Optimization Principles with Applications},
  publisher = {Academic Press, Inc.},
  year = {1992},
  author = {J. N. Kapur and H. K Kesavan}
}

@INPROCEEDINGS{Kapur94,
  author = {S. Kapur},
  title = {Language learning under various types of constraint combinations},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1994},
  volume = {872},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {365--378},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Kapur93,
  author = {S. Kapur},
  title = {Monotonic language learning},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1993},
  volume = {743},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {147--158},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Kapur93a,
  author = {S. Kapur},
  title = {Uniform characterizations of various kinds of language learning},
  booktitle = {International Workshop on Analogical and Inductive Inference and
	International Workshop on Algorithmic Learning Theory},
  year = {1993},
  volume = {744},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {197--208},
  publisher = {Springer-Verlag}
}

@ARTICLE{KapurBi95,
  author = {S. Kapur and G. Bilardi},
  title = {Language learning without overgeneralization},
  journal = {Theoret. Comput. Sci.},
  year = {1995},
  volume = {141},
  pages = {151--162},
  number = {1/2}
}

@INPROCEEDINGS{KapurBi92,
  author = {S. Kapur and G. Bilardi},
  title = {Language learning from stochastic input},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1992},
  pages = {303--310},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{KapurBi92a,
  author = {S. Kapur and G. Bilardi},
  title = {On uniform learnability of language families},
  journal = {Information Processing Letters},
  year = {1992},
  volume = {44},
  pages = {35--38},
  number = {1}
}

@ARTICLE{KaraliccaronBr97,
  author = {Aram Karaliccaron and Ivan Bratko},
  title = {First Order Regression},
  journal = {Machine Learning},
  year = {1997},
  volume = {26},
  pages = {147--176},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{KaravelasGu01,
  author = {M. I. Karavelas and L. J. Guibas},
  title = {Static and kinetic geometric spanners with applications},
  booktitle = SODA,
  year = {2001},
  pages = {168--176}
}

@INPROCEEDINGS{KarimiScTu07,
  author = {Karimi, Sarvnaz and Scholer, Falk and Turpin, Andrew},
  title = {Collapsed Consonant and Vowel Models: New Approaches for English-Persian
	Transliteration and Back-Transliteration},
  booktitle = ACL,
  year = {2007},
  pages = {648--655},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1082}
}

@INPROCEEDINGS{KarimiTuSc07,
  author = {Karimi, Sarvnaz and Turpin, Andrew and Scholer, Falk},
  title = {Corpus Effects on the Evaluation of Automated Transliteration Systems},
  booktitle = ACL,
  year = {2007},
  pages = {640--647},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1081}
}

@INPROCEEDINGS{Karlsson90,
  author = {Fred Karlsson},
  title = {Constraint grammar as a framework for parsing running text},
  booktitle = COLING,
  year = {1990}
}

@ARTICLE{KarovEd98,
  author = {Y. Karov and S. Edelman},
  title = {Similarity-based word sense disambiguation},
  year = {1998},
  volume = {4},
  pages = {41--59},
  booktitle = CL
}

@INPROCEEDINGS{KarovEd96,
  author = {Y. Karov and S. Edelman},
  title = { Learning similarity-based word sense disambiguation from sparse
	data},
  booktitle = {Fourth workshop on very large corpora},
  year = {1996},
  pages = {42-55}
}

@ARTICLE{Karp93,
  author = {Peter D. Karp},
  title = {Design Methods for Scientific Hypothesis Formation and Their Application
	to Molecular Biology},
  journal = {Machine Learning},
  year = {1993},
  volume = {12},
  pages = {89--116},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{KarpWaZw95,
  author = {R. M. Karp and O. Waarts and G. Zweig},
  title = {The bit vector intersection problem},
  booktitle = FOCS,
  year = {1995},
  pages = {621--630}
}

@ARTICLE{KarpinskiMa97,
  author = {Marek Karpinski and Angus Macintyre},
  title = {Polynomial Bounds for {VC} Dimension of Sigmoidal and General Pfaffian
	Neural Networks},
  journal = {J. Comput. Syst. Sci.},
  year = {1997},
  volume = {54},
  pages = {169--176},
  number = {1}
}

@INPROCEEDINGS{KarpinskiMa95,
  author = {Marek Karpinski and Angus Macintyre},
  title = {Bounding {VC}-dimension for neural networks: progress and prospects},
  booktitle = EuroCOLT,
  year = {1995},
  pages = {337--341},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{KarpinskiMa95a,
  author = {Marek Karpinski and Angus Macintyre},
  title = {Polynomial bounds for {VC} dimension of sigmoidal neural networks},
  booktitle = STOC,
  year = {1995},
  pages = {200--208},
  publisher = {ACM Press, New York, NY}
}

@INBOOK{KarpinskiWe94,
  chapter = {11},
  pages = {331--354},
  title = {{VC} dimension and sampling complexity of learning sparse polynomials
	and rational functions},
  publisher = {MIT Press},
  year = {1994},
  author = {Marek Karpinski and Thorsten Werther},
  volume = {I: Constraints and Prospects},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@ARTICLE{Katajainen92,
  author = {Jyrki Katajainen and Timo Raita},
  title = {An Analysis of the Longest Match and the Greedy Heuristics in Text
	Encoding},
  journal = jacm,
  year = {1992},
  volume = {39},
  pages = {281-294},
  number = {2},
  month = apr,
  keywords = {Data Structures and Algorithms; Algorithms; Theory; optimal and heuristic
	encoding; shortest paths; textual substitution; }
}

@INPROCEEDINGS{Kate08,
  author = {Kate, R.},
  title = {Transforming Meaning Representation Grammars to Improve Semantic
	Parsing},
  booktitle = {CONLL},
  year = {2008},
  pages = {33--40},
  address = {Manchester, England},
  month = {August},
  publisher = {Coling 2008 Organizing Committee},
  url = {http://www.aclweb.org/anthology/W08-2105}
}

@INPROCEEDINGS{KateMo06,
  author = {Kate, R. and Mooney, R.},
  title = {Using String-Kernels for Learning Semantic Parsers},
  booktitle = ACL,
  year = {2006},
  pages = {913--920},
  address = {Sydney, Australia},
  month = {July},
  publisher = {Association for Computational Linguistics},
  doi = {10.3115/1220175.1220290},
  url = {http://www.aclweb.org/anthology/P06-1115}
}

@INCOLLECTION{KKSA08,
  author = {Tsuyoshi Kato and Hisashi Kashima and Masashi Sugiyama and Kiyoshi
	Asai},
  title = {Multi-Task Learning via Conic Programming},
  booktitle = NIPS,
  publisher = {MIT Press},
  year = {2008},
  editor = {J.C. Platt and D. Koller and Y. Singer and S. Roweis},
  pages = {737--744},
  address = {Cambridge, MA}
}

@INPROCEEDINGS{KatrenkoAd05,
  author = {Sophia Katrenko and Peter Adriaans},
  title = {Using Maximal Embedded Syntactic Subtrees for Textual Entailment
	Recognition},
  booktitle = {PASCAL Challenges Workshop on Recognizing Textual Entailment},
  year = {2005}
}

@ARTICLE{KatzVo86,
  author = {M. D. Katz and D. J. Volper},
  title = {{Data structures for retrieval on square grids}},
  journal = SICOMP,
  year = {1986},
  volume = {15},
  pages = {919--931},
  number = {4}
}

@ARTICLE{KatzOvSh92,
  author = {M. J. Katz and M. H. Overmars and M. Sharir},
  title = {Efficient hidden surface removal for objects with small union size},
  journal = CGTA,
  year = {1992},
  volume = {2},
  pages = {223--234},
  keywords = {hidden surface removal}
}

@ARTICLE{Katz87,
  author = {Slava M. Katz},
  title = {Estimation of probabilities from sparse data for the language model
	component of a speech recognizer},
  journal = TASSP,
  year = {1987},
  volume = {35},
  pages = {400--401},
  number = {3}
}

@INPROCEEDINGS{BarzilayPPEval,
  author = {David Kauchak and Regina Barzilay},
  title = {Paraphrasing for automatic evaluation},
  booktitle = HLT-NAACL,
  year = {2006},
  pages = {455--462}
}

@INPROCEEDINGS{KauchakBa06,
  author = {D. Kauchak and R. Barzilay},
  title = {Paraphrasing for automatic evaluation},
  booktitle = HLT-NAACL,
  year = {2006},
  pages = {455--462}
}

@INPROCEEDINGS{KaufmannSt97,
  author = {Susanne Kaufmann and Frank Stephan},
  title = {Resource Bounded Next Value and Explanatory Identification: Learning
	Automata, Patterns and Polynomials On-Line},
  booktitle = COLT,
  year = {1997},
  pages = {263--274},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{KaufmannSt97a,
  author = {Susanne Kaufmann and Frank Stephan},
  title = {Robust learning with infinite additional information},
  booktitle = EuroCOLT,
  year = {1997},
  pages = {316--330},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{KautzSe92,
  author = {Kautz, H. and B. Selman},
  title = {Forming Concepts for Fast Inference},
  booktitle = AAAI,
  year = {1992}
}

@INPROCEEDINGS{KautzSe92a,
  author = {Henry Kautz and Bart Selman},
  title = {Speeding inference by acquiring new concepts},
  booktitle = AAAI,
  year = {1992},
  address = {San Jose},
  month = jul
}

@INPROCEEDINGS{KautzSe91,
  author = {Kautz, H. and B. Selman},
  title = {A General Framework for Knowledge Compilation},
  year = {1991},
  month = July,
  journal = {Proceedings of the International Workshop on Processing Declarative
	Knowledge, Kaiserlautern, Germany}
}

@INPROCEEDINGS{KawaharaKu07,
  author = {Kawahara, Daisuke and Kurohashi, Sadao},
  title = {Probabilistic Coordination Disambiguation in a Fully-Lexicalized
	{J}apanese Parser},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {306--314},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1032}
}

@TECHREPORT{Kay80,
  author = {Martin Kay},
  title = {The proper place of men and machines in language translation},
  institution = {Xerox Palo Alto Research Center},
  year = {1980},
  number = {CSL-80-11},
  place = {Palo Alto, California}
}

@ARTICLE{Kay93,
  author = {M. Kay and M. Roscheisen},
  title = {Text-translation alignment},
  journal = CL,
  year = {1993},
  volume = {19},
  pages = {121--142},
  number = {1}
}

@ARTICLE{KayRo93,
  author = {M. Kay and M. Roscheisen},
  title = {Text-translation alignment},
  journal = CL,
  year = {1993},
  volume = {19},
  pages = {121--142},
  number = {1}
}

@INPROCEEDINGS{KazamaTo07,
  author = {Kazama, Jun'ichi and Torisawa, Kentaro},
  title = {A New Perceptron Algorithm for Sequence Labeling with Non-Local Features},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {315--324},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1033}
}

@INPROCEEDINGS{KazamaTo07a,
  author = {Kazama, Jun'ichi and Torisawa, Kentaro},
  title = {Exploiting {Wikipedia} as External Knowledge for Named Entity Recognition},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {698--707},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1073}
}

@ARTICLE{Kazman94,
  author = {Rick Kazman},
  title = {Simulating the Child's Acquisition of the Lexicon and Syntax -- Experiences
	with {\it Babel}},
  journal = {Machine Learning},
  year = {1994},
  volume = {16},
  pages = {87--120},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Kearns98,
  author = {M. Kearns},
  title = {Efficient Noise-Tolerant Learning from Statistical Queries},
  journal = JACM,
  year = {1998},
  volume = {45},
  pages = {983--1006},
  number = {6}
}

@INPROCEEDINGS{Kearns93,
  author = {M. Kearns},
  title = {Efficient noise-tolerant learning from statistical queries},
  booktitle = STOC,
  year = {1993},
  pages = {392--401},
  publisher = {ACM Press, New York, NY}
}

@PHDTHESIS{Kearns89,
  author = {M. Kearns},
  title = {The Computational Complexity of Machine Learning},
  school = {Harvard University Center for Research in Computing Technology},
  year = {1989},
  month = may,
  note = {Technical Report TR-13-89. Also published by MIT Press as an ACM
	Distinguished Dissertation.}
}

@UNPUBLISHED{Kearns88,
  author = {Michael Kearns},
  title = {Thoughts on Hypothesis Boosting},
  note = {(Unpublished)},
  month = Dec,
  year = {1988}
}

@ARTICLE{KearnsLi93,
  author = {M. Kearns and M. Li},
  title = {Learning in the presence of malicious errors},
  journal = {SIAM J. Comput.},
  year = {1993},
  volume = {22},
  pages = {807--837},
  annote = {Also Harvard TR 03-87},
  comment = {Studies pac learning in the presence of worst sort of errors. prev
	iously appeared in stoc'88.}
}

@INPROCEEDINGS{KearnsLi88,
  author = {Kearns, M. and M. Li},
  title = {Learning in the Presence of Malicious Errors},
  booktitle = STOC,
  year = {1988},
  pages = {267--280},
  address = {Chicago, Illinois},
  month = May,
  comment = {Studies pac learning in the presence of worst sort of errors.Submitted
	to SIAM J. Computing.}
}

@INPROCEEDINGS{KLPV87,
  author = {M. Kearns and M. Li and L. Pitt and L. Valiant},
  title = {On the learnability of {B}oolean formulae},
  booktitle = STOC,
  year = {1987},
  pages = {285--294},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{KearnsLiPiVa87,
  author = {Kearns, M. and M. Li and L. Pitt and L. G. Valiant},
  title = {On the Learnability of Boolean Formulae},
  booktitle = STOC,
  year = {1987},
  pages = {285--295},
  address = {New York, New York},
  month = May,
  comment = {To appear in JACM.}
}

@INPROCEEDINGS{KearnsLiPiVa87b,
  author = {Kearns, M. and M. Li and L. Pitt and L. G. Valiant},
  title = {Recent Results on Boolean Concept Learning},
  booktitle = {International Workshop on Machine},
  year = {1987},
  pages = {337--352},
  address = {University of California, Irvine},
  month = Jun
}

@ARTICLE{KearnsMa99,
  author = {M. Kearns and Y. Mansour},
  title = {On the boosting ability of top-down decision tree learning algorithms},
  journal = {J. of Comput. Syst. Sci.},
  year = {1999},
  volume = {58},
  pages = {109--128},
  number = {1}
}

@INPROCEEDINGS{KearnsMa98,
  author = {Michael Kearns and Yishay Mansour},
  title = {A fast, bottom-up decision tree pruning algorithm with near-optimal
	generalization},
  booktitle = ICML,
  year = {1998},
  pages = {269--277},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@UNPUBLISHED{KearnsMa93,
  author = {Kearns, Michael and Mansour, Yishay},
  title = {{DNF} formulae and decision trees are hard for statistical queries},
  note = {Unpublished},
  month = May,
  year = {1993}
}

@ARTICLE{KMNR97,
  author = {Michael Kearns and Yishay Mansour and Andrew Y. Ng and Dana Ron},
  title = {An Experimental and Theoretical Comparison of Model Selection Methods},
  journal = {Machine Learning},
  year = {1997},
  volume = {27},
  pages = {7--50},
  annote = {Earlier version in COLT95},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{KearnsMaRoRuScSe94,
  author = {Kearns, M. and Y. Mansour and D. Ron and R. Rubinfeld and R. E. Schapire
	and L. Selly},
  title = {On the Learnability of Discrete Distributions},
  booktitle = STOC,
  year = {1994},
  pages = {273--282}
}

@INPROCEEDINGS{KearnsPi89,
  author = {Kearns, M. and L. Pitt},
  title = {A Polynomial-time Algorithm for Learning $k$-variable Pattern Languages
	from Examples},
  booktitle = {Annual Workshop on Computational Learning Theory},
  year = {1989},
  pages = {57--71},
  address = {Santa Cruz, California},
  month = Jul
}

@INPROCEEDINGS{KearnsRo98,
  author = {Michael Kearns and Dana Ron},
  title = {Testing problems with sub-learning sample complexity},
  booktitle = COLT,
  year = {1998},
  pages = {268--279},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{KearnsRo97,
  author = {Michael Kearns and Dana Ron},
  title = {Algorithmic stability and sanity-check bounds for leave-one-out cross-validation},
  booktitle = COLT,
  year = {1997},
  pages = {152--162},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{KearnsSc94,
  author = {Kearns, M. and R. Schapire},
  title = {Efficient Distribution-free Learning of Probabilistic Concepts},
  journal = JCSS,
  year = {1994},
  volume = {48},
  pages = {464-497}
}

@INPROCEEDINGS{KearnsSc90b,
  author = {Kearns, M. and R. Schapire},
  title = {Efficient Distribution-free Learning of Probabilistic Concepts},
  booktitle = COLT,
  year = {1990},
  pages = {389},
  publisher = {Morgan Kaufmann},
  note = {Abstract only},
  tag = {TOC-display}
}

@ARTICLE{KearnsSe95,
  author = {Michael Kearns and H. Sebastian Seung},
  title = {Learning from a population of hypotheses},
  journal = {Machine Learning},
  year = {1995},
  volume = {18},
  pages = {255--276},
  number = {2/3},
  annote = {Earlier version appeared in sixth COLT, 1993},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{KearnsSi00,
  author = {Michael Kearns and Satinder Singh},
  title = {Bias-Variance Error Bounds for Temporal Difference Updates},
  booktitle = COLT,
  year = {2000},
  pages = {142--147},
  publisher = {Morgan Kaufmann, San Francisco}
}

@INPROCEEDINGS{KearnsSi98,
  author = {Michael Kearns and Satinder Singh},
  title = {Near-optimal reinforcement learning in polynomial time},
  booktitle = ICML,
  year = {1998},
  pages = {260--268},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@ARTICLE{KearnsVal94,
  author = {Kearns, M.J. and Valiant, L.G. },
  title = {Cryptographic limitations on learning {B}oolean formulae and finite
	automata},
  journal = JACM,
  year = {1994},
  volume = {41},
  pages = {67--95},
  number = {1}
}

@INPROCEEDINGS{KearnsVa89,
  author = {M. Kearns and L. G. Valiant},
  title = {Cryptographic limitations on learning {B}oolean formulae and finite
	automata},
  booktitle = {Symposium on Theory of Computing},
  year = {1989},
  pages = {433--444},
  publisher = {ACM Press, New York, NY},
  comment = {To appear in J. ACM}
}

@TECHREPORT{KearnsVa88,
  author = {M. Kearns and L. G. Valiant},
  title = {Learning Boolean Formulae or Finite Automata is as Hard as Factoring},
  institution = {Harvard University Aiken Computation Laboratory},
  year = {1988},
  number = {TR 14-88}
}

@UNPUBLISHED{KearnsVa92,
  author = {Michael Kearns and Umesh Vazirani},
  title = {Topics in Learning Theory},
  note = {(Prelinary draft)},
  year = {1992}
}

@ARTICLE{KearnsScSe94,
  author = {Michael J. Kearns and Robert E. Schapire and Linda M. Sellie},
  title = {Toward efficient agnostic learning},
  journal = {Machine Learning},
  year = {1994},
  volume = {17},
  pages = {115--142},
  number = {2/3},
  annote = {Earlier version in COLT 1992},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{KearnsScSe92,
  author = {M. J. Kearns and R. E. Schapire and L. M. Sellie},
  title = {Toward efficient agnostic learning},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1992},
  pages = {341--352},
  publisher = {ACM Press, New York, NY}
}

@BOOK{KearnsVa94,
  title = {An Introduction to Computational Learning Theory},
  publisher = {MIT Press},
  year = {1994},
  author = {Michael J. Kearns and Umesh V. Vazirani},
  address = {Cambridge, Massachusetts}
}

@ARTICLE{KececiogluLiTr97,
  author = {John Kececioglu and Ming Li and John Tromp},
  title = {Inferring a {DNA} sequence from erroneous copies},
  journal = {Theoret. Comput. Sci.},
  year = {1997},
  volume = {185},
  pages = {3--13},
  number = {1},
  note = {Special issue for ALT '95}
}

@ARTICLE{KLPS86,
  author = {K. Kedem and R. Livne and J. Pach and M. Sharir},
  title = {On the union of {Jordan} regions and collision-free translational
	motion amidst polygonal obstacles},
  journal = DCG,
  year = {1986},
  volume = {1},
  pages = {59--71},
  keywords = {motion planning, two-dimensional, Jordan curves}
}

@TECHREPORT{KellyGl87,
  author = {K. Kelly and C. Glymour},
  title = {On convergence to the truth and nothing but the truth},
  institution = {Carnegie Mellon University, Laboratory for Computational Linguistics,
	CMU-LCL-87-4},
  year = {1987}
}

@INPROCEEDINGS{Kelly89,
  author = {K. T. Kelly},
  title = {Induction from the general to the more general},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1989},
  pages = {334--348},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{KellyGl92,
  author = {K. T. Kelly and C. Glymour},
  title = {Inductive Inference from Theory Laden Data},
  journal = {Journal of Philosophical Logic},
  year = {1992},
  volume = {21},
  pages = {391--444},
  number = {4}
}

@ARTICLE{Kendall38,
  author = {M. G. Kendall},
  title = {A New Measure of Rank Correlation},
  journal = {Biometrika},
  year = {1938},
  volume = {30},
  pages = {81-93},
  number = {1/2},
  month = {Jun.}
}

@INPROCEEDINGS{KerstingDe00,
  author = {Kersting, K. and De Raedt, L.},
  title = {{Bayesian} Logic Programs},
  booktitle = {Work-in-Progress Track at the 10th International Conference on Inductive
	Logic Programming},
  year = {2000},
  editor = {J. Cussens and A. Frisch},
  pages = {138--155},
  url = {citeseer.nj.nec.com/kersting00bayesian.html}
}

@INPROCEEDINGS{KerstingDe01a,
  author = {Kersting, K. and De Raedt, Luc},
  title = {Towards Combining Inductive Logic Programming with {Bayesian} Networks},
  booktitle = ILP,
  year = {2001},
  editor = {Celine Rouveirol and Michele Sebag},
  volume = {2157 of LNAI},
  pages = {104-117},
  publisher = {Springer-Verlag}
}

@ARTICLE{KerstingDe01b,
  author = {Kersting, K. and De Raedt, L.},
  title = {Adaptive {{Bayesian}} Logic Programs},
  journal = {Lecture Notes in Computer Science},
  year = {2001},
  volume = {2157},
  pages = {104--117},
  url = {citeseer.nj.nec.com/532049.html}
}

@INPROCEEDINGS{KPPB07,
  author = {K. Kersting and C. Plagemann and P. Pfaff and W. Burgard},
  title = {Most likely heteroscedastic {Gaussian} process regression},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {393--400},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{KerstingRa00,
  author = {K. Kersting and L. De Raedt},
  title = {Bayesian Logic Programs},
  booktitle = {Work-in-Progress Track at the 10th International Conference on Inductive
	Logic Programming},
  year = {2000},
  editor = {J. Cussens and A. Frisch},
  pages = {138--155}
}

@MISC{KerstingRaKr00,
  author = {K. Kersting and L. De Raedt and S. Kramer},
  title = {Interpreting {Bayesian} Logic Programs},
  year = {2000},
  text = {K. Kersting, L. De Raedt, and S. Kramer. Interpreting {Bayesian} Logic
	Programs. In L. Getoor and D. Jensen, editors, Working Notes of the
	AAAI-2000 Workshop on Learning Statistical Models from Relational
	Data (SRL), 2000.},
  url = {citeseer.nj.nec.com/kersting00interpreting.html}
}

@ARTICLE{KesavanKa89,
  author = {H. K. Kesavan and J. N. Kapur},
  title = {The Generalized Maximum Entropy Principle},
  journal = {IEEE Transactions on Systems, Man, and Cybernetics},
  year = {1989},
  volume = {19},
  pages = {1042--1052},
  number = {5},
  month = {September/October},
  comment = {Generalizes to include a prior distribution, using Kullback/Leibler
	Minimum Discrimination Information metric}
}

@ARTICLE{Keshner82,
  author = {Marvin S. Keshner},
  title = {$1/f$ Noise},
  journal = {Proceedings of the IEEE},
  year = {1982},
  volume = {70},
  pages = {212--218},
  number = {3},
  month = Mar,
  comment = {Nice introduction and overview.}
}

@BOOK{Keynes21,
  title = {A treatise on Probability},
  publisher = {Mammillan},
  year = {1921},
  author = {Keynes, J. M.},
  address = {London}
}

@ARTICLE{Khacian79,
  author = {Khacian, L. G.},
  title = {A Polynomial Algorithm for Linear Programming},
  journal = {Soviet Math. Doklady},
  year = {1979},
  volume = {20},
  pages = {191--194}
}

@ARTICLE{Khardon99,
  author = {Roni Khardon},
  title = {Learning Function-Free {H}orn Expressions},
  journal = {Machine Learning},
  year = {1999},
  volume = {37},
  pages = {241--275},
  number = {3},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Khardon99a,
  author = {Khardon, R.},
  title = {Learning to take Actions},
  journal = {Machine Learning},
  year = {1999},
  volume = {35},
  pages = {57-90},
  number = {1}
}

@ARTICLE{Khardon99b,
  author = {Khardon, R.},
  title = {Learning action strategies for planning domains},
  journal = AI,
  year = {1999},
  volume = {113},
  pages = {125-148}
}

@INPROCEEDINGS{Khardon99c,
  author = {Roni Khardon},
  title = {Learning Range Restricted {H}orn Expressions},
  booktitle = EuroCOLT,
  year = {1999},
  volume = {1572},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {111--125},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Khardon98,
  author = {Khardon, R.},
  title = {Learning First Order Universal {Horn} Expressions},
  booktitle = COLT,
  year = {1998},
  note = {Forthcoming}
}

@TECHREPORT{Khardon98c,
  author = {Khardon, R.},
  title = {Learning Function Free {Horn} Expressions},
  institution = {Laboratory for Foundations of Computer Science, Edinburgh University},
  year = {1998},
  number = {ECS-LFCS-98-394},
  note = {A preliminary version of this paper appeared in COLT 1998}
}

@ARTICLE{Khardon94,
  author = {Khardon, R.},
  title = {On Using the {F}ourier transform to learn disjoint {DNF}},
  journal = {Information Processing Letters},
  year = {1994},
  volume = {49},
  pages = {219--222},
  number = {5},
  month = mar
}

@INPROCEEDINGS{Kharitonov93,
  author = {M. Kharitonov},
  title = {Cryptographic hardness of distribution-specific learning},
  booktitle = STOC,
  year = {1993},
  pages = {372--381},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{Kharitonov92,
  author = {M. Kharitonov},
  title = {Cryptographic lower bounds on learnability of {B}oolean functions
	on the uniform distribution},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1992},
  pages = {29--36},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{KietzDz94,
  author = {Kietz, J. and Dzeroski, S.},
  title = {Inductive Logic Programming and Learnability},
  journal = {SIGART Bulletin},
  year = {1994},
  volume = {5},
  pages = {22--32},
  number = {1}
}

@INPROCEEDINGS{Kietz93,
  author = {Jorg-Uwe Kietz},
  title = {Some computational lower bounds for the computational complexity
	of inductive logic programmming},
  booktitle = ECML,
  year = {1993},
  address = {Vienna, Austria}
}

@INPROCEEDINGS{KietzL94,
  author = {J{\"o}rg-Uwe Kietz and Marcus L{\"u}bbe},
  title = {An efficient subsumption algorithm for inductive logic programming},
  booktitle = ICML,
  year = {1994},
  pages = {130--138},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{KietzMo94,
  author = {J{\"{o}}rg-Uwe Kietz and Katharina Morik},
  title = {A Polynomial Approach to the Constructive Induction of Structural
	Knowledge},
  journal = {Machine Learning},
  year = {1994},
  volume = {14},
  pages = {193--217},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{KilianLaPe94,
  author = {J. Kilian and K. J. Lang and B. A. Pearlmutter},
  title = {Playing the matching-shoulders lob-pass game with logarithmic regret},
  booktitle = COLT,
  year = {1994},
  pages = {159--164},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{KilianSi93,
  author = {J. Kilian and H. Siegelmann},
  title = {On the power of sigmoid neural networks},
  booktitle = COLT,
  year = {1993},
  pages = {137--143},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{KilpelainenMaUk95,
  author = {Pekka Kilpel{\"a}inen and Heikki Mannila and Esko Ukkonen},
  title = {{MDL} learning of unions of simple pattern languages from positive
	examples},
  booktitle = EuroCOLT,
  year = {1995},
  volume = {904},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {252--260},
  publisher = {Springer-Verlag}
}

@PHDTHESIS{Kim83,
  author = {J. H. Kim},
  title = {{CONVINCE}: {A} Conversational Inference Consolidation Engine},
  school = {University of California, Los Angeles},
  year = {1983},
  comment = {Interactive decision support system using Pearl's Bayesian networks}
}

@INPROCEEDINGS{KimRo95,
  author = {Jeong Han Kim and James R. Roche},
  title = {On the optimal capacity of binary neural networks: rigorous combinatorial
	approaches},
  booktitle = COLT,
  year = {1995},
  pages = {240--249},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{KimCh07,
  author = {K. Kim and S. Choi},
  title = {Neighbor search with global geometry: a minimax message passing algorithm},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {401--408},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{KimPa07,
  author = {M. Kim and V. Pavlovic},
  title = {A recursive method for discriminative mixture learning},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {409--416},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{KimHo07,
  author = {Kim, Soo-Min and Hovy, Eduard},
  title = {{Crystal}: Analyzing Predictive Opinions on the Web},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {1056--1064},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1113}
}

@INPROCEEDINGS{Kim91,
  author = {W. M. Kim},
  title = {Learning by smoothing: a morphological approach},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1991},
  pages = {43--57},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{CoNLL00,
  author = {Kim-Sang, E. F. T. and S. Buchholz},
  title = {Introduction to the {CoNLL}-2000 Shared Task: Chunking},
  booktitle = CoNLL-LLL,
  year = {2000},
  pages = {127--132}
}

@INPROCEEDINGS{KimberLo92,
  author = {Kimber, Don and Philip M. Long},
  title = {The learning complexity of smooth functions of a single variable},
  booktitle = COLT,
  year = {1992},
  pages = {153--159},
  month = Jul
}

@INPROCEEDINGS{KimotoIw92,
  author = {H. Kimoto and T. Iwadera},
  title = {Learning effect of a dynamic thesaurus in associated information
	retrieval},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1992},
  pages = {47--60},
  publisher = {IOS Press}
}

@INPROCEEDINGS{KimuraKo99,
  author = {Hajime Kimura and Shigenobu Kobayashi},
  title = {Efficient non-linear control by combining {Q}-learning with local
	linear controllers},
  booktitle = ICML,
  year = {1999},
  pages = {210--219},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{KimuraKo98,
  author = {Hajime Kimura and Shigenobu Kobayashi},
  title = {An analysis of actor/critic algorithms using eligibility traces:
	reinforcement learning with imperfect value functions},
  booktitle = ICML,
  year = {1998},
  pages = {278--286},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{KimuraMiKo97,
  author = {Hajime Kimura and Kazuteru Miyazaki and Shigenobu Kobayashi},
  title = {Reinforcement learning in {POMDP}s with function approximation},
  booktitle = ICML,
  year = {1997},
  pages = {152--160},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{KimuraYaKo95,
  author = {Hajime Kimura and Masayuki Yamamura and Shigenobu Kobayashi},
  title = {Reinforcement learning by stochastic hill climbing on discounted
	reward},
  booktitle = ICML,
  year = {1995},
  pages = {295--303},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{KimuraToSh94,
  author = {S. Kimura and A. Togashi and N. Shiratori},
  title = {Synthesis algorithm for recursive processes by {$\mu$}-calculus},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1994},
  pages = {379--394},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Kinber94,
  author = {E. Kinber},
  title = {Monotonicity versus efficiency for learning languages from texts},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1994},
  pages = {395--406},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{KPSW99,
  author = {Efim Kinber and Christophe Papazian and Carl Smith and Rolf Wiehagen},
  title = {On the intrinsic complexity of learning recursive functions},
  booktitle = COLT,
  year = {1999},
  pages = {257--266},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{KSVW95,
  author = {Efim Kinber and Carl H. Smith and Mahendran Velauthapillai and Rolf
	Wiehagen},
  title = {On learning multiple concepts in parallel},
  journal = {J. of Comput. Syst. Sci.},
  year = {1995},
  volume = {50},
  pages = {41--52},
  number = {1},
  note = {Earlier version in 6th COLT, 1993}
}

@INPROCEEDINGS{KinberSt95,
  author = {Efim Kinber and Frank Stephan},
  title = {Language learning from texts: mind changes, limited memory and monotonicity},
  booktitle = COLT,
  year = {1995},
  pages = {182--189},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{KinberSt95a,
  author = {Efim Kinber and Frank Stephan},
  title = {Language Learning from Texts: Mindchanges, Limited Memory, and Monotonicity},
  journal = {Inform. Comput.},
  year = {1995},
  volume = {123},
  pages = {224--241},
  number = {2}
}

@INPROCEEDINGS{Kinber90,
  author = {E. B. Kinber},
  title = {Some problems of learning with an oracle},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1990},
  pages = {178--186},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{Kinber88,
  author = {E. B. Kinber},
  title = {Inductive Syntactical Synthesis of Programs From Sample Computations},
  booktitle = MFCS,
  year = {1988},
  volume = {324},
  series = {Lecture Notes in Computer Science},
  pages = {73--84}
}

@ARTICLE{Kinber83,
  author = {E. B. Kinber},
  title = {A note on Limit Identification of c-minimal Indices},
  journal = {Elektronische Informationsverarbeitung und Kybernetik},
  year = {1983},
  volume = {19},
  pages = {459--463}
}

@ARTICLE{Kinber77,
  author = {E. B. Kinber},
  title = {On Limit Identification of Minimal {G\"odel} Numbers for Functions
	from Enumerable Classes},
  journal = {Theory of Algorithms and Programs, Latvian State University, Riga},
  year = {1977},
  volume = {3},
  pages = {35--56}
}

@INPROCEEDINGS{Kinber77a,
  author = {E. B. Kinber},
  title = {On a Theory of Inductive Inference},
  booktitle = {International FCT-Conference},
  year = {1977},
  volume = {56},
  series = {Lecture Notes in Computer Science},
  pages = {435--440}
}

@ARTICLE{Kinber75,
  author = {E. B. Kinber},
  title = {On Comparison of Limit Identification and Limit Standardization of
	General Recursive Functions},
  journal = {Uch. zap. Latv. univ.},
  year = {1975},
  volume = {233},
  pages = {45--56}
}

@ARTICLE{Kinber74,
  author = {E. B. Kinber},
  title = {On the synthesis in the limit of almost minimal {G\"odel} numbers},
  journal = {Theory of Algorithms and Programs, Latvian State University, Riga},
  year = {1974},
  volume = {1},
  pages = {221--223}
}

@INPROCEEDINGS{KGZPS90,
  author = {E. B. Kinber and W. I. Gasarch and T. Zeugmann and M. K. Pleszkoch
	and C. H. Smith},
  title = {Learning via queries with teams and anomalies},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1990},
  pages = {327--337},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{KinberZe91,
  author = {E. B. Kinber and T. Zeugmann},
  title = {One-Sided Error Probabilistic Inductive Inference and Reliable Frequency
	Identification},
  journal = {Inform. Comput.},
  year = {1991},
  volume = {92},
  pages = {253--284}
}

@INPROCEEDINGS{KinberZe89,
  author = {E. B. Kinber and T. Zeugmann},
  title = {Monte-Carlo Inference and its Relations to Reliable Frequency Identification},
  booktitle = {Fundamentals of Computation Theory},
  year = {1989},
  volume = {380},
  series = {Lecture Notes in Computer Science},
  pages = {257--266},
  publisher = {Springer--Verlag}
}

@INPROCEEDINGS{KinberZe89a,
  author = {E. B. Kinber and T. Zeugmann},
  title = {Refined Query Inference},
  booktitle = {International Workshop on Analogical and Inductive Inference},
  year = {1989},
  volume = {397},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {148--160},
  publisher = {Springer--Verlag}
}

@ARTICLE{KinberZe85,
  author = {E. B. Kinber and T. Zeugmann},
  title = {Inductive inference of almost everywhere correct programs by reliably
	working strategies},
  journal = {Elektronische Informationsverarbeitung und Kybernetik},
  year = {1985},
  volume = {21},
  pages = {91--100}
}

@TECHREPORT{KindlShRo91,
  author = {M. Kindl and M. Shing and N. Rowe},
  title = {A stochastic approach to the weighted-region problem, {I}: The design
	of the path annealing algorithm},
  institution = {Computer Science, U. S. Naval Postgraduate School},
  year = {1991},
  address = {Monterey, CA}
}

@INPROCEEDINGS{KingsburyPa02,
  author = {P. Kingsbury and M. Palmer},
  title = {From {Treebank} to {PropBank}},
  booktitle = LREC,
  year = {2002},
  address = {Spain}
}

@INPROCEEDINGS{KingsburyPaMa02,
  author = {P. Kingsbury and M. Palmer and M. Marcus},
  title = {Adding semantic annotation to the {P}enn treebank},
  booktitle = HLT,
  year = {2002},
  address = {San Diego, CA}
}

@INPROCEEDINGS{KingsburyPaMa:02,
  author = {P. Kingsbury and M. Palmer and M. Marcus},
  title = {Adding semantic annotation to the {P}enn treebank},
  booktitle = HLT,
  year = {2002},
  address = {San Diego, CA}
}

@INPROCEEDINGS{KipperDaPa00,
  author = {Karin Kipper and Hoa Trang Dang and Martha Palmer},
  title = {Class-based construction of a verb lexicon},
  booktitle = AAAI,
  year = {2000},
  address = {Austin, TX},
  publisher = {AAAI}
}

@MISC{Kirsch94,
  author = {I. Kirsch},
  title = {Automatic Formulation of Queries in Textual Information Retrieval
	Systems},
  year = {1994},
  note = {Ph.D. Research Proposal},
  institution = {Bar-Ilan University}
}

@INPROCEEDINGS{KirshnerSm07,
  author = {S. Kirshner and P. Smyth},
  title = {Infinite mixtures of trees},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {417--424},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@ARTICLE{Kissin91,
  author = {Gloria Kissin},
  title = {Upper and Lower Bounds on Switching Energy in {VLSI}},
  journal = jacm,
  year = {1991},
  volume = {38},
  pages = {222-254},
  number = {1},
  month = jan,
  keywords = {Theory of Computation; Algorithms; Design; Measurement; Performance;
	Theory; addition; AND function; average-case analysis; CID VLSI circuit;
	circuit scheme; compare functions; embedding; energy consumption;
	energy-efficient; layout; multiswitch models; 1-switchable functions;
	OR function; parity function; switching energy; uniswitch energy;
	upper and lower bounds; USM; }
}

@INPROCEEDINGS{Kivinen89,
  author = {J. Kivinen},
  title = {Reliable and useful learning},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1989},
  pages = {365--380},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{KivinenMaUk94,
  author = {J. Kivinen and H. Mannila and E. Ukkonen},
  title = {Learning Rules with Local Exceptions},
  booktitle = EuroCOLT,
  year = {1994},
  volume = {New Series Number 53},
  series = {The Institute of Mathematics and its Applications Conference Series},
  pages = {35--46},
  address = {Oxford},
  publisher = {Oxford University Press},
  isbn = {0 19 853492 2}
}

@INPROCEEDINGS{KivinenMaUk92,
  author = {J. Kivinen and H. Mannila and E. Ukkonen},
  title = {Learning heirarchical rule sets},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1992},
  pages = {37--44},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{KivinenWa94,
  author = {J. Kivinen and M. Warmuth},
  title = {Using Experts for Predicting Continuous Outcomes},
  booktitle = EuroCOLT,
  year = {1994},
  volume = {New Series Number 53},
  series = {The Institute of Mathematics and its Applications Conference Series},
  pages = {109--120},
  address = {Oxford},
  publisher = {Oxford University Press},
  isbn = {0 19 853492 2}
}

@INPROCEEDINGS{KivinenWa99,
  author = {Jyrki Kivinen and Manfred K. Warmuth},
  title = {Averaging Expert Predictions},
  booktitle = EuroCOLT,
  year = {1999},
  volume = {1572},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {153--167},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{KivinenWa99a,
  author = {Jyrki Kivinen and Manfred K. Warmuth},
  title = {Boosting as entropy projection},
  booktitle = COLT,
  year = {1999},
  pages = {134--144},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{KivinenWa97,
  author = {J. Kivinen and M.~K. Warmuth},
  title = {Exponentiated Gradient Versus Gradient Descent for Linear Predictors},
  journal = {Information and Computation},
  year = {1997},
  volume = {132},
  pages = {1--63},
  number = {1}
}

@INPROCEEDINGS{KivinenWa95,
  author = {J. ~Kivinen and M.~K. Warmuth},
  title = {Exponentiated Gradient versus Gradient Descent for Linear Predictors},
  booktitle = STOC,
  year = {1995}
}

@INPROCEEDINGS{KivinenWa95a,
  author = {J. Kivinen and M. K. Warmuth},
  title = {The Perceptron algorithm vs. {W}innow: linear vs. logarithmic mistake
	bounds when few input variables are relevant},
  booktitle = COLT,
  year = {1995},
  pages = {289--296},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{KivinenWa95b,
  author = {Jyrki Kivinen and Manfred K. Warmuth},
  title = {Additive versus exponentiated gradient updates for linear prediction},
  booktitle = STOC,
  year = {1995},
  pages = {209--218},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{Kivinen-AI97,
  author = {J. Kivinen and M. K. Warmuth and P. Auer},
  title = {The {Perceptron} algorithm vs. {Winnow}: linear vs. logarithmic mistake
	bound when few input variables are relevant},
  journal = {Artificial Intelligence},
  year = {1997},
  volume = {1-2},
  pages = {325-343}
}

@ARTICLE{Klahr94,
  author = {David Klahr},
  title = {Children, adults, and machines as discovery systems},
  journal = {Machine Learning},
  year = {1994},
  volume = {14},
  pages = {313--320},
  number = {3}
}

@INPROCEEDINGS{KlamiKa07,
  author = {A. Klami and S. Kaski},
  title = {Local dependent components},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {425--432},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{KlasnerSi95,
  author = {Norbert Klasner and Hans Ulrich Simon},
  title = {From noise-free to noise-tolerant and from on-line to batch learning},
  booktitle = COLT,
  year = {1995},
  pages = {250--257},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{Klavans90,
  author = {J. Klavans and E. Tzoukermann},
  title = {The {BICORD} System},
  booktitle = COLING,
  year = {1990}
}

@INPROCEEDINGS{KlavansTz90,
  author = {J. Klavans and E. Tzoukermann},
  title = {The {BICORD} System},
  booktitle = COLING,
  year = {1990}
}

@INPROCEEDINGS{KleinMa03,
  author = {Klein, D. and Manning, C. D.},
  title = {Fast Exact Inference with a Factored Model for Natural Language Parsing},
  booktitle = NIPS,
  year = {2003},
  volume = {15},
  publisher = {MIT Press}
}

@INPROCEEDINGS{KSNM03,
  author = {D. Klein and J. Smarr and H. Nguyen and C. Manning},
  title = {Named Entity Recognition with Character-Level Models},
  booktitle = CoNLL,
  year = {2003},
  editor = {Walter Daelemans and Miles Osborne},
  pages = {180--183},
  publisher = {Edmonton, Canada}
}

@ARTICLE{Klein89,
  author = {Rolf Klein and Derick Wood},
  title = {On the Path Length of Binary Trees},
  journal = jacm,
  year = {1989},
  volume = {36},
  pages = {280-289},
  number = {2},
  month = apr,
  keywords = {Data Structures and Algorithms; Performance; Theory; Verification;
	binary search tree; comparison cost; fringe thickness; node visit
	cost; path length; ratio of means; upper bounds; }
}

@INBOOK{Klenin97,
  chapter = {16},
  pages = {279--300},
  title = {A practical approach for evaluating generalization performance},
  publisher = {MIT Press},
  year = {1997},
  author = {Marjorie Klenin},
  volume = {IV: Making Learning Systems Practical},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@INPROCEEDINGS{Klenner07,
  author = {Klenner, M.},
  title = {Shallow Dependency Labeling},
  booktitle = ACL,
  year = {2007},
  pages = {201--204},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P07-2051}
}

@INPROCEEDINGS{Klenner07a,
  author = {Klenner, M.},
  title = {Enforcing Consistency on Coreference Sets},
  booktitle = {RANLP},
  year = {2007}
}

@INPROCEEDINGS{Klenner06,
  author = {Klenner,M.},
  title = {Grammatical Role Labeling with Integer Linear Programming},
  booktitle = EACL,
  year = {2006}
}

@ARTICLE{Klette77,
  author = {R. Klette},
  title = {A few results on the complexity of classes of identifiable recursive
	function sets},
  journal = {Sektion Mathematik report 4 (M) 77, Friedrich Schiller Universitat,
	Jena},
  year = {1977},
  pages = {1--16}
}

@ARTICLE{Klette76,
  author = {R. Klette},
  title = {Indexmengen und {E}rkennung Rekursiver {F}unctionen},
  journal = {Zeitschr. f. math. Logik und Grundlagen d. Math. Bd.},
  year = {1976},
  volume = {22},
  pages = {231--238}
}

@ARTICLE{Klette76a,
  author = {R. Klette},
  title = {Recognizing algorithms for recursive functions},
  journal = {Elektronische Informationsverarbeitung und Kybernetik},
  year = {1976},
  volume = {12},
  pages = {227--243}
}

@ARTICLE{Klette75,
  author = {R. Klette},
  title = {Unterklassen in der {F}amilie {NUM} aller effektiv numerierbaren
	{M}engen von eistelligen allgemein rekursiven {F}unktionen},
  journal = {Kompliziertheit von Lern und Erkennungsprozessen},
  year = {1975},
  volume = {1},
  pages = {62--66}
}

@ARTICLE{KletteGo75,
  author = {R. Klette and B. Goetze},
  title = {Limes-rekursive {F}unktionen},
  journal = {Elektronische Informationsverarbeitung und Kybernetik},
  year = {1975},
  volume = {11},
  pages = {586--589}
}

@ARTICLE{KletteWi80,
  author = {R. Klette and R. Wiehagen},
  title = {Research in the Theory of Inductive Inference by {GDR} mathematicians
	-- {A} Survey},
  journal = {Inform. Sci.},
  year = {1980},
  volume = {22},
  pages = {149--169}
}

@ARTICLE{KlingsporMoRi96,
  author = {Volker Klingspor and Katharina J. Morik and Anke D. Rieger},
  title = {Learning Concepts from Sensor Data of a Mobile Robot},
  journal = {Machine Learning},
  year = {1996},
  volume = {23},
  pages = {305--332},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{KlivansSe01,
  author = {A.R.~Klivans and R.A.~Servedio},
  title = {Learning DNF in Time $2^{\tilde O(n^{1/3})}$},
  booktitle = STOC,
  year = {2001},
  pages = {258--265}
}

@INPROCEEDINGS{Klosgen93,
  author = {W. Klosgen},
  title = {Some Implementation Aspects of a Discovery System},
  booktitle = {Workshop on Knowledge Discovery in Databases},
  year = {1993}
}

@ARTICLE{Klosgen92,
  author = {W. Klosgen},
  title = {Problems for knowledge discovery in databases and their treatment
	in the statistics interpreter {EXPLORA}},
  journal = {International Journal for Intelligent Systems},
  year = {1992},
  volume = {7},
  pages = {649--673},
  number = {7}
}

@ARTICLE{Knessl90,
  author = {Charles Knessl and Charles Tier},
  title = {Asymptotic Expansions for Large Closed Queuing Networks},
  journal = jacm,
  year = {1990},
  volume = {37},
  pages = {144-174},
  number = {1},
  month = jan,
  keywords = {System Modeling and Analysis; Performance; Theory; asymptotics; singular
	perturbations; }
}

@ARTICLE{KnightGr98,
  author = {Knight, K. and Graehl, J.},
  title = {Machine Transliteration},
  journal = {Computational Linguistics},
  year = {1998},
  pages = {599--612}
}

@ARTICLE{KnobeKn76,
  author = {B. Knobe and K. Knobe},
  title = {A Method for Inferring Context-Free Grammars},
  journal = {Inform. Control},
  year = {1976},
  volume = {31},
  pages = {129--146}
}

@BOOK{Knuth81,
  title = {Seminumerical Algorithms},
  publisher = {Addison-Wesley},
  year = {1981},
  author = {D. E. Knuth},
  volume = {2},
  series = {The Art of Computer Programming},
  address = {Reading, MA},
  edition = {2nd}
}

@BOOK{Knuth73,
  title = {The Art of Computer Programming: Sorting and Searching},
  publisher = {Addison-Wesley},
  year = {1973},
  author = {Knuth, Donald E.},
  volume = {3}
}

@BOOK{Knuth68,
  title = {The Art of Computer Programming: Fundamental Algorithms},
  publisher = {Addison-Wesley},
  year = {1968},
  author = {Knuth, Donald E.},
  volume = {1}
}

@TECHREPORT{KnuthLaRo88,
  author = {Donald E. Knuth and Tracy Larrabee and Paul M. Roberts},
  title = {Mathematical Writing},
  institution = {Stanford University Computer Science Department},
  year = {1988},
  number = {STAN-CS-88-1193},
  month = Jan
}

@INPROCEEDINGS{Knuutila93,
  author = {T. Knuutila},
  title = {How to invent characterizable inference methods for regular languages},
  booktitle = {International Workshop on Analogical and Inductive Inference and
	International Workshop on Algorithmic Learning Theory},
  year = {1993},
  volume = {744},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {209--222},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{KoMiNy07,
  author = {Ko, Jeongwoo and Mitamura, Teruko and Nyberg, Eric},
  title = {Language-independent Probabilistic Answer Ranking for Question Answering},
  booktitle = ACL,
  year = {2007},
  pages = {784--791},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1099}
}

@INPROCEEDINGS{Ko90,
  author = {K. Ko},
  title = {On the complexity of learning minimum time-bounded {T}uring machines},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1990},
  pages = {82--96},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{KoHu87,
  author = {Ko, K. and Hua, C.},
  title = {A note on the two-variable pattern-finding problem},
  journal = {Journal of Computer and System Science},
  year = {1987},
  volume = {34},
  pages = {75--86}
}

@INPROCEEDINGS{KoMa90,
  author = {K. Ko and T. W. {Marron, Assaf}},
  title = {Learning String Patterns and Tree Patterns from Examples},
  booktitle = {Machine Learning: Proceedings of the seventh international conference},
  year = {1990},
  pages = {384--391}
}

@ARTICLE{Ko90a,
  author = {Ker-I Ko},
  title = {Seperating and Collapsing Results on the Relativized Probabilistic
	Polynomial-Time Hierarchy},
  journal = jacm,
  year = {1990},
  volume = {37},
  pages = {415-438},
  number = {2},
  month = apr,
  keywords = {Theory of Computation; Complexity; Theory; probablilistic computation;
	polynomial-time hierarchy; relativization; }
}

@INPROCEEDINGS{KobayashiInMa07,
  author = {Kobayashi, Nozomi and Inui, Kentaro and Matsumoto, Yuji},
  title = {Extracting Aspect-Evaluation and Aspect-Of Relations in Opinion Mining},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {1065--1074},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1114}
}

@INPROCEEDINGS{Kobayashi93,
  author = {S. Kobayashi},
  title = {Learning strategies using decision lists},
  booktitle = {International Workshop on Analogical and Inductive Inference and
	International Workshop on Algorithmic Learning Theory},
  year = {1993},
  volume = {744},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {370--383},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{KobayashiYo97,
  author = {Satoshi Kobayashi and Takashi Yokomori},
  title = {Identifiability of subspaces and homomorphic images of zero-reversible
	languages},
  booktitle = ALT,
  year = {1997},
  volume = {1316},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {48--61},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{KobayashiYo95,
  author = {Satoshi Kobayashi and Takashi Yokomori},
  title = {On approximately identifying concept classes in the limit},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1995},
  volume = {997},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {298--312},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{KobayashiYo94,
  author = {S. Kobayashi and T. Yokomori},
  title = {Learning concatenations of locally testable languages from positive
	data},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1994},
  volume = {872},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {407--422},
  publisher = {Springer-Verlag}
}

@ARTICLE{Kocabas91,
  author = {Sakir Kocabas},
  title = {Conflict Resolution as Discovery in Particle Physics},
  journal = {Machine Learning},
  year = {1991},
  volume = {6},
  pages = {277--309},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{Kodratoff95,
  author = {Yves Kodratoff},
  title = {Technical and scientific issues of {KDD}},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1995},
  volume = {997},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {261--265},
  publisher = {Springer-Verlag}
}

@ARTICLE{Kodratoff79,
  author = {Y. Kodratoff},
  title = {A class of functions synthesized from a finite number of examples
	and a {LISP} program scheme},
  journal = {Internat. J. Comput. Info. Sci.},
  year = {1979},
  volume = {8},
  pages = {489--521}
}

@INPROCEEDINGS{KodratoffFa78,
  author = {Y. Kodratoff and J. Fargues},
  title = {A sane algorithm for the synthesis of {LISP} functions from example
	problems},
  booktitle = {AISB/GI},
  year = {1978},
  pages = {169--175},
  organization = {AISB and GI}
}

@INPROCEEDINGS{KoehnHo07,
  author = {Koehn, Philipp and Hoang, Hieu},
  title = {Factored Translation Models},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {868--876},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1091}
}

@ARTICLE{KoenigSi96,
  author = {Sven Koenig and Reid G. Simmons},
  title = {The Effect of Representation and Knowledge on Goal-Directed Exploration
	with Reinforcement-Learning Algorithms},
  journal = {Machine Learning},
  year = {1996},
  volume = {22},
  pages = {227--250},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{KoenigSi96a,
  author = {Sven Koenig and Reid G. Simmons},
  title = {Passive distance learning for robot navigation},
  booktitle = ICML,
  year = {1996},
  pages = {266--274},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{KoenigSm96,
  author = {Sven Koenig and Yury Smirnov},
  title = {Graph learning with a nearest neighbor approach},
  booktitle = COLT,
  year = {1996},
  pages = {19--28},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{KogaHiAr94,
  author = {Y. Koga and E. Hirowatari and S. Arikawa},
  title = {Explanation-based reuse of {P}rolog programs},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1994},
  volume = {872},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {149--160},
  publisher = {Springer-Verlag}
}

@ARTICLE{KohaviBe93,
  author = {Ron Kohavi and Scott Benson},
  title = {Research Note on Decision Lists},
  journal = {Machine Learning},
  year = {1993},
  volume = {13},
  pages = {131--134},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{KohaviJo95,
  author = {Ron Kohavi and George H. John},
  title = {Automatic parameter selection by minimizing estimated error},
  booktitle = ICML,
  year = {1995},
  pages = {304--312},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{KohaviKu97,
  author = {Ron Kohavi and Clayton Kunz},
  title = {Option decision trees with majority votes},
  booktitle = ICML,
  year = {1997},
  pages = {161--169},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{KohaviWo96,
  author = {Ron Kohavi and David H. Wolpert},
  title = {Bias plus variance decomposition for zero-one loss functions},
  booktitle = ICML,
  year = {1996},
  pages = {275--283},
  publisher = {Morgan Kaufmann}
}

@BOOK{Kohavi78,
  title = {Switching and Finite Automata Theory},
  publisher = {McGraw-Hill},
  year = {1978},
  author = {Kohavi, Zvi},
  edition = {second},
  comment = {Chapter on State-Identification and Fault-Detection Experiments}
}

@BOOK{Kohonen01,
  title = {Self-Organizing Maps},
  publisher = {Springer, Berlin},
  year = {2001},
  author = {T. Kohonen},
  volume = {30},
  series = {Springer Series in Information Sciences}
}

@INPROCEEDINGS{Koiran94,
  author = {P. Koiran},
  title = {Efficient learning of continuous neural networks},
  booktitle = COLT,
  year = {1994},
  pages = {348--355},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{KoiranSo97,
  author = {Pascal Koiran and Eduardo D. Sontag},
  title = {{V}apnik-{C}hervonenkis dimension of recurrent neural networks},
  booktitle = EuroCOLT,
  year = {1997},
  volume = {1208},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {223--237},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{KokDo07,
  author = {S. Kok and P. Domingos},
  title = {Statistical predicate invention},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {433--440},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@ARTICLE{Kokar86,
  author = {Mieczyslaw M. Kokar},
  title = {Determining Arguments of Invariant Functional Descriptions},
  journal = {Machine Learning},
  year = {1986},
  volume = {1},
  pages = {403--422},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Kolaitis90,
  author = {Phokion G. Kolaitis and Christos H. Papadimitriou},
  title = {Some Computational Aspects of Circumscription},
  journal = jacm,
  year = {1990},
  volume = {37},
  pages = {1-14},
  number = {1},
  month = jan,
  keywords = {Artificial Intelligence; Theory; circumscription; first-order logic;
	Horn clauses; model checking; nonmonotonic reasoning; NP-completeness;
	undecidability; }
}

@INPROCEEDINGS{KollerSt07,
  author = {Koller, Alexander and Stone, Matthew},
  title = {Sentence generation as a planning problem},
  booktitle = ACL,
  year = {2007},
  pages = {336--343},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1043}
}

@INPROCEEDINGS{Koller99,
  author = {D. Koller},
  title = {Probabilistic relational models},
  booktitle = ILP,
  year = {1999},
  editor = {Sa\v{s}o D\v{z}eroski and Peter Flach},
  pages = {3--13},
  publisher = {Springer Verlag},
  note = {Invited contribution}
}

@INPROCEEDINGS{KollerFr98,
  author = {Daphne Koller and Raya Fratkina},
  title = {Using learning for approximation in stochastic processes},
  booktitle = ICML,
  year = {1998},
  pages = {287--295},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{KollerLePf97,
  author = {Koller, D. and Alon Y. Levy and Pfeffer, A.},
  title = {P-{CLASSIC}: A Tractable Probablistic Description Logic},
  booktitle = {AAAI-IAAI},
  year = {1997},
  pages = {390-397},
  url = {citeseer.ist.psu.edu/koller97pclassic.html}
}

@INPROCEEDINGS{KollerPf98,
  author = {Koller, D. and Pfeffer, A.},
  title = {Probabilistic Frame-Based Systems},
  booktitle = AAAI,
  year = {1998},
  pages = {580-587}
}

@INPROCEEDINGS{KollerSa97,
  author = {Daphne Koller and Mehran Sahami},
  title = {Hierarchically classifying documents using very few words},
  booktitle = ICML,
  year = {1997},
  pages = {170--178},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{KollerSa96,
  author = {Daphne Koller and Mehran Sahami},
  title = {Toward optimal feature selection},
  booktitle = ICML,
  year = {1996},
  pages = {284--292},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{Kolmogorov68,
  author = {Kolmogorov, Andrei N.},
  title = {Logical Basis for Information Theory and Probability Theory},
  journal = {IEEE Transactions on Information Theory},
  year = {1968},
  volume = {IT-14},
  pages = {662--664},
  number = {5},
  month = Sep,
  comment = {Definition of `Kolmogorov' complexity; analogy to information- theoretic
	entropy; notion of random sequences}
}

@INPROCEEDINGS{Koltun01,
  author = {V. Koltun},
  title = {Almost tight upper bounds for vertical decomposition in four dimensions},
  booktitle = FOCS,
  year = {2001},
  pages = {56--65}
}

@INPROCEEDINGS{KomlosPa88,
  author = {Komlos, J. and R. Paturi},
  title = {Effect of Connectivity in Associative Memory Models},
  booktitle = FOCS,
  year = {1988},
  pages = {138--147},
  month = Oct
}

@ARTICLE{KomlosPa88a,
  author = {Komlos, J. and R. Paturi},
  title = {Convergence Results in Associative Memory Models},
  journal = {Neural Networks},
  year = {1988},
  volume = {1}
}

@INPROCEEDINGS{Konagaya93,
  author = {A. Konagaya},
  title = {A stochastic approach to genetic information processing},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1993},
  volume = {743},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {25--36},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{KongDi95,
  author = {Eun Bae Kong and Thomas G. Dietterich},
  title = {Error-correcting output coding corrects bias and variance},
  booktitle = ICML,
  year = {1995},
  pages = {313--321},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{KononenkoBr91,
  author = {Igor Kononenko and Ivan Bratko},
  title = {Information-Based Evaluation Criterion for Classifier's Performance},
  journal = {Machine Learning},
  year = {1991},
  volume = {6},
  pages = {67--80},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{KooCaCo08,
  author = {Koo, T. and Carreras, X. and Collins, M.},
  title = {Simple Semi-supervised Dependency Parsing},
  booktitle = HLT,
  year = {2008},
  pages = {595--603},
  address = {Columbus, Ohio},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P08/P08-1068}
}

@INPROCEEDINGS{KooCaCo08a,
  author = {Terry Koo and Xavier Carreras and Michael Collins},
  title = {Simple Semi-supervised Dependency Parsing},
  booktitle = {Proceedings of ACL-08:HLT},
  year = {2008},
  pages = {595--603},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@INPROCEEDINGS{KGCC07,
  author = {Koo, Terry and Globerson, Amir and Carreras, Xavier and Collins,
	Michael},
  title = {Structured Prediction Models via the Matrix-Tree Theorem},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {141--150},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1015}
}

@ARTICLE{Koppel91,
  author = {Moshe Koppel},
  title = {Learning to Predict Non-Deterministically Generated Strings},
  journal = {Machine Learning},
  year = {1991},
  volume = {7},
  pages = {85--99},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{KoppelSeFe94,
  author = {Moshe Koppel and Alberto Maria Segre and Ronen Feldman},
  title = {Getting the most from flawed theories},
  booktitle = ICML,
  year = {1994},
  pages = {139--147},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{Kortelainen89,
  author = {Juha Kortelainen},
  title = {The Conjecture of {F}liess on Commutative Context-Free Languages},
  journal = jacm,
  year = {1989},
  volume = {36},
  pages = {870-872},
  number = {4},
  month = oct,
  keywords = {Formal Languages; Languages; commutative languages; context-free languages;}
}

@INPROCEEDINGS{Koshiba95,
  author = {Takeshi Koshiba},
  title = {Typed pattern languages and their learnability},
  booktitle = EuroCOLT,
  year = {1995},
  volume = {904},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {367--379},
  publisher = {Springer-Verlag}
}

@ARTICLE{KoshibaMTa97,
  author = {Takeshi Koshiba and Erkki M{\"a}kinen and Yuji Takada},
  title = {Learning deterministic even linear languages from positive examples},
  journal = {Theoret. Comput. Sci.},
  year = {1997},
  volume = {185},
  pages = {63--79},
  number = {1},
  note = {Special issue for ALT '95}
}

@INPROCEEDINGS{KoshibaMTa95,
  author = {Takeshi Koshiba and Erkki M{\"a}kinen and Yuji Takada},
  title = {Learning strongly deterministic even linear languages from positive
	examples},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1995},
  volume = {997},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {41--54},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{KosmyninDa96,
  author = {Kosmynin, A. and Davidson, I},
  title = {Using Background Contextual Knowledge For Documents Representation},
  booktitle = {PODP Workshop},
  year = {1996},
  address = {Palo-Alto}
}

@INPROCEEDINGS{Kowalczyk97,
  author = {A. Kowalczyk},
  title = {Dense shattering and teaching dimensions for differentiable families},
  booktitle = COLT,
  year = {1997},
  pages = {143--151},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{KoyamaLa92,
  author = {K. Koyama and T. Lai},
  title = {An interactive knowledge transfer model and analysis of {M}astermind
	game},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1992},
  pages = {196--206},
  publisher = {IOS Press}
}

@INBOOK{Koza94,
  chapter = {19},
  pages = {321--346},
  title = {Evolution of a subsumption architecture that performs a wall following
	task for an autonomous mobile robot},
  publisher = {MIT Press},
  year = {1994},
  author = {John R. Koza},
  volume = {II: Intersections Between Theory and Experiment},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@INPROCEEDINGS{KozarevaRiHo08,
  author = {Kozareva, Z. and Riloff, E. and Hovy, E.},
  title = {Semantic Class Learning from the Web with Hyponym Pattern Linkage
	Graphs},
  booktitle = {ACL-HLT},
  year = {2008},
  url = {http://www.aclweb.org/anthology/P/P08/P08-1119}
}

@ARTICLE{KozenPaSc94,
  author = {Dexter Kozen and Jens Palsberg and Michael I. Schwartzbach},
  title = {Efficient inference of partial types},
  journal = {J. of Comput. Syst. Sci.},
  year = {1994},
  volume = {49},
  pages = {306--324},
  number = {2}
}

@INPROCEEDINGS{KramerBr07,
  author = {N. Kr\"{a}mer and M. Braun},
  title = {Kernelizing {PLS}, degrees of freedom, and efficient model selection},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {441--448},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@ARTICLE{Kramer62,
  author = {Kramer},
  title = {A Note on the self-consistency definitions of generalization and
	inductive inference},
  journal = {J. ACM},
  year = {1962},
  pages = {280--281}
}

@INPROCEEDINGS{Kramer01,
  author = {Stefan Kramer},
  title = {Demand-Driven Construction of Structural Features in ILP},
  booktitle = ILP,
  year = {2001},
  editor = {Celine Rouveirol and Michele Sebag},
  volume = {2157 of LNAI},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{KramerFr00,
  author = {S. Kramer and E. Frank},
  title = {Bottom-Up propositionalization},
  booktitle = {ILP - Work-In-Progress Track},
  year = {2000},
  location = {Imperial College, London}
}

@INCOLLECTION{KramerLaFl01,
  author = {S. Kramer and N. Lavrac and P. Flach},
  title = {Propositionalization Approaches to Relational Data Mining},
  booktitle = {Relational Data Mining},
  publisher = {Springer Verlag},
  year = {2001},
  editor = {Dzeroski, S. and Lavrac, N.}
}

@INPROCEEDINGS{KramerDeRa01,
  author = {S. Kramer and L. De Raedt},
  title = {Feature Construction with Version Spaces for Biochemical Applications},
  booktitle = ICML,
  year = {2001}
}

@INPROCEEDINGS{KrauseGu07,
  author = {A. Krause and C. Guestrin},
  title = {Nonmyopic active learning of {Gaussian} processes: an exploration-exploitation
	approach},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {449--456},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{KrishnanLoVi95,
  author = {P. Krishnan and Philip M. Long and Jeffrey Scott Vitter},
  title = {Learning to make rent-to-buy decisions with systems applications},
  booktitle = ICML,
  year = {1995},
  pages = {322--330},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{KBMSH94,
  author = {A. Krogh and M. Brown and I. S. Mian and K. Sj{\"o}lander and D.
	Haussler},
  title = {Hidden {Markov} models in computational biology: Applications to
	protein modeling},
  journal = {Journal of Molecular Biology},
  year = {1994},
  volume = {235},
  pages = {1501--1531},
  month = feb,
  annotate = {The JMB paper.}
}

@ARTICLE{KroghMiHa94,
  author = {A. Krogh and I. S. Mian and D. Haussler},
  title = {A Hidden {M}arkov Model that finds genes in {\em E. coli} {DNA}},
  journal = {Nucleic Acids Research},
  year = {1994},
  volume = {22},
  pages = {4768--4778}
}

@INPROCEEDINGS{KropotovVe07,
  author = {D. Kropotov and D. Vetrov},
  title = {On one method of non-diagonal regularization in sparse {Bayesian}
	learning},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {457--464},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@ARTICLE{KrovetzCr92,
  author = {R. Krovetz and W. B. Croft},
  title = {Lexical Ambiguity and Information Retrieval},
  journal = {ACM Transactions on Information Systems},
  year = {1992},
  volume = {10},
  pages = {115--141},
  number = {2}
}

@ARTICLE{KrovvidyWe93,
  author = {Srinivas Krovvidy and William G. Wee},
  title = {Wastewater Treatment Systems from Case-Based Reasoning},
  journal = {Machine Learning},
  year = {1993},
  volume = {10},
  pages = {341--363},
  publisher = {Kluwer Academic Publishers, Boston}
}

@MISC{Krymolowski99,
  author = {Y. Krymolowski},
  year = {1999},
  note = {Private communication}
}

@BOOK{brown-corpus,
  title = {Computational Analysis of Present-Day {A}merican {E}nglish},
  publisher = {Brown University Press},
  year = {1967},
  author = {H. Ku\v{c}era and W. N. Francis},
  address = {Providence, RI}
}

@INPROCEEDINGS{Kubat96,
  author = {Miroslav Kubat},
  title = {Second tier for decision trees},
  booktitle = ICML,
  year = {1996},
  pages = {293--301},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{KubatHoMa98,
  author = {Miroslav Kubat and Robert C. Holte and Stan Matwin},
  title = {Machine learning for the detection of oil spills in satellite radar
	images},
  journal = {Machine Learning},
  year = {1998},
  volume = {30},
  pages = {195--215},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{KubatMa97,
  author = {Miroslav Kubat and Stan Matwin},
  title = {Addressing the curse of imbalanced training sets: one-sided selection},
  booktitle = ICML,
  year = {1997},
  pages = {179--186},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{KuceraMaPr88,
  author = {L. Kucera and A. Marchetti-Spaccamela and M. Protasi},
  title = {On the Learnability of {D}{N}{F} Formulae},
  booktitle = ICALP,
  year = {1988},
  volume = {317},
  series = {Lecture Notes in Computer Science},
  pages = {347--361},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{KudohMa00,
  author = {Kudoh, T. and Y. Matsumoto},
  title = {Use of support vector machines for chunk identifiation},
  booktitle = CoNLL,
  year = {2000},
  pages = {142--147},
  address = {Lisbon, Protugal}
}

@ARTICLE{Kugel77,
  author = {Kugel, Peter},
  title = {Induction, Pure and Simple},
  journal = {Information and Control},
  year = {1977},
  volume = {35},
  pages = {276--336}
}

@INPROCEEDINGS{KuhPeRi91,
  author = {A. Kuh and T. Petsche and R. L. Rivest},
  title = {Learning Time-Varying Concepts},
  booktitle = NIPS,
  year = {1991},
  pages = {183--189},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{KuhPeRi91a,
  author = {T. Kuh and T. Petsche and R. Rivest},
  title = {Mistake bounds of incremental learners when concepts drift with applications
	to feedforward networks},
  booktitle = NIPS,
  year = {1991},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{KuhPeRi90,
  author = {T. Kuh and T. Petsche and R. Rivest},
  title = {Learning time varying concepts},
  booktitle = NIPS,
  year = {1990},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{KuhRi92,
  author = {T. P. Anthony Kuh and R. L. Rivest},
  title = {Incrementally Learning Time-Varying Half-planes},
  booktitle = NIPS,
  year = {1992},
  pages = {920--927},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{Kuhlmann00,
  author = {Christian Kuhlmann},
  title = {Hardness Results for General Two-Layer Neural Networks},
  booktitle = COLT,
  year = {2000},
  pages = {275--285},
  publisher = {Morgan Kaufmann, San Francisco}
}

@INPROCEEDINGS{Kuhlmann99,
  author = {Christian Kuhlmann},
  title = {On Teaching and Learning Intersection-Closed Concept Classes},
  booktitle = EuroCOLT,
  year = {1999},
  volume = {1572},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {168--182},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{KuhlmannM07,
  author = {Kuhlmann, Marco and M\"ohl, Mathias},
  title = {Mildly Context-Sensitive Dependency Languages},
  booktitle = ACL,
  year = {2007},
  pages = {160--167},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1021}
}

@TECHREPORT{Kukich91,
  author = {K. Kukich},
  title = {Automatic Spelling Correction: Detection, Correction and Context-Dependent
	Techniques},
  institution = {Bellcore},
  year = {1991},
  address = {Morristown, NJ 07960},
  month = {November},
  note = {Draft}
}

@TECHREPORT{Kulkarni89,
  author = {S. Kulkarni},
  title = {On Metric Entripy, {V}apnik-{C}hervonenkis Dimension, and Learnability
	for a Class of Distributions},
  institution = {Center for Intelligent Control Systems, MIT},
  year = {1989},
  number = {LIDS-P-1910}
}

@INPROCEEDINGS{KulkarniZe93,
  author = {S. Kulkarni and O. Zeitouni},
  title = {On probably correct classification of concepts},
  booktitle = COLT,
  year = {1993},
  pages = {111--116},
  publisher = {ACM Press, New York, NY}
}

@PHDTHESIS{Kulkarni91,
  author = {S. R. Kulkarni},
  title = {Problems of computational and information complexity in machine vision
	and learning},
  school = {MIT EECS},
  year = {1991},
  note = {(Also CICS report CICS-TH-298.)}
}

@ARTICLE{KulkarniMiTs93,
  author = {S. R. Kulkarni and S. K. Mitter and J. N. Tsitsiklis},
  title = {Active Learning Using Arbitrary Binary Valued Queries},
  journal = {Machine Learning},
  year = {1993},
  volume = {11},
  pages = {23--35},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{KMTZ92,
  author = {S. R. Kulkarni and S. K. Mitter and J. N. Tsitsiklis and O. Zeitouni},
  title = {{PAC} learning with generalized samples and an application to stochastic
	geometry},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1992},
  pages = {172--179},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{Kullback71,
  author = {Kullback, S.},
  title = {Marginal Homogeneity of Multidimensional Contingency Tables},
  journal = {Annals of Mathematical Statistics},
  year = {1971},
  volume = {42},
  pages = {594--606},
  number = {2},
  comment = {Uses maximum entropy solution to derive minimum discrimination information
	statistic.}
}

@ARTICLE{Kullback68,
  author = {Kullback, S.},
  title = {Probability Densities with Given Marginals},
  journal = {Annals of Mathematical Statistics},
  year = {1968},
  volume = {39},
  pages = {1236--1243},
  number = {4},
  comment = {Extension of Ireland/Kullback results to continuous densities.}
}

@INPROCEEDINGS{Kulp96,
  author = {Kulp, D. and Haussler, D. and Reese, M.G. and Eeckman, F.H.},
  title = {A Generalized Hidden {M}arkov Model for the Recognition of Human
	Genes in {DNA}},
  booktitle = ISMB,
  year = {1996},
  pages = {134--142},
  month = Jun
}

@INPROCEEDINGS{KumarMiYi03,
  author = {P. Kumar and J. S. B. Mitchell and E. A. Yildirim},
  title = {Fast smallest enclosing hypersphere computation},
  booktitle = {ALENEX},
  year = {2003},
  pages = {to appear}
}

@INPROCEEDINGS{KumarSi99,
  author = {R. Kumar and D. Sivakumar},
  title = {Roundness Estimation via Random Sampling},
  booktitle = SODA,
  year = {1999},
  pages = {603--612}
}

@INPROCEEDINGS{KumarOcMa07,
  author = {Kumar, Shankar and Och, Franz J. and Macherey, Wolfgang},
  title = {Improving Word Alignment with Bridge Languages},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {42--50},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1005}
}

@ARTICLE{Kummer95,
  author = {Martin Kummer},
  title = {A learning theoretic characterization of classes of recursive functions},
  journal = {Information Processing Letters},
  year = {1995},
  volume = {54},
  pages = {205--211}
}

@INPROCEEDINGS{Kummer94,
  author = {M. Kummer},
  title = {The strength of noninclusions for teams of finite learners},
  booktitle = COLT,
  year = {1994},
  pages = {268--277},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{KummerOt96,
  author = {Martin Kummer and Matthias Ott},
  title = {Learning branches and learning to win closed games},
  booktitle = COLT,
  year = {1996},
  pages = {280--291},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{KummerSt96,
  author = {Martin Kummer and Frank Stephan},
  title = {On the structure of the Degrees of Inferability},
  journal = {J. of Comput. Syst. Sci.},
  year = {1996},
  volume = {52},
  pages = {214--238},
  number = {2},
  note = {Earlier version in Sixth Annual Conference on Computational Learning
	Theory, 1993}
}

@INPROCEEDINGS{KummerSt94,
  author = {M. Kummer and F. Stephan},
  title = {Inclusion problems in parallel learning and games},
  booktitle = COLT,
  year = {1994},
  pages = {287--298},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{Kupiec93,
  author = {J. Kupiec},
  title = {An algorithm for finding noun phrase correspondences in bilingual
	corpora},
  booktitle = ACL,
  year = {1993}
}

@INPROCEEDINGS{Kupiec93a,
  author = {Julian Kupiec},
  title = {{MURAX}: A robust linguistic approach for question answering using
	an on-line encyclopedia},
  booktitle = SIGIR,
  year = {1993},
  pages = {181--190}
}

@ARTICLE{Kupiec92,
  author = {J. Kupiec},
  title = {Robust part-of-speech tagging using a hidden {M}arkov model},
  journal = CSL,
  year = {1992},
  volume = {6},
  pages = {225--242}
}

@INPROCEEDINGS{Kurita93,
  author = {T. Kurita},
  title = {Iterative weighted least squares algorithms for neural networks classifiers},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1993},
  volume = {743},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {77--86},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{KurtzRo88,
  author = {S. A. Kurtz and J. S. Royer},
  title = {Prudence in Language Learning},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1988},
  pages = {143--156},
  publisher = {Morgan Kaufmann, Inc.}
}

@INPROCEEDINGS{KurtzSm89,
  author = {S. A. Kurtz and C. H. Smith},
  title = {On the role of search for learning},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1989},
  pages = {303--311},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{Kushilevitz96,
  author = {Eyal Kushilevitz},
  title = {A simple algorithm for learning {O}(log n)-term {DNF}},
  booktitle = COLT,
  year = {1996},
  pages = {266--269},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{KushilevitzMa93,
  author = {E. Kushilevitz and Y. Mansour},
  title = {Learning Decision Trees using the Fourier Spectrum},
  journal = SIJC,
  year = {1993},
  volume = {22},
  pages = {1331--1348},
  number = {6},
  note = {Earlier version appeared in Proc. 23rd Ann. IEEE Symp. on Foundations
	of Computer Science, 1991}
}

@INPROCEEDINGS{KushilevitzMa91,
  author = {E. Kushilevitz and Y. Mansour},
  title = {Learning decision trees using the Fourier sprectrum},
  booktitle = FOCS,
  year = {1991},
  pages = {455--464}
}

@ARTICLE{KushilevitzOsRa00,
  author = {E. Kushilevitz and R. Ostrovsky and Y. Rabani},
  title = {Efficient Search for Approximate Nearest Neighbor in High Dimensional
	Spaces},
  journal = SICOMP,
  year = {2000},
  volume = {2},
  pages = {457--474},
  number = {30},
  url = {http://epubs.siam.org/sam-bin/dbq/article/34717}
}

@INPROCEEDINGS{KushilevitzOsRa98,
  author = {E. Kushilevitz and R. Ostrovsky and Y. Rabani},
  title = {Efficient Search for Approximate Nearest Neighbor in High Dimensional
	Spaces},
  booktitle = STOC,
  year = {1998},
  pages = {614--623}
}

@INPROCEEDINGS{KuzminWa07,
  author = {D. Kuzmin and M. Warmuth},
  title = {Online kernel {PCA} with entropic matrix updates},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {465--472},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{Kwek97,
  author = {Stephen Kwek},
  title = {Learning disjunctions of features},
  booktitle = ALT,
  year = {1997},
  volume = {1316},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {401--415},
  publisher = {Springer-Verlag}
}

@ARTICLE{KwekPi98,
  author = {Stephen Kwek and Leonard Pitt},
  title = {{PAC} Learning Intersections of Halfspaces with Membership Queries},
  journal = {Algorithmica},
  year = {1998},
  volume = {22},
  pages = {53--75},
  number = {1/2},
  comment = {first in 9th COLT '96}
}

@INPROCEEDINGS{Kwek99,
  author = {Stephen S. Kwek},
  title = {An apprentice learning model},
  booktitle = COLT,
  year = {1999},
  pages = {63--74},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{Kwok90,
  author = {K. L. Kwok},
  title = {Experiments with a component theory of probabilistic information
	retrieval based on single terms as document components},
  journal = {{ACM} Transactions on Information Systems},
  year = {1990},
  volume = {8},
  pages = {363--386},
  number = {4}
}

@INPROCEEDINGS{KwonKaOh94,
  author = {K. H. Kwon and K. Kang and J. H. Oh},
  title = {Generalization in partially connected layered neural networks},
  booktitle = COLT,
  year = {1994},
  pages = {356--361},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{KwongTs07,
  author = {Kwong, Oi Yee and Tsou, Benjamin K.},
  title = {Extending a Thesaurus in the Pan-{C}hinese Context},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {325--333},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1034}
}

@TECHREPORT{Kyburg85,
  author = {Kyburg, Henry E. Jr},
  title = {Bayesian and Non-Baysian Evidential Updating},
  institution = {University of Rochester Computer Science Department},
  year = {1985},
  number = {TR 139},
  month = Jul
}

@INPROCEEDINGS{KoblerLi97,
  author = {Johannes K{\"o}bler and Wolfgang Lindner},
  title = {Oracles in ${\Sigma}^p_2$ are sufficient for exact learning},
  booktitle = ALT,
  year = {1997},
  volume = {1316},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {277--290},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{AllweinScSi00,
  author = {Allwein E. L. and R. E. Schapire and Y. Singer},
  title = {Reducing multiclass to binary: a unifying approach for margin classifiers},
  booktitle = {International Workshop on Machine Learning},
  year = {2000},
  pages = {9--16}
}

@INPROCEEDINGS{Lafferty99,
  author = {John Lafferty},
  title = {Additive models, boosting, and inference for generalized divergences},
  booktitle = COLT,
  year = {1999},
  pages = {125--133},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{LaffertyMcPe01,
  author = {J. Lafferty and A. McCallum and F. Pereira},
  title = {Conditional Random Fields: {P}robabilistic Models for Segmenting
	and Labeling Sequence Data},
  booktitle = ICML,
  year = {2001}
}

@INPROCEEDINGS{Lafferty92,
  author = {John Lafferty and Daniel Slator and Davy Temperley},
  title = {Grammatical trigrams: A probabilisitc approach to {L}ink {G}rammar},
  booktitle = {Working Notes, AAAI Fall Symposium on Probabilistic Approaches to
	Natural Language},
  year = {1992}
}

@INPROCEEDINGS{LaffertySlTe92,
  author = {John Lafferty and Daniel Slator and Davy Temperley},
  title = {Grammatical trigrams: A probabilisitc approach to {L}ink {G}rammar},
  booktitle = {Working Notes, AAAI Fall Symposium on Probabilistic Approaches to
	Natural Language},
  year = {1992}
}

@INCOLLECTION{Lai88,
  author = {T. L. Lai},
  title = {Asymptotic Solutions of Bandit Problems},
  booktitle = {Stochastic Differential Systems, Stochastic Control Theory and Applications},
  publisher = {Springer-Verlag},
  year = {1988},
  editor = {W. Fleming and P. L. Lions},
  comment = {survey paper}
}

@ARTICLE{Lai87,
  author = {Tze Leung Lai},
  title = {Adaptive Treatment Allocation and the Multi-armed Bandit Problem},
  journal = {Annals of Statistics},
  year = {1987},
  volume = {15},
  pages = {1091--1114},
  number = {3}
}

@ARTICLE{LaiRo85,
  author = {T. L. Lai and Herbert Robbins},
  title = {Asymptotically Efficient Adaptive Allocation Rules},
  journal = {Advances in Applied Mathematics},
  year = {1985},
  volume = {6},
  pages = {4--22},
  comment = {asymptotically optimal result for bandit problems}
}

@ARTICLE{LaiRo84,
  author = {T. L. Lai and Herbert Robbins},
  title = {Optimal sequential sampling from two populations},
  journal = {Proceedings National Academy Science USA},
  year = {1984},
  volume = {81},
  pages = {1284--1286},
  month = Feb
}

@ARTICLE{LaiYi88,
  author = {Tze Leung Lai and Zhiliang Ying},
  title = {Open Bandit Processes and Optimal Scheduling of Queueing Networks},
  journal = {Advances in Applied Probability},
  year = {1988},
  volume = {20},
  pages = {447--472}
}

@ARTICLE{LairdNeRo87,
  author = {Laird, J.E. and A. Newell and P.S. Rosenbloom},
  title = {SOAR: An architecture for General Intelligence},
  journal = {Artificial Intelligence},
  year = {1987},
  volume = {33},
  pages = {1--64},
  number = {1},
  month = Sep
}

@ARTICLE{LairdRoNe86,
  author = {Laird, John and Paul Rosenbloom and Allen Newell},
  title = {Chunking in {S}oar: the anatomy of a general learning mechanism},
  journal = {Machine Learning},
  year = {1986},
  volume = {1},
  pages = {11--46},
  number = {1}
}

@INPROCEEDINGS{LairdRoNe84,
  author = {Laird, John and Paul Rosenbloom and Allen Newell},
  title = {Towards Chunking as a General Learning Mechanism},
  booktitle = AAAI,
  year = {1984},
  pages = {188--192},
  month = aug,
  orgainzation = {American Association for Artificial Intelligence}
}

@INPROCEEDINGS{Laird93,
  author = {P. Laird},
  title = {Identifying and using patterns in sequential data},
  booktitle = {International Workshop on Analogical and Inductive Inference and
	International Workshop on Algorithmic Learning Theory},
  year = {1993},
  volume = {744},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {1--18},
  publisher = {Springer-Verlag}
}

@TECHREPORT{Laird88,
  author = {P. Laird},
  title = {Learning by Making Models},
  institution = {NASA-Ames Reasarch Center},
  year = {1988},
  number = {RIA-88-4-12-0}
}

@INPROCEEDINGS{Laird86,
  author = {P. Laird},
  title = {Inductive inference by refinement},
  booktitle = AAAI,
  year = {1986},
  pages = {472--476},
  organization = {AAAI},
  annote = {Earlier version is Yale Comp Sci TR-376 from 1985}
}

@ARTICLE{LairdGa91,
  author = {Philip Laird and Evan Gamble},
  title = {A `{PAC}' Algorithm for Making Feature Maps},
  journal = {Machine Learning},
  year = {1991},
  volume = {6},
  pages = {145--160},
  publisher = {Kluwer Academic Publishers, Boston}
}

@TECHREPORT{LairdGa88,
  author = {Laird, Philip and Evan Gamble},
  title = {Learning a Probability Distribution Efficiently and Reliably},
  institution = {NASA Ames Research Center},
  year = {1988},
  month = oct
}

@INPROCEEDINGS{LairdRDu93,
  author = {P. Laird and S. R and P. Dunning},
  title = {A model of sequence extrapolation},
  booktitle = COLT,
  year = {1993},
  pages = {84--93},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{LairdSa94,
  author = {Philip Laird and Ronald Saul},
  title = {Discrete Sequence Prediction and Its Applications},
  journal = {Machine Learning},
  year = {1994},
  volume = {15},
  pages = {43--68},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{Laird88a,
  author = {Philip D. Laird},
  title = {Efficient Unsupervised Learning},
  booktitle = COLT,
  year = {1988},
  pages = {297--311},
  publisher = {Morgan-Kaufmann}
}

@BOOK{Laird88b,
  title = {Learning from Good and Bad Data},
  publisher = {Kluwer Academic Publishers},
  year = {1988},
  author = {Philip D. Laird},
  series = {Kluwer international series in engineering and computer science},
  address = {Boston},
  comment = {His PhD thesis in book form}
}

@BOOK{Lakoff87,
  title = {Women, fire, and dangerous things},
  publisher = {Univ. of Chicago Press},
  year = {1987},
  author = {G. Lakoff}
}

@ARTICLE{LammaRiPe00,
  author = {E. Lamma and F. Riguzzi and L. M. Pereira},
  title = {Strategies in Combined Learning via Logic Programs},
  journal = {Machine Learning},
  year = {2000},
  volume = {38},
  pages = {63--87},
  number = {1/2},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Landau89,
  author = {G. M. Landau and U. Vishkin},
  title = {Fast parallel and serial approximate string matching},
  journal = {Journal of Algorithms},
  year = {1989},
  volume = {10},
  pages = {157-169},
  number = {2}
}

@ARTICLE{LandauVi89,
  author = {G. M. Landau and U. Vishkin},
  title = {Fast parallel and serial approximate string matching},
  journal = {Journal of Algorithms},
  year = {1989},
  volume = {10},
  pages = {157-169},
  number = {2}
}

@ARTICLE{LandauerDu97,
  author = {Thomas K. Landauer and Susan T. Dumais},
  title = {A Solution to Plato's Problem: The Latent Semantic Analysis Theory
	of Acquisition, Induction, and Representation of Knowledge},
  journal = {Psychological Review},
  year = {1997},
  volume = {104(2)},
  pages = {211-240}
}

@INPROCEEDINGS{Landauer90,
  author = {Thomas K. Landauer and Michael L. Littman},
  title = {Fully automatic cross-language document retrieval using latent semantic
	indexing},
  booktitle = UWOED,
  year = {1990}
}

@INPROCEEDINGS{LandauerLi90,
  author = {Thomas K. Landauer and Michael L. Littman},
  title = {Fully automatic cross-language document retrieval using latent semantic
	indexing},
  booktitle = UWOED,
  year = {1990}
}

@INCOLLECTION{LandesLeTe98,
  author = {S. Landes and C. Leacock and R. I. Tengi},
  title = {Building Semantic Concordances},
  booktitle = {WordNet: an Electoronic Lexical Database},
  publisher = {The MIT Press},
  year = {1998},
  editor = {C. Fellbaum},
  pages = {199--216}
}

@INPROCEEDINGS{Lang95,
  author = {Ken Lang},
  title = {News{W}eeder: learning to filter netnews},
  booktitle = ICML,
  year = {1995},
  pages = {331--339}
}

@INPROCEEDINGS{Lang95a,
  author = {Kevin J. Lang},
  title = {Hill climbing beats genetic search on a {B}oolean circuit problem
	of {K}oza's},
  booktitle = ICML,
  year = {1995},
  pages = {340--343},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{Lang92,
  author = {K. J. Lang},
  title = {Random {DFA}'s can be approximately learned from sparse uniform examples},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1992},
  pages = {45--52},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{LangPePr98,
  author = {K. J. Lang and B. A. Pearlmutter and R. A. Price},
  title = {Results of the {A}bbadingo one {DFA} learning competition and a new
	evidence-driven state merging algorithm},
  booktitle = {International Workshop on Algorithmic Learning},
  year = {1998},
  volume = {1433},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {1--12},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Lange94,
  author = {S. Lange},
  title = {The representation of recursive languages and its impact on the efficiency
	of learning},
  booktitle = COLT,
  year = {1994},
  pages = {256--267},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{Lange90,
  author = {S. Lange},
  title = {A Note on Polynomial-Time Inference of $k$-Variable Pattern Language},
  booktitle = {Nonmonotonic and Inductive Logic},
  year = {1990},
  volume = {543},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {178--183},
  publisher = {Springer Verlag}
}

@INPROCEEDINGS{LangeGr99,
  author = {Steffen Lange and Gunter Grieser},
  title = {On the Strength of Incremental Learning},
  booktitle = ALT,
  year = {1999},
  volume = {1720},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {118--131},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{LangeGr98,
  author = {Steffen Lange and Gunter Grieser},
  title = {On Variants of Iterative Learning},
  booktitle = {International Conference on Discovery Science},
  year = {1998},
  volume = {1532},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {72--83},
  publisher = {Springer-Verlag}
}

@ARTICLE{LangeNeWi98,
  author = {Steffen Lange and Jochen Nessel and Rolf Wiehagen},
  title = {Learning recursive languages from good examples},
  journal = {Annals of Mathematics and Artificial Intelligence},
  year = {1998},
  volume = {23},
  pages = {27--52},
  number = {1/2},
  note = {Special issue for AII '94 and ALT '94}
}

@INPROCEEDINGS{LangeNeWi94,
  author = {S. Lange and J. Nessel and R. Wiehagen},
  title = {Language learning from good examples},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1994},
  pages = {423--437},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{LangeWa94,
  author = {S. Lange and P. Watson},
  title = {Machine Discovery in the Presence of Incomplete or Ambiguous Data},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1994},
  volume = {872},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {438--452},
  publisher = {Springer--Verlag}
}

@ARTICLE{LangeWi91,
  author = {S. Lange and R. Wiehagen},
  title = {Polynomial-time inference of arbitrary pattern languages},
  journal = {New Generation Computing},
  year = {1991},
  volume = {8},
  pages = {361--370},
  number = {4}
}

@INPROCEEDINGS{LangeWiZe96,
  author = {S. Lange and R. Wiehagen and T. Zeugmann},
  title = {Learning by Erasing},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1996},
  volume = {1160},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {228--241},
  publisher = {Springer--Verlag}
}

@ARTICLE{LangeZe96,
  author = {S. Lange and T. Zeugmann},
  title = {Incremental Learning from Positive Data},
  journal = {J.~Comp. System Sci.},
  year = {1996},
  volume = {53, No.~1},
  pages = {88--103}
}

@ARTICLE{LangeZe96a,
  author = {S. Lange and T. Zeugmann},
  title = {Set-driven and rearrangement-independent learning of recursive languages},
  journal = {Math. Syst. Theory},
  year = {1996},
  volume = {29, No.~6},
  pages = {599--634},
  note = {Earlier version in Fifth ALT conf, 1994, Lecture Notes in AI 872}
}

@TECHREPORT{LangeZe95,
  author = {S. Lange and T. Zeugmann},
  title = {Modeling Incremental Learning from Positive Data},
  institution = {RIFIS, Kyushu University 33},
  year = {1995},
  number = {RIFIS-TR-CS-117}
}

@INPROCEEDINGS{LangeZe95a,
  author = {S. Lange and T. Zeugmann},
  title = {Refined Incremental Learning},
  booktitle = {Australian Joint Conference on Artificial Intelligence},
  year = {1995},
  pages = {147--154},
  publisher = {World Scientific Publ.~Co.}
}

@ARTICLE{LangeZe95b,
  author = {S. Lange and T. Zeugmann},
  title = {Trading monotonicity demands versus efficiency},
  journal = {Bulletin of Informatics and Cybernetics},
  year = {1995},
  volume = {27},
  pages = {53--83}
}

@INPROCEEDINGS{LangeZe95c,
  author = {S. Lange and T. Zeugmann},
  title = {Trading Monotonicity Demands versus Mind Changes},
  booktitle = EuroCOLT,
  year = {1995},
  volume = {904},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {125--139},
  publisher = {Springer--Verlag}
}

@ARTICLE{LangeZe94,
  author = {S. Lange and T. Zeugmann},
  title = {Characterization of language learning from informant under various
	monotonicity constraints},
  journal = {J. of Experimental and Theoret. Artif. Intell.},
  year = {1994},
  volume = {6},
  pages = {73--94},
  number = {1},
  note = {Special issue for AII '92}
}

@INPROCEEDINGS{LangeZe93,
  author = {S. Lange and T. Zeugmann},
  title = {Language Learning with a Bounded Number of Mind Changes},
  booktitle = STACS,
  year = {1993},
  volume = {665},
  series = {Lecture Notes in Computer Science},
  pages = {682--691},
  publisher = {Springer--Verlag}
}

@INPROCEEDINGS{LangeZe93a,
  author = {S. Lange and T. Zeugmann},
  title = {Language learning in dependence on the space of hypotheses},
  booktitle = COLT,
  year = {1993},
  pages = {127--136},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{LangeZe93b,
  author = {S. Lange and T. Zeugmann},
  title = {Learning Recursive Languages With a Bounded Number of Mind Changes},
  journal = {Internat. Journal of Foundations of Computer Science},
  year = {1993},
  volume = {4},
  pages = {157--178}
}

@TECHREPORT{LangeZe93c,
  author = {S. Lange and T. Zeugmann},
  title = {The Learnability of Recursive Languages in Dependence on the Hypothesis
	Space},
  institution = {GOSLER-Report, FB Mathematik und Informatik, TH Lepzig},
  year = {1993},
  number = {20/93}
}

@INPROCEEDINGS{LangeZe93d,
  author = {S. Lange and T. Zeugmann},
  title = {Monotonic Versus Non--monotonic Language Learning},
  booktitle = {International Workshop on Nonmonotonic and Inductive Logic},
  year = {1993},
  volume = {659},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {254--269},
  publisher = {Springer--Verlag}
}

@TECHREPORT{LangeZe92,
  author = {S. Lange and T. Zeugmann},
  title = {Learning recursive languages with bounded mind changes},
  institution = {GOSLER-Report, FB Mathematik und Informatik, TH Lepzig},
  year = {1992},
  number = {16/92}
}

@TECHREPORT{LangeZe92a,
  author = {S. Lange and T. Zeugmann},
  title = {On the Power of Monotonic Language Learning},
  institution = {GOSLER-Report, FB Mathematik und Informatik, TH Lepzig},
  year = {1992},
  number = {5/92}
}

@INPROCEEDINGS{LangeZe92b,
  author = {S. Lange and T. Zeugmann},
  title = {Types of monotonic language learning and their characterization},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1992},
  pages = {377--390},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{LangeZe92c,
  author = {S. Lange and T. Zeugmann},
  title = {A Unifying Approach to Monotonic Language Learning on Informant},
  booktitle = {International Workshop on Analogical and Inductive Inference},
  year = {1992},
  volume = {642},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {244--259},
  publisher = {Springer--Verlag}
}

@ARTICLE{LangeZeKa96,
  author = {S. Lange and T. Zeugmann and S. Kapur},
  title = {Monotonic and dual monotonic language learning},
  journal = {Theoret. Comput. Sci.},
  year = {1996},
  volume = {155},
  pages = {365--410},
  number = {2}
}

@PHDTHESIS{Langerman01,
  author = {S. Langerman},
  title = {Algorithms and Data Structures in Computational Geometry},
  school = {Dept. Comp. Sci., Rutgers University},
  year = {2001}
}

@INPROCEEDINGS{LangfordBl99,
  author = {John Langford and Avrim Blum},
  title = {Microchoice bounds and self bounding learning algorithms},
  booktitle = COLT,
  year = {1999},
  pages = {209--214},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{LangfordMc00,
  author = {John Langford and David Mc{A}llester},
  title = {Computable Shell Decomposition Bounds},
  booktitle = COLT,
  year = {2000},
  pages = {25--34},
  publisher = {Morgan Kaufmann, San Francisco}
}

@INPROCEEDINGS{LangfordTa02,
  author = {J. Langford and J. Shawe-Taylor},
  title = {PAC-Bayes and Margins },
  booktitle = NIPS,
  year = {2002}
}

@INPROCEEDINGS{LanglaisPa07,
  author = {Langlais, Philippe and Patry, Alexandre},
  title = {Translating Unknown Words by Analogical Learning},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {877--886},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1092}
}

@ARTICLE{Langley90,
  author = {Pat Langley},
  title = {Advice to Machine Learning Authors},
  journal = {Machine Learning},
  year = {1990},
  volume = {5},
  pages = {233--237},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Langley89,
  author = {P. Langley},
  title = {Toward a Unified Science of Machine Learning},
  journal = {Machine Learning},
  year = {1989},
  volume = {3},
  pages = {253--259},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Langley88,
  author = {P. Langley},
  title = {Machine Learning as an Experimental Science},
  journal = {Machine Learning},
  year = {1988},
  volume = {3},
  pages = {5--8},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Langley87,
  author = {P. Langley},
  title = {Machine Learning and Concept Formation},
  journal = {Machine Learning},
  year = {1987},
  volume = {2},
  pages = {99--102},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Langley87a,
  author = {P. Langley},
  title = {Machine Learning and Grammar Induction},
  journal = {Machine Learning},
  year = {1987},
  volume = {2},
  pages = {5--8},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Langley87b,
  author = {P. Langley},
  title = {Research Papers in Machine Learning},
  journal = {Machine Learning},
  year = {1987},
  volume = {2},
  pages = {195--198},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Langley86,
  author = {Pat Langley},
  title = {Editorial: Human and Machine Learning},
  journal = {Machine Learning},
  year = {1986},
  volume = {1},
  pages = {243--248},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Langley86a,
  author = {Pat Langley},
  title = {Editorial: The Terminology of Machine Learning},
  journal = {Machine Learning},
  year = {1986},
  volume = {1},
  pages = {141--144},
  publisher = {Kluwer Academic Publishers, Boston}
}

@TECHREPORT{Langley86b,
  author = {P. Langley},
  title = {A General Theory of Discrimination Learning},
  institution = {University of California, Irvine},
  year = {1986},
  number = {86-18}
}

@ARTICLE{Langley86c,
  author = {Pat Langley},
  title = {On Machine Learning},
  journal = {Machine Learning},
  year = {1986},
  volume = {1},
  pages = {5--10},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{LangleyMi86,
  author = {Pat Langley and Ryszard S. Michalski},
  title = {Machine Learning and Discovery},
  journal = {Machine Learning},
  year = {1986},
  volume = {1},
  pages = {363--366},
  publisher = {Kluwer Academic Publishers, Boston}
}

@TECHREPORT{LangleyNo86,
  author = {P. Langley and B. Nordhausen},
  title = {A Framework for Empirical Discovery},
  institution = {University of California, Irvine},
  year = {1986},
  number = {86-19}
}

@INPROCEEDINGS{LangleyPf95,
  author = {Pat Langley and Karl Pfleger},
  title = {Case-based acquisition of place knowledge},
  booktitle = ICML,
  year = {1995},
  pages = {344--352},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{LangleyPrSm97,
  author = {Pat Langley and Gregory M. Provan and Padhraic Smyth},
  title = {Learning with probabilistic representations},
  journal = {Machine Learning},
  year = {1997},
  volume = {29},
  pages = {91--101},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{LangleySa99,
  author = {Pat Langley and Stephanie Sage},
  title = {Tractable average-case analysis of naive {B}ayesian classifiers},
  booktitle = ICML,
  year = {1999},
  pages = {220--228},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INBOOK{LangleySa97,
  chapter = {4},
  pages = {51--63},
  title = {Scaling to domains with irrelevant features},
  publisher = {MIT Press},
  year = {1997},
  author = {Patrick Langley and Stephanie Sage},
  volume = {IV: Making Learning Systems Practical},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@INPROCEEDINGS{LanthierMaSa97,
  author = {M. Lanthier and A. Maheshwari and J.-R. Sack},
  title = {Approximating weighted shortest paths on polyhedral surfaces},
  booktitle = {SOCG},
  year = {1997},
  pages = {274--283}
}

@ARTICLE{Lapata02,
  author = {Maria Lapata},
  title = {The Disambiguation of Nominalisations},
  journal = {Computational Linguistics},
  year = {2002},
  volume = {28},
  pages = {357--388},
  number = {3}
}

@PHDTHESIS{Lapata01,
  author = {Maria Lapata},
  title = {The Acquisition and Modeling of Lexical Knowledge: A Corpus-based
	Investigation of Systematic Polysemy},
  school = {University of Edinburgh},
  year = {2001}
}

@INPROCEEDINGS{LapataBr99,
  author = {M. Lapata and C. Brew},
  title = {Using Subcategorization to Resolve Verb Class Ambiguity},
  booktitle = EMNLP,
  year = {1999},
  pages = {266-274}
}

@ARTICLE{LaPaugh93,
  author = {Andrea S. LaPaugh},
  title = {Recontamination Does Not Help to Search a Graph},
  journal = jacm,
  year = {1993},
  volume = {40},
  pages = {224-245},
  number = {2},
  month = apr,
  keywords = {Analysis of Algorithms; Algorithms; Theory; graph searching; NP-completeness;
	pursuit and evasion; }
}

@ARTICLE{LapedesStFa95,
  author = {Alan S. Lapedes and Evan W. Steeg and Robert M. Farber},
  title = {Use of Adaptive Networks to Define Highly Predictable Protein Secondary-Structure
	Classes},
  journal = {Machine Learning},
  year = {1995},
  volume = {21},
  pages = {103--124},
  publisher = {Kluwer Academic Publishers, Boston}
}

@TECHREPORT{Lappin89,
  author = {S. Lappin and I. Golan and M. Rimon},
  title = {Computing grammatical functions from a configurational parse tree},
  institution = {IBM Israel Center of Science and Technology},
  year = {1989},
  number = {88.268}
}

@MISC{Lappin92,
  author = {Shlaon Lappin and Herbert Leass},
  year = {1992},
  note = {ms. IBM T.J. Watson Reseaarch Center, Yorktown-Heights and IBM Germany
	Scientific Center, Heidelberg}
}

@INPROCEEDINGS{Lappin90a,
  author = {Shalom Lappin and Michael McCord},
  title = {A syntactic filter on pronominal anaphora in slot grammar},
  booktitle = ACL,
  year = {1990}
}

@ARTICLE{Lappin90b,
  author = {Shalom Lappin and Michael McCord},
  title = {Anaphora resolution in slot grammar},
  journal = CL,
  year = {1990},
  volume = {16},
  pages = {197--212}
}

@INPROCEEDINGS{LappinMc90,
  author = {Shalom Lappin and Michael McCord},
  title = {A syntactic filter on pronominal anaphora in slot grammar},
  booktitle = ACL,
  year = {1990}
}

@ARTICLE{LappinMc90a,
  author = {Shalom Lappin and Michael McCord},
  title = {Anaphora resolution in slot grammar},
  journal = CL,
  year = {1990},
  volume = {16},
  pages = {197--212}
}

@INPROCEEDINGS{Larkin03,
  author = {David Larkin },
  title = {Approximate Decomposition: A Method for Bounding and Estimating Probabilistic
	and Deterministic Queries},
  booktitle = {AUAI},
  year = {2003},
  pages = {346-35},
  address = {San Francisco, CA},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{Larmore90,
  author = {Lawrence L. Larmore and Daniel S. Hirschberg},
  title = {A Fast Algorithm for Optimal Length-Limited Huffman Codes},
  journal = jacm,
  year = {1990},
  volume = {37},
  pages = {464-473},
  number = {3},
  month = jul,
  keywords = {Data Structure and Algorithms; Algorithms; Theory; binary tree; Huffman
	coding; data compaction and compression; }
}

@INPROCEEDINGS{LECBB07,
  author = {H. Larochelle and D. Erhan and A. Courville and J. Bergstra and Y.
	Bengio},
  title = {An empirical evaluation of deep architectures on problems with many
	factors of variation},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {473--480},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@TECHREPORT{Laskey05,
  author = {K. B. Laskey},
  title = {First-Order {Bayesian} Logic},
  institution = {George Mason University Department of Systems Engineering and Operations
	Research},
  year = {2005}
}

@INPROCEEDINGS{Lathrop96,
  author = {Richard H. Lathrop},
  title = {On the learnability of the uncomputable},
  booktitle = ICML,
  year = {1996},
  pages = {302--309},
  publisher = {Morgan Kaufmann}
}

@PHDTHESIS{Lathrop90,
  author = {R. H. Lathrop},
  title = {Efficient Methods for Massively Parallel Symbolic Induction: Algorithms
	and Implementation},
  school = {MIT Department of Electrical Engineering and Computer Science},
  year = {1990},
  month = jun
}

@ARTICLE{LatteuxRo84,
  author = {M. Latteux and G. Rozenberg},
  title = {Commutative One-Counter Languages Are Regular},
  journal = jcss,
  year = {1984},
  volume = {29},
  pages = {54--57},
  number = {1},
  month = aug,
  comment = {Gives a nice characteriztion of commutative regular languages}
}

@INPROCEEDINGS{Lau93,
  author = {Raymond Lau and Ronald Rosenfeld and Salim Roukos},
  title = {Adaptive language modeling using the maximum entropy principle},
  booktitle = ARPA,
  year = {1993},
  pages = {108--113}
}

@ARTICLE{LavraucD96,
  author = {Nada Lavra\u{c} and Sa\u{s}o D\u{z}eroski},
  title = {A Reply to Pazzani's Book Review of {\it Inductive Logic Programming:
	Techniques and Applications}},
  journal = {Machine Learning},
  year = {1996},
  volume = {23},
  pages = {109--111},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{LavraucD94,
  author = {N. Lavra\u{c} and S. D\u{z}eroski},
  title = {Weakening the language bias in {LINUS}},
  journal = {J. of Experimental and Theoret. Artif. Intell.},
  year = {1994},
  volume = {6},
  pages = {95--120},
  number = {1},
  note = {Special issue for AII '92}
}

@BOOK{LavracDz94,
  title = {Inductive Logic Programming: Techniques and Applications},
  publisher = {Ellis Horwood},
  year = {1994},
  author = {Lavrac, N. and Dzeroski, D.},
  address = {London}
}

@INPROCEEDINGS{LavracDz91,
  author = {Lavrac, N. and Dzeroski, S.},
  title = {Learning nonrecursive definitions of relations with LINUS},
  booktitle = {European Working Session on Learning},
  year = {1991},
  pages = {265-281},
  publisher = {Springer}
}

@INPROCEEDINGS{LavracDzGr91,
  author = {N. Lavrac and S. Dzeroski and M. Grobelnik},
  title = {Learning Nonrecursive Definitions of Relations with {LINUS}},
  booktitle = {European Working Session on Learning : Machine Learning},
  year = {1991},
  volume = {482},
  series = {LNAI},
  pages = {265--281},
  address = {Porto, Portugal},
  month = mar,
  publisher = {Springer Verlag}
}

@INPROCEEDINGS{LavravGaTu96,
  author = {Nada Lavra{\v c} and Dragan Gamberger and Peter Turney},
  title = {Cost-sensitive feature reduction applied to a hybrid genetic algorithm},
  booktitle = ALT,
  year = {1996},
  volume = {1160},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {127--134},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{LavrenkoCr01,
  author = {V. Lavrenko and W. B. Croft},
  title = {Relevance-based {L}anguage {M}odels},
  booktitle = SIGIR,
  year = {2001},
  pages = {120--127}
}

@INPROCEEDINGS{LavrenkoRelLM,
  author = {Victor Lavrenko and W. Bruce Croft},
  title = {Relevance-based {L}anguage {M}odels},
  booktitle = SIGIR,
  year = {2001},
  pages = {120--127}
}

@INPROCEEDINGS{LawrenceMo07,
  author = {N. Lawrence and A. Moore},
  title = {The hierarchical {Gaussian} process latent variable model},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {481--488},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{LPVV01,
  author = {Francis Lazarus and Michel Pocchiola and Gert Vegter and Anne Verroust},
  title = {Computing a canonical polygonal schema of an orientable triangulated
	surface},
  booktitle = {SOCG},
  year = {2001},
  pages = {80-89}
}

@ARTICLE{LeLe91,
  author = {V. B. Le and D. T. Lee},
  title = {Out-of-roundness problem revisited},
  journal = {IEEE Trans. Pattern Anal. Mach. Intell.},
  year = {1991},
  volume = {PAMI-13},
  pages = {217--223},
  number = {3}
}

@INCOLLECTION{LeacockChodorow98,
  author = {C. Leacock and M. Chodorow},
  title = {Combining Local Context and WordNet Similarity for Word Sense Identification},
  booktitle = {WordNet: An Electronic Lexical Database},
  publisher = {The MIT Press},
  year = {1998},
  editor = {C. Fellbaum},
  pages = {265-283}
}

@ARTICLE{LeacockChMi98,
  author = {Claudia Leacock and Martin Chodorow and George A. Miller},
  title = {Using Corpus Statistics and WordNet Relations for Sense Identification},
  journal = {Computational Linguistics},
  year = {1998},
  volume = {24},
  pages = {147-165},
  number = {1},
  url = {citeseer.ist.psu.edu/leacock98using.html}
}

@INPROCEEDINGS{LebanonLa03,
  author = {G. Lebanon and J. Lafferty},
  title = {Conditional Models on the Ranking Poset.},
  booktitle = NIPS,
  year = {2003},
  volume = {15},
  pages = {431-438}
}

@INPROCEEDINGS{LebanonLa02,
  author = {Guy Lebanon and John Lafferty},
  title = {Cranking: Combining Rankings Using Conditional Probability Models
	on Permutations},
  booktitle = ICML,
  year = {2002}
}

@ARTICLE{Lebowitz87,
  author = {Michael Lebowitz},
  title = {Experiments with Incremental Concept Formation: {UNIMEM}},
  journal = {Machine Learning},
  year = {1987},
  volume = {2},
  pages = {103--138},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INCOLLECTION{Lechner71,
  author = {Robert J. Lechner},
  title = {Harmonic Analysis of Switching Functions},
  booktitle = {Recent Developments in Switching Theory},
  publisher = {Academic Press},
  year = {1971},
  chapter = {V},
  pages = {121--228}
}

@INPROCEEDINGS{LeeCh92,
  author = {H. S. Lee and R. C. Chang},
  title = {Approximating Vertices of a Convex Polygon with Grid Points in the
	Polygon},
  booktitle = {ISAAC},
  year = {1992},
  volume = {650},
  series = {Lecture Notes in Computer Science},
  pages = {269--278},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Lee07,
  author = {Lee, John},
  title = {A Computational Model of Text Reuse in Ancient Literary Texts},
  booktitle = ACL,
  year = {2007},
  pages = {472--479},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1060}
}

@ARTICLE{LeeNa05,
  author = {J. N. Lee and L. R. Naigles},
  title = {The input to verb learning in Mandarin Chinese: A role for syntactic
	bootstrapping},
  journal = {Developmental Psychology},
  year = {2005},
  volume = {41},
  pages = {529-540}
}

@ARTICLE{LeeMa88,
  author = {K. Lee and S. Mahajan},
  title = {A Pattern Classification Approach to Evaluation Function Learning},
  journal = {Artificial Intelligence},
  year = {1988},
  volume = {36},
  pages = {1--26},
  number = {1},
  month = aug,
  comment = {Learns Othello evaluation function based on four features and multivariate
	normal distribution assumption.}
}

@INCOLLECTION{Lee89,
  author = {Lee, Kai-Fu},
  title = {Automatic Speech Recognition},
  booktitle = {Computer Science Research Review},
  publisher = {School of Computer Science, {C}arnegie {M}ellon {U}niversity},
  year = {1989},
  pages = {7--16}
}

@PHDTHESIS{Lee88,
  author = {Lee, Kai-Fu},
  title = {Large-Vocabulary Speaker-Independent Continuous Speech Recognition:
	The SPHINX System},
  school = {Carnegie Mellon University Computer Science Dept.},
  year = {1988},
  month = apr,
  note = {Tech report number CMU-CS-88-148}
}

@INPROCEEDINGS{Lee01,
  author = {L. Lee},
  title = {On the Effectiveness of the Skew Divergence for Statistical Language
	Analysis},
  booktitle = AISTAT,
  year = {2001},
  pages = {65--72}
}

@ARTICLE{Lee00,
  author = {L. Lee},
  title = {Foundations of Statistical Natural Language Processing by Christopher
	D. Manning and Hinrich Sch��tze [review]},
  journal = {Computational Linguistics},
  year = {2000},
  volume = {26},
  pages = {277--279},
  number = {2}
}

@INPROCEEDINGS{Lee99,
  author = {L. Lee},
  title = {Measure of Distributional Similarity},
  booktitle = ACL,
  year = {1999},
  pages = {25-32}
}

@PHDTHESIS{Lee97,
  author = {L. Lee},
  title = {Similarity-Based Approaches to Natural Language Processing},
  school = {Computer Science Department, Harvard University},
  year = {1997},
  month = {Aug}
}

@INPROCEEDINGS{LeePe99,
  author = {L. Lee and F. Pereira},
  title = {Distributional similarity models: Clustering vs. nearest neighbors},
  booktitle = ACL,
  year = {1999},
  pages = {33-40}
}

@INPROCEEDINGS{LeePe99b,
  author = {L. Lee and F. Pereira},
  title = {Distributional similarity models: Clustering vs. nearest neighbors},
  booktitle = ACL,
  year = {1999},
  pages = {33-40}
}

@INPROCEEDINGS{LCVK07,
  author = {S. Lee and V. Chatalbashev and D. Vickrey and D. Koller},
  title = {Learning a meta-level prior for feature relevance from multiple related
	tasks},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {489--496},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{LeeBaWi96,
  author = {Wee Sun Lee and Peter L. Bartlett and Robert C. Williamson},
  title = {The importance of convexity in learning with squared loss},
  booktitle = COLT,
  year = {1996},
  pages = {140--146},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{LeeBaWi95,
  author = {Wee Sun Lee and Peter L. Bartlett and Robert C. Williamson},
  title = {On efficient agnostic learning of linear combinations of basis functions},
  booktitle = COLT,
  year = {1995},
  pages = {369--376},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{LeeBaWi94,
  author = {W. S. Lee and P. L. Bartlett and R. C. Williamson},
  title = {Lower bounds on the {VC}-dimension of smoothly parametrized function
	classes},
  booktitle = COLT,
  year = {1994},
  pages = {362--367},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{LeeBuAr98,
  author = {Yongwon Lee and Bruce G. Buchanan and John M. Aronis},
  title = {Knowledge-based learning in exploratory science: learning rules to
	predict rodent carcinogenicity},
  journal = {Machine Learning},
  year = {1998},
  volume = {30},
  pages = {217--240},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{LQJBFOLCSZCG90,
  author = {Y. C. Lee and S. Qian and R. D. Jones and C. W. Barnes and G. W.
	Flake and M. K. O'Rourke and K. Lee and H. H. Chen and G. Z. Sun
	and Y. Q. Zhang and D. Chen and C. L. Giles},
  title = {Adaptive Stochastic Cellular Automata: Theory},
  journal = {Phyisca D},
  year = {1990},
  volume = {666},
  comment = {Nice survey of convergence results for stochastic learning automata.}
}

@INPROCEEDINGS{Lehman94,
  author = {Lehman, J. F.},
  title = {Toward The Essential nature of Statistical Knowledge in Sense Resolution},
  booktitle = AAAI,
  year = {1994},
  pages = {734--741}
}

@INCOLLECTION{Lehnert86,
  author = {W. G. Lehnert},
  title = {A Conceptual Theory of Question Answering},
  booktitle = {Natural Language Processing},
  publisher = {Kaufmann},
  year = {1986},
  editor = {B. J. Grosz and K. {Sparck Jones} and B. L. Webber},
  pages = {651-657},
  address = {Los Altos, CA},
  keywords = {ling, n-l-p, user-mod}
}

@ARTICLE{Leighton91,
  author = {Tom Leighton},
  title = {Letter from the Editor},
  journal = jacm,
  year = {1991},
  volume = {38},
  pages = {515},
  number = {3},
  month = jul,
  keywords = {editorial; }
}

@ARTICLE{LeisinkKa03,
  author = {Martijn Leisink and Bert Kappen},
  title = {Bound Propagation},
  journal = {Journal of Artificial Intelligence Research},
  year = {2003},
  volume = {19},
  pages = {139--154},
  url = {citeseer.ist.psu.edu/leisink03bound.html}
}

@ARTICLE{Lemmer83,
  author = {Lemmer, John F.},
  title = {Generalized Bayesian updating of incompletely specified distributions},
  journal = {Large Scale Systems},
  year = {1983},
  volume = {5},
  pages = {51--68},
  comment = {Derives sufficient conditions for when marginals are consistent with
	some underlying distribution.}
}

@INBOOK{Lemmon94,
  chapter = {12},
  pages = {183--203},
  title = {Prototype selection using competitive learning},
  publisher = {MIT Press},
  year = {1994},
  author = {Michael Lemmon},
  volume = {II: Intersections Between Theory and Experiment},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@ARTICLE{Lempert89,
  author = {H. Lempert},
  title = {Animacy constraints on preschool children's acquisition of syntax},
  journal = {Child Development},
  year = {1989},
  volume = {60},
  pages = {237-245}
}

@ARTICLE{Lenat95,
  author = {Douglas B. Lenat},
  title = {{CYC}: {A} Large-Scale Investment in Knowledge Infrastructure},
  journal = {Communications of the ACM},
  year = {1995},
  volume = {38},
  pages = {33--38},
  number = {11},
  url = {citeseer.ist.psu.edu/lenat95cyc.html}
}

@ARTICLE{Lenat89,
  author = {Douglas B. Lenat},
  title = {When Will Machines Learn?},
  journal = {Machine Learning},
  year = {1989},
  volume = {4},
  pages = {255--257},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Lenat90,
  author = {Lenat, D. B. and R. V. Guha and K. Pittman and D. Pratt and M. Shepherd},
  title = {Cyc: Toward programs with common sense},
  journal = CACM,
  year = {1990},
  volume = {33},
  pages = {30--49},
  number = {8}
}

@ARTICLE{LGPPS90,
  author = {Lenat, D. B. and R. V. Guha and K. Pittman and D. Pratt and M. Shepherd},
  title = {Cyc: Toward programs with common sense},
  journal = CACM,
  year = {1990},
  volume = {33},
  pages = {30--49},
  number = {8}
}

@ARTICLE{Lengauer89,
  author = {Thomas Lengauer},
  title = {Hierarchical Planarity Testing Algorithms},
  journal = jacm,
  year = {1989},
  volume = {36},
  pages = {474-509},
  number = {3},
  month = jul,
  keywords = {Combinatorics and Graph Theory; Algorithms; Verification; hierarchical
	graph algorithms; planarity; }
}

@ARTICLE{Lengauer93,
  author = {Thomas Lengauer and Egon Wanke},
  title = {Efficient Decision Procedures for Graph Properties on Centext-Free
	Graph Languages},
  journal = jacm,
  year = {1993},
  volume = {40},
  pages = {368-393},
  number = {2},
  month = apr,
  keywords = {Graph Theory; Algorithms; Theory; hyperedge replacement systems; }
}

@ARTICLE{LenstraLeLo82,
  author = {A. K. Lenstra and H. W. Lenstra and L. Lov\'{a}sz},
  title = {Factoring Polynomials with Rational Coefficients},
  journal = {Mathematische Annalen},
  year = {1982},
  volume = {261},
  pages = {515--534}
}

@INPROCEEDINGS{LentLa99,
  author = {Michael van Lent and John Laird},
  title = {Learning hierarchical performance knowledge by observation},
  booktitle = ICML,
  year = {1999},
  pages = {229--238},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@BOOK{Leon98,
  title = {Linear Algebra with Applications},
  publisher = {Prentice Hall},
  year = {1998},
  author = {S. J. Leon},
  edition = {5th}
}

@INPROCEEDINGS{LeskovecFa07,
  author = {J. Leskovec and C. Faloutsos},
  title = {Scalable modeling of real graphs using {Kronecker} multiplication},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {497--504},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@PHDTHESIS{Leung89,
  author = {H. C. Leung},
  title = {The Use of Artificial Neural Networks for Phonetic Recognition},
  school = {MIT Dept.\ of Electrical Engineering and Computer Science},
  year = {1989},
  month = may
}

@ARTICLE{Leung93,
  author = {Kin K. Leung},
  title = {An Execution/Sleep Scheduling Policy for Serving an Additional Job
	in Priority Queueing Systems},
  journal = jacm,
  year = {1993},
  volume = {40},
  pages = {394-417},
  number = {2},
  month = apr,
  keywords = {Queueing Systems; Performance; Theory; performance evaluation; priority
	queues; response times; server vacation models; time-limited service;
	waiting times; }
}

@INPROCEEDINGS{Levesque87,
  author = {Levesque, H.},
  title = {All I know: An abridged report.},
  booktitle = AAAI,
  year = {1987}
}

@ARTICLE{Levesque86,
  author = {Levesque, H.},
  title = {Making believers out of computers.},
  journal = {Artificial Intelligence},
  year = {1986},
  volume = {30},
  pages = {81-108}
}

@INPROCEEDINGS{Levesque84,
  author = {Levesque, H.},
  title = {The logic of implicit and explicit belief.},
  booktitle = AAAI,
  year = {1984}
}

@ARTICLE{LevesqueBr87,
  author = {Levesque, H. and R. Brachman},
  title = {Expressiveness and tractability in knowledgerepresentation and reasoning},
  journal = {Computational Intelligence},
  year = {1987},
  volume = {3},
  pages = {78-93}
}

@INCOLLECTION{LevesqueBr85,
  author = {Hector J. Levesque and Ronald J. Brachman},
  title = {A Fundamental Tradeoff in Knowledge Representation and Reasoning
	(Revised Version)},
  booktitle = {Readings in Knowledge Representation},
  publisher = {Kaufmann},
  year = {1985},
  editor = {Ronald J. Brachman and Hector J. Levesque},
  pages = {41-70},
  address = {Los Altos, CA}
}

@BOOK{Levin93,
  title = {English Verb Classes and Alternations: A Preliminary Investigation},
  publisher = {University of Chicago Press},
  year = {1993},
  author = {B. Levin},
  address = {Chicago, IL}
}

@BOOK{LevinRa05,
  title = {Argument Realization},
  publisher = {Cambridge University Press},
  year = {2005},
  author = {B. Levin and M. Rappaport-Hovav},
  series = {Research Surveys in Linguistics Series},
  address = {Cambridge, UK}
}

@INPROCEEDINGS{LevinTiSo89,
  author = {E. Levin and N. Tishby and S. Solla},
  title = {A Statistical Approach to Learning and Generalization in Neural Networks},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1989},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{LevinTiSo90,
  author = {E. Levin and N. Tishby and S. A. Solla},
  title = {A Statistical Approach to Learning and Generalization in Layered
	Neural Networks},
  journal = {Proc. of the IEEE -- Special issue on Neural Networks},
  year = {1990},
  annote = {Earlier version in COLT89}
}

@TECHREPORT{Levin80,
  author = {Levin, Leonid, A.},
  title = {A Concept of Independence with Applications in Various Fields of
	Mathematics},
  institution = {MIT Laboratory for Computer Science},
  year = {1980},
  number = {MIT/LCS/TR-235},
  month = Apr
}

@ARTICLE{Levine82,
  author = {B. Levine},
  title = {The use of tree derivatives and a sample support parameter for inferring
	tree systems},
  journal = {IEEE Trans. Pattern Anal. Mach. Intell.},
  year = {1982},
  volume = {PAMI-4},
  pages = {25--34}
}

@ARTICLE{Levine81,
  author = {B. Levine},
  title = {Derivatives of tree sets with applications to grammatical inference},
  journal = {IEEE Trans. Pattern Anal. Mach. Intell.},
  year = {1981},
  volume = {PAMI-3},
  pages = {285--293}
}

@ARTICLE{LevinsonRaSo83,
  author = {S. E. Levinson and L. R. Rabiner and M. M. Sondhi},
  title = {An Introduction to the Application of the Theory of Probabilistic
	Functions of a Markov Process to Automatic Speech Recognition},
  journal = {Bell System Technical Journal},
  year = {1983},
  volume = {62},
  pages = {1035--1074},
  number = {4},
  month = Apr,
  comment = {Analysis of implementation of Hidden Markov models and the Baum-Welch
	algorithm}
}

@INPROCEEDINGS{LPCRKPGADGSF00,
  author = {M. Levoy and K. Pulli and B. Curless and S. Rusinkiewicz and D. Koller
	and L. Pereira and M. Ginzton and S. Anderson and J. Davis and J.
	Ginsberg and J. Shade and D. Fulk},
  title = {The Digital Michelangelo Project: 3{D} Scanning of Large Statues},
  booktitle = {SIGGRAPH},
  year = {2000},
  editor = {Kurt Akeley},
  pages = {131--144},
  publisher = {ACM Press / ACM SIGGRAPH / Addison Wesley Longman}
}

@INPROCEEDINGS{Lewis,
  author = {D. Lewis},
  title = {An evaluation of phrasal and clustered representations on a text
	categorization problem},
  booktitle = ACM-SIGIR,
  year = {1992}
}

@INPROCEEDINGS{Lewis92,
  author = {D. Lewis},
  title = {An evaluation of phrasal and clustered representations on a text
	categorization problem},
  booktitle = ACM-SIGIR,
  year = {1992}
}

@INPROCEEDINGS{Lewis-catlett94,
  author = {D. Lewis and J. Catlett},
  title = {Heterogeneous uncertainty sampling for supervised learning},
  booktitle = ICML,
  year = {1994}
}

@INPROCEEDINGS{LewisCa94,
  author = {D. Lewis and J. Catlett},
  title = {Heterogeneous uncertainty sampling for supervised learning},
  booktitle = ICML,
  year = {1994}
}

@INPROCEEDINGS{Lewis-gale94,
  author = {D. Lewis and W. Gale},
  title = {Training text classifiers by uncertainty sampling},
  booktitle = ACM-SIGIR,
  year = {1994}
}

@INPROCEEDINGS{LewisGa94,
  author = {D. Lewis and W. Gale},
  title = {Training text classifiers by uncertainty sampling},
  booktitle = ACM-SIGIR,
  year = {1994}
}

@INPROCEEDINGS{Lewisetal96,
  author = {D. Lewis and R. E. Schapire and J. P. Callan and R. Papka},
  title = {Training algorithms for linear text classifiers},
  booktitle = SIGIR,
  year = {1996}
}

@INPROCEEDINGS{LSCP96,
  author = {D. Lewis and R. E. Schapire and J. P. Callan and R. Papka},
  title = {Training algorithms for linear text classifiers},
  booktitle = SIGIR,
  year = {1996}
}

@INPROCEEDINGS{Lewis96,
  author = {David D. Lewis},
  title = {Challenges in machine learning for text classification},
  booktitle = COLT,
  year = {1996},
  pages = {1},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{LCFX07,
  author = {B. Li and M. Chi and J. Fan and X. Xue},
  title = {Support cluster machine},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {505--512},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{LLZLZG07,
  author = {Li, Chi-Ho and Li, Minghui and Zhang, Dongdong and Li, Mu and Zhou,
	Ming and Guan, Yi},
  title = {A Probabilistic Approach to Syntax-based Reordering for Statistical
	Machine Translation},
  booktitle = ACL,
  year = {2007},
  pages = {720--727},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1091}
}

@INPROCEEDINGS{LiYaWa07,
  author = {F. Li and J. Yang and J. Wang},
  title = {A transductive framework of distance metric learning by spectral
	dimensionality reduction},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {513--520},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{LZBTZH09,
  author = {Li, F. and Zheng, Z. and Bu, F. and Tang, Y. and Zu, X. and Huang,
	M.},
  title = {THU QUANTA at TAC 2009 KBP and RTE Track},
  booktitle = TAC,
  year = {2009},
  pages = {288--298}
}

@INPROCEEDINGS{LiAb98,
  author = {H. Li and N. Abe},
  title = {Word clustering and disambiguation based on co-occurrence data.},
  booktitle = COLING,
  year = {1998},
  pages = {749-755}
}

@INPROCEEDINGS{LSKD07,
  author = {Li, Haizhou and Sim, Khe Chai and Kuo, Jin-Shea and Dong, Minghui},
  title = {Semantic Transliteration of Personal Names},
  booktitle = ACL,
  year = {2007},
  pages = {120--127},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1016}
}

@INPROCEEDINGS{LiZhSu04,
  author = {Li, H. and Zhang, M. and Su, J.},
  title = {A Joint Source-Channel Model for Machine Transliteration},
  booktitle = ACL,
  year = {2004},
  pages = {159--166},
  address = {Barcelona, Spain},
  month = {July},
  url = {http://www.aclweb.org/anthology/P04-1021}
}

@INPROCEEDINGS{LiSu07,
  author = {Li, Jingyang and Sun, Maosong},
  title = {Scalable Term Selection for Text Categorization},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {774--782},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1081}
}

@INPROCEEDINGS{LiSp09,
  author = {Li, L. and Sporleder, C.},
  title = {Classifier Combination for Contextual Idiom Detection Without Labelled
	Data},
  booktitle = EMNLP,
  year = {2009},
  pages = {315--323},
  url = {http://www.aclweb.org/anthology/D/D09/D09-1033}
}

@INPROCEEDINGS{LiSp09a,
  author = {Li, L. and Sporleder, C.},
  title = {A Cohesion Graph Based Approach for Unsupervised Recognition of Literal
	and Non-literal Use of Multiword Expressions},
  booktitle = {TextGraphs},
  year = {2009},
  pages = {75--83},
  url = {http://www.aclweb.org/anthology/W/W09/W09-3211}
}

@INPROCEEDINGS{Li90,
  author = {M. Li},
  title = {Towards a {DNA} sequencing theory (learning a string)},
  booktitle = FOCS,
  year = {1990},
  pages = {125--134},
  publisher = {IEEE Computer Society Press, Los Alamitos, CA}
}

@INPROCEEDINGS{LiVa88,
  author = {M. Li and U. Vazirani},
  title = {On the learnability of finite automata},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1988},
  pages = {359--370},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@BOOK{LiVi93,
  title = {An Introduction to Kolmogorov Complexity and Its Applications},
  publisher = {Springer-Verlag},
  year = {1993},
  author = {M. Li and P. Vit\'anyi},
  series = {Text and Monographs in Computer Science}
}

@ARTICLE{LiVi92,
  author = {M. Li and P. Vitanyi},
  title = {Inductive reasoning and Kolmogorov complexity},
  journal = {J. Comput. Syst. Sci.},
  year = {1992},
  volume = {44},
  pages = {343--384},
  annote = {Was in STRUCTURES89}
}

@ARTICLE{LiVi91,
  author = {M. Li and P. M. B. Vitanyi},
  title = {Learning simple concepts under simple distributions},
  journal = {SIAM J. Comput.},
  year = {1991},
  volume = {20},
  pages = {911--935},
  comment = {Earlier version appeared in FOCS89}
}

@INPROCEEDINGS{LiVi89,
  author = {M. Li and P. M. B. Vitanyi},
  title = {A theory of learning simple concepts under simple distributions and
	average case complexity for the universal distribution},
  booktitle = FOCS,
  year = {1989},
  pages = {34--39},
  address = {Research Triangle Park, North Carolina},
  month = Oct,
  tag = {TOC-display}
}

@ARTICLE{Li89,
  author = {Ming Li and Yacov Yesha},
  title = {New Lower Bounds for Parallel Computation},
  journal = jacm,
  year = {1989},
  volume = {36},
  pages = {671-680},
  number = {3},
  month = jul,
  keywords = {Theory of Computation; Algorithms; Theory; Verification; addition;
	computational complexity; lower bounds; parallel random access machine;
	parity; }
}

@INPROCEEDINGS{LiDi07,
  author = {T. Li and C. Ding},
  title = {Adaptive dimension reduction using discriminant analysis and $k$-means
	clustering},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {521--528},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{LiLeLe07,
  author = {W. Li and K. Lee and K. Leung},
  title = {Large-scale {RLSC} learning without agony},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {529--536},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{LCLW07,
  author = {X. Li and W. Cheung and J. Liu and Z. Wu},
  title = {A novel orthogonal {NMF}-based belief compression for {POMDPs}},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {537--544},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@ARTICLE{LiBaMc03,
  author = {Y. Li and Z. Bandar and D. Mclean},
  title = {An Approach for Measuring Semantic Similarity between Words Using
	Multiple Information Sources},
  journal = {IEEE Transctions on Knowledge and Data Engineering},
  year = {2003},
  volume = {15},
  pages = {871-882},
  number = {4}
}

@INPROCEEDINGS{LiZaHeShKa02,
  author = {Y. Li and H. Zaragoza and R. Herbrich and J. Shawe-Taylor and J.
	S. Kandola},
  title = {The Perceptron Algorithm with Uneven Margins},
  booktitle = ICML,
  year = {2002},
  pages = {379--386}
}

@INPROCEEDINGS{LPPJW08,
  author = {Zhao Li and Hong Peng and Peng Peng and Xi-Peng Jia and Jia-Bing
	Wang},
  title = {An Improved Measuring Similarity for short text snippets and its
	application in Clustering Search Engine},
  booktitle = {Seventh International Conference on Machine Learning and Cybernetics},
  year = {2008},
  pages = {1581--1585},
  month = July
}

@MASTERSTHESIS{Liang05,
  author = {P. Liang},
  title = {Semi-Supervised Learning for Natural Language},
  school = {Massachusetts Institute of Technology},
  year = {2005}
}

@MASTERSTHESIS{Liang05a,
  author = {Percy Liang},
  title = {Semi-Supervised Learning for Natural Language},
  school = {Massachusetts Institute of Technology},
  year = {2005},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@INPROCEEDINGS{LiangJoTa07,
  author = {P. Liang and M. Jordan and B. Taskar},
  title = {A permutation-augmented sampler for {DP} mixture models},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {545--552},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{LiangJoKl09,
  author = {P. Liang and M. I. Jordan and D. Klein},
  title = {Learning Semantic Correspondences with Less Supervision},
  booktitle = ACL,
  year = {2009}
}

@INPROCEEDINGS{LiangJoKl09a,
  author = {P. Liang and M. I. Jordan and D. Klein},
  title = {Learning from Measurements in Exponential Families},
  booktitle = ICML,
  year = {2009}
}

@INPROCEEDINGS{LPJK07,
  author = {Liang, Percy and Petrov, Slav and Jordan, Michael and Klein, Dan},
  title = {The Infinite {PCFG} Using Hierarchical {Dirichlet} Processes},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {688--697},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1072}
}

@INPROCEEDINGS{LiaoLiCa07,
  author = {X. Liao and H. Li and L. Carin},
  title = {Quadratically gated mixture of experts for incomplete data classification},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {553--560},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@ARTICLE{LidzGlGl03,
  author = {J. Lidz and H. Gleitman and L. R. Gleitman},
  title = {Understanding how input matters: verb learning and the footprint
	of universal grammar},
  journal = {Cognition},
  year = {2003},
  volume = {87},
  pages = {151-178}
}

@INCOLLECTION{Lifschitz86,
  author = {Lifschitz, V.},
  title = {On the Semantics of STRIPS},
  booktitle = {Reasoning about Actions and Plans},
  publisher = {Morgan Kaufman},
  year = {1986},
  editor = {M. P. Georgeff and A. L. Lansky}
}

@ARTICLE{LMRB01,
  author = {Light, M. and Mann, G. and Riloff, E. and Breck, E.},
  title = {{Analyses for Elucidating Current Question Answering Technology}},
  journal = jnle,
  year = {2001},
  note = {{forthcoming}}
}

@INPROCEEDINGS{LinWeKe07,
  author = {C. Lin and R. Weng and S. Keerthi},
  title = {Trust region newton methods for large-scale logistic regression},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {561--568},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{Lin99,
  author = {Dekang Lin},
  title = {Automatic identification of noncompositional phrases},
  booktitle = ACL,
  year = {1999},
  pages = {317--324}
}

@INPROCEEDINGS{Lin98,
  author = {D. Lin},
  title = {An information-theoretic definition of similarity},
  booktitle = ICML,
  year = {1998}
}

@INPROCEEDINGS{Lin98a,
  author = {D. Lin},
  title = {Automatic Retrieval and Clustering of Similar Words},
  booktitle = ACL,
  year = {1998},
  pages = {768-774}
}

@INPROCEEDINGS{LinClusters,
  author = {Dekang Lin},
  title = {Automatic {R}etrieval and {C}lustering of similar words},
  booktitle = COLING-ACL,
  year = {1998},
  pages = {768--774}
}

@INPROCEEDINGS{LinMP98,
  author = {D. Lin},
  title = {Dependency-based Evaluation of MINIPAR},
  booktitle = {Workshop on the Evaluation of Parsing Systems},
  year = {1998}
}

@INPROCEEDINGS{Lin+01,
  author = {D. Lin and P. Pantel},
  title = {Induction of Semantic Classes from Natural Language Text},
  booktitle = SIGKDD,
  year = {2001},
  pages = {317--322}
}

@INPROCEEDINGS{LinPa01,
  author = {D. Lin and P. Pantel},
  title = {Induction of Semantic Classes from Natural Language Text},
  booktitle = SIGKDD,
  year = {2001},
  pages = {317--322}
}

@INPROCEEDINGS{LinPa01_short,
  author = {D. Lin and P. Pantel},
  title = {Induction of Semantic Classes from Natural Language Text},
  booktitle = SIGKDD,
  year = {2001},
  pages = {317--322}
}

@INPROCEEDINGS{LinPa01a,
  author = {D. Lin and P. Pantel},
  title = {{DIRT}: discovery of inference rules from text},
  booktitle = SIGKDD,
  year = {2001},
  pages = {323--328}
}

@INPROCEEDINGS{LinPantel01,
  author = {D. Lin and P. Pantel},
  title = {Induction of Semantic Classes from Natural Language Text},
  booktitle = SIGKDD,
  year = {2001},
  pages = {317-322}
}

@INPROCEEDINGS{LinVi89,
  author = {J. Lin and J. S. Vitter},
  title = {Complexity issues in learning by neural nets},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1989},
  pages = {118--133},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{LinVi94,
  author = {Jyh-Han Lin and Jeffrey Scott Vitter},
  title = {A Theory for Memory-Based Learning},
  journal = {Machine Learning},
  year = {1994},
  volume = {17},
  pages = {143--167},
  number = {2/3},
  annote = {Earlier version in COLT 92},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{LinVi92a,
  author = {Jyh-Han Lin and Jeffrey Scott Vitter},
  title = {$\epsilon$-Approximation with Minimum Packing Constraint Violation},
  booktitle = STOC,
  year = {1992},
  pages = {771--782},
  month = May,
  tag = {TOC-display}
}

@INPROCEEDINGS{LinVi92b,
  author = {Jyh-Han Lin and Jeffrey Scott Vitter},
  title = {A Theory for Memory-Based Learning},
  booktitle = COLT,
  year = {1992},
  pages = {103--115},
  month = Jul,
  tag = {TOC-display}
}

@ARTICLE{LinVi91,
  author = {J-H. Lin and J. S. Vitter},
  title = {Complexity results on learning by neural networks},
  journal = {Machine Learning},
  year = {1991},
  volume = {6},
  pages = {211--230},
  annote = {Earlier version in COLT89},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Lin92,
  author = {Long-ji Lin},
  title = {Self-Improving Reactive Agents Based On Reinforcement Learning, Planning
	and Teaching},
  journal = {Machine Learning},
  year = {1992},
  volume = {8},
  pages = {293--321},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{LincolnSk89,
  author = {N. Lincoln and J. Skrzypek},
  title = {Synergy of clustering multiple backpropagation networks},
  booktitle = NIPS,
  year = {1989},
  publisher = {Morgan Kaufmann}
}

@PHDTHESIS{Lindner72,
  author = {R. Lindner},
  title = {Algorithmische {E}rkennung},
  school = {Friedrich-Schiller-Universitat},
  year = {1972}
}

@INPROCEEDINGS{Lindstrom00,
  author = {P. Lindstrom},
  title = {Out-of-Core Simplification of Large Polygonal Models},
  booktitle = {SIGGRAPH},
  year = {2000},
  editor = {Kurt Akeley},
  pages = {259--262},
  publisher = {ACM Press / ACM SIGGRAPH / Addison Wesley Longman}
}

@INPROCEEDINGS{LinialMaNi89,
  author = {N. Linial and Y. Mansour and N. Nisan},
  title = {Constant depth circuits, {Fourier} transform, and learnability},
  booktitle = FOCS,
  year = {1989},
  pages = {574--579},
  publisher = {IEEE Computer Society Press}
}

@ARTICLE{LinialMaRi91,
  author = {Nathan Linial and Yishay Mansour and Ronald L. Rivest},
  title = {Results on Learnability and the {V}apnik-{C}hervonenkisDimension},
  journal = {Information and Computation},
  year = {1991},
  volume = {90},
  pages = {33--49},
  number = {1},
  month = Jan,
  tag = {TOC-display}
}

@INPROCEEDINGS{LinialMaRi88,
  author = {Nathan Linial and Yishay Mansour and Ronald L. Rivest},
  title = {Results on Learnability and the {V}apnik-{C}hervonenkisDimension},
  booktitle = FOCS,
  year = {1988},
  pages = {120--129},
  month = Oct,
  tag = {TOC-display}
}

@INPROCEEDINGS{LinialMaRi88b,
  author = {Nathan Linial and Yishay Mansour and Ronald L. Rivest},
  title = {Results on Learnability and the {V}apnik-{C}hervonenkis Dimension},
  booktitle = {Workshop on Computational Learning Theory},
  year = {1988},
  pages = {56--68},
  publisher = {Morgan-Kaufmann},
  tag = {TOC-display}
}

@ARTICLE{Lippmann87,
  author = {R. P. Lippmann},
  title = {An Introduction to Computing with Neural Nets},
  journal = {IEEE ASSP Magazine},
  year = {1987},
  pages = {4--22},
  month = apr,
  comment = {Good survey article}
}

@INPROCEEDINGS{LiquiereSa98,
  author = {Michel Liquiere and Jean Sallantin},
  title = {Srtuctural machine learning with {G}alois lattice and graphs},
  booktitle = ICML,
  year = {1998},
  pages = {305--313},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{Litkowski02,
  author = {Litkowski, K.C.},
  title = {Digraph analysis of dictionary preposition definitions},
  booktitle = {ACLSIGLEX Workshop: Word Sense Disambiguation},
  year = {2002},
  pages = {9--16}
}

@INPROCEEDINGS{LitkowskiHa07,
  author = {Litkowski, K. and Hargraves, O.},
  title = {{SemEval-2007 Task 06: Word-Sense Disambiguation of Prepositions}},
  booktitle = {SemEval-2007: 4th International Workshop on Semantic Evaluations},
  year = {2007}
}

@INPROCEEDINGS{LitkowskiHa05,
  author = {Litkowski, K.C. and Hargraves, O.},
  title = {The Preposition Project},
  booktitle = {ACL-SIGSEM Workshop on the Linguistic Dimensions of Prepositions
	and their Use in Computational Linguistics Formalisms and Applications},
  year = {2005}
}

@INPROCEEDINGS{LSWK00,
  author = {D. Litman and S. Singh and M. Walker and M. Kearns},
  title = {Automatic Optimization of Dialogue Management},
  booktitle = COLING,
  year = {2000}
}

@INPROCEEDINGS{Littlestone95,
  author = {Nick Littlestone},
  title = {Comparing several linear-threshold learning algorithms on tasks involving
	superfluous attributes},
  booktitle = ICML,
  year = {1995},
  pages = {353--361},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{Littlestone92,
  author = {N. Littlestone},
  title = {Learning simple {B}oolean concepts},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1992},
  pages = {6--14},
  publisher = {IOS Press}
}

@INPROCEEDINGS{Littlestone91,
  author = {N. Littlestone},
  title = {Redundant noisy attributes, attribute errors, and linear threshold
	learning using {W}innow},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1991},
  pages = {147--156},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@PHDTHESIS{Littlestone89,
  author = {N. Littlestone},
  title = {Mistake Bounds and Logarithmic Linear-threshold Learning Algorithms},
  school = {Technical Report UCSC-CRL-89-11, University of California Santa Cruz},
  year = {1989}
}

@INPROCEEDINGS{Littlestone89a,
  author = {N. Littlestone},
  title = {From on-line to batch learning},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1989},
  pages = {269--284},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{Littlestone88,
  author = {N. Littlestone},
  title = {Learning Quickly When Irrelevant Attributes Abound: {A} New Linear-threshold
	Algorithm},
  journal = {Machine Learning},
  year = {1988},
  volume = {2},
  pages = {285--318},
  number = {4},
  annote = {Earlier version in FOCS87},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{Littlestone87,
  author = {N. Littlestone},
  title = {Learning in a Layered Network with many Fixed-Function Hidden Nodes},
  booktitle = {Annual IEEE International Conference on Neural Networks},
  year = {1987},
  volume = {II},
  pages = {471--478},
  address = {Washington, D.C.},
  month = jun,
  publisher = {IEEE Computer Society Press}
}

@INPROCEEDINGS{Littlestone87a,
  author = {Littlestone, N.},
  title = {Learning When Irrelevant Attributes Abound},
  booktitle = FOCS,
  year = {1987},
  pages = {68--77},
  month = Oct
}

@INPROCEEDINGS{LittlestoneLo93,
  author = {N. Littlestone and P. Long},
  title = {On-line learning with linear loss constraints},
  booktitle = COLT,
  year = {1993},
  pages = {412--421},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{LittlestoneLoWa95,
  author = {N. Littlestone and P. M. Long and M. K. Warmuth},
  title = {On-line learning of linear functions},
  journal = {Journal of Computational Complexity},
  year = {1995},
  volume = {5},
  pages = {1--23},
  note = {Was in STOC91}
}

@INPROCEEDINGS{LittlestoneLW,
  author = {Nick Littlestone and Philip M. Long and Manfred K. Warmuth},
  title = {On-line learning of linear functions},
  booktitle = STOC,
  year = {1991},
  pages = {465--475},
  address = {New Orleans, Louisiana},
  month = May,
  publisher = {ACM}
}

@ARTICLE{LittlestoneWa94,
  author = {N.~Littlestone and M.~K. Warmuth},
  title = {The weighted majority algorithm},
  journal = {Information and Computation},
  year = {1994},
  volume = {108},
  pages = {212--261},
  number = {2}
}

@INPROCEEDINGS{LittlestoneWa89c,
  author = {Nick Littlestone and Manfred K. Warmuth},
  title = {The Weighted Majority Algorithm},
  booktitle = FOCS,
  year = {1989},
  pages = {256--261},
  month = Oct,
  publisher = {IEEE},
  note = {(Extended abstract only.)}
}

@INPROCEEDINGS{LittmanCaKa95,
  author = {M. Littman and A. Cassandra and L. Kaebling},
  title = {Learning plicies for partially observable environments: Scaling up},
  booktitle = ML,
  year = {1995},
  pages = {362--370}
}

@INPROCEEDINGS{Littman94,
  author = {Michael L. Littman},
  title = {Markov games as a framework for multi-agent reinforcement learning},
  booktitle = ICML,
  year = {1994},
  pages = {157--163},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{LittmanJiKe98,
  author = {Michael L. Littman and Fan Jiang and Greg A. Keim},
  title = {Learning a language-independent representation for terms from a partially
	aligned corpus},
  booktitle = ICML,
  year = {1998},
  pages = {314--322},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{LittmanSz96,
  author = {Michael L. Littman and Csaba Szepesv{\'a}ri},
  title = {A generalized reinforcement-learning model: {Co}nvergence and applications},
  booktitle = ICML,
  year = {1996},
  pages = {310--318},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{LiuNg07,
  author = {Liu, Chang and Ng, Hwee Tou},
  title = {Learning Predictive Structures for Semantic Role Labeling of NomBank},
  booktitle = ACL,
  year = {2007},
  pages = {208--215},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1027}
}

@ARTICLE{LiuWe96,
  author = {Chao-Lin Liu and Michael P. Wellman},
  title = {On state-space abstraction for anytime evaluation of Bayesian networks},
  journal = {SIGART Bull.},
  year = {1996},
  volume = {7},
  pages = {50--57},
  number = {2},
  address = {New York, NY, USA},
  doi = {http://doi.acm.org/10.1145/242587.242601},
  issn = {0163-5719},
  publisher = {ACM Press}
}

@INPROCEEDINGS{LiuLi07,
  author = {Liu, Feifan and Liu, Yang},
  title = {Unsupervised Language Model Adaptation Incorporating Named Entity
	Information},
  booktitle = ACL,
  year = {2007},
  pages = {672--679},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1085}
}

@INPROCEEDINGS{LiuSe96,
  author = {Huan Liu and Rudy Setiono},
  title = {A probabilistic approach to feature selection -- a filter solution},
  booktitle = ICML,
  year = {1996},
  pages = {319--327},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{LCLHZ07,
  author = {Liu, Jingjing and Cao, Yunbo and Lin, Chin-Yew and Huang, Yalou and
	Zhou, Ming},
  title = {Low-Quality Product Review Detection in Opinion Summarization},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {334--342},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1035}
}

@ARTICLE{LiuWh94,
  author = {W. Z. Liu and A. P. White},
  title = {The Importance of Attribute Selection Measures in Decision Tree Induction},
  journal = {Machine Learning},
  year = {1994},
  volume = {15},
  pages = {25--41},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INBOOK{Liu97,
  chapter = {8},
  pages = {121--136},
  title = {Abnormal data points in the data set: an algorithm for robust neural
	net regression},
  publisher = {MIT Press},
  year = {1997},
  author = {Yong Liu},
  volume = {IV: Making Learning Systems Practical},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@INPROCEEDINGS{LiuChJi07,
  author = {Liu, Yi and Chai, Joyce and Jin, Rong},
  title = {Automated Vocabulary Acquisition and Interpretation in Multimodal
	Conversational Systems},
  booktitle = ACL,
  year = {2007},
  pages = {368--375},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1047}
}

@INPROCEEDINGS{LHLL07,
  author = {Liu, Yang and Huang, Yun and Liu, Qun and Lin, Shouxun},
  title = {Forest-to-String Statistical Translation Rules},
  booktitle = ACL,
  year = {2007},
  pages = {704--711},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1089}
}

@INPROCEEDINGS{LiuSa07,
  author = {Liu, Yudong and Sarkar, Anoop},
  title = {Experimental Evaluation of {LTAG}-Based Features for Semantic Role
	Labeling},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {590--599},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1062}
}

@INPROCEEDINGS{LLQML07,
  author = {Yu-Ting Liu and Tie-Yan Liu and Tao Qin and Zhi-Ming Ma and Hang
	Li},
  title = {Supervised Rank Aggregation},
  booktitle = WWW,
  year = {2007}
}

@BOOK{Lloyd87,
  title = {Foundations of Logic Programming},
  publisher = {Springer-Verlag},
  year = {1987},
  author = {J.W. Lloyd}
}

@INPROCEEDINGS{LochSi98,
  author = {John Loch and Satinder Singh},
  title = {Using eligibility traces to find the best memoryless policy in partially
	observable {M}arkov decision processes},
  booktitle = ICML,
  year = {1998},
  pages = {323--331},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{LZWY07,
  author = {B. Long and Z. Zhang and X. Wu and P. Yu},
  title = {Relational clustering by symmetric convex coding},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {569--576},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@ARTICLE{Long00,
  author = {Philip M. Long},
  title = {Improved bounds about on-line learning of smooth-functions of a single
	variable,},
  journal = {Theoret. Comput. Sci.},
  year = {2000},
  volume = {241},
  pages = {25--35},
  number = {1-2},
  note = {Special issue for ALT '96}
}

@ARTICLE{Long99,
  author = {Philip M. Long},
  title = {The Complexity of Learning According to Two Models of a Drifting
	Environment},
  journal = {Machine Learning},
  year = {1999},
  volume = {37},
  pages = {337--354},
  number = {3},
  comment = {first in 11th COLT '98},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{Long98,
  author = {Philip M. Long},
  title = {On the sample complexity of learning functions with bounded variation},
  booktitle = COLT,
  year = {1998},
  pages = {126--133},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{Long97a,
  author = {Philip M. Long},
  title = {On-line evaluation and prediction using linear functions},
  booktitle = COLT,
  year = {1997},
  pages = {21--31},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{Long96,
  author = {Philip M. Long},
  title = {Improved bounds about on-line learning of smooth functions of a single
	variable},
  booktitle = ALT,
  year = {1996},
  volume = {1160},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {26--36},
  publisher = {Springer-Verlag}
}

@PHDTHESIS{Long92,
  author = {P. M. Long},
  title = {Towards a more comprehensive theory of learning in computers},
  school = {UC Santa Cruz},
  year = {1992}
}

@ARTICLE{LongTa98,
  author = {Philip M. Long and Lei Tan},
  title = {{PAC} learning axis-aligned rectangles with respect to product distributions
	from multiple-instance examples},
  journal = {Machine Learning},
  year = {1998},
  volume = {30},
  pages = {7--21},
  note = {Earlier version in COLT96},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{LongWa93,
  author = {P. M. Long and M. K. Warmuth},
  title = {Composite Geometric Concepts and Polynomial Predictability},
  journal = {Inform. Comput.},
  year = {1993},
  note = {To appear},
  annote = {Earlier version in COLT90}
}

@INPROCEEDINGS{Longtin94,
  author = {M. J. Longtin},
  title = {Cover and concealment in {ModSAF}},
  booktitle = {Conference on Computer Generated Forces and Behavioral Representation},
  year = {1994},
  pages = {239--247}
}

@INPROCEEDINGS{LongtinMe95,
  author = {M. J. Longtin and D. Megherbi},
  title = {Concealed routes in {ModSAF}},
  booktitle = {Conference on Computer Generated Forces and Behavioral Representation},
  year = {1995},
  pages = {305--313}
}

@INPROCEEDINGS{Loper07,
  author = {Loper, Edward},
  title = {Finding Good Sequential Model Structures using Output Transformations},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {801--809},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1084}
}

@INPROCEEDINGS{LoperBi02,
  author = {Loper, E. and Bird, S.},
  title = {{NLTK: the Natural Language Toolkit}},
  booktitle = {ACL Workshop on Effective Tools and Methodologies for Teaching Natural
	Language Processing and Computational Linguistics},
  year = {2002},
  address-omit = {Morristown, NJ, USA},
  month-omit = {July},
  pages-omit = {63--70},
  publisher-omit = {Association for Computational Linguistics}
}

@INPROCEEDINGS{Lopez07,
  author = {Lopez, Adam},
  title = {Hierarchical Phrase-Based Translation with Suffix Arrays},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {976--985},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1104}
}

@BOOK{Lovasz79,
  title = {Combinatorial Problems and Exercises},
  publisher = {North-Holland Publishing Company},
  year = {1979},
  author = {L. Lov\'asz}
}

@ARTICLE{Lov'asz75,
  author = {L. Lov{\'a}sz},
  title = {On the ratio of optimal integral and fractional covers},
  journal = {Discrete Math.},
  year = {1975},
  volume = {13},
  pages = {383--390},
  keywords = {approximation}
}

@INPROCEEDINGS{LowdDo08,
  author = {D. Lowd and P. Domingos},
  title = {Learning Arithmetic Circuits},
  booktitle = UAI,
  year = {2008},
  pages = {383-392}
}

@INPROCEEDINGS{LowdMe05,
  author = {Daniel Lowd and Christopher Meek},
  title = {Adversarial learning},
  booktitle = KDD,
  year = {2005},
  pages = {641--647},
  address = {New York, NY, USA},
  publisher = {ACM},
  doi = {http://doi.acm.org/10.1145/1081870.1081950},
  isbn = {1-59593-135-X},
  location = {Chicago, Illinois, USA}
}

@INPROCEEDINGS{LuAr96,
  author = {Jianguo Lu and Jun Arima},
  title = {Inductive logic programming beyond logical implication},
  booktitle = ALT,
  year = {1996},
  volume = {1160},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {185--198},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{LuHuLi07,
  author = {Lu, Yajuan and Huang, Jin and Liu, Qun},
  title = {Improving Statistical Machine Translation Performance by Training
	Data Selection and Optimization},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {343--350},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1036}
}

@INPROCEEDINGS{Lubinsky95,
  author = {David J. Lubinsky},
  title = {Increasing the performance and consistency of classification trees
	by using the accuracy criterion at the leaves},
  booktitle = ICML,
  year = {1995},
  pages = {371--377},
  publisher = {Morgan Kaufmann}
}

@BOOK{Luenberger84,
  title = {Linear and Nonlinear Programming},
  publisher = {Addison-Wesley},
  year = {1984},
  author = {D. G. Luenberger},
  address = {Reading, MA}
}

@BOOK{Luenberger68,
  title = {Optimization by Vector Space Methods},
  publisher = {John Wiley and Sons, Inc.},
  year = {1968},
  author = {D. G. Luenberger}
}

@INPROCEEDINGS{LugosiPi96,
  author = {G{\'a}bor Lugosi and M{\'a}rta Pint{\'e}r},
  title = {A data dependent skeleton estimate for learning},
  booktitle = COLT,
  year = {1996},
  pages = {51--56},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{Lukasiewicz99,
  author = {Thomas Lukasiewicz},
  title = {Probabilistic Deduction with Conditional Constraints over Basic Events.},
  journal = {J. Artif. Intell. Res. (JAIR)},
  year = {1999},
  volume = {10},
  pages = {199-241},
  bibsource = {DBLP, http://dblp.uni-trier.de},
  ee = {http://www.cs.washington.edu/research/jair/abstracts/lukasiewicz99a.html}
}

@ARTICLE{Lund92,
  author = {Carsten Lund and Lance Fortnow and Howard Karloff and Noam Nisan},
  title = {Algebraic Methods for Interactive Proof Systems},
  journal = jacm,
  year = {1992},
  volume = {39},
  pages = {859-868},
  number = {4},
  month = oct,
  keywords = {Complexity Theory; Theory; interactive proof systems}
}

@INPROCEEDINGS{M.GiKi05,
  author = {M. Palmer, and D. Gildea and P. Kingsbury},
  title = {The proposition bank: An annotated corpus of semantic roles},
  booktitle = CL,
  year = {2005}
}

@INPROCEEDINGS{Muller07,
  author = {M\"uller, Christoph},
  title = {Resolving It, This, and That in Unrestricted Multi-Party Dialog},
  booktitle = ACL,
  year = {2007},
  pages = {816--823},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1103}
}

@INPROCEEDINGS{MLTK07,
  author = {Y. Ma and S. Lao and E. Takikawa and M. Kawade},
  title = {Discriminant analysis in correlation similarity measure space},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {577--584},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{MaStWa07,
  author = {Ma, Yanjun and Stroppa, Nicolas and Way, Andy},
  title = {Bootstrapping Word Alignment via Word Packing},
  booktitle = ACL,
  year = {2007},
  pages = {304--311},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1039}
}

@INPROCEEDINGS{Maarek89,
  author = {Yoelle Maarek and Frank Smadja},
  title = {Full text indexing based on lexical relations -- {An} application:
	Software libraries},
  booktitle = SIGIR,
  year = {1989},
  pages = {198--206}
}

@INPROCEEDINGS{MaarekSm89,
  author = {Yoelle Maarek and Frank Smadja},
  title = {Full text indexing based on lexical relations -- {An} application:
	Software libraries},
  booktitle = SIGIR,
  year = {1989},
  pages = {198--206}
}

@ARTICLE{Maass97,
  author = {Wolfgang Maass},
  title = {Bounds for the Computational Power and Learning Complexity of Analog
	Neural Nets},
  journal = {{SIAM} J. Comput.},
  year = {1997},
  volume = {26},
  pages = {708--732},
  number = {3},
  note = {first in STOC '93}
}

@INPROCEEDINGS{Maass97a,
  author = {Wolfgang Maass},
  title = {On the relevance of time in neural computation and learning},
  booktitle = ALT,
  year = {1997},
  volume = {1316},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {364--384},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Maass94,
  author = {W. Maass},
  title = {On the Complexity of Learning on Neural Nets},
  booktitle = EuroCOLT,
  year = {1994},
  volume = {New Series Number 53},
  series = {The Institute of Mathematics and its Applications Conference Series},
  pages = {1--17},
  address = {Oxford},
  publisher = {Oxford University Press},
  isbn = {0 19 853492 2}
}

@INPROCEEDINGS{Maass94a,
  author = {W. Maass},
  title = {Efficient agnostic {PAC}-learning with simple hypotheses},
  booktitle = COLT,
  year = {1994},
  pages = {67--75},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{Maass91,
  author = {W. Maass},
  title = {On-line learning with an oblivious environment and the power of randomization},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1991},
  pages = {167--175},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{MaassSc99,
  author = {W. Maass and M. Schmitt},
  title = {On the complexity of learning for spiking neurons with temporal coding},
  journal = {Inform. Comput.},
  year = {1999},
  volume = {153},
  pages = {26--46},
  number = {1}
}

@INPROCEEDINGS{MaassSc97,
  author = {Wolfgang Maass and Michael Schmitt},
  title = {On the Complexity of Learning for a Spiking Neuron},
  booktitle = COLT,
  year = {1997},
  pages = {54--61},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{MaassScSo91,
  author = {W. Maass and G. Schnitger and E. D. Sontag},
  title = {On the computational power of sigmoid versus {B}oolean threshold
	circuits},
  booktitle = FOCS,
  year = {1991},
  pages = {767--776},
  publisher = {IEEE Computer Society Press, Los Alamitos, CA}
}

@INCOLLECTION{MaassTu92,
  author = {Wolfgang Maass and Gy\"{o}gy Tur\'{a}n},
  title = {How Fast Can a Threshold Gate Learn?},
  booktitle = {Computational Learning Theory and Natural Learning Systems: Constraints
	and Prospects},
  publisher = {MIT Press},
  year = {1992},
  editor = {Drastal and Hanson and Rivest},
  note = {(To appear.)}
}

@INPROCEEDINGS{MaassTu90,
  author = {Wolfgang Maass and Gy\"{o}gy Tur\'{a}n},
  title = {On the complexity of learning from counterexamples and membership
	queries},
  booktitle = FOCS,
  year = {1990},
  pages = {203--210},
  month = Oct,
  publisher = {IEEE}
}

@INBOOK{MaassTu94,
  chapter = {13},
  pages = {381--414},
  title = {How fast can a threshold gate learn?},
  publisher = {MIT Press},
  year = {1994},
  author = {Wolgang Maass and Gy{\"o}rgy Tur{\'a}n},
  note = {Earlier versions appeared in FOCS89 and FOCS90},
  booktitle = {Computational Learning Theory and Natural Learning Systems I: Constraints
	and Prospects}
}

@INPROCEEDINGS{MaassTu89,
  author = {W. Maass and G. Tur{\'a}n},
  title = {On the complexity of learning from counterexamples},
  booktitle = FOCS,
  year = {1989},
  pages = {262--267},
  publisher = {IEEE Computer Society Press, Los Alamitos, CA}
}

@ARTICLE{MaassTu94a,
  author = {Wolfgang Maass and Gy{\"{o}}rgy Tur{\'{a}}n},
  title = {Algorithms and Lower Bounds for On-Line Learning of Geometrical Concepts},
  journal = {Machine Learning},
  year = {1994},
  volume = {14},
  pages = {251--269},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{MaassTu92a,
  author = {Wolfgang Maass and Gy{\"{o}}rgy Tur{\'{a}}n},
  title = {Lower Bound Methods and Separation Results for On-Line Learning Models},
  journal = {Machine Learning},
  year = {1992},
  volume = {9},
  pages = {107--145},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{MaassWa95,
  author = {Wolfgang Maass and Manfred K. Warmuth},
  title = {Efficient learning with virtual threshold gates},
  booktitle = ICML,
  year = {1995},
  pages = {378--386},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{Macbeath51,
  author = {A. M. Macbeath},
  title = {A Compactness theorem for affine equivalence-classes of convex regions},
  journal = {Canad. J. Math.},
  year = {1951},
  volume = {3},
  pages = {54--61}
}

@INPROCEEDINGS{MacCartneyGaMa08,
  author = {B. MacCartney and M. Galley and C. D. Manning},
  title = {A Phrase-Based Alignment Model for Natural Language Inference},
  booktitle = EMNLP,
  year = {2008},
  pages = {802--811},
  address = {Honolulu, Hawaii},
  month = {October},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/D08-1084}
}

@INPROCEEDINGS{MacCartneyGrMa06,
  author = {B. MacCartney and T. Grenager and M. de Marneffe},
  title = {Learning to recognize features of valid textual entailments},
  booktitle = RTE-NAACL,
  year = {2006}
}

@INPROCEEDINGS{MacCartneyGrTrDeMaCeMa06,
  author = {MacCartney, B. and Grenager, T. and de Marneffe, M.-C. and Cer, D.
	and Manning, C. D.},
  title = {Learning to recognize features of valid textual entailments},
  booktitle = NAACL,
  year = {2006}
}

@INPROCEEDINGS{MacCartneyMa09,
  author = {B. MacCartney and C. D. Manning},
  title = {An extended model of natural logic},
  booktitle = IWCS,
  year = {2009},
  address = {Tilburg, Netherlands}
}

@INPROCEEDINGS{MacCartneyMa09a,
  author = {MacCartney, B. and Manning, C. D.},
  title = {An extended model of natural logic},
  booktitle = {IWCS-8},
  year = {2009},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@INPROCEEDINGS{MaccartneyMa08,
  author = {Maccartney, Bill and Manning, Christopher D. },
  title = {Modeling Semantic Containment and Exclusion in Natural Language Inference},
  booktitle = COLING,
  year = {2008},
  pages = {521--528},
  address = {Manchester, UK},
  month = {August},
  publisher = {Coling 2008 Organizing Committee},
  citeulike-article-id = {3273967},
  keywords = {coling2008, semantics, trg},
  posted-at = {2008-09-16 17:40:57},
  priority = {0},
  url = {http://www.aclweb.org/anthology/C08-1066}
}

@INPROCEEDINGS{MacCartneyMa08,
  author = {MacCartney, B. and Manning, C. D. },
  title = {Modeling Semantic Containment and Exclusion in Natural Language Inference},
  booktitle = {COLING},
  year = {2008},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@INPROCEEDINGS{MachereyOc07,
  author = {Macherey, Wolfgang and Och, Franz J.},
  title = {An Empirical Study on Computing Consensus Translations from Multiple
	Machine Translation Systems},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {986--995},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1105}
}

@INPROCEEDINGS{MacintyreSo93,
  author = {A. Macintyre and E. D. Sontag},
  title = {Finiteness results for sigmoid},
  booktitle = STOC,
  year = {1993},
  pages = {325--334},
  publisher = {ACM Press, New York, NY}
}

@PHDTHESIS{MacKay92,
  author = {D. MacKay},
  title = {{B}ayesian Methods for Adaptive Models},
  school = {California Institute of Technology},
  year = {1992}
}

@ARTICLE{MaclinSh96,
  author = {Richard Maclin and Jude W. Shavlik},
  title = {Creating Advice-Taking Reinforcement Learners},
  journal = {Machine Learning},
  year = {1996},
  volume = {22},
  pages = {251--281},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INBOOK{MaclinSh94,
  chapter = {9},
  pages = {249--286},
  title = {Refining algorithms with knowledge-based neural networks: improving
	the {C}ho-{F}asman algorithm for protein folding},
  publisher = {MIT Press},
  year = {1994},
  author = {Richard Maclin and Jude W. Shavlik},
  volume = {I: Constraints and Prospects},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@ARTICLE{MaclinSh93,
  author = {Richard Maclin and Jude W. Shavlik},
  title = {Using Knowledge-Based Neural Networks to Improve Algorithms: Refining
	the Chou-Fasman Algorithm for Protein Folding},
  journal = {Machine Learning},
  year = {1993},
  volume = {11},
  pages = {195--215},
  publisher = {Kluwer Academic Publishers, Boston}
}

@BOOK{MacWhinney00,
  title = {The CHILDES project: Tools for analyzing talk. Third Edition},
  publisher = {Lawrence Elrbaum Associates},
  year = {2000},
  author = {B. MacWhinney},
  address = {Mahwah, NJ}
}

@ARTICLE{Maes90,
  author = {Maes, Pattie},
  title = {How to do the Right Thing},
  journal = {Connection Science Journal, Special Issue on Hybrid Systems},
  year = {1990},
  volume = {1}
}

@INPROCEEDINGS{MCCS09,
  author = {D. Magatti and S. Calegari and D. Ciucci and F. Stella},
  title = {Automatic Labeling of Topics},
  booktitle = {ISDA},
  year = {2009},
  pages = {1227-1232}
}

@INPROCEEDINGS{Magen02,
  author = {A.~Magen},
  title = {Dimensionality Reductions That Preserve Volumes and Distance to Affine
	Spaces, and Their Algorithmic Applications},
  booktitle = {RANDOM},
  year = {2002},
  pages = {239--253}
}

@INPROCEEDINGS{Magerman95,
  author = {Magerman, D. M.},
  title = {Statistical decision-tree models for parsing},
  booktitle = ACL,
  year = {1995},
  pages = {276--283}
}

@BOOK{MagnusKaSo66,
  title = {Combinatorial Group Theory: Presentation of Groups inTerms of Generators
	and Relations},
  publisher = {John Wiley \& Sons},
  year = {1966},
  author = {Wilhelm Magnus and Abraham Karrass and Donald Solitar},
  address = {New York},
  comment = {Discusses word problem and Cayley graph of a group}
}

@INPROCEEDINGS{Mahadevan07,
  author = {S. Mahadevan},
  title = {Adaptive mesh compression in {3D} computer graphics using multiscale
	manifold learning},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {585--592},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@ARTICLE{Mahadevan96,
  author = {Sridhar Mahadevan},
  title = {Average Reward Reinforcement Learning: Foundations, Algorithms, and
	Empirical Results},
  journal = {Machine Learning},
  year = {1996},
  volume = {22},
  pages = {159--195},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{Mahadevan96a,
  author = {Sridhar Mahadevan},
  title = {Sensitive discount optimality: unifying discounted and average reward
	reinforcement learning},
  booktitle = ICML,
  year = {1996},
  pages = {328--336},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{Mahadevan94,
  author = {Sridhar Mahadevan},
  title = {To discount or not to discount in reinforcement learning: a case
	study comparing {R} learning and {Q} learning},
  booktitle = ICML,
  year = {1994},
  pages = {164--172},
  publisher = {Morgan Kaufmann}
}

@TECHREPORT{MahadevanCo90,
  author = {S. Mahadevan and J. Connell},
  title = {Automatic Programming of Behavior-Based Robots using Reinforcement
	Learning},
  institution = {IBM Research at Yorktown Heights},
  year = {1990},
  month = dec
}

@INPROCEEDINGS{MMDG97,
  author = {Sridhar Mahadevan and Nicholas Marchalleck and Tapas K. Das and Abhijit
	Gosavi},
  title = {Self-improving factory simulation using continuous-time average-reward
	reinforcement learning},
  booktitle = ICML,
  year = {1997},
  pages = {202--210},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{MahadevanTa94,
  author = {Sridhar Mahadevan and Prasad Tadepalli},
  title = {Quantifying Prior Determination Knowledge Using the {PAC} Learning
	Model},
  journal = {Machine Learning},
  year = {1994},
  volume = {17},
  pages = {69--105},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{MahoneyMo94,
  author = {J. Jeffrey Mahoney and Raymond J. Mooney},
  title = {Comparing methods for refining certainty-factor rule-bases},
  booktitle = ICML,
  year = {1994},
  pages = {173--180},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{MairesseWa07,
  author = {Mairesse, Francois and Walker, Marilyn},
  title = {PERSONAGE: Personality Generation for Dialogue},
  booktitle = ACL,
  year = {2007},
  pages = {496--503},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1063}
}

@ARTICLE{MakhoulRoGi85,
  author = {Makhoul, John and Salim Roucos and Herbert Gish},
  title = {Vector Quantization in Speech Coding},
  journal = {Proceedings of the IEEE},
  year = {1985},
  volume = {73},
  pages = {1551--1588},
  number = {11},
  month = Nov,
  comment = {Excellent overview and introduction to vector quantization.}
}

@ARTICLE{MakinoIb97,
  author = {Kazuhisa Makino and Toshihide Ibaraki},
  title = {The Maximum Latency and Identification of Positive Boolean Functions},
  journal = {{SIAM} J. Comput.},
  year = {1997},
  volume = {26},
  pages = {1363--1383},
  number = {5}
}

@INPROCEEDINGS{MalakasiotisAn07,
  author = {Malakasiotis, P. and Androutsopoulos, I.},
  title = {Learning Textual Entailment using SVMs and String Similarity Measures},
  booktitle = {ACL-PASCAL Workshop on Textual Entailment and Paraphrasing},
  year = {2007},
  pages = {42--47},
  address = {Prague},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/W/W07/W07-1407}
}

@INPROCEEDINGS{MalerPn91,
  author = {O. Maler and A. Pneuli},
  title = {On the learnability of infinitary regular sets},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1991},
  pages = {128--136},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{MPBG07,
  author = {Malioutov, Igor and Park, Alex and Barzilay, Regina and Glass, James},
  title = {Making Sense of Sound: Unsupervised Topic Segmentation over Acoustic
	Input},
  booktitle = ACL,
  year = {2007},
  pages = {504--511},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1064}
}

@ARTICLE{Mallows57,
  author = {C. L. Mallows},
  title = {Non-Null Ranking Models},
  journal = {Biometrika},
  year = {1957},
  volume = {44},
  pages = {114-130}
}

@INPROCEEDINGS{MamitsukaYa93,
  author = {H. Mamitsuka and K. Yamanishi},
  title = {Protein secondary structure prediction based on stochastic-rule learning},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1993},
  volume = {743},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {240--251},
  publisher = {Springer-Verlag}
}

@ARTICLE{Manacher89,
  author = {G. K. Manacher and T. D. Bui and T. Mai},
  title = {Optimum Combinations of Sorting and Merging},
  journal = jacm,
  year = {1989},
  volume = {36},
  pages = {290-334},
  number = {2},
  month = apr,
  keywords = {Data Structures and Algorithms; Algorithms; Theory; Verification;
	Ford-Johnson algorithm; optimum combinations; optimum sort and merge;}
}

@BOOK{Mangarasian69,
  title = {Nonlinear Programming},
  publisher = {McGraw-Hill},
  year = {1969},
  author = {O. L. Mangarasian}
}

@ARTICLE{MangenLa91,
  author = {A. Mangen and N. Lasudry},
  title = {Search for the {I}ntersection {P}olygon of any {T}wo {P}olygons:
	{A}pplication to the {G}arment {I}ndustry},
  journal = {Computer Graphics Forum},
  year = {1991},
  volume = {10},
  pages = {195-208}
}

@INPROCEEDINGS{ManguBr97,
  author = {Mangu, L. and Brill, E.},
  title = {Automatic rule acquisition for spelling correction},
  booktitle = ICML,
  year = {1997},
  pages = {734--741}
}

@INPROCEEDINGS{MannMc07,
  author = {G. Mann and A. McCallum},
  title = {Simple, robust, scalable semi-supervised learning via expectation
	regularization},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {593--600},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{MannMc08,
  author = {Gideon Mann and Andrew McCallum},
  title = {Generalized Expectation Criteria for Semi-Supervised Learning of
	Conditional Random Fields},
  booktitle = ACL,
  year = {2008},
  number = {870 - 878},
  type = {IR}
}

@INPROCEEDINGS{Mannem07,
  author = {Mannem, Prashanth Reddy},
  title = {Online Learning for Deterministic Dependency Parsing},
  booktitle = {CoNLL Shared Task Session of EMNLP-CoNLL},
  year = {2007},
  pages = {1139--1143},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1124}
}

@INPROCEEDINGS{Mannila96,
  author = {Heikki Mannila},
  title = {Data mining and machine learning (abstract)},
  booktitle = ICML,
  year = {1996},
  pages = {555},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{MannilaRa86,
  author = {Mannila, H. and K. J. Raiha},
  title = {Design By Example: An Application of {A}rmstrong relations},
  journal = JCSS,
  year = {1986},
  volume = {33},
  pages = {126--141},
  number = {2}
}

@BOOK{ManningRaSc08,
  title = {An Introduction to Information Retrieval},
  publisher = {Cambridge},
  year = {2008},
  author = {C. Manning and P. Raghavan and H. Sch\"{u}tze},
  comment = {#draft#}
}

@BOOK{ManningSc99,
  title = {Foundations of Statistical Natural Language Processing},
  publisher = {Cambridge, Massachusetts},
  year = {1999},
  author = {Christopher D. Manning and Hinrich Sch�tze}
}

@INPROCEEDINGS{Mansour99,
  author = {Yishay Mansour},
  title = {Reinforcement learning and mistake bounded algorithms},
  booktitle = COLT,
  year = {1999},
  pages = {183--192},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{Mansour97,
  author = {Yishay Mansour},
  title = {Pessimistic decision tree pruning based on tree size},
  booktitle = ICML,
  year = {1997},
  pages = {195--201},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{Mansour92a,
  author = {Mansour, Yishay92},
  title = {An $o(n^{loglogn})$ learning algorithm for DNF under theuniform distribution},
  booktitle = COLT,
  year = {1992},
  pages = {53--61},
  month = Jul
}

@UNPUBLISHED{Mansour90,
  author = {Mansour, Yishay},
  title = {Learning via Fourier Transform},
  note = {(see KushilevitzMa91)},
  month = Apr,
  year = {1990},
  tag = {TOC-display}
}

@INPROCEEDINGS{MansourMc00,
  author = {Yishay Mansour and David Mc{A}llester},
  title = {Boosting Using Branching Programs},
  booktitle = COLT,
  year = {2000},
  pages = {220--224},
  publisher = {Morgan Kaufmann, San Francisco}
}

@INPROCEEDINGS{MansourMc00a,
  author = {Yishay Mansour and David Mc{A}llester},
  title = {Generalization Bounds for Decision Trees},
  booktitle = COLT,
  year = {2000},
  pages = {69--80},
  publisher = {Morgan Kaufmann, San Francisco}
}

@ARTICLE{MansourSa00,
  author = {Yishay Mansour and Sigal Sahar},
  title = {Implementation Issues in the Fourier Transform Algorithm},
  journal = {Machine Learning},
  year = {2000},
  volume = {40},
  pages = {5--33},
  number = {1},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{MansourSc97,
  author = {Yishay Mansour and Mariano Schain},
  title = {Learning with Maximum-Entropy Distributions},
  booktitle = COLT,
  year = {1997},
  pages = {201--210},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{Mansour92,
  author = {Yishay Mansour and Baruch Schieber},
  title = {The Intractability of Bounded Protocols for On-Line Sequence Transmission
	over Non-{FIFO} Channels},
  journal = jacm,
  year = {1992},
  volume = {39},
  pages = {783-799},
  number = {4},
  month = oct,
  keywords = {Communication Protocols; Channels; Protocols; data link; lower bound;
	non-FIFO channels; sequence transmission; }
}

@ARTICLE{Mansour91,
  author = {Yishay Mansour and Baruch Schieber and Prasoon Tiwari},
  title = {A Lower Bound for Integer Greatest Common Divisor Computations},
  journal = jacm,
  year = {1991},
  volume = {38},
  pages = {453-471},
  number = {2},
  month = apr,
  keywords = {Theory of Computation; Algorithms; floor operation; greatest common
	divisor; lower bound; mod operation; truncation; }
}

@INPROCEEDINGS{MarciniakSt05,
  author = {Marciniak, T. and M. Strube},
  title = {Beyond the Pipeline: Discrete Optimization in {NLP}},
  booktitle = CoNLL,
  year = {2005},
  pages = {136--143},
  address = {Ann Arbor, Michigan},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/W/W05/W05-0618}
}

@INPROCEEDINGS{MarcoSt07,
  author = {Marco, Baroni and Stefan, Evert},
  title = {Words and Echoes: Assessing and Mitigating the Non-Randomness Problem
	in Word Frequency Distribution Modeling},
  booktitle = ACL,
  year = {2007},
  pages = {904--911},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1114}
}

@ARTICLE{Marcus93,
  author = {G. F. Marcus},
  title = {Negative evidence in language acquisition},
  journal = {Cognition},
  year = {1993},
  volume = {46},
  pages = {53-85}
}

@ARTICLE{MarcusSaMa93,
  author = {M. P. Marcus and B. Santorini and M. Marcinkiewicz},
  title = {Building a Large Annotated Corpus of {E}nglish: The {P}enn {T}reebank},
  journal = {Computational Linguistics},
  year = {1993},
  volume = {19},
  pages = {313--330},
  number = {2},
  month = jun
}

@ARTICLE{wsj-corpus,
  author = {M. P. Marcus and B. Santorini and M. Marcinkiewicz},
  title = {Building a Large Annotated Corpus of {E}nglish: The {P}enn {T}reebank},
  journal = {Computational Linguistics},
  year = {1993},
  volume = {19},
  pages = {313--330},
  number = {2},
  month = jun
}

@ARTICLE{penn-tree-bank,
  author = {Marcus, M. P. and Santorini, B. and Marcinkiewicz, M. A. },
  title = {Building a Large Annotated Corpus of English: The Penn Treebank},
  journal = {Computational Linguistics},
  abstract = {this paper, we review our experience with constructing one such large
	annotated corpus--the Penn Treebank, a corpus consisting of over
	4.5 million words of American English. During the first three-year
	phase of the Penn Treebank Project (1989-1992), this corpus has been
	annotated for part-of-speech (POS) information. In addition, over
	half of it has been annotated for skeletal syntactic structure. These
	materials are available to members of the Linguistic Data Consortium;
	for details, see...},
  keywords = {informationretrieval, nlp, ontology, thesaurus}
}

@ARTICLE{Marek91,
  author = {Wiktor Marek and Miroslaw Truszczynski},
  title = {Autoepistemic Logic},
  journal = jacm,
  year = {1991},
  volume = {38},
  pages = {588-619},
  number = {3},
  month = jul,
  keywords = {Logic; Theory; autoepistemic logic; expansion; logic programming;
	NP-completeness; stratification; }
}

@INPROCEEDINGS{MargaritisTh98,
  author = {Dimitris Margaritis and Sebastian Thrun},
  title = {Learning to locate an object in {3D} space from a sequence of camera
	images},
  booktitle = ICML,
  year = {1998},
  pages = {332--340},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{MargineantuDi97,
  author = {Dragos D. Margineantu and Thomas G. Dietterich},
  title = {Pruning adaptive boosting},
  booktitle = ICML,
  year = {1997},
  pages = {211--218},
  publisher = {Morgan Kaufmann}
}

@BOOK{Margolis87,
  title = {Patterns, Thinking, and Cognition. A Theory of Judgment},
  publisher = {University of Chicago Press},
  year = {1987},
  author = {Margolis, H.}
}

@INPROCEEDINGS{Marinov07,
  author = {Marinov, Svetoslav},
  title = {{Covington} Variations},
  booktitle = {CoNLL Shared Task Session of EMNLP-CoNLL},
  year = {2007},
  pages = {1144--1148},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1125}
}

@ARTICLE{MarkovitchSc93,
  author = {Shaul Markovitch and Paul D. Scott},
  title = {Information Filtering: Selection Mechanisms in Learning Systems},
  journal = {Machine Learning},
  year = {1993},
  volume = {10},
  pages = {113--151},
  publisher = {Kluwer Academic Publishers, Boston}
}

@MASTERSTHESIS{Marlow01,
  author = {Marlow, C.},
  title = {A Language-Based Approach to Categorical Analysis},
  school = {Massachusetts Institute of Technology},
  year = {2001},
  month = {June}
}

@INPROCEEDINGS{MGMCRKM07,
  author = {M. de Marneffe and T. Grenager and B. MacCartney and D. Cer and D.
	Ramage and C. Kiddon and C. D. Manning},
  title = {Aligning semantic graphs for textual inference and machine reading},
  booktitle = {AAAI Spring Symposium at Stanford},
  year = {2007}
}

@INPROCEEDINGS{MMGCRM05,
  author = {Marie-Catherine de Marneffe and Bill MacCartney and Trond Grenager
	and Daniel Cer and Anna Rafferty and Christopher Manning},
  title = {Learning to distinguish valid textual entailments},
  booktitle = {PASCAL Challenges Workshop on Recognizing Textual Entailment},
  year = {2005}
}

@INPROCEEDINGS{MarneffeRaMa08,
  author = {de Marneffe, Marie-Catherine and Rafferty, Anna N. and Manning, Christopher
	D.},
  title = {Finding Contradictions in Text},
  booktitle = ACL,
  year = {2008},
  pages = {1039--1047},
  address = {Columbus, Ohio},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P08/P08-1118}
}

@INPROCEEDINGS{MaronRa98,
  author = {Oded Maron and Aparna Lakshmi Ratan},
  title = {Multiple-instance learning for natural scene classification},
  booktitle = ICML,
  year = {1998},
  pages = {341--349},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{Marron88,
  author = {A. Marron},
  title = {Learning pattern languages from a single initial example and from
	queries},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1988},
  pages = {345--358},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{Marron87,
  author = {Marron, Assaf and Ker-I Ko},
  title = {Identification of Pattern Languages from Examples and Queries},
  journal = {Information and Computation},
  year = {1987},
  volume = {74},
  pages = {91--112},
  number = {2},
  month = Aug
}

@TECHREPORT{Marroquin85,
  author = {Marroquin, Jose Luis},
  title = {Probabilistic Solution of Inverse Problems},
  institution = {MIT AI Laboratory},
  year = {1985},
  number = {AI-TR-860},
  month = Sep,
  comment = {Vision problems, Markov Random Fields, simulation techniques similar
	to simulated annealing used for Bayesian estimation.}
}

@INPROCEEDINGS{MarsiKrahmer05,
  author = {Marsi, E. and Krahmer, E.},
  title = {Classification of Semantic Relations by Humans and Machines},
  booktitle = {ACL Workshop on Empirical Modeling of Semantic Equivalence and Entailment},
  year = {2005},
  address = {Ann Arbor, Michigan}
}

@INPROCEEDINGS{Marthi07,
  author = {B. Marthi},
  title = {Automatic shaping and decomposition of reward functions},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {601--608},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{MartinOs95,
  author = {Eric Martin and Daniel Osherson},
  title = {A note on the use of probabilities by mechanical learners},
  booktitle = EuroCOLT,
  year = {1995},
  pages = {261--271},
  publisher = {Springer-Verlag}
}

@ARTICLE{MartinOs98,
  author = {Eric Martin and Daniel N. Osherson},
  title = {Belief revision in the service of scientific discovery},
  journal = {Mathematical Social Sciences},
  year = {1998},
  volume = {36},
  pages = {57--68},
  number = {1}
}

@BOOK{MartinOs98a,
  title = {Elements of Scientific Inquiry},
  publisher = {The MIT Press},
  year = {1998},
  author = {Eric Martin and Daniel N. Osherson},
  address = {Cambridge, Massachusetts}
}

@ARTICLE{MartinOs97,
  author = {Eric Martin and Daniel N. Osherson},
  title = {Scientific discovery based on belief revision},
  journal = {The Journal of Symbolic Logic},
  year = {1997},
  volume = {62},
  pages = {1352--1370},
  number = {4},
  month = dec
}

@ARTICLE{MartinBi94,
  author = {Joel D. Martin and Dorrit O. Billman},
  title = {Acquiring and Combining Overlapping Concepts},
  journal = {Machine Learning},
  year = {1994},
  volume = {16},
  pages = {121--155},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Martin97,
  author = {J. Kent Martin},
  title = {An exact probability metric for decision tree splitting and stopping},
  journal = {Machine Learning},
  year = {1997},
  volume = {28},
  pages = {257--291},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{MartinVr96,
  author = {Lionel Martin and Christel Vrain},
  title = {Induction of constraint logic programs},
  booktitle = ALT,
  year = {1996},
  volume = {1160},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {169--176},
  publisher = {Springer-Verlag}
}

@INCOLLECTION{Martin83,
  author = {W.J.R. Martin and B.P.F. Al and P.J.G. van Sterkenburg},
  title = {On the processing of text corpus: from textual data to lexicographical
	information},
  booktitle = {Lexicography: Principles and Practice},
  publisher = {Academic Press},
  year = {1983},
  editor = {R.R.K. Hartman},
  series = {Applied Language Studies Series},
  address = {London}
}

@INCOLLECTION{MartinAlSt83,
  author = {W.J.R. Martin and B.P.F. Al and P.J.G. van Sterkenburg},
  title = {On the processing of text corpus: from textual data to lexicographical
	information},
  booktitle = {Lexicography: Principles and Practice},
  publisher = {Academic Press},
  year = {1983},
  editor = {R.R.K. Hartman},
  series = {Applied Language Studies Series},
  address = {London}
}

@INPROCEEDINGS{MartinsSmXi09a,
  author = {Martins, A. and Smith, N. A. and Xing, E.},
  title = {Concise Integer Linear Programming Formulations for Dependency Parsing},
  booktitle = ACL,
  year = {2009},
  month = {August}
}

@INPROCEEDINGS{MartinsSmXi09,
  author = {Martins, A. F. T. and Smith, N. A. and Xing, E. P.},
  title = {Polyhedral outer approximations with application to natural language
	parsing},
  booktitle = ICML,
  year = {2009},
  pages = {713--720},
  address = {New York, NY, USA},
  publisher = {ACM},
  doi = {http://doi.acm.org/10.1145/1553374.1553466},
  isbn = {978-1-60558-516-1},
  location = {Montreal, Quebec, Canada}
}

@INPROCEEDINGS{MaruokaTa98,
  author = {A. Maruoka and E. Takimoto},
  title = {Structured Weight-Based Prediction Algorithms},
  booktitle = ALT,
  year = {1998},
  volume = {1501},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {127--142},
  publisher = {Springer-Verlag}
}

@TECHREPORT{MaruyamaMi91,
  author = {Osamu Maruyama and Satoru Miyano},
  title = {Inferring a Tree from Walks},
  institution = {Kyushu University},
  year = {1991},
  number = {RIFIS-TR-CS-51},
  month = Dec
}

@ARTICLE{MaryanskiBo77,
  author = {F. J. Maryanski and T. L. Booth},
  title = {Inference of finite-state probabilistic grammars},
  journal = {IEEE Trans. on Computers},
  year = {1977},
  volume = {C-26},
  pages = {521--536}
}

@ARTICLE{MaschlerShPe72,
  author = {Maschler, M.B. and B. Peleg and L.S. Shapley},
  title = {The Kernel and Bargaining Set for Convex Games},
  journal = {International Journal of Game Theory},
  year = {1972},
  volume = {1},
  pages = {73--93},
  number = {2}
}

@INPROCEEDINGS{MaslennikovCh07,
  author = {Maslennikov, Mstislav and Chua, Tat-Seng},
  title = {A Multi-resolution Framework for Information Extraction from Free
	Text},
  booktitle = ACL,
  year = {2007},
  pages = {592--599},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1075}
}

@INPROCEEDINGS{Masnadi-ShiraziVa07,
  author = {H. Masnadi-Shirazi and N. Vasconcelos},
  title = {Asymmetric boosting},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {609--616},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@ARTICLE{MasonBaBa00,
  author = {Llew Mason and Peter L. Bartlett and Jonathan Baxter},
  title = {Improved Generalization Through Explicit Optimization of Margins},
  journal = {Machine Learning},
  year = {2000},
  volume = {38},
  pages = {243--255},
  number = {3},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{MataMi97,
  author = {C. Mata and J. S.B. Mitchell},
  title = {A new algorithm for computing the shortest paths in planar subdivisions},
  booktitle = {SOCG},
  year = {1997},
  pages = {264--273}
}

@TECHREPORT{Matan95,
  author = {Ofer Matan},
  title = {On-Site Learning},
  institution = {Stanford University},
  year = {1995},
  number = {LOGIC-95-4},
  department = {Logic Group}
}

@MASTERSTHESIS{Matar93,
  author = {Matar, S.},
  title = {Learning with Minimal Number of Queries},
  school = {University of Albert, Canada},
  year = {1993}
}

@INPROCEEDINGS{Mataric94,
  author = {Maja J. Mataric},
  title = {Reward functions for accelerated learning},
  booktitle = ICML,
  year = {1994},
  pages = {181--189},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{MateescuDeKa02,
  author = {Robert Mateescu and Rina Dechter and Kalev Kask},
  title = {Tree approximation for belief updating},
  booktitle = AAAI,
  year = {2002},
  pages = {553--559},
  address = {Menlo Park, CA, USA},
  publisher = {American Association for Artificial Intelligence},
  isbn = {0-262-51129-0},
  location = {Edmonton, Alberta, Canada}
}

@INPROCEEDINGS{Mathias95,
  author = {David H. Mathias},
  title = {{DNF} - if you can't learn 'em, teach 'em: an interactive model of
	teaching},
  booktitle = COLT,
  year = {1995},
  pages = {222--229},
  publisher = {ACM Press, New York, NY}
}

@INCOLLECTION{Matouv91a,
  author = {J. Matou{\v s}ek},
  title = {Computing the center of planar point sets},
  booktitle = {Computational Geometry: Papers from the DIMACS Special Year},
  publisher = {American Mathematical Society},
  year = {1991},
  editor = {J. E. Goodman and R. Pollack and W. Steiger},
  pages = {221--230},
  address = {Providence},
  keywords = {centerpoint, parametric search, cutting, k-level}
}

@INCOLLECTION{Matouv93,
  author = {J. Matou{\v s}ek},
  title = {Epsilon-Nets and Computational Geometry},
  booktitle = {New Trends in Discrete and Computational Geometry},
  publisher = {Springer-Verlag},
  year = {1993},
  editor = {J. Pach},
  volume = {10},
  series = {Algorithms and Combinatorics},
  pages = {69--89},
  address = {Heidelberg}
}

@BOOK{Matouv02,
  title = {Lectures on Discrete Geometry},
  publisher = {Springer},
  year = {2002},
  author = {J. Matou{\v s}ek},
  url = {http://kam.mff.cuni.cz/~matousek/dg.html}
}

@ARTICLE{Matouv00,
  author = {J.~Matou{\v s}ek},
  title = {On approximate geometric $k$-clustering},
  journal = DCG,
  year = {2000},
  volume = {24},
  pages = {61--84}
}

@BOOK{Matouv99,
  title = {Geometric Discrepancy},
  publisher = {Springer},
  year = {1999},
  author = {J. Matou{\v s}ek},
  url = {http://kam.mff.cuni.cz/~matousek/dg.html}
}

@ARTICLE{Matouv98,
  author = {J. Matou{\v s}ek},
  title = {On constants for cuttings in the plane},
  journal = DCG,
  year = {1998},
  volume = {20},
  pages = {427--448},
  url = {http://link.springer.de/link/service/journals/00454/bibs/20n4p427.html}
}

@ARTICLE{Matouv95,
  author = {J. Matou{\v s}ek},
  title = {On Geometric Optimization with Few Violated Constraints},
  journal = DCG,
  year = {1995},
  volume = {14},
  pages = {365--384}
}

@ARTICLE{Matouv95a,
  author = {J. Matou{\v s}ek},
  title = {On enclosing $k$ points by a circle},
  journal = IPL,
  year = {1995},
  volume = {53},
  pages = {217--221}
}

@ARTICLE{Matouv93a,
  author = {J. Matou{\v s}ek},
  title = {Range searching with efficient hierarchical cuttings},
  journal = DCG,
  year = {1993},
  volume = {10},
  pages = {157--182},
  number = {2}
}

@ARTICLE{Matouv92,
  author = {J. Matou{\v s}ek},
  title = {Efficient partition trees},
  journal = DCG,
  year = {1992},
  volume = {8},
  pages = {315--334},
  keywords = {simplex range searching, crossing number, multilevel data structure,
	approximations}
}

@INPROCEEDINGS{Matouv91,
  author = {J. Matou{\v s}ek},
  title = {Approximations and optimal geometric divide-and-conquer},
  booktitle = STOC,
  year = {1991},
  pages = {505--511},
  note = {Also to appear in {\em J. Comput. Syst. Sci.}},
  keywords = {approximations, VC-dimension, shatter function, derandomization ,
	cutting, partition}
}

@ARTICLE{Matouv90,
  author = {J. Matou{\v s}ek},
  title = {Construction of $\epsilon$-nets},
  journal = DCG,
  year = {1990},
  volume = {5},
  pages = {427--448}
}

@INPROCEEDINGS{MMPSSW91,
  author = {J. Matou{\v s}ek and N. Miller and J. Pach and M. Sharir and S. Sifrony
	and E. Welzl},
  title = {Fat triangles determine linearly many holes},
  booktitle = FOCS,
  year = {1991},
  pages = {49--58}
}

@UNPUBLISHED{MatouvPl97,
  author = {J. Matou{\v s}ek and P. Plech{\' a}{\v c}},
  title = {On functional separately convex hulls},
  note = {To appear in Discrete Comput. Geom.},
  year = {1997}
}

@ARTICLE{MatouvShWe96,
  author = {J. Matou{\v s}ek and M. Sharir and E. Welzl},
  title = {A subexponential bound for linear programming},
  journal = {Algorithmica},
  year = {1996},
  volume = {16},
  pages = {498--516}
}

@INPROCEEDINGS{MatouvWeWe91,
  author = {J. Matou{\v s}ek and E. Welzl and L. Wernisch},
  title = {Discrepancy and $\varepsilon$-approximations for bounded {VC}-dimension},
  booktitle = FOCS,
  year = {1991},
  pages = {424--430}
}

@ARTICLE{Matouvsek95,
  author = {J. Matou{\v{s}}ek},
  title = {Approximations and Optimal Geometric Divide-and-Conquer},
  journal = {J. Comput. Syst. Sci.},
  year = {1995},
  volume = {50},
  pages = {203--208},
  number = {2},
  preliminary = {STOC::Matousek1991},
  source = {http://theory.lcs.mit.edu/\tildegen{}dmjones/hbp/jcss/jcss.bib}
}

@INPROCEEDINGS{MatsumotoHaSh97,
  author = {Satoshi Matsumoto and Yukiko Hayashi and Takayoshi Shoudai},
  title = {Polynomial time inductive inference of regular term tree languages
	from positive data},
  booktitle = ALT,
  year = {1997},
  volume = {1316},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {212--227},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{MatsumotoSh97,
  author = {Satoshi Matsumoto and Ayumi Shinohara},
  title = {Learning pattern languages using queries},
  booktitle = EuroCOLT,
  year = {1997},
  volume = {1208},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {185--197},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{MatsumotoSh94,
  author = {S. Matsumoto and A. Shinohara},
  title = {Refutably probably approximately correct learning},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1994},
  volume = {872},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {469--483},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Matsumoto93,
  author = {Yuji Matsumoto and Hiroyuki Ishimoto and Takehito Utsuro and Makoto
	Nagao},
  title = {Structural matching of parallel texts},
  booktitle = ACL,
  year = {1993}
}

@INPROCEEDINGS{MIUN93,
  author = {Yuji Matsumoto and Hiroyuki Ishimoto and Takehito Utsuro and Makoto
	Nagao},
  title = {Structural matching of parallel texts},
  booktitle = ACL,
  year = {1993}
}

@INPROCEEDINGS{Matsuoka93,
  author = {M. Matsuoka},
  title = {An application of {B}ernstein polynomials in {PAC} model},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1993},
  volume = {743},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {220--228},
  publisher = {Springer-Verlag}
}

@ARTICLE{Matthews88,
  author = {Alison Matthews and Martin S. Chodorow},
  title = {Pronoun resolution in two-clause sentences: Effects of ambiguity,
	antecedent location and depth of embedding},
  journal = {Journal of Memory and Language},
  year = {1988},
  volume = {27},
  pages = {245--260}
}

@ARTICLE{MatthewsCh88,
  author = {Alison Matthews and Martin S. Chodorow},
  title = {Pronoun resolution in two-clause sentences: Effects of ambiguity,
	antecedent location and depth of embedding},
  journal = {Journal of Memory and Language},
  year = {1988},
  volume = {27},
  pages = {245--260}
}

@BOOK{MatthewsDe89,
  title = {Learnability and Linguistic Theory},
  publisher = {Kluwer},
  year = {1989},
  author = {R. J. Matthews and W. Demopoulos}
}

@INPROCEEDINGS{MatveevaLe07,
  author = {Matveeva, Irina and Levow, Gina-Anne},
  title = {Topic Segmentation with Hybrid Document Indexing},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {351--359},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1037}
}

@INPROCEEDINGS{MaxionTo02,
  author = {R. Maxion and T. Townsend},
  title = {Masquerade detection using truncated command lines},
  booktitle = {Proceeedings of the International Conference on Dependable Systems
	and Networks},
  year = {2002},
  pages = {219-228},
  publisher = {IEEE Computer Society Press},
  url = {citeseer.ist.psu.edu/maxion02masquerade.html}
}

@INPROCEEDINGS{MayKn07,
  author = {May, Jonathan and Knight, Kevin},
  title = {Syntactic Re-Alignment Models for Machine Translation},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {360--368},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1038}
}

@INPROCEEDINGS{MayorazMo97,
  author = {Eddy Mayoraz and Miguel Moreira},
  title = {On the decomposition of polychotomies into dichotomies},
  booktitle = ICML,
  year = {1997},
  pages = {219--226},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{MaysDaMe91,
  author = {E. Mays and F. J. Damerau and R. L. Mercer},
  title = {Context Based Spelling Correction},
  journal = {Information Processing and Management},
  year = {1991},
  volume = {27},
  pages = {517--522},
  number = {5}
}

@INPROCEEDINGS{Maza94,
  author = {Michael de la Maza},
  title = {The generate, test, and explain discovery system architecture},
  booktitle = ICML,
  year = {1994},
  pages = {46--52},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{McAllester91,
  author = {McAllester, David},
  title = {Observations on Cognitive Judgments},
  year = {1991},
  journal = {Proceedings of AAAI-91}
}

@INPROCEEDINGS{McAllester99,
  author = {David A. McAllester},
  title = {{PAC-B}ayesian model averaging},
  booktitle = COLT,
  year = {1999},
  pages = {164--170},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{McAllester99a,
  author = {David A. McAllester},
  title = {Some {PAC}-{B}ayesian Theorems},
  journal = {Machine Learning},
  year = {1999},
  volume = {37},
  pages = {355--363},
  number = {3},
  comment = {first in 11th COLT '98},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{McAllester93a,
  author = {David A. McAllester},
  title = {Automatic Recognition of Tractability in Inference Relations},
  journal = jacm,
  year = {1993},
  volume = {40},
  pages = {284-303},
  number = {2},
  month = apr,
  keywords = {Computational Logic; Algorithms; Deduction; automated reasoning; inference
	rules; machine inference; mechanical verification; polynomial-time
	alg orithm; proof systems; proof theory; theorem proving; }
}

@ARTICLE{McAllester93,
  author = {David McAllester and Robert Givan},
  title = {Taxonomic Syntax for First Order Inference},
  journal = jacm,
  year = {1993},
  volume = {40},
  pages = {246-283},
  number = {2},
  month = apr,
  keywords = {Computational Logic; Algorithms; Deduction; automated reasoning; inference
	rules; machine inference; mechanical verification; polynomial time
	algorithms; proof systems; proof theory; theorem proving; }
}

@INPROCEEDINGS{McCallumBePe05,
  author = {A. McCallum and K. Bellare and F. Pereira},
  title = {A Conditional Random Field for Discriminatively-trained Finite-state
	String Edit Distance},
  booktitle = UAI,
  year = {2005}
}

@INPROCEEDINGS{McCallumFrPe00,
  author = {A. McCallum and D. Freitag and F. Pereira},
  title = {Maximum Entropy Markov Models for Information Extraction and Segmentation},
  booktitle = ICML,
  year = {2000}
}

@INPROCEEDINGS{McCallumNiUn00,
  author = {A. McCallum and K. Nigam and L. Ungar},
  title = {Efficient Clustering of High-Dimensional Data Sets with Application
	to Reference Matching},
  booktitle = KDD,
  year = {2000}
}

@INPROCEEDINGS{McCallumRoSu03,
  author = {Andrew McCallum and Khashayar Rohanimanesh and Charles Sutton},
  title = {{Dynamic Conditional Random Fields for Jointly Labeling Multiple
	Sequences}},
  booktitle = {NIPS Workshop on Syntax, Semantics, and Statistics},
  year = {2003},
  month = {December},
  url = {publications/dcrf-nips03.pdf}
}

@INPROCEEDINGS{McCallumScSi09,
  author = {A. McCallum and K. Schultz and S. Singh},
  title = {{FACTORIE: Probabilistic Programming via Imperatively Defined Factor
	Graphs}},
  booktitle = NIPS,
  year = {2009},
  editor-omit = {Y. Bengio and D. Schuurmans and J. Lafferty and C. K. I. Williams
	and A. Culotta},
  pages-omit = {1249--1257},
  volume-omit = {22}
}

@INPROCEEDINGS{McCallumNi98,
  author = {Andrew Kachites McCallum and Kamal Nigam},
  title = {Employing {EM} and pool-based active learning for text classification},
  booktitle = ICML,
  year = {1998},
  pages = {350--358},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{MRMN98,
  author = {Andrew K. McCallum and Ronald Rosenfeld and Tom M. Mitchell and Andrew
	Y. Ng},
  title = {Improving text classification by shrinkage in a hierarchy of classes},
  booktitle = ICML,
  year = {1998},
  pages = {359--367}
}

@INPROCEEDINGS{McCarthyVeJo07,
  author = {McCarthy, Diana and Venkatapathy, Sriram and Joshi, Aravind},
  title = {Detecting Compositionality of Verb-Object Combinations using Selectional
	Preferences},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {369--379},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1039}
}

@INCOLLECTION{McCarthy68,
  author = {McCarthy, J.},
  title = {Programs with common sense},
  booktitle = {Semantic information processing},
  publisher = {MIT Press},
  year = {1968},
  editor = {M. Minsky},
  pages = {403-418}
}

@INCOLLECTION{McCarthy89,
  author = {McCarthy, J.},
  title = {Artificial Intelligence, logic and formalizingcommon sense},
  booktitle = {Logic and Artificial Intelligence},
  publisher = {Kluer},
  year = {1989},
  editor = {R. Thomason}
}

@ARTICLE{McCarthy86,
  author = {McCarthy, J.},
  title = {Application of circumscription to formalizing commonsense},
  journal = {Artificial Intelligence},
  year = {1986},
  volume = {28},
  pages = {89--116}
}

@ARTICLE{McCarthy80,
  author = {McCarthy, J.},
  title = {Circumscription - a form of non-monotonic reasoning},
  journal = {Artificial Intelligence},
  year = {1980},
  volume = {13},
  number = {1,2}
}

@INPROCEEDINGS{McCarthy58,
  author = {McCarthy, J.},
  title = {Programs with common sense},
  booktitle = {Symposium on the Mechanization of Thought Processes},
  year = {1958},
  volume = {1},
  pages = {77-84},
  organization = {National Physical Laboratory},
  note = {Reprinted in Minsky`s (ed.) {\em Semantic Information Processing},
	MIT Press(1968), 403--409. Also inR. Brachman and H. Levesque,Readings
	in Knowledge Representation, 1985}
}

@ARTICLE{McCarthy56,
  author = {McCarthy, John},
  title = {Measures of the Value of Information},
  journal = {Proceedings of the National Academy of Sciences},
  year = {1956},
  volume = {42},
  pages = {654--655},
  comment = {How to pay a weatherman to make honest predictions. Generalizes rule
	that pays him log(Pi) if event predicted with prob Pi happens.}
}

@BOOK{McClellandRuPDP86,
  title = {Parallel Distributed Processing ---Explorations in the Microstructure
	of Cognition},
  publisher = {MIT Press},
  year = {1986},
  author = {James L. McClelland and David E. Rumelhart and thePDP Research Group},
  volume = {2}
}

@INPROCEEDINGS{McCloskyChJo06,
  author = {D. McClosky and E. Charniak and M. Johnson},
  title = {Effective self-training for parsing},
  booktitle = HLT-NAACL,
  year = {2006}
}

@INPROCEEDINGS{McCluskeyWe98,
  author = {T. L. McCluskey and M. M. West},
  title = {A case study in the use of theory revision in requirements validation},
  booktitle = ICML,
  year = {1998},
  pages = {368--376},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INCOLLECTION{McCord90,
  author = {McCord, M. C.},
  title = {Slot Grammar: A System for Simpler Construction of Practical Natural
	Language Grammars},
  booktitle = {Natural Language and Logic: International Scientific Symposium},
  publisher = {Springer Verlag},
  year = {1990},
  editor = {R. Studer},
  series = {Lecture Notes in Computer Science},
  pages = {118--145},
  address = {Berlin}
}

@TECHREPORT{McCord91,
  author = {McCord, M. C.},
  title = {The Slot Grammar System},
  institution = {IBM Research Report},
  year = {1991},
  number = {RC 17313},
  note = { in J. Wedekind and C. Rohrer (Eds.), {\em Unification in Grammar},
	MIT Press}
}

@INPROCEEDINGS{McCreathSh98,
  author = {E. McCreath and A. Sharma},
  title = {{\sc LIME}: {A} System for Learning Relations},
  booktitle = ALT,
  year = {1998},
  volume = {1501},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {336--374},
  publisher = {Springer-Verlag}
}

@ARTICLE{McCune89,
  author = {William W. McCune and Lawrence J. Henschen},
  title = {Maintaining State Constraints in Relational Databases: A Proof Theoretic
	Basis},
  journal = jacm,
  year = {1989},
  volume = {36},
  pages = {46-68},
  number = {1},
  month = jan,
  keywords = {Database Theory; Reliability; Verification; automated theorem proving;
	dependency statement; first-order logic; integrity constraints; relational
	databases; }
}

@ARTICLE{McDermott87,
  author = {McDermott, D.},
  title = {A critique of pure reason},
  journal = {Computational Intelligence},
  year = {1987},
  volume = {3},
  pages = {151-237}
}

@ARTICLE{McDermott89,
  author = {John McDermott},
  title = {The World Would Be a Better Place if Non-Programmers Could Program},
  journal = {Machine Learning},
  year = {1989},
  volume = {4},
  pages = {337--338},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{MSGC97,
  author = {M.~McDonald and D.~Small and C.~Graves and D.~Cannon},
  title = {Virtual collaborative control to improve intelligent robotic system
	efficiency and quality},
  booktitle = {ICRA},
  year = {1997}
}

@INPROCEEDINGS{McDonald07,
  author = {McDonald, R.},
  title = {A Study of Global Inference Algorithms in Multi-Document Summarization},
  booktitle = ECIR,
  year = {2007}
}

@INPROCEEDINGS{McDonaldCrPe05,
  author = {McDonald, R. and Crammer, K. and Pereira, F.},
  title = {Online Large-Margin Training of Dependency Parsers},
  booktitle = ACL,
  year = {2005},
  pages = {91--98},
  address = {Ann Arbor, Michigan},
  timestamp = {2007.01.26},
  url = {http://www.aclweb.org/anthology/P/P05/P05-1012}
}

@INPROCEEDINGS{MHNWR07,
  author = {McDonald, Ryan and Hannan, Kerry and Neylon, Tyler and Wells, Mike
	and Reynar, Jeff},
  title = {Structured Models for Fine-to-Coarse Sentiment Analysis},
  booktitle = ACL,
  year = {2007},
  pages = {432--439},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1055}
}

@INPROCEEDINGS{McDonaldNi07,
  author = {McDonald, Ryan and Nivre, Joakim},
  title = {Characterizing the Errors of Data-Driven Dependency Parsing Models},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {122--131},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1013}
}

@ARTICLE{McEliecePoRoVe87,
  author = {McEliece, R. J. and E. C. Posner and E. R. Rodemich and S. S. Vekatesh},
  title = {The Capacity of the Hopfield Associative Memory},
  journal = {IEEE Transactions in Information Theory},
  year = {1987},
  volume = {IT-33},
  pages = {461--482}
}

@INPROCEEDINGS{McNeillVi07,
  author = {G. McNeill and S. Vijayakumar},
  title = {Linear and nonlinear generative probabilistic class models for shape
	contours},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {617--624},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@ARTICLE{McRoy92,
  author = {Susan W. McRoy},
  title = {Using multiple knowledge sources for word sense disambiguation},
  journal = CL,
  year = {1992},
  volume = {18},
  pages = {1--30},
  number = {1}
}

@INPROCEEDINGS{McAllesterSc00,
  author = {David Mc{A}llester and Robert E. Schapire},
  title = {On the Convergence Rate of Good-{T}uring Estimators},
  booktitle = COLT,
  year = {2000},
  pages = {1--6},
  publisher = {Morgan Kaufmann, San Francisco}
}

@INPROCEEDINGS{McCallumNi98a,
  author = {A. K. Mc{C}allum and K. Nigam},
  title = {A Comparison of Event Models for {N}aive {B}ayes Text Classification},
  booktitle = {AAAI Workshop on Learning for Text Categorization},
  year = {1998}
}

@INPROCEEDINGS{McCallum95,
  author = {R. Andrew Mc{C}allum},
  title = {Instance-based utile distinctions for reinforcement learning with
	hidden state},
  booktitle = ICML,
  year = {1995},
  pages = {387--395},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{MedinGoGe93,
  author = {D. Medin and R. Goldstone and D. Gentner},
  title = {Respects for Similarity},
  journal = {Psychological Review},
  year = {1993},
  pages = {254-278},
  url = {http://www.sciencedirect.com}
}

@INPROCEEDINGS{MedlockBr07,
  author = {Medlock, Ben and Briscoe, Ted},
  title = {Weakly Supervised Learning for Hedge Classification in Scientific
	Literature},
  booktitle = ACL,
  year = {2007},
  pages = {992--999},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1125}
}

@ARTICLE{Megiddo90,
  author = {N. Megiddo},
  title = {Geometric problems in unbounded dimension},
  journal = {J. Symb. Comput.},
  year = {1990},
  pages = {327--334}
}

@ARTICLE{Megiddo90a,
  author = {N.~Megiddo},
  title = {On the complexity of some geometric problems in unbounded dimension},
  journal = {J. Symb. Comput.},
  year = {1990},
  volume = {10},
  pages = {327--334}
}

@TECHREPORT{Megiddo86,
  author = {Megiddo, Nimrod},
  title = {On The Complexity of Polyhedral Separability},
  institution = {IBM Almaden Research Center},
  year = {1986},
  number = {RJ 5252},
  month = Aug
}

@ARTICLE{MegiddoTa82,
  author = {N. Megiddo and A. Tamir},
  title = {On the complexity of locating linear facilities in the plane},
  journal = {Oper. Res. Lett.},
  year = {1982},
  volume = {1},
  pages = {194--197},
  keywords = {VLSI design, NP-completeness, points, lines, two-dimensional}
}

@ARTICLE{MegiddoVi88,
  author = {Megiddo, Nimrod and Uzi Vishkin},
  title = {On Finding a Minimum Dominating Set in a Tournament},
  journal = {Theoretical Computer Science},
  year = {1988},
  volume = {61},
  pages = {307--316},
  number = {2-3},
  month = Nov,
  comment = {A problem that is equiv. to CNF with log**2 n variables}
}

@INPROCEEDINGS{MNCKM09,
  author = {Y. Mehdad and M. Negri and E. Cabrio and M. Kouylekov and B. Magnini},
  title = {EDITS: An Open Source Framework for Recognizing Textual Entailment},
  booktitle = TAC,
  year = {2009},
  pages = {169--178}
}

@INPROCEEDINGS{MehdadZaMo09,
  author = {Mehdad, Y. and Zanzotto, F. M. and Moschitti, A.},
  title = {SemKer: Syntactic/Semantic Kernels for Recognizing Textual Entailment},
  booktitle = TAC,
  year = {2009},
  pages = {259--265}
}

@BOOK{MehlhornN99,
  title = {{LEDA}: {A} platform for combinatorial and geometric computing},
  publisher = {Cambridge University Press},
  year = {1999},
  author = {K. Mehlhorn and S. N{\"a}her}
}

@ARTICLE{MehlhornN95,
  author = {K. Mehlhorn and S. N{\"a}her},
  title = {{LEDA}: a platform for combinatorial and geometric computing},
  journal = {Commun. ACM},
  year = {1995},
  volume = {38},
  pages = {96--102},
  url = {http://www.mpi-sb.mpg.de/guide/staff/uhrig/leda.html}
}

@INPROCEEDINGS{MehlhornShYa97,
  author = {K. Mehlhorn and T. C. Shermer and C. K. Yap},
  title = {A Complete Roundness Classification Procedure},
  booktitle = {SOCG},
  year = {1997},
  pages = {129--138},
  url = {ftp://cs.nyu.edu/pub/local/yap/metrology/classification.ps.gz}
}

@INCOLLECTION{MehlsamKaBa95,
  author = {G. Mehlsam and H. Kaindl and W. Barth},
  title = {Feature Construction during Tree Learning},
  booktitle = {Algorithmic Learning for Knowledge-Based Systems},
  publisher = {Springer--Verlag},
  year = {1995},
  volume = {961},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {391--403}
}

@INPROCEEDINGS{MehtaRa00,
  author = {Dinesh Mehta and Vijay Raghavan},
  title = {Decision Tree Approximations of {B}oolean Functions},
  booktitle = COLT,
  year = {2000},
  pages = {16--24},
  publisher = {Morgan Kaufmann, San Francisco}
}

@INPROCEEDINGS{MeiShZh07,
  author = {Mei, Q. and Shen, X. and Zhai, C.},
  title = {Automatic labeling of multinomial topic models},
  booktitle = KDD,
  year = {2007},
  pages = {490--499}
}

@ARTICLE{MeilaJo00,
  author = {M. Meila and M. I. Jordan},
  title = {Learning with Mixtures of Trees},
  journal = JMLR,
  year = {2000},
  volume = {1},
  pages = {1-48}
}

@ARTICLE{MeilaJo00a,
  author = {Marina Meila and Michael I. Jordan},
  title = {Learning with Mixtures of Trees},
  journal = {Journal of Machine Learning Research},
  year = {2000},
  volume = {1},
  pages = {1-48},
  bibsource = {DBLP, http://dblp.uni-trier.de},
  ee = {http://www.ai.mit.edu/projects/jmlr/papers/volume1/meila00a/abstract.html},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@INPROCEEDINGS{Meilu99,
  author = {Marina Meil{\u a}},
  title = {An accelerated {C}how and {L}iu algorithm: fitting tree distributions
	to high-dimensional sparse data},
  booktitle = ICML,
  year = {1999},
  pages = {249--257},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@ARTICLE{Meir00,
  author = {Ron Meir},
  title = {Nonparametric Time Series Prediction Through Adaptive Model Selection},
  journal = {Machine Learning},
  year = {2000},
  volume = {39},
  pages = {5--34},
  number = {1},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{Meir97,
  author = {Ron Meir},
  title = {Performance bounds for nonlinear time series prediction},
  booktitle = COLT,
  year = {1997},
  pages = {122--129},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{MeirElBe00,
  author = {Ron Meir and Ran El-{Y}aniv and Shai Ben-{D}avid},
  title = {Localized Boosting},
  booktitle = COLT,
  year = {2000},
  pages = {190--199},
  publisher = {Morgan Kaufmann, San Francisco}
}

@INPROCEEDINGS{MeirFo92,
  author = {R. Meir and J. F. Fontanari},
  title = {On learning noisy theshold functions with finite precision weights},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1992},
  pages = {280--286},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{MeirMe95,
  author = {Ronny Meir and Neri Merhav},
  title = {On the Stochastic Complexity of Learning Realizable and Unrealizable
	Rules},
  journal = {Machine Learning},
  year = {1995},
  volume = {19},
  pages = {241--261},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Meiser93,
  author = {S. Meiser},
  title = {Point location in arrangements of hyperplanes},
  journal = {Inform. Comput.},
  year = {1993},
  volume = {106},
  pages = {286--303}
}

@INPROCEEDINGS{MelideoVa98,
  author = {G. Melideo and S. Varricchio},
  title = {Learning Unary Output Two-Tape Automata from Multiplicity and Equivalence
	Queries},
  booktitle = ALT,
  year = {1998},
  volume = {1501},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {87--102},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Menczer97,
  author = {Filippo Menczer},
  title = {{ARACHNID}: Adaptive retrieval agents choosing heuristic neighborhoods
	for information discovery},
  booktitle = ICML,
  year = {1997},
  pages = {227--235},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{MenczerBe00,
  author = {Filippo Menczer and Richard K. Belew},
  title = {Adaptive Retrieval Agents: Internalizing Local Context and Scaling
	up to the Web},
  journal = {Machine Learning},
  year = {2000},
  volume = {39},
  pages = {203--242},
  number = {2/3},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{Mendelson02,
  author = {S. Mendelson},
  title = {A few notes on Statistical Learning Theory},
  booktitle = {Machine Learning Summer School, Cranberra},
  year = {2002},
  place = {Cranberra}
}

@INPROCEEDINGS{MendelsonTi00,
  author = {Shahar Mendelson and Naftali Tishby},
  title = {Statistical Sufficiency for Classes in Empirical ${L}_2$ Spaces},
  booktitle = COLT,
  year = {2000},
  pages = {81--89},
  publisher = {Morgan Kaufmann, San Francisco}
}

@INPROCEEDINGS{MLCT01,
  author = {Meng, H. and Lo, W. and Chen, B. and Tang, K.},
  title = {Generating Phonetic Cognates to Handle Named Entities in English-Chinese
	Cross-Langauge Spoken Document Retreival},
  booktitle = {Automatic Speech Recognition and Understanding Workshop},
  year = {2001},
  pages = {389--397}
}

@INPROCEEDINGS{MerhavFe92,
  author = {N. Merhav and M. Feder},
  title = {Universal sequential learning and decisions from individual data
	sequences},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1992},
  pages = {413--427},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{Merialdo94,
  author = {Bernard Merialdo},
  title = {Tagging Text With A Probabilistic Model},
  journal = CL,
  year = {1994},
  volume = {20},
  pages = {155--172},
  number = {2}
}

@INPROCEEDINGS{Merialdo91,
  author = {Bernard Merialdo},
  title = {Tagging Text With A Probabilistic Model},
  booktitle = {International Conference on Acoustics, Speech, and Signal Processing},
  year = {1991}
}

@INPROCEEDINGS{MerkleSt96,
  author = {Wolfgang Merkle and Frank Stephan},
  title = {Trees and learning},
  booktitle = COLT,
  year = {1996},
  pages = {270--279},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{Mertzbacher-chu93,
  author = {M. Mertzbacher and W. Chu},
  title = {Pattern-Based Clustering for Databases Attribute Values},
  booktitle = {Workshop on Knowledge Discovery in Databases},
  year = {1993}
}

@INPROCEEDINGS{MertzbacherCh93,
  author = {M. Mertzbacher and W. Chu},
  title = {Pattern-Based Clustering for Databases Attribute Values},
  booktitle = {Workshop on Knowledge Discovery in Databases},
  year = {1993}
}

@ARTICLE{Merz99,
  author = {Christopher J. Merz},
  title = {Using Correspondence Analysis to Combine Classifiers},
  journal = {Machine Learning},
  year = {1999},
  volume = {36},
  pages = {33--58},
  number = {1/2},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{MerzPa99,
  author = {Christopher J. Merz and Michael J. Pazzani},
  title = {A Principal Components Approach to Combining Regression Estimates},
  journal = {Machine Learning},
  year = {1999},
  volume = {36},
  pages = {9--32},
  number = {1/2},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{MBCMZ05,
  author = {D. Metzler and Y. Bernstein and W. B. Croft and A. Moffat and J.
	Zobel},
  title = {Similarity measures for tracking information flow},
  booktitle = CIKM,
  year = {2005},
  pages = {517--524}
}

@INPROCEEDINGS{SimInfoFlow,
  author = {Donald Metzler and Yaniv Bernstein and W. Bruce Croft and Alistair
	Moffat and Justin Zobel},
  title = {Similarity measures for tracking information flow},
  booktitle = CIKM,
  year = {2005},
  pages = {517--524}
}

@INPROCEEDINGS{MetzlerDuMe07,
  author = {D. Metzler and S. Dumais and C. Meek},
  title = {Similarity {M}easures for {S}hort {S}egments of {T}ext},
  booktitle = ECIR,
  year = {2007},
  pages = {16--27}
}

@INPROCEEDINGS{MetzlerMS,
  author = {Donald Metzler and Susan Dumais and Christopher Meek},
  title = {Similarity {M}easures for {S}hort {S}egments of {T}ext},
  booktitle = ECIR,
  year = {2007},
  pages = {16--27}
}

@ARTICLE{MeuleauBo99,
  author = {Nicolas Meuleau and Paul Bourgine},
  title = {Exploration of Multi-State Environments: {L}ocal Measures and Back-Propagation
	of Uncertainty},
  journal = {Machine Learning},
  year = {1999},
  volume = {35},
  pages = {117--154},
  number = {2},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Meyer72,
  author = {A. Meyer},
  title = {Program size in restricted programming languages},
  journal = {Inform. Control},
  year = {1972},
  volume = {21},
  pages = {382--394}
}

@INPROCEEDINGS{Meyer92,
  author = {I. Meyer and D. Skuce and L. Bowker and K. Ack},
  title = {Towards a new generation of terminological resources: an experiment
	in building a terminological knowledge base},
  booktitle = COLING,
  year = {1992},
  pages = {956--960}
}

@INPROCEEDINGS{MSBA92,
  author = {I. Meyer and D. Skuce and L. Bowker and K. Ack},
  title = {Towards a new generation of terminological resources: an experiment
	in building a terminological knowledge base},
  booktitle = COLING,
  year = {1992},
  pages = {956--960}
}

@INPROCEEDINGS{Meyer98,
  author = {L. Meyer},
  title = {Comparing the Power of Probabilistic Learning and Oracle Identification
	under Monotonicity Constraints},
  booktitle = ALT,
  year = {1998},
  volume = {1501},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {306--320},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Meyer98a,
  author = {L{\'e}a Meyer},
  title = {Aspects of complexity of conservative probabilistic learning},
  booktitle = COLT,
  year = {1998},
  pages = {72--78},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{Meyer97,
  author = {L{\'e}a Meyer},
  title = {Monotonic and dual-monotonic probabilistic language learning of indexed
	families with high probability},
  booktitle = EuroCOLT,
  year = {1997},
  volume = {1208},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {66--78},
  publisher = {Springer-Verlag}
}

@ARTICLE{Meyer97a,
  author = {L{\'e}a Meyer},
  title = {Probabilistic language learning under monotonicity constraint},
  journal = {Theoret. Comput. Sci.},
  year = {1997},
  volume = {185},
  pages = {81--128},
  number = {1},
  note = {Special issue for ALT '95}
}

@ARTICLE{Meyers92,
  author = {Gene Meyers},
  title = {A Four Russians Algorithm for Regular Expression Pattern Matching},
  journal = jacm,
  year = {1992},
  volume = {39},
  pages = {430-448},
  number = {2},
  month = apr,
  keywords = {String Processing; Algorithms; Theory; finite automaton; four russians
	paradigm; note listing; regular expression; }
}

@ARTICLE{Michalski80,
  author = {R. Michalski},
  title = {Pattern recognition as rule guided inductive inference},
  journal = {IEEE Trans. Pattern Anal. Mach. Intell.},
  year = {1980},
  volume = {PAMI-2},
  pages = {349--361}
}

@INBOOK{Michalski86,
  pages = {3--26},
  title = {Understanding the Nature of Learning: Issues and Research Directions},
  publisher = {Morgan Kaufmann},
  year = {1986},
  author = {R. M. Michalski},
  address = {Los Altos, CA},
  booktitle = {Machine Learning: An Artificial Intelligence Approach}
}

@ARTICLE{Michalski00,
  author = {Ryszard S. Michalski},
  title = {{LEARNABLE EVOLUTION MODEL}: Evolutionary Processes Guided by Machine
	Learning},
  journal = {Machine Learning},
  year = {2000},
  volume = {38},
  pages = {9--40},
  number = {1/2},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Michalski93,
  author = {Ryszard S. Michalski},
  title = {Inferential Theory of Learning as a Conceptual Basis for Multistrategy
	Learning},
  journal = {Machine Learning},
  year = {1993},
  volume = {11},
  pages = {111--151},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INCOLLECTION{Michalski86a,
  author = {R. S. Michalski},
  title = {A Theory and Methodology of Inductive Inference},
  booktitle = {Machine Learning Vol2},
  publisher = {Morgan Kaufman},
  year = {1986},
  pages = {215--244}
}

@BOOK{MichalskiCaMi83,
  title = {Machine Learning: An Artificial Intelligence Approach},
  publisher = {Tioga Publishing Co., Palo Alto, Calif.},
  year = {1983},
  author = {R. S. Michalski and J. G. Carbonell and T. Mitchell},
  comment = {This is volume I of the series.}
}

@INPROCEEDINGS{Michie83,
  author = {D. Michie},
  title = {Inductive Rule Generation in the Context of the Fifth Generation},
  booktitle = {International Workshop on Machine Learning},
  year = {1983},
  pages = {66--70},
  address = {Monticello, Illinois},
  month = jun
}

@ARTICLE{Miclet80,
  author = {L. Miclet},
  title = {Regular inference with a tail-clustering method},
  journal = {IEEE Trans. on Systems, Man, and Cybernetics},
  year = {1980},
  volume = {SMC-10},
  pages = {737--743}
}

@INBOOK{Miesbach95,
  chapter = {2},
  pages = {21--42},
  title = {High accuracy path tracking by neural linearization techniques},
  publisher = {MIT Press},
  year = {1995},
  author = {Stefan Miesbach},
  volume = {III: Selecting Good Models},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@INPROCEEDINGS{MihalceaBaWi07,
  author = {Mihalcea, Rada and Banea, Carmen and Wiebe, Janyce},
  title = {Learning Multilingual Subjective Language via Cross-Lingual Projections},
  booktitle = ACL,
  year = {2007},
  pages = {976--983},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1123}
}

@INPROCEEDINGS{MihalceaCe07,
  author = {Mihalcea, Rada and Ceylan, Hakan},
  title = {Explorations in Automatic Book Summarization},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {380--389},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1040}
}

@INPROCEEDINGS{MihalceaCoSt06,
  author = {R. Mihalcea and C. Corley and C. Strapparava},
  title = {Corpus-based and Knowledge-based Measures of Text Semantic Similarity},
  booktitle = AAAI,
  year = {2006},
  address = {Boston, USA},
  month = {July}
}

@INPROCEEDINGS{MihalceaCs07,
  author = {Mihalcea, R. and Csomai, A.},
  title = {Wikify!: linking documents to encyclopedic knowledge},
  booktitle = {CIKM},
  year = {2007},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@INPROCEEDINGS{MihalkovaMo07,
  author = {L. Mihalkova and R. Mooney},
  title = {Bottom-up learning of {Markov} logic network structure},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {625--632},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{MMRSOK05,
  author = {Brian Milch and Bhaskara Marthi and Stuart Russell and David Sontag
	and Daniel L. Ong and Andrey Kolobov},
  title = {{BLOG}: Probabilistic Models with Unknown Objects},
  booktitle = IJCAI,
  year = {2005},
  url = {http://www.cs.berkeley.edu/~russell/papers/ijcai05-blog.pdf}
}

@INPROCEEDINGS{MZKHK08,
  author = {B. Milch and L. S. Zettlemoyer and K. Kersting and M. Haimes and
	L. Kaelbling},
  title = {Lifted Probabilistic Inference with Counting Formulas},
  booktitle = AAAI,
  year = {2008},
  pages = {1062-1068}
}

@INPROCEEDINGS{MilenkovicDaLi92,
  author = {V. Milenkovic and K. Daniels and Z. Li},
  title = {Placement and {C}ompaction of {N}onconvex {P}olygons for {C}lothing
	{M}anufacture},
  booktitle = {Canadian Conference on Computational Geometry},
  year = {1992}
}

@INPROCEEDINGS{MilenkovicDaLi91,
  author = {V. Milenkovic and K. Daniels and Z. Li},
  title = {Automatic {M}arker {M}aking},
  booktitle = {Canadian Conference on Computational Geometry},
  year = {1991}
}

@ARTICLE{Miller56,
  author = {Miller, G.},
  title = {The magic number seven, plus or minus two: Some limits on our capacity
	for processing information},
  journal = {Psychology Review},
  year = {1956},
  volume = {63},
  pages = {81--97},
  comment = {The classic paper that says humans can hold 7 +/- 2 'chunks' in short
	term memory.}
}

@ARTICLE{MBFGM90,
  author = {G. Miller and R. Beckwith and C. Fellbaum and D. Gross and K.J. Miller},
  title = {Wordnet: An on-line lexical database},
  journal = {International Journal of Lexicography},
  year = {1990},
  volume = {3(4)},
  pages = {235-312}
}

@ARTICLE{MillerBeFeGrMi90,
  author = {G. Miller and R. Beckwith and C. Fellbaum and D. Gross and K.J. Miller},
  title = {Wordnet: An on-line lexical database},
  journal = {International Journal of Lexicography},
  year = {1990},
  volume = {3(4)},
  pages = {235-312}
}

@ARTICLE{MillerCh91,
  author = {G. Miller and W. Charles},
  title = {Contextual Correlates of Semantic Similairty},
  journal = {Language and Cognitive Process},
  year = {1991}
}

@ARTICLE{Miller86,
  author = {G. L. Miller},
  title = {{Finding small simple cycle separators for 2-connected planar graphs}},
  journal = {Journal of Computer and System Sciences},
  year = {1986},
  volume = {32},
  pages = {265--279},
  number = {3},
  month = {June}
}

@INPROCEEDINGS{MillerToVi07,
  author = {Miller, John and Torii, Manabu and Vijay-Shanker, K.},
  title = {Building Domain-Specific Taggers without Annotated (Domain) Data},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {1103--1111},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1118}
}

@INPROCEEDINGS{MRRSSSS01,
  author = {K. Miller and S. Ramaswami and P. Rousseeuw and T. Sellares and D.
	L. Souvaine and I. Streinu and A. Struyf},
  title = {Fast implementation of depth contours using topological sweep},
  booktitle = SODA,
  year = {2001},
  pages = {690-699},
  url = {http://citeseer.nj.nec.com/miller01fast.html}
}

@ARTICLE{Miller93,
  author = {L. Chris Miller},
  title = {Bableware for the desktop},
  journal = {BYTE},
  year = {1993},
  volume = {January},
  pages = {177--183}
}

@ARTICLE{MillierGlKr87,
  author = {W. Thomas Miller and Filson H. Glanz and L. Gordon Kraft},
  title = {Application of a General Learning Algorithm to the Controlof Robotic
	Manipulators},
  journal = {International Journal of Robotics Research},
  year = {1987},
  volume = {6},
  pages = {84--98},
  number = {2},
  month = {Summer},
  comment = {experimental study of CMAC variation}
}

@ARTICLE{Mill'anTo92,
  author = {Jos{\'{e}} Del R. Mill{\'{a}}n and Carme Torras},
  title = {A Reinforcement Connectionist Approach to Robot Path Finding in Non-Maze-Like
	Environments},
  journal = {Machine Learning},
  year = {1992},
  volume = {8},
  pages = {363--395},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{MilneWi08,
  author = {Milne, D. and Witten, I. H.},
  title = {Learning to link with wikipedia},
  booktitle = {CIKM},
  year = {2008},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@INPROCEEDINGS{Milosavljevi'cHaJu89,
  author = {A. Milosavljevi{'c} and D. Haussler and J. Jurka},
  title = {Informed parsimonious inference of prototypical genetic sequences},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1989},
  pages = {102--117},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{Milosavljevi'cJu93,
  author = {Aleksandar Milosavljevi{\'{c}} and Jerzy Jurka},
  title = {Discovery by Minimal Length Encoding: {A} Case Study in Molecular
	Evolution},
  journal = {Machine Learning},
  year = {1993},
  volume = {12},
  pages = {69--87},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Milosavljevi`c95,
  author = {Aleksandar Milosavljevi{\`{c}}},
  title = {Discovering Dependencies via Algorithmic Mutual Information: {A}
	Case Study in {DNA} Sequence Comparisons},
  journal = {Machine Learning},
  year = {1995},
  volume = {21},
  pages = {35--50},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{MiltrupSc98,
  author = {Matthias Miltrup and Georg Schnitger},
  title = {Neural networks and efficient associative memory},
  booktitle = COLT,
  year = {1998},
  pages = {235--246},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{MimnoLiMc07,
  author = {D. Mimno and W. Li and A. McCallum},
  title = {Mixtures of hierarchical topics with pachinko allocation},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {633--640},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@ARTICLE{Mingers89,
  author = {John Mingers},
  title = {An Empirical Comparison of Pruning Methods for Decision Tree Induction},
  journal = {Machine Learning},
  year = {1989},
  volume = {4},
  pages = {227--243},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Mingers89a,
  author = {John Mingers},
  title = {An Empirical Comparison of Selection Measures for Decision-Tree Induction},
  journal = {Machine Learning},
  year = {1989},
  volume = {3},
  pages = {319--342},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Minicozzi76,
  author = {E. Minicozzi},
  title = {Some natural properties of strong identification in inductive inference},
  journal = {Theoret. Comput. Sci.},
  year = {1976},
  volume = {2},
  pages = {345--360}
}

@INPROCEEDINGS{MinkovToSu07,
  author = {Minkov, Einat and Toutanova, Kristina and Suzuki, Hisami},
  title = {Generating Complex Morphology for Machine Translation},
  booktitle = ACL,
  year = {2007},
  pages = {128--135},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1017}
}

@INCOLLECTION{Minsky75,
  author = {Minsky, M.},
  title = {A framework for representing knowledge},
  booktitle = {The Psychology of Computer Vision},
  publisher = {McGraw-Hill},
  year = {1975},
  editor = {P. Winston}
}

@BOOK{Minsky85,
  title = {The Society of Mind},
  publisher = {Simon and Schuster Inc.},
  year = {1985},
  author = {Minsky, M.},
  address = {New York, NY}
}

@BOOK{Minsky68,
  title = {Semantic information processing},
  publisher = {MIT Press},
  year = {1968},
  author = {Minsky, M.},
  address = {Cambridge, MA}
}

@ARTICLE{Minsky61,
  author = {Marvin Minsky},
  title = {Steps toward {Artificial} {Intelligence}},
  journal = {Proceedings of the Institute of Radio Engineers},
  year = {1961},
  volume = {49},
  pages = {8--30},
  month = Jan,
  note = {(Reprinted in {\em Computers and Thought}, ed. by Feigenbaumand Feldman,
	(McGraw-Hill, 1963).)}
}

@BOOK{MinskyPa69,
  title = {Perceptrons: An Introduction to Computational Geometry},
  publisher = {The MIT Press},
  year = {1969},
  author = {Minsky, Marvin and Seymour Papert},
  comment = {Classic analysis of the capabilities of the perceptron.}
}

@ARTICLE{Minton91,
  author = {Steven Minton},
  title = {A Reply to Zito-Wolf's Book Review of Learning Search Control Knowledge:
	An Explanation-Based Approach},
  journal = {Machine Learning},
  year = {1991},
  volume = {6},
  pages = {205--206},
  publisher = {Kluwer Academic Publishers, Boston}
}

@BOOK{Minton88,
  title = {Learning search control knowledge: An explanation-based approach},
  publisher = {Kluwer academic pulishers},
  year = {1988},
  author = {S. Minton},
  address = {Boston, MA}
}

@INPROCEEDINGS{MBSJ09,
  author = {Mike Mintz and Steven Bills and Rion Snow and Daniel Jurafsky},
  title = {Distant supervision for relation extraction without labeled data},
  booktitle = {Proceedings of ACL-IJCNLP-09},
  year = {2009},
  pages = {1003--1011},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@ARTICLE{Mirkin99,
  author = {Boris Mirkin},
  title = {Concept Learning and Feature Selection Based on Square-Error Clustering},
  journal = {Machine Learning},
  year = {1999},
  volume = {35},
  pages = {25--39},
  number = {1},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{MirkinDaGe06,
  author = {S. Mirkin and I. Dagan and M. Geffet},
  title = {Integrating Pattern-Based and Distributional Similarity Methods for
	Lexical Entailment Acquisition},
  booktitle = COLING-ACL,
  year = {2006},
  pages = {579--586},
  address = {Sydney, Australia},
  month = {July},
  url = {http://www.aclweb.org/anthology/P/P06/P06-2075}
}

@ARTICLE{Mirtich96,
  author = {B. Mirtich},
  title = {Fast and Accurate Computation of Polyhedral Mass Properties},
  journal = {J. Graphics Tools},
  year = {1996},
  volume = {1},
  pages = {31--50},
  number = {2}
}

@INPROCEEDINGS{MishraObPi01,
  author = {N. Mishra and D. Oblinger and L. Pitt},
  title = {Sublinear Time Approximate Clustering},
  booktitle = SODA,
  year = {2001},
  pages = {439--447}
}

@INPROCEEDINGS{MishraPi97,
  author = {Nina Mishra and Leonard Pitt},
  title = {Generating all Maximal Independent Sets of Bounded-degree Hypergraphs},
  booktitle = COLT,
  year = {1997},
  pages = {211--217},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{MitaimKo98,
  author = {Sanya Mitaim and Bart Kosko},
  title = {Stochastic resonance with adaptive fuzzy systems},
  booktitle = ICML,
  year = {1998},
  pages = {377--385},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{MSSS99,
  author = {Andrew Mitchell and Tobias Scheffer and Arun Sharma and Frank Stephan},
  title = {The {VC}-Dimension of Subclasses of Pattern Languages},
  booktitle = ALT,
  year = {1999},
  volume = {1720},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {93--105},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Mitchell98,
  author = {Andrew R. Mitchell},
  title = {Learnability of a subclass of extended pattern languages},
  booktitle = COLT,
  year = {1998},
  pages = {64--71},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{MitchellMoPa87,
  author = {J. S.B. Mitchell and D. M. Mount and C. H. Papadimitriou},
  title = {{The discrete geodesic problem}},
  journal = SICOMP,
  year = {1987},
  volume = {16},
  pages = {647--668}
}

@ARTICLE{MitchellPa91,
  author = {J. S.B. Mitchell and C. H. Papadimitriou},
  title = {The weighted region problem: finding shortest paths through a weighted
	planar subdivision},
  journal = JACM,
  year = {1991},
  volume = {38},
  pages = {18--73},
  keywords = {weighted, path planning, geodesic distance, shortest paths, Voronoi
	diagrams, continuous Dijkstra}
}

@INCOLLECTION{Mitchell91,
  author = {J. S. B. Mitchell},
  title = {An algorithmic approach to some problems in terrain navigation},
  booktitle = {Autonomous Mobile Robots: Perception, Mapping, and Navigation},
  publisher = {IEEE Computer Society Press},
  year = {1991},
  editor = {S. Sitharama Iyengar and Alberto Elfes},
  pages = {408--427},
  address = {Los Alamitos, CA}
}

@ARTICLE{MitchellPa91a,
  author = {Joseph S. B. Mitchell and Christos H. Papadimitriou},
  title = {The Weighted Region Problem: Fidning Shortest Paths Through a Weighted
	Planar Subdivision},
  journal = jacm,
  year = {1991},
  volume = {38},
  pages = {18-73},
  number = {1},
  month = jan,
  keywords = {Computational Geometry; Algorithms; Theory; Dijkstra's algorithm;
	shortest paths; terrain navigation; Voronoi diagrams; weighted distance
	functions; }
}

@INPROCEEDINGS{Mitchell90,
  author = {Mitchell, T.},
  title = {Becoming Increasingly Reactive},
  year = {1990},
  journal = {Proceedings of AAAI-90}
}

@BOOK{Mitchell97,
  title = {Machine Learning},
  publisher = {WCB/McGraw-Hill},
  year = {1997},
  author = {Tom M. Mitchell},
  address = {Boston, Massachusetts}
}

@ARTICLE{Mitchell82,
  author = {T. M. Mitchell},
  title = {Generalization as search},
  journal = {Art. Int.},
  year = {1982},
  volume = {18},
  pages = {203--226}
}

@TECHREPORT{Mitchell80,
  author = {T. M. Mitchell},
  title = {The need for biases in learning generalizations},
  institution = {Rutgers University},
  year = {1980},
  number = {CBM-TR-117},
  address = {New Brunswick, NJ}
}

@INPROCEEDINGS{Mitchell77,
  author = {Mitchell, Thomas M.},
  title = {Version Spaces: A Candidate Elimination Approach to Rule Learning},
  booktitle = IJCAI,
  year = {1977},
  pages = {305--310},
  address = {Cambridge, Mass.},
  month = Aug,
  organization = {International Joint Committee for Artificial Intelligence}
}

@ARTICLE{MitchellKeKe86,
  author = {Tom M. Mitchell and Richard M. Keller and Smadar T. Kedar-Cabelli},
  title = {Explanation-Based Generalization: {A} Unifying View},
  journal = {Machine Learning},
  year = {1986},
  volume = {1},
  pages = {47--80},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{MitinaVe95,
  author = {Olga Mitina and Nikolai Vereshchagin},
  title = {How to use expert advice in the case when actual values of estimated
	events remain unknown},
  booktitle = COLT,
  year = {1995},
  pages = {91--97},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{Miyahara92,
  author = {T. Miyahara},
  title = {Analogical reasoning using elementary formal system with mismatch},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1992},
  pages = {224--230},
  publisher = {IOS Press}
}

@INPROCEEDINGS{Miyano93,
  author = {S. Miyano},
  title = {Learning theory toward genome informatics},
  booktitle = {International Workshop on Analogical and Inductive Inference and
	International Workshop on Algorithmic Learning Theory},
  year = {1993},
  volume = {744},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {19--36},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{MiyanoShSh92,
  author = {S. Miyano and A. Shinohara and T. Shinohara},
  title = {Which classes of elementary formal systems are polynomial-time learnable?},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1992},
  pages = {139--150},
  publisher = {IOS Press}
}

@INPROCEEDINGS{Mladeni'Gr99,
  author = {Dunja Mladeni{\' c} and Marko Grobelnik},
  title = {Feature selection for unbalanced class distribution and {N}aive {B}ayes},
  booktitle = ICML,
  year = {1999},
  pages = {258--267},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{MnihHi07,
  author = {A. Mnih and G. Hinton},
  title = {Three new graphical models for statistical language modelling},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {641--648},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{MofizurNu94,
  author = {C. R. Mofizur and M. Numao},
  title = {Constructive induction for recursive programs},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1994},
  pages = {161--175},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{MohamedMiNi98,
  author = {M. H. Mohamed and T. Minamoto and K. Niijima},
  title = {Convergence Rate of Minimization Learning for Neural Networks},
  booktitle = ECML,
  year = {1998},
  volume = {1398},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {412--417},
  publisher = {Springer-Verlag}
}

@PHDTHESIS{Mohammad08,
  author = {S. Mohammad},
  title = {Measuring Semantic Distance using Distributional Profiles of Concepts},
  school = {Computer Science Department, University of Toronto},
  year = {2008}
}

@INPROCEEDINGS{MGHZ07,
  author = {Mohammad, Saif and Gurevych, Iryna and Hirst, Graeme and Zesch, Torsten},
  title = {Cross-Lingual Distributional Profiles of Concepts for Measuring Semantic
	Distance},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {571--580},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1060}
}

@INPROCEEDINGS{MohlerMi09,
  author = {Mohler, M. and Mihalcea, R.},
  title = {Text-to-Text Semantic Similarity for Automatic Short Answer Grading},
  booktitle = EACL,
  year = {2009},
  url = {http://www.aclweb.org/anthology/E09-1065}
}

@INPROCEEDINGS{MohlerMi09a,
  author = {Mohler, Michael and Mihalcea, Rada},
  title = {Text-to-Text Semantic Similarity for Automatic Short Answer Grading},
  booktitle = {EACL},
  year = {2009},
  owner = {dxquang},
  timestamp = {2010.12.12},
  url = {http://www.aclweb.org/anthology/E09-1065}
}

@MASTERSTHESIS{Mohtashemi92,
  author = {Mojdeh Mohtashemi},
  title = {On Breaking A Huffman Code},
  school = {MIT EECS Department},
  year = {1992}
}

@INPROCEEDINGS{MCHM03,
  author = {D. Moldovan and C. Clark and S. Harabagiu and S.~Maiorano},
  title = {COGEX: A Logic Prover for Question Answering},
  booktitle = HLT-NAACL,
  year = {2003}
}

@INPROCEEDINGS{Moldovan:03,
  author = {D. Moldovan and C. Clark and S. Harabagiu and S.~Maiorano},
  title = {COGEX: A Logic Prover for Question Answering},
  booktitle = HLT-NAACL,
  year = {2003}
}

@INPROCEEDINGS{MoldovanNo02,
  author = {D. Moldovan and A. Novischi},
  title = {Lexical Chains for Question Answering},
  booktitle = COLING,
  year = {2002}
}

@INPROCEEDINGS{Mo02,
  author = {D. Moldovan and M. Pasca and S. Harabagiu and M. Surdeanu},
  title = {Performance Issues and Error Analysis in an Open-Domain Question
	Answering System},
  booktitle = ACL,
  year = {2002},
  pages = {33-40}
}

@INPROCEEDINGS{MPHS02,
  author = {D. Moldovan and M. Pasca and S. Harabagiu and M. Surdeanu},
  title = {Performance Issues and Error Analysis in an Open-Domain Question
	Answering System},
  booktitle = ACL,
  year = {2002},
  pages = {33-40}
}

@ARTICLE{Montana90,
  author = {David J. Montana},
  title = {Empirical Learning Using Rule Threshold Optimization for Detection
	of Events in Synthetic Images},
  journal = {Machine Learning},
  year = {1990},
  volume = {5},
  pages = {427--450},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Montanari74,
  author = {Montanari, U.},
  title = {Networks of Constraint: Fundamental properties and applications to
	picture processing},
  journal = {Inf. Sci.},
  year = {1974},
  volume = {7},
  pages = {95--132}
}

@INCOLLECTION{MontemagniVi98,
  author = {S. Montemagni and V. Pirelli},
  title = {Augmenting {W}ord{N}et-like Lexical Resources with Distributional
	Evidence. An Application-Oriented Perspective},
  booktitle = {Use of {W}ord{N}et in Natural Language Processing Systems: Proceedings
	of the Conference},
  publisher = {Association for Computational Linguistics},
  year = {1998},
  editor = {S. Harabagiu},
  pages = {87--93}
}

@INPROCEEDINGS{Moody89,
  author = {Moody, John},
  title = {Fast Learning in Multi-Resolution Hierarchies},
  booktitle = NIPS,
  year = {1989},
  editor = {David S. Touretzky},
  pages = {29--39},
  address = {San Mateo, California},
  publisher = {Morgan Kaufmann},
  comment = {CMAC algorithm at multiple resolutions}
}

@ARTICLE{MoodyDa89,
  author = {J. Moody and C. Darken},
  title = {Fast Learning in Networks of Locally-Tuned Processing Units},
  journal = {Neural Computation},
  year = {1989},
  volume = {1},
  pages = {281--294},
  number = {2}
}

@INPROCEEDINGS{MoonBa07,
  author = {Moon, Taesun and Baldridge, Jason},
  title = {Part-of-Speech Tagging for Middle {E}nglish through Alignment and
	Projection of Parallel Diachronic Texts},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {390--399},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1041}
}

@INPROCEEDINGS{Mooney97,
  author = {Raymond J. Mooney},
  title = {Inductive logic programming for natural language processing},
  booktitle = ILP,
  year = {1997},
  volume = {1314},
  series = {LNAI},
  pages = {3--24},
  address = {Berlin},
  month = aug # {~26--28},
  publisher = {Springer}
}

@ARTICLE{Mooney95,
  author = {Raymond J. Mooney},
  title = {Encouraging Experimental Results on Learning {CNF}},
  journal = {Machine Learning},
  year = {1995},
  volume = {19},
  pages = {79--92},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INBOOK{Mooney95a,
  chapter = {3},
  pages = {43--53},
  title = {A preliminary {PAC} analysis of theory revision},
  publisher = {MIT Press},
  year = {1995},
  author = {Raymond J. Mooney},
  volume = {III: Selecting Good Models},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@ARTICLE{Mooney93,
  author = {Raymond J. Mooney},
  title = {Induction Over the Unexplained: Using Overly-General Domain Theories
	to Aid Concept Learning},
  journal = {Machine Learning},
  year = {1993},
  volume = {10},
  pages = {79--110},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INCOLLECTION{MooneyCa96,
  author = {R. J. Mooney and M. E. Califf},
  title = {Learning the Past Tense of English Verbs Using Inductive Logic Programming},
  booktitle = {Connectionist, Statistical, and Symbolic Approaches to Learning for
	Natural Language Processing},
  publisher = {Springer},
  year = {1996},
  editor = {S. Wermter and E. Riloff and G. Scheler},
  pages = {370--384},
  address = {Berlin},
  url = {citeseer.nj.nec.com/article/mooney96learning.html}
}

@INPROCEEDINGS{Moore96,
  author = {Andrew W. Moore},
  title = {Reinforcement learning in factories: the auton project (abstract)},
  booktitle = ICML,
  year = {1996},
  pages = {556},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{MooreAt95,
  author = {Andrew W. Moore and Christopher G. Atkeson},
  title = {The Parti-game Algorithm for Variable Resolution Reinforcement Learning
	in Multidimensional State-spaces},
  journal = {Machine Learning},
  year = {1995},
  volume = {21},
  pages = {199--233},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{MooreAt93,
  author = {Andrew W. Moore and Christopher G. Atkeson},
  title = {Prioritized Sweeping: Reinforcement Learning With Less Data and Less
	Time},
  journal = {Machine Learning},
  year = {1993},
  volume = {13},
  pages = {103--130},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INBOOK{MooreHiJo95,
  chapter = {19},
  pages = {361--379},
  title = {An empirical investigation of brute force to choose features, smoothers
	and function approximators},
  publisher = {MIT Press},
  year = {1995},
  author = {Andrew W. Moore and Daniel J. Hill and Michael P. Johnson},
  volume = {III: Selecting Good Models},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@INPROCEEDINGS{MooreLe94,
  author = {Andrew W. Moore and Mary S. Lee},
  title = {Efficient algorithms for minimizing cross validation error},
  booktitle = ICML,
  year = {1994},
  pages = {190--198},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{MooreScDe97,
  author = {Andrew W. Moore and Jeff Schneider and Kan Deng},
  title = {Efficient locally weighted polynomial regression predictions},
  booktitle = ICML,
  year = {1997},
  pages = {236--244},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{MSBL98,
  author = {Andrew W. Moore and Jeff G. Schneider and Justin A. Boyan and Mary
	S. Lee},
  title = {{Q2}: memory-based active learning for optimizing noisy continuous
	functions},
  booktitle = ICML,
  year = {1998},
  pages = {386--394},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{Moore82,
  author = {Moore, R.},
  title = {The role of logic in knowledge representation andcommonsense reasoning},
  booktitle = AAAI,
  year = {1982},
  pages = {428--433}
}

@INCOLLECTION{Moore86,
  author = {R. C. Moore},
  title = {Problems in Logical Form},
  booktitle = {Natural Language Processing},
  publisher = {Kaufmann},
  year = {1986},
  editor = {B. J. Grosz and K. {Sparck Jones} and B. L. Webber},
  address-local = {Los Altos, CA},
  keywords = {ling, n-l-p}
}

@INCOLLECTION{Moore:86,
  author = {R. C. Moore},
  title = {Problems in Logical Form},
  booktitle = {Natural Language Processing},
  publisher = {Kaufmann},
  year = {1986},
  editor = {B. J. Grosz and K. {Sparck Jones} and B. L. Webber},
  address = {Los Altos, CA},
  keywords = {ling, n-l-p}
}

@ARTICLE{Morales97,
  author = {Eduardo F. Morales},
  title = {{PAL}: {A} Pattern and dash;Based First and dash;Order Inductive
	System},
  journal = {Machine Learning},
  year = {1997},
  volume = {26},
  pages = {227--252},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{MoriartyMi96,
  author = {David E. Moriarty and Risto Miikkulainen},
  title = {Efficient Reinforcement Learning through Symbiotic Evolution},
  journal = {Machine Learning},
  year = {1996},
  volume = {22},
  pages = {11--32},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{MoriartyMi95,
  author = {David E. Moriarty and Risto Miikkulainen},
  title = {Efficient learning from delayed rewards through symbolic evolution},
  booktitle = ICML,
  year = {1995},
  pages = {396--404},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{Morik99,
  author = {Katharina Morik},
  title = {Tailoring Representations to Different Requirements},
  booktitle = ALT,
  year = {1999},
  volume = {1720},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {1--12},
  publisher = {Springer-Verlag}
}

@ARTICLE{Morik93,
  author = {Katharina Morik},
  title = {Balanced Cooperative Modeling},
  journal = {Machine Learning},
  year = {1993},
  volume = {11},
  pages = {217--235},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{MorikBrJo99,
  author = {Katharina Morik and Peter Brockhausen and Thorsten Joachims},
  title = {Combining statistical learning with a knowledge-based approach -
	a case study in intensive care monitoring},
  booktitle = ICML,
  year = {1999},
  pages = {268--277},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{MDTK07,
  author = {Morin, Emmanuel and Daille, B\'eatrice and Takeuchi, Koichi and Kageura,
	Kyo},
  title = {Bilingual Terminology Mining - Using Brain, not brawn comparable
	corpora},
  booktitle = ACL,
  year = {2007},
  pages = {664--671},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1084}
}

@INPROCEEDINGS{MoritaHaOk99,
  author = {Nobuhiro Morita and Makoto Haraguchi and Yoshiaki Okubo},
  title = {A Method of Similarity-Driven Knowledge Revision for Type Specification},
  booktitle = ALT,
  year = {1999},
  volume = {1720},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {194--205},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{MoriyamaSa93,
  author = {T. Moriyama and M. Sato},
  title = {Properties of language classes with finite elasticity},
  booktitle = {International Workshop on Analogical and Inductive Inference and
	International Workshop on Algorithmic Learning Theory},
  year = {1993},
  volume = {744},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {187--196},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{MQBM07,
  author = {Moschitti, Alessandro and Quarteroni, Silvia and Basili, Roberto
	and Manandhar, Suresh},
  title = {Exploiting Syntactic and Shallow Semantic Kernels for Question Answer
	Classification},
  booktitle = ACL,
  year = {2007},
  pages = {776--783},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1098}
}

@INPROCEEDINGS{MoschittiZa07,
  author = {A. Moschitti and F. Zanzotto},
  title = {Fast and effective kernels for relational learning from texts},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {649--656},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{MosciRoVe07,
  author = {S. Mosci and L. Rosasco and A. Verri},
  title = {Dimensionality reduction and generalization},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {657--664},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@BOOK{Mosteller84,
  title = {Applied Bayesian and classical inference The case of The Federalist
	papers},
  publisher = {Springer-Verlag},
  year = {1984},
  author = {Frederick Mosteller and David Wallace},
  note = {2nd edition of {\em Inference and Disputed Authorship: The Federalist},
	Addison-Wesley, 1964}
}

@BOOK{Mosteller64,
  title = {Inference and Disputed Authorship: The Federalist},
  publisher = {Addison-Wesley},
  year = {1964},
  author = {Frederick Mosteller and David Wallace},
  place = {Reading, Massachusetts}
}

@BOOK{MostellerWa64a,
  title = {Inference and Disputed Authorship: The Federalist},
  publisher = {Addison-Wesley},
  year = {1964},
  author = {Frederick Mosteller and David Wallace},
  place = {Reading, Massachusetts}
}

@BOOK{MostellerWa64,
  title = {Applied Bayesian and Classical Inference: The Case of the Federalist
	Papers},
  publisher = {Springer Series in Statistics},
  year = {1964},
  author = {Mosteller, F. and Wallace, D. L.}
}

@UNPUBLISHED{Motoki92,
  author = {T. Motoki},
  title = {Inductive Inference From All Positive and Some Negative Data},
  note = {Unpublished},
  year = {1992}
}

@INPROCEEDINGS{MotokiShWr91,
  author = {T. Motoki and T. Shinohara and K. Wright},
  title = {The correct definition of finite elasticity: corrigendum to {I}dentification
	of unions},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1991},
  pages = {375},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@BOOK{MotwaniRa95,
  title = {Randomized Algorithms},
  publisher = {Cambridge University Press},
  year = {1995},
  author = {R. Motwani and P. Raghavan},
  address = {New York, NY},
  url = {http://us.cambridge.org/titles/catalogue.asp?isbn=0521474655}
}

@ARTICLE{Mount87,
  author = {D. M. Mount},
  title = {Storing the subdivision of a polyhedral surface},
  journal = DCG,
  year = {1987},
  volume = {2},
  pages = {153--174}
}

@INBOOK{MovellanMc94,
  chapter = {14},
  pages = {215--232},
  title = {Contrastive learning with graded random networks},
  publisher = {MIT Press},
  year = {1994},
  author = {Javier R. Movellan and James L. McClelland},
  volume = {II: Intersections Between Theory and Experiment},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@ARTICLE{MozerBa91,
  author = {Michael C. Mozer and Jonathan Bachrach},
  title = {{SLUG}: {A} Connectionist Architecture for Inferring the Structure
	of Finite-State Environments},
  journal = {Machine Learning},
  year = {1991},
  volume = {7},
  pages = {139--160},
  publisher = {Kluwer Academic Publishers, Boston}
}

@TECHREPORT{MozerBa89,
  author = {Mozer, Michael C. and Jonathan Bachrach},
  title = {Discovering the Structure of a Reactive Environment by Exploration},
  institution = {University of Colorado Department of Computer Science},
  year = {1989},
  month = Nov,
  note = {Report CU-CS-451-89}
}

@ARTICLE{MudeWa78,
  author = {A. Van der Mude and A. Walker},
  title = {On the inference of stochastic regular grammars},
  journal = {Inform. Control},
  year = {1978},
  volume = {38},
  pages = {310--329}
}

@INPROCEEDINGS{Muggleton95a,
  author = {Muggleton, S.},
  title = {Stochastic Logic Programs},
  booktitle = ILP,
  year = {1995},
  editor = {De Raedt, L.},
  pages = {29},
  publisher = {Department of Computer Science, Katholieke Universiteit Leuven},
  url = {citeseer.nj.nec.com/muggleton96stochastic.html}
}

@INCOLLECTION{Muggleton92,
  author = {S. Muggleton},
  title = {Inductive Logic Programming},
  booktitle = ILP,
  publisher = {Academic Press},
  year = {1992},
  editor = {S. Muggleton},
  pages = {1--27},
  comment = {QA76.63.I52 1992 In McKay}
}

@INPROCEEDINGS{Muggleton00,
  author = {S. Muggleton},
  title = {Learning Stochastic Logic Programs},
  booktitle = {AAAI - Workshop on Learning Statistical Models from Relational Data},
  year = {2000},
  url = {citeseer.nj.nec.com/muggleton00learning.html}
}

@ARTICLE{Muggleton95,
  author = {Muggleton, S.},
  title = {Inverse Entailment and {P}rogol},
  journal = {New Generation Computing, Special issue on Inductive Logic Programming},
  year = {1995},
  volume = {13},
  pages = {245-286},
  number = {3-4},
  publisher = {Ohmsha},
  url = {citeseer.nj.nec.com/muggleton95inverse.html}
}

@INPROCEEDINGS{Muggleton94,
  author = {S. Muggleton},
  title = {Bayesian inductive logic programming},
  booktitle = COLT,
  year = {1994},
  pages = {3--11},
  publisher = {ACM Press, New York, NY},
  annote = {Also in Proc. 11th Int. Conf. on ML, 1994}
}

@ARTICLE{Muggleton94a,
  author = {S. Muggleton},
  title = {Predicate invention and utilization},
  journal = {J. of Experimental and Theoret. Artif. Intell.},
  year = {1994},
  volume = {6},
  pages = {121--130},
  number = {1},
  note = {Special issue for AII '92}
}

@INPROCEEDINGS{Muggleton93,
  author = {S. Muggleton},
  title = {Optimal layered learning: a {PAC} approach to incremental sampling},
  booktitle = {International Workshop on Analogical and Inductive Inference and
	International Workshop on Algorithmic Learning Theory},
  year = {1993},
  volume = {744},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {37--44},
  publisher = {Springer-Verlag}
}

@ARTICLE{MuggletonDR94,
  author = {Muggleton, S. and De Raedt, L. },
  title = {Inductive Logic Programming: Theory and Methods},
  journal = {Journal of Logic Programming},
  year = {1994},
  volume = {20},
  pages = {629--679}
}

@MISC{Muggleton,
  author = {Stephen H. Muggleton},
  title = {Statistical Aspects of Logic-Based Machine Learning},
  url = {citeseer.nj.nec.com/375960.html}
}

@INPROCEEDINGS{MCBG07,
  author = {Mukherjee, Animesh and Choudhury, Monojit and Basu, Anupam and Ganguly,
	Niloy},
  title = {Redundancy Ratio: An Invariant Property of the Consonant Inventories
	of the World's Languages},
  booktitle = ACL,
  year = {2007},
  pages = {104--111},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1014}
}

@INPROCEEDINGS{Mukouchi97,
  author = {Yasuhito Mukouchi},
  title = {Inferring a system from examples with time passage},
  booktitle = ALT,
  year = {1997},
  volume = {1316},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {197--211},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Mukouchi94,
  author = {Y. Mukouchi},
  title = {Induction inference of an approximate concept from positive data},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1994},
  volume = {872},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {484--499},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Mukouchi93,
  author = {Y. Mukouchi},
  title = {Inductive inference with bounded mind changes},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1993},
  volume = {743},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {125--134},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Mukouchi92,
  author = {Y. Mukouchi},
  title = {Characterization of finite identification},
  booktitle = {International Workshop on Analogical and Inductive Inference},
  year = {1992},
  volume = {642},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {260--267}
}

@INPROCEEDINGS{Mukouchi92a,
  author = {Y. Mukouchi},
  title = {Characterization of pattern languages},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1992},
  pages = {93--104},
  publisher = {IOS Press}
}

@ARTICLE{MukouchiAr95,
  author = {Yasuhito Mukouchi and Setsuo Arikawa},
  title = {Towards a mathematical theory of machine discovery from facts},
  journal = {Theoret. Comput. Sci.},
  year = {1995},
  volume = {137},
  pages = {53--84},
  number = {1},
  note = {Special Issue for ALT '93}
}

@INPROCEEDINGS{MukouchiAr93,
  author = {Y. Mukouchi and S. Arikawa},
  title = {Inductive inference machines that can refute hypothesis spaces},
  booktitle = {International Workshop on Analogical and Inductive Inference and
	International Workshop on Algorithmic Learning Theory},
  year = {1993},
  volume = {744},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {123--136},
  publisher = {Springer-Verlag},
  annote = {Was Kyushu University TR RIFIS-TRCS-67}
}

@INPROCEEDINGS{MukouchiYaSa98,
  author = {Yasuhito Mukouchi and Ikuyo Yamue and Masako Sato},
  title = {Inferring a Rewriting System from Examples},
  booktitle = {International Conference on Discovery Science},
  year = {1998},
  volume = {1532},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {93--104},
  publisher = {Springer-Verlag}
}

@ARTICLE{Muller89,
  author = {John H. Muller and Jeremy Spinrad},
  title = {Incremental Modular Decomposition},
  journal = jacm,
  year = {1989},
  volume = {36},
  pages = {1-19},
  number = {1},
  month = jan,
  keywords = {Combinatorics and Graph Theory; Algorithms; Verification; modular
	decomposition; substitution decomposition; X-join; }
}

@BOOK{Mulmuley94,
  title = {Computational Geometry: An Introduction Through Randomized Algorithms},
  publisher = {Prentice Hall},
  year = {1994},
  author = {K. Mulmuley},
  address = {Englewood Cliffs, NJ},
  annote = {Graduate text}
}

@ARTICLE{Mulmuley94a,
  author = {K. Mulmuley},
  title = {An efficient algorithm for hidden surface removal, {II}},
  journal = {J. Comp. Sys. Sci.},
  year = {1994},
  volume = {49},
  pages = {427--453}
}

@ARTICLE{Mulmuley91,
  author = {Ketan Mulmuley},
  title = {A Fast Planar Partition Algorithm, {II}},
  journal = jacm,
  year = {1991},
  volume = {38},
  pages = {74-103},
  number = {1},
  month = jan,
  keywords = {Computational Geometry; Algorithms; Theory; computational complexity;
	computational geometry; hidden surface removal; randomized geometric
	algorithms; planar subdivision; }
}

@ARTICLE{Mulmuley91a,
  author = {K. Mulmuley},
  title = {On levels in arrangements and {Voronoi} diagrams},
  journal = DCG,
  year = {1991},
  volume = {6},
  pages = {307--338}
}

@ARTICLE{Mulmuley90,
  author = {K. Mulmuley},
  title = {A Fast Planar Partition Algorithm, {I}},
  journal = {J. Symbolic Comput.},
  year = {1990},
  volume = {10},
  pages = {253--280},
  number = {3-4}
}

@ARTICLE{Mulmuley89,
  author = {K. Mulmuley},
  title = {An efficient algorithm for hidden surface removal},
  journal = {Comput. Graph.},
  year = {1989},
  volume = {23},
  pages = {379--388},
  number = {3},
  month = {1989}
}

@INPROCEEDINGS{MunichPe99,
  author = {M. E. Munich and P. Perona},
  title = {Continuous Dynamic Time Warping for Translation-Invariant Curve Alignment
	with Applications to Signature Verification},
  booktitle = {ICCV},
  year = {1999},
  pages = {108--115}
}

@BOOK{Munkres75,
  title = {Topology: {A} first course},
  publisher = {Prentice Hall},
  year = {1975},
  author = {J. R. Munkres},
  address = {Englewood Cliffs, NJ}
}

@INPROCEEDINGS{Munos96,
  author = {R{\'e}mi Munos},
  title = {A convergent reinforcement learning algorithm in the continuous case:
	the finite-element reinforcement learning},
  booktitle = ICML,
  year = {1996},
  pages = {337--345},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{MurdockCr05,
  author = {V. Murdock and W. B. Croft},
  title = {A {T}ranslation {M}odel for {S}entence {R}etrieval},
  booktitle = HLT-EMNLP,
  year = {2005},
  pages = {684--691}
}

@INPROCEEDINGS{TranslationSenRetr,
  author = {Vanessa Murdock and W. Bruce Croft},
  title = {A {T}ranslation {M}odel for {S}entence {R}etrieval},
  booktitle = HLT-EMNLP,
  year = {2005},
  pages = {684--691}
}

@INPROCEEDINGS{MuresanRa07,
  author = {Muresan, Smaranda and Rambow, Owen},
  title = {Grammar Approximation by Representative Sublanguage: A New Model
	for Language Learning},
  booktitle = ACL,
  year = {2007},
  pages = {832--839},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1105}
}

@PHDTHESIS{Murphy02,
  author = {Kevin Patrick Murphy},
  title = {Dynamic {B}ayesian networks: representation, inference and learning},
  school = {University of Berkeley},
  year = {2002},
  note = {Chair-Stuart Russell},
  order_no = {AAI3082340}
}

@INPROCEEDINGS{MurphyWeJo99,
  author = {Kevin P. Murphy and Yair Weiss and Michael I. Jordan},
  title = {Loopy Belief Propagation for Approximate Inference: An Empirical
	Study},
  booktitle = UAI,
  year = {1999},
  pages = {467--475}
}

@INBOOK{MurphyPa97,
  chapter = {11},
  pages = {171--187},
  title = {Exploring the decision forest: an empirical investigation of {O}ccam's
	razor in decision tree induction},
  publisher = {MIT Press},
  year = {1997},
  author = {Patrick M. Murphy and Michael J. Pazzani},
  volume = {IV: Making Learning Systems Practical},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@INPROCEEDINGS{MurphyPa94,
  author = {Patrick M. Murphy and Michael J. Pazzani},
  title = {Revision of production system rule-bases},
  booktitle = ICML,
  year = {1994},
  pages = {199--207},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{MurthyKaSa94,
  author = {Murthy, S. and S. Kasif and S. Salzberg},
  title = {A System for Induction of Oblique Decision Trees},
  journal = {Journal of Artificial Intelligence Research },
  year = {1994},
  volume = {2:1},
  pages = {1--33}
}

@INPROCEEDINGS{Muselli95,
  author = {Marco Muselli},
  title = {Is the pocket algorithm optimal?},
  booktitle = EuroCOLT,
  year = {1995},
  pages = {287--297},
  publisher = {Springer-Verlag}
}

@ARTICLE{Musen89,
  author = {Mark A. Musen},
  title = {Automated Support for Building and Extending Expert Models},
  journal = {Machine Learning},
  year = {1989},
  volume = {4},
  pages = {347--375},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{MDWD07,
  author = {Mutton, Andrew and Dras, Mark and Wan, Stephen and Dale, Robert},
  title = {GLEU: Automatic Evaluation of Sentence-Level Fluency},
  booktitle = ACL,
  year = {2007},
  pages = {344--351},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1044}
}

@ARTICLE{Mycielski88,
  author = {J. Mycielski},
  title = {A Learning Algorithm for Linear Operators},
  journal = {Proc. of the {American Mathematical Society}},
  year = {1988},
  volume = {103},
  pages = {547--550},
  number = {2}
}

@INPROCEEDINGS{MSWK00,
  author = {K. Myers and S. Singh and M. Walker and M. Kearns},
  title = {A Boosting Approach to Topic Spotting on Subdialogues},
  booktitle = ICML,
  year = {2000}
}

@INPROCEEDINGS{MylonakisSiHw07,
  author = {M. Mylonakis and K. Sima'an and R. Hwa},
  title = {Unsupervised estimation for noisy-channel models},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {665--672},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@ARTICLE{Mate90,
  author = {Attila M{\'a}t{\'e}},
  title = {Nondeterministic Polynomial-Time Computations and Models of Arithmetic},
  journal = jacm,
  year = {1990},
  volume = {37},
  pages = {175-193},
  number = {1},
  month = jan,
  keywords = {Theory of Computation; Algorithms; Theory; Diophantine sets; nondeterministic
	Turing machine; nonstandard models of arithmetic; NP-complete; the
	P =? NP problem; }
}

@ARTICLE{Mantaras91,
  author = {R. L{\'{o}}pez De M{\'{a}}ntaras},
  title = {A Distance-Based Attribute Selection Measure for Decision Tree Induction},
  journal = {Machine Learning},
  year = {1991},
  volume = {6},
  pages = {81--92},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{MarquezPaRo00,
  author = {L. M{\`a}rquez and L. Padr{\'o} and H. Rodriguez},
  title = {A Machine Learning Approach to {POS} Tagging},
  journal = {Machine Learning},
  year = {2000},
  volume = {39},
  pages = {59--91},
  number = {1},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INCOLLECTION{ReekeFinSpoEde90,
  author = {Reeke G. N. and L. H. Finkel and O. Sporns and G. M. Edelman},
  title = {Synthetic Neural Modeling: A multilevel Approach to the Aalysis of
	Brain Complexity},
  booktitle = {Signal and Sense: Local and Global Order in Perceptual Maps},
  publisher = {Wiley-Liss},
  year = {1990},
  editor = {Edelman, M. Gerald and W. Einar Gall and W. Maxwell Cowan},
  comments = {p. 607--701; Contains and survey of the theory and some comparison
	to the traditional approach. Bibliography}
}

@ARTICLE{Nadathur90,
  author = {Gopalan Nadathur and Dale Miller},
  title = {Higher-Order Horn Clauses},
  journal = jacm,
  year = {1990},
  volume = {37},
  pages = {777-814},
  number = {4},
  month = oct,
  keywords = {Logic Programming; Languages; Theory; higher-order logic; higher-order
	unification; Horn clauses; Prolog; SLD-resolution; }
}

@ARTICLE{Naigles96,
  author = {L. R. Naigles},
  title = {The Use of multiple frames in verb learning via syntactic bootstrapping},
  journal = {Cognition},
  year = {1996},
  volume = {58},
  pages = {221-251}
}

@ARTICLE{Naigles90,
  author = {L. R. Naigles},
  title = {Children use syntax to learn verb meanings},
  journal = {Journal of Child Language},
  year = {1990},
  volume = {17},
  pages = {357-374}
}

@ARTICLE{NaiglesKa93,
  author = {L. R. Naigles and E. Kako},
  title = {First contact in verb acquisition: defining a role for syntax},
  journal = {Child Development},
  year = {1993},
  volume = {64},
  pages = {1665-1687}
}

@INPROCEEDINGS{NairnCoKa06,
  author = {Nairn, R. and Condoravdi, C. and Karttunen, L.},
  title = {Computing relative polarity for textual inference},
  booktitle = {Inference in Computational Semantics},
  year = {2006},
  month = {April}
}

@INPROCEEDINGS{Nakagawa07,
  author = {Nakagawa, Tetsuji},
  title = {Multilingual Dependency Parsing Using Global Features},
  booktitle = {CoNLL Shared Task Session of EMNLP-CoNLL},
  year = {2007},
  pages = {952--956},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1100}
}

@INPROCEEDINGS{NakajimaHa84,
  author = {M. Nakajima and K. Hayashi},
  title = {Automated {P}arts {L}ayout {P}lanning in {G}arment {I}ndustry {B}y
	{U}sing {G}roup {T}echnology},
  booktitle = {Computers in the {W}orld of {T}extiles},
  year = {1984},
  pages = {297-310},
  organization = {Textile Institute Annual World Conference}
}

@ARTICLE{Nakamura00,
  author = {Atsuyoshi Nakamura},
  title = {Query learning of bounded-width {OBDD}s},
  journal = {Theoret. Comput. Sci.},
  year = {2000},
  volume = {241},
  pages = {83--114},
  number = {1-2},
  note = {Special issue for ALT '96}
}

@INPROCEEDINGS{Nakamura99,
  author = {Atsuyoshi Nakamura},
  title = {Learning specialist decision lists},
  booktitle = COLT,
  year = {1999},
  pages = {215--225},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{Nakamura97,
  author = {Atsuyoshi Nakamura},
  title = {An efficient exact learning algorithm for ordered binary decision
	diagrams},
  booktitle = ALT,
  year = {1997},
  volume = {1316},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {307--322},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{NakamuraAb98,
  author = {Atsuyoshi Nakamura and Naoki Abe},
  title = {Collaborative filtering using weighted majority prediction algorithms},
  booktitle = ICML,
  year = {1998},
  pages = {395--403},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@ARTICLE{NakamuraAb95,
  author = {Atsuyoshi Nakamura and Naoki Abe},
  title = {Exact learning of linear combinations of monotone terms from function
	value queries},
  journal = {Theoret. Comput. Sci.},
  year = {1995},
  volume = {137},
  pages = {159--176},
  number = {1},
  note = {Special Issue for ALT '93}
}

@INPROCEEDINGS{NakamuraAb95a,
  author = {Atsuyoshi Nakamura and Naoki Abe},
  title = {On-line learning of binary and $n$-ary relations over multi-dimensional
	clusters},
  booktitle = COLT,
  year = {1995},
  pages = {214--221},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{NakamuraAb93,
  author = {A. Nakamura and N. Abe},
  title = {Exact learning of linear combinations of monotone terms from function
	value queries},
  booktitle = {International Workshop on Analogical and Inductive Inference and
	International Workshop on Algorithmic Learning Theory},
  year = {1993},
  pages = {300--313},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{NakamuraAbTa94,
  author = {A. Nakamura and N. Abe and J. Takeuchi},
  title = {Efficient distribution-free population learning of simple concepts},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1994},
  pages = {500--515},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{NakamuraMi95,
  author = {Atsuyoshi Nakamura and Shinji Miura},
  title = {Learning sparse linear combinations of basis functions over a finite
	domain},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1995},
  volume = {997},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {138--150},
  publisher = {Springer-Verlag}
}

@ARTICLE{NakamuraTaAb98,
  author = {Atsuyoshi Nakamura and Jun-ichi Takeuchi and Naoki Abe},
  title = {Efficient distribution-free population learning of simple concepts},
  journal = {Annals of Mathematics and Artificial Intelligence},
  year = {1998},
  volume = {23},
  pages = {53--82},
  number = {1/2},
  note = {Special issue for AII '94 and ALT '94}
}

@INPROCEEDINGS{Namatame92,
  author = {A. Namatame},
  title = {Knowledge-intensive learning in connectionist networks},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1992},
  pages = {35--46},
  publisher = {IOS Press}
}

@BOOK{NarendraTh89,
  title = {Learning Automata--An Introduction},
  publisher = {Prentice-Hall},
  year = {1989},
  author = {Kumpati S. Narendra and Mandayam A. L. Thathachar}
}

@ARTICLE{NarendraTh74,
  author = {Narendra, Kumpati S. and M. A. L. Thathachar},
  title = {Learning Automata -- A Survey},
  journal = {IEEE Transactions on Systems, Man, and Cybernetics},
  year = {1974},
  volume = {SMC-4},
  pages = {323--334},
  number = {4},
  comment = {Stochastic automata that adapt behavior under reinforcement schemes}
}

@ARTICLE{Natarajan99,
  author = {B. Natarajan},
  title = {On Learning Functions from Noise-Free and Noisy Samples via Occam's
	Razor},
  journal = {{SIAM} J. Comput.},
  year = {1999},
  volume = {29},
  pages = {712--727},
  number = {3}
}

@INPROCEEDINGS{Natarajan93,
  author = {B. K. Natarajan},
  title = {Occam's razor for functions},
  booktitle = COLT,
  year = {1993},
  pages = {370--376},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{Natarajan93a,
  author = {B. K. Natarajan},
  title = {A Reply to Hellerstein's Book Review of Machine Learning: {A} Theoretical
	Approach},
  journal = {Machine Learning},
  year = {1993},
  volume = {13},
  pages = {151--152},
  publisher = {Kluwer Academic Publishers, Boston}
}

@BOOK{Natarajan91,
  title = {Machine Learning: {A} Theoretical Approach},
  publisher = {Morgan Kaufmann},
  year = {1991},
  author = {B. K. Natarajan},
  address = {San Mateo, CA}
}

@ARTICLE{Natarajan91a,
  author = {B. K. Natarajan},
  title = {Probably Approximate Learning of Sets and Functions},
  journal = {SIAM J. Comput.},
  year = {1991},
  volume = {20},
  pages = {328--351},
  number = {2},
  month = apr
}

@INPROCEEDINGS{Natarajan89,
  author = {B. K. Natarajan},
  title = {On Learning From Excercises},
  booktitle = COLT,
  year = {1989},
  pages = {72--87},
  address = {Santa Cruz, Cal.\ },
  month = Aug
}

@ARTICLE{Natarajan89a,
  author = {B. K. Natarajan},
  title = {On Learning Sets and Functions},
  journal = {Machine Learning},
  year = {1989},
  volume = {4},
  pages = {67--97},
  publisher = {Kluwer Academic Publishers, Boston}
}

@TECHREPORT{Natarajan89b,
  author = {B. K. Natarajan},
  title = {Probably-Approximate Learning over Classes of Distributions},
  institution = {Hewlett Packard Labs, Palo Alto, CA},
  year = {1989},
  number = {HPL-SAL-89-29}
}

@TECHREPORT{Natarajan89c,
  author = {B. K. Natarajan},
  title = {Some Results on Learning},
  institution = {Carnegie Mellon},
  year = {1989},
  number = {CMU-RI-TR-89-6}
}

@INPROCEEDINGS{Natarajan87,
  author = {B. K. Natarajan},
  title = {On Learning Boolean Functions},
  booktitle = STOC,
  year = {1987},
  pages = {296--304},
  address = {New York, New York},
  month = May
}

@TECHREPORT{Natarajan87a,
  author = {B. K. Natarajan},
  title = {Learning Functions from Examples},
  institution = {Robotics Institute, Carnegie-Mellon University},
  year = {1987},
  number = {CMU-RI-TR-87-19}
}

@INPROCEEDINGS{NatarajanTa88,
  author = {B. K. Natarajan and P. Tadepalli},
  title = {Two New Frameworks for Learning},
  booktitle = ICML,
  year = {1988},
  pages = {402--415},
  address = {San Mateo, CA},
  month = jun,
  publisher = {published by Morgan Kaufmann}
}

@ARTICLE{Naughton89,
  author = {Jeffrey F. Naughton},
  title = {Minimizing Function-Free Recursive Inference Rules},
  journal = jacm,
  year = {1989},
  volume = {36},
  pages = {69-91},
  number = {1},
  month = jan,
  keywords = {Database Theory; Algorithms; Languages; Theory; Verification; deductive
	database; knowledge-base; optimization of recursion; }
}

@ARTICLE{NaBa97,
  author = {G. Navarro and R. Baeza-Yates},
  title = {Proximal Nodes: A Model to Query Document Databases by Content and
	Structure},
  journal = {ACM Transactions on Information Systems},
  year = {1997},
  volume = {15(4)},
  pages = {400--435}
}

@ARTICLE{NavarroBa97,
  author = {G. Navarro and R. Baeza-Yates},
  title = {Proximal Nodes: A Model to Query Document Databases by Content and
	Structure},
  journal = {ACM Transactions on Information Systems},
  year = {1997},
  volume = {15(4)},
  pages = {400--435}
}

@TECHREPORT{Neal92,
  author = {R. M. Neal},
  title = {Bayesian Training of Backpropagation Networks by the Hybrid Monte
	Carlo Method},
  institution = {Department of Computer Science, U. of Toronto},
  year = {1992},
  number = {CRG-TR-92-1},
  month = apr
}

@TECHREPORT{Neal90,
  author = {R. M. Neal},
  title = {Learning Stochastic Feedforward Networks},
  institution = {Department of Computer Science, University of Toronto},
  year = {1990},
  month = nov
}

@INCOLLECTION{NealHi98,
  author = {R. M. Neal and G. E. Hinton},
  title = {A new view of the {EM} algorithm that justifies incremental, sparse
	and other variants},
  booktitle = {Learning in Graphical Models},
  publisher = {Kluwer Academic Publishers},
  year = {1998},
  editor = {M. I. Jordan},
  pages = {355--368}
}

@ARTICLE{Nebel90,
  author = {Nebel, B.},
  title = {Terminological Reasoning is Inherently Intractable},
  journal = {Artificial Intelligence},
  year = {1990},
  volume = {43},
  pages = {325--249},
  number = {2}
}

@ARTICLE{Nebel88,
  author = {Nebel, B.},
  title = {Computational Complexity of Terminological Reasoning inBACK},
  journal = {Artificial Intelligence},
  year = {1988},
  volume = {34},
  pages = {371--383},
  number = {3}
}

@ARTICLE{Neiger93,
  author = {Gil Neiger and Sam Toueg},
  title = {Simulating Synchronized Clocks and Common Knowledge in Distributed
	Systems},
  journal = jacm,
  year = {1993},
  volume = {40},
  pages = {334-367},
  number = {2},
  month = apr,
  keywords = {Distributed Computing; Algorithms; Theory; Verification; clock synchronization;
	common knowledge; knowledge-based protocols; logical clocks; synchronized
	clocks; timestamped common knowledge; }
}

@INPROCEEDINGS{NelsonCo07,
  author = {B. Nelson and I. Cohen},
  title = {Revisiting probabilistic models for clustering with constraints},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {673--680},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INCOLLECTION{Nelson93,
  author = {Paul E. Nelson},
  title = {Site report for the {Text REtrieval Conference} by {ConQuest Software
	Inc.}},
  booktitle = TREC,
  publisher = {NIST SP 500-207},
  year = {1993},
  editor = {D. K. Harman},
  pages = {287--296}
}

@ARTICLE{NemirovskiRoTe99,
  author = {A.~Nemirovski and C.~Roos and T.~Terlaky},
  title = {On maximization of quadratic forms over intersection of ellipsoids
	with common center},
  journal = {Mathematical Programming},
  year = {1999},
  volume = {86},
  pages = {463--473},
  number = {3},
  series = {A}
}

@ARTICLE{Neri00,
  author = {Filippo Neri},
  title = {Multi Level Knowledge in Modeling Qualitative Physics Learning},
  journal = {Machine Learning},
  year = {2000},
  volume = {38},
  pages = {181--211},
  number = {1/2},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{Nessel99,
  author = {Jochen Nessel},
  title = {Learnability of Enumerable Classes of Recursive Functions from ``Typical''
	Examples},
  booktitle = ALT,
  year = {1999},
  volume = {1720},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {264--275},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Nessel98,
  author = {Jochen Nessel},
  title = {Birds can fly...},
  booktitle = COLT,
  year = {1998},
  pages = {56--63},
  publisher = {ACM Press, New York, NY}
}

@TECHREPORT{Nesterov98,
  author = {Y.~Nesterov},
  title = {Global quadratic optimization via conic relaxation},
  institution = {Catholic University of Louvaine, Belgium},
  year = {1998},
  key = {Working paper, CORE}
}

@ARTICLE{Nevins95a,
  author = {Arthur J. Nevins},
  title = {A Branch and Bound Incremental Conceptual Clusterer},
  journal = {Machine Learning},
  year = {1995},
  volume = {18},
  pages = {5--22},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{NPPSS02,
  author = {E. Nevo and J. Pach and R. Pinchasi and M. Sharir and S. Smorodinsky},
  title = {Lenses in arrangements of pseudo-circles and their applications},
  booktitle = {SOCG},
  year = {2002},
  pages = {123--132},
  url = {http://www.math.tau.ac.il/~shakhar/lenses.socg02.ps}
}

@ARTICLE{Newell81,
  author = {Newell, A.},
  title = {The knowledge level},
  journal = {The AI Magazine},
  year = {1981},
  volume = {1},
  pages = {1-20}
}

@INPROCEEDINGS{NewmanKaCa09,
  author = {D. Newman and S. Karimi and L. Cavedon},
  title = {External Evaluation of Topic Models},
  booktitle = {ADCS},
  year = {2009}
}

@INCOLLECTION{NewportGlGl77,
  author = {E. L. Newport and H. Gleitman and L. R. Gleitman},
  title = {Mother I'd rather do it myself: Some effects and non-effects of maternal
	speech style},
  booktitle = {Talking to children: Language input and acquisition},
  publisher = {Cambridge University Press},
  year = {1977},
  editor = {C. E. Snow and C. A. Ferguson},
  pages = {109-149},
  address = {New York}
}

@ARTICLE{Ney95,
  author = {Ney, Hermann},
  title = {On the Probabilistic Interpretation of Neural Network Classifiers
	and Discriminative Training Criteria},
  journal = {Transactions on Pattern Analysis and Machine Intelligence},
  year = {1995},
  volume = {17},
  pages = {107-119},
  number = {2}
}

@INPROCEEDINGS{NgJo02,
  author = {A. Ng and M. Jordan},
  title = {On discriminative vs. generative classifiers: A comparison of logistic
	regression and naive Bayes},
  booktitle = NIPS,
  year = {2002}
}

@INPROCEEDINGS{Ng98,
  author = {Andrew Y. Ng},
  title = {On feature selection: learning with exponentially many irrelevant
	features as training examples},
  booktitle = ICML,
  year = {1998},
  pages = {404--412},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{Ng97,
  author = {Andrew Y. Ng},
  title = {Preventing Overfitting of cross-validation data},
  booktitle = ICML,
  year = {1997},
  pages = {245--253},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{NgHaRu99,
  author = {Andrew Y. Ng and Daishi Harada and Stuart Russell},
  title = {Policy invariance under reward transformations: theory and application
	to reward shaping},
  booktitle = ICML,
  year = {1999},
  pages = {278--287},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{NgJo01,
  author = {A. Y. Ng and M. I. Jordan},
  title = {On Discriminative vs. Generative Classifiers: A comparison of logistic
	regression and naive Bayes},
  booktitle = NIPS,
  year = {2001},
  pages = {841-848}
}

@ARTICLE{NgSu92,
  author = {Ng, R. T. and Subrahmanian, V. S.},
  title = {Probabilistic Logic Programming},
  journal = {Information and Computation},
  year = {1992},
  volume = {101},
  pages = {150-201},
  number = {2},
  url = {citeseer.nj.nec.com/ng92probabilistic.html}
}

@INPROCEEDINGS{Ng07,
  author = {Ng, Vincent},
  title = {Semantic Class Induction and Coreference Resolution},
  booktitle = ACL,
  year = {2007},
  pages = {536--543},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1068}
}

@INPROCEEDINGS{NgoHa95,
  author = {L. Ngo and P. Haddawy},
  title = {Probabilistic Logic Programming and {Bayesian} Networks},
  booktitle = ASIAN,
  year = {1995},
  pages = {286-300},
  url = {citeseer.nj.nec.com/ngo95probabilistic.html}
}

@INPROCEEDINGS{NguyenShPh06,
  author = {Nguyen, L. and Shimazu, A. and Phan, X.},
  title = {Semantic Parsing with Structured SVM Ensemble Classification Models},
  booktitle = ACL,
  year = {2006},
  pages = {619--626},
  address = {Sydney, Australia},
  month = {July},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P06/P06-2080}
}

@INPROCEEDINGS{NSNP07,
  author = {Nguyen, Le-Minh and Shimazu, Akira and Nguyen, Phuong-Thai and Phan,
	Xuan-Hieu},
  title = {A Multilingual Dependency Analysis System Using Online Passive-Aggressive
	Learning},
  booktitle = {CoNLL Shared Task Session of EMNLP-CoNLL},
  year = {2007},
  pages = {1149--1155},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1126}
}

@INPROCEEDINGS{NguyenGu07,
  author = {N. Nguyen and Y. Guo},
  title = {Comparisons of sequence labeling algorithms and extensions},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {681--688},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{NiCaDu07,
  author = {K. Ni and L. Carin and D. Dunson},
  title = {Multi-Task learning for sequential data via {IHMMs} and the nested
	{Dirichlet} process},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {689--696},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{Niblett87,
  author = {Niblett, T.},
  title = {Constructing Decision Trees in Noisy Domains},
  booktitle = {Progress in Machine Learning--Proceedings of EWSL 87: 2nd European
	Working Session on Learning},
  year = {1987},
  editor = {Bratko, I. and N. Lavrac},
  pages = {67--78},
  address = {Bled, Yugoslavia},
  month = may
}

@ARTICLE{Nicol93,
  author = {David M. Nicol},
  title = {The Cost of Conservative Synchronization in Parallel Discrete Event
	Simulations},
  journal = jacm,
  year = {1993},
  volume = {40},
  pages = {304-333},
  number = {2},
  month = apr,
  keywords = {Computer System Modeling and Analysis; Algorithms; Performance; conservative
	synchronization; }
}

@INPROCEEDINGS{Niculescu-MizilCa05,
  author = {Alexandru Niculescu-Mizil and Rich Caruana},
  title = {Predicting good probabilities with supervised learning},
  booktitle = ICML,
  year = {2005},
  pages = {625--632},
  address = {New York, NY, USA},
  publisher = {ACM Press},
  doi = {http://doi.acm.org/10.1145/1102351.1102430},
  isbn = {1-59593-180-5},
  location = {Bonn, Germany}
}

@ARTICLE{NMTM00,
  author = {Kamal Nigam and Andrew Kachites Mccallum and Sebastian Thrun and
	Tom Mitchell},
  title = {Text Classification from Labeled and Unlabeled Documents using {EM}},
  journal = {Machine Learning},
  year = {2000},
  volume = {39},
  pages = {103--134},
  number = {2/3},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{Niijima93,
  author = {K. Niijima},
  title = {Domains of attraction in autoassociative memory networks for character
	pattern recognition},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1993},
  volume = {743},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {87--98},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{NUHA98,
  author = {K. Niijima and H. Uchida and E. Hirowatari and S. Arikawa},
  title = {Discovery of Differential Equations from Numerical Data},
  booktitle = {International Conference on Discovery Science},
  year = {1998},
  volume = {1532},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {364--374},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{NilssonNiHa07,
  author = {Nilsson, Jens and Nivre, Joakim and Hall, Johan},
  title = {Generalizing Tree Transformations for Inductive Dependency Parsing},
  booktitle = ACL,
  year = {2007},
  pages = {968--975},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1122}
}

@INPROCEEDINGS{NilssonShJo07,
  author = {J. Nilsson and F. Sha and M. Jordan},
  title = {Regression on manifolds using kernel dimension reduction},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {697--704},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@ARTICLE{Nilsson91,
  author = {Nilsson, N. J.},
  title = {Logic and Artificial Intelligence},
  journal = {Artificial Intelligence},
  year = {1991},
  volume = {47},
  pages = {31-56}
}

@BOOK{Nilsson90,
  title = {The Mathematical Foundations of Learning Machines},
  publisher = {Morgan Kaufmann},
  year = {1990},
  author = {Nils J. Nilsson},
  note = {(Republication of 1965 edition, with a new introduction by T.J. Sejnowski
	and H. White.)}
}

@ARTICLE{Nilsson86,
  author = {Nils J. Nilsson},
  title = {Probabilistic logic},
  journal = {Artificial Intelligence},
  year = {1986},
  volume = {28},
  pages = {71--88},
  number = {1},
  address = {Essex, UK},
  issn = {0004-3702},
  publisher = {Elsevier Science Publishers Ltd.}
}

@BOOK{Nilsson65,
  title = {Learning Machines},
  publisher = {McGraw-Hill},
  year = {1965},
  author = {N. J. Nilsson},
  address = {New York}
}

@ARTICLE{Nipkow90,
  author = {Tobias Nipkow},
  title = {Unification in Primal Algebras, Their Powers and Their Varieties},
  journal = jacm,
  year = {1990},
  volume = {37},
  pages = {742-776},
  number = {4},
  month = oct,
  keywords = {Logic; Algorithms; Theory; Verification; boolean algebra; boolean
	rings; equational reasoning; Post algebra; primal algebras; unification;}
}

@TECHREPORT{Nirenburg88,
  author = {Nirenburg, S. and I. Monarch and T. Kaufmann and I. Nirenburg and
	J. Carbonell},
  title = {Acquisition of Very Large Knowledge Bases: Methodology, Tools and
	Applications},
  institution = {Center for Machine Translation, Carnegie-Mellon},
  year = {1988},
  number = {CMU-CMT-88-108}
}

@TECHREPORT{NMKNC88,
  author = {Nirenburg, S. and I. Monarch and T. Kaufmann and I. Nirenburg and
	J. Carbonell},
  title = {Acquisition of Very Large Knowledge Bases: Methodology, Tools and
	Applications},
  institution = {Center for Machine Translation, Carnegie-Mellon},
  year = {1988},
  number = {CMU-CMT-88-108}
}

@INPROCEEDINGS{Nivre03,
  author = {J. Nivre},
  title = {An Efficient Algorithm for Projective Dependency Parsing},
  booktitle = IWPT,
  year = {2003},
  address = {Nancy, France},
  timestamp = {2007.01.26},
  xmonth = {23--25 April}
}

@INPROCEEDINGS{NHKMNRY07,
  author = {Nivre, Joakim and Hall, Johan and K\"ubler, Sandra and McDonald,
	Ryan and Nilsson, Jens and Riedel, Sebastian and Yuret, Deniz},
  title = {The {CoNLL} 2007 Shared Task on Dependency Parsing},
  booktitle = {CoNLL Shared Task Session of EMNLP-CoNLL},
  year = {2007},
  pages = {915--932},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1096}
}

@INPROCEEDINGS{NivreHaNi04,
  author = {J. Nivre and J. Hall and J. Nilsson},
  title = {Memory-Based Dependency Parsing},
  booktitle = CoNLL,
  year = {2004},
  pages = {49--56},
  timestamp = {2007.01.26}
}

@INPROCEEDINGS{NivreSc04,
  author = {J. Nivre and M. Scholz},
  title = {Deterministic Dependency Parsing of English Text},
  booktitle = COLING,
  year = {2004},
  pages = {64--70},
  timestamp = {2007.01.26}
}

@INPROCEEDINGS{Nix84,
  author = {R. Nix},
  title = {Editing by example},
  booktitle = {ACM Symposium on Principles of Programming Languages},
  year = {1984},
  pages = {186--195},
  publisher = {ACM Press}
}

@PHDTHESIS{Nix83,
  author = {R. Nix},
  title = {Editing {B}y {E}xample (Ph.{D} Thesis)},
  school = {Yale University},
  year = {1983},
  note = {Computer Science TR-280}
}

@INPROCEEDINGS{Niyogi95,
  author = {Partha Niyogi},
  title = {Free to choose: investigating the sample complexity of active learning
	of real valued functions},
  booktitle = ICML,
  year = {1995},
  pages = {405--412},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{Nobel91,
  author = {A. Nobel},
  title = {Evaluating the performance of a simple inductive procedure in the
	presence of overfitting error},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1991},
  pages = {267--274},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{Nock99,
  author = {Richard Nock},
  title = {Complexity in the Case Against Accuracy: {W}hen Building One Function-Free
	Horn Clause is as Hard as Any},
  booktitle = ALT,
  year = {1999},
  volume = {1720},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {182--193},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{NockGa95,
  author = {Richard Nock and Olivier Gascuel},
  title = {On learning decision committees},
  booktitle = ICML,
  year = {1995},
  pages = {413--420},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{NockJa98,
  author = {Richard Nock and Pascal Jappy},
  title = {On the power of decision lists},
  booktitle = ICML,
  year = {1998},
  pages = {413--420},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@ARTICLE{NordhausenLa93,
  author = {Bernd Nordhausen and Pat Langley},
  title = {An Integrated Framework for Empirical Discovery},
  journal = {Machine Learning},
  year = {1993},
  volume = {12},
  pages = {17--47},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Norvig89,
  author = {Norvig, P.},
  title = {Marker passing as a weak method for text inferencing},
  journal = {Cognitive Science},
  year = {1989},
  volume = {13},
  pages = {569--620},
  number = {4}
}

@INPROCEEDINGS{Norvig88,
  author = {Norvig, P.},
  title = {Multiple simultaneous interpretations of ambiguous sentences},
  booktitle = CogSci,
  year = {1988}
}

@INPROCEEDINGS{NorvigWi90,
  author = {Norvig, P., and R. Wilensky},
  title = {A critical Evaluation of Commensurable {A}bduction Models for Semantic
	interpretation},
  booktitle = COLING,
  year = {1990},
  number = {3},
  pages = {225--230}
}

@INPROCEEDINGS{Novikoff63,
  author = {A. Novikoff},
  title = {On convergence proofs for perceptrons},
  booktitle = {Symposium on the Mathematical Theory of Automata},
  year = {1963},
  volume = {12},
  pages = {615--622}
}

@ARTICLE{NtafosTs94,
  author = {S. C. Ntafos and M. Z. Tsoukalas},
  title = {Optimum Placement of Guards},
  journal = {Info. Sciences},
  year = {1994},
  volume = {76},
  pages = {141--150}
}

@BOOK{Nunberg90,
  title = {CSLI Lecture Notes 18: The Linguistics of Punctuation},
  publisher = {CSLI Publications, Stanford, CA},
  year = {1990},
  author = {G. Nunberg}
}

@ARTICLE{N'unez91,
  author = {Marlon N{\'{u}}{\~{n}}ez},
  title = {The Use of Background Knowledge in Decision Tree Induction},
  journal = {Machine Learning},
  year = {1991},
  volume = {6},
  pages = {231--250},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{O'Rorke89,
  author = {Paul O'Rorke},
  title = {{LT} Revisited: Explanation-Based Learning and the Logic of Principia
	Mathematica},
  journal = {Machine Learning},
  year = {1989},
  volume = {4},
  pages = {117--159},
  publisher = {Kluwer Academic Publishers, Boston}
}

@BOOK{O'Rourke94,
  title = {Computational Geometry in {C}},
  publisher = {Cambridge University Press},
  year = {1994},
  author = {J. O'Rourke},
  address = {Cambridge},
  annote = {Textbook}
}

@ARTICLE{O'Rourke85,
  author = {J. O'Rourke},
  title = {Finding minimal enclosing boxes},
  journal = {Internat. J. Comput. Inform. Sci.},
  year = {1985},
  volume = {14},
  pages = {183--199},
  keywords = {approximation, volume}
}

@INPROCEEDINGS{OatesCo96,
  author = {Tim Oates and Paul R. Cohen},
  title = {Searching for structure in multiple streams of data},
  booktitle = ICML,
  year = {1996},
  pages = {346--354},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{OatesJe97,
  author = {Tim Oates and David Jensen},
  title = {The effects of training set size on decision tree complexity},
  booktitle = ICML,
  year = {1997},
  pages = {254--262},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{Oblow92,
  author = {E. M. Oblow},
  title = {Implementing Valiant's Learnability Theory Using Random Sets},
  journal = {Machine Learning},
  year = {1992},
  volume = {8},
  pages = {45--73},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INBOOK{Obradovic97,
  chapter = {2},
  pages = {17--33},
  title = {Recurrent neural networks with continuous topology adaptation, {K}alman
	filter bsed training},
  publisher = {MIT Press},
  year = {1997},
  author = {Dragan Obradovic},
  volume = {IV: Making Learning Systems Practical},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@UNPUBLISHED{Ogden93,
  author = {William Ogden and Margarita Gonzales},
  title = { Norm -- A System for Translators},
  note = {Demonstration at ARPA Workshop on Human Language Technology},
  year = {1993}
}

@ARTICLE{Oja89,
  author = {E. Oja},
  title = {Neural networks, principle components, and subspaces},
  journal = {Internat. J. Neural Syst.},
  year = {1989},
  volume = {1},
  pages = {61--68},
  number = {1}
}

@INPROCEEDINGS{OITN92,
  author = {H. Okabe and H. Imaoka and T. Tomiha and H. Niwaya},
  title = {Three Dimensional Apparel CAD System},
  booktitle = {ACM SIGGRAPH},
  year = {1992},
  pages = {105-110}
}

@INPROCEEDINGS{OkamotoYu96,
  author = {Seishi Okamoto and Nobuhiro Yugami},
  title = {Theoretical analysis of the nearest neighbor classifier in noisy
	domains},
  booktitle = ICML,
  year = {1996},
  pages = {355--363},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{OkanoharaTs07,
  author = {Okanohara, Daisuke and Tsujii, Jun'ichi},
  title = {A discriminative language model with pseudo-negative samples},
  booktitle = ACL,
  year = {2007},
  pages = {73--80},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1010}
}

@ARTICLE{OkuboHa98,
  author = {Yoshiaki Okubo and Makoto Haraguchi},
  title = {Constructing predicate mappings for goal-dependent abstraction},
  journal = {Annals of Mathematics and Artificial Intelligence},
  year = {1998},
  volume = {23},
  pages = {169--197},
  number = {1/2},
  note = {Special issue for AII '94 and ALT '94}
}

@INPROCEEDINGS{OkuboHa93,
  author = {Y. Okubo and M. Haraguchi},
  title = {Planning with abstraction based on partial predicate mappings},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1993},
  volume = {743},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {183--194},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{OliveiraEd96,
  author = {Arlindo L. Oliveira and Stephen Edwards},
  title = {Limits of exact algorithms for inference of minimum size finite state
	machines},
  booktitle = ALT,
  year = {1996},
  volume = {1160},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {59--66},
  publisher = {Springer-Verlag}
}

@ARTICLE{OliveiraSa96,
  author = {Arlindo L. Oliveira and Alberto Sangiovanni-Vincentelli},
  title = {Using the Minimum Description Length Principle to Infer Reduced Ordered
	Decision Graphs},
  journal = {Machine Learning},
  year = {1996},
  volume = {25},
  pages = {23--50},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{OliveiraSa95,
  author = {Arlindo L. Oliveira and Alberto Sangiovanni-Vincentelli},
  title = {Inferring reduced ordered decision graphs of minimum decision length},
  booktitle = ICML,
  year = {1995},
  pages = {421--429},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{OliverBaWa96,
  author = {Jonathan J. Oliver and Rohan A. Baxter and Chris S. Wallace},
  title = {Unsupervised learning using {MML}},
  booktitle = ICML,
  year = {1996},
  pages = {364--372},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{OliverHa95,
  author = {Jonathan J. Oliver and David J. Hand},
  title = {On Pruning and averaging decision trees},
  booktitle = ICML,
  year = {1995},
  pages = {430--437},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{OlteanuMo05,
  author = {Olteanu,, Marian and Moldovan,, Dan},
  title = {PP-attachment disambiguation using large context},
  booktitle = HLT,
  year = {2005},
  pages = {273--280},
  address = {Morristown, NJ, USA},
  publisher = {Association for Computational Linguistics},
  doi = {http://dx.doi.org/10.3115/1220575.1220610},
  location = {Vancouver, British Columbia, Canada}
}

@ARTICLE{Omohundro87,
  author = {Omohundro, S.},
  title = {Efficient algorithms with neural networks behavior},
  journal = {Complex Systems},
  year = {1987},
  volume = {1},
  pages = {273--347}
}

@INCOLLECTION{OncinaGa92,
  author = {J. Oncina and P. Garcia},
  title = {Inferring regular languages in polynomial update time},
  booktitle = {Pattern Recognition and Image Analysis},
  publisher = {World Scientific, Singapore},
  year = {1992},
  editor = {N. P{\'e}rez de la Blanca and A. Sanfeliu and E. Vidal},
  volume = {1},
  series = {Series in Machine Perception and Artificial Intelligence},
  pages = {49--61}
}

@INPROCEEDINGS{Opitz97,
  author = {David W. Opitz},
  title = {The effective size of a neural network: {A} principal component approach},
  booktitle = ICML,
  year = {1997},
  pages = {263--271},
  publisher = {Morgan Kaufmann}
}

@INBOOK{OpitzSh95,
  chapter = {1},
  pages = {3--19},
  title = {Using heuristic search to expand knowledge-based neural networks},
  publisher = {MIT Press},
  year = {1995},
  author = {David W. Opitz and Jude W. Shavlik},
  volume = {III: Selecting Good Models},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@INPROCEEDINGS{OpitzSh94,
  author = {David W. Opitz and Jude W. Shavlik},
  title = {Using genetic search to refine knowledge-based neural networks},
  booktitle = ICML,
  year = {1994},
  pages = {208--216},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{OpperHa95,
  author = {Manfred Opper and David Haussler},
  title = {Bounds for Predictive Errors in the Statistical Mechanics of in Supervised
	Learning},
  journal = {Physical Review Letters},
  year = {1995},
  volume = {75},
  pages = {3772--3775},
  number = {20}
}

@INPROCEEDINGS{OpperHa95a,
  author = {Manfred Opper and David Haussler},
  title = {General Bounds for Predictive Errors in Supervised Learning},
  booktitle = {Workshop on the Theory of Neural Networks: The Statistical Mechanics
	Perspective},
  year = {1995},
  publisher = {World Scientific}
}

@INPROCEEDINGS{OpperHa91,
  author = {M. Opper and D. Haussler},
  title = {Calculation of the learning curve of {B}ayes optimal classification
	algorithm for learning a perceptron with noise},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1991},
  pages = {75--87},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{Orda90,
  author = {Ariel Orda and Raphael Rom},
  title = {Shortest-Path and Minimum-Delay Algorithms in Networks with Time-Dependent
	Edge-Length},
  journal = jacm,
  year = {1990},
  volume = {37},
  pages = {607-625},
  number = {3},
  month = jul,
  keywords = {Operations Research; Algorithms; network algorithms; shortest paths;
	functional complexity; time dependency; waiting times; }
}

@INPROCEEDINGS{OrdentlichCo96,
  author = {Erik Ordentlich and Thomas Cover},
  title = {On-line portfolio selection},
  booktitle = COLT,
  year = {1996},
  pages = {310--313},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{Orihara92,
  author = {R. Orihara},
  title = {Analogical reasoning as a form of hypothetical reasoning and justification-based
	knowledge acquisition},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1992},
  pages = {243--254},
  publisher = {IOS Press}
}

@INPROCEEDINGS{OrponenGr90,
  author = {P. Orponen and R. Greiner},
  title = {On the sample complexity of finding good search strategies},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1990},
  pages = {352--358},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{OsentoskiMa07,
  author = {S. Osentoski and S. Mahadevan},
  title = {Learning state-action basis functions for hierarchical {MDPs}},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {705--712},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@ARTICLE{Osherson85,
  author = {D. Osherson},
  title = {Computer Output},
  journal = {Cognition},
  year = {1985},
  volume = {20},
  pages = {261--264}
}

@INCOLLECTION{OshersonStWe86,
  author = {D. Osherson and M. Stob and S. Weinstein},
  title = {An Analysis of a Learning Paradigm},
  booktitle = {Language Learning and Concept Acquisition},
  publisher = {Ablex Publ. Co.},
  year = {1986}
}

@ARTICLE{OshersonStWe83,
  author = {D. Osherson and M. Stob and S. Weinstein},
  title = {Note on a Central Lemma of Learning Theory},
  journal = {J. of Math. Psych.},
  year = {1983},
  volume = {27},
  pages = {86--92}
}

@ARTICLE{OshersonStWe82,
  author = {D. Osherson and M. Stob and S. Weinstein},
  title = {Ideal learning machines},
  journal = {Cognitive Science},
  year = {1982},
  volume = {6},
  pages = {277--290}
}

@UNPUBLISHED{OshersonWe92,
  author = {D. Osherson and S. Weinstein},
  title = {On the Study of First Language Acquisition},
  note = {Manuscript},
  year = {1992}
}

@INCOLLECTION{OshersonWe84,
  author = {D. Osherson and S. Weinstein},
  title = {Models of Language Acquisition},
  booktitle = {The Biology of Learning},
  publisher = {Springer-Verlag},
  year = {1984},
  address = {Berlin, New York}
}

@INCOLLECTION{OshersonWe83,
  author = {D. Osherson and S. Weinstein},
  title = {Formal Learning Theory},
  booktitle = {Handbook of Cognitive Neurology},
  publisher = {Plenum Press},
  year = {1983},
  address = {New York}
}

@ARTICLE{OshersonWe82a,
  author = {D. Osherson and S. Weinstein},
  title = {A Note on Formal Learning Theory},
  journal = {Cognition},
  year = {1982},
  volume = {11},
  pages = {77--88}
}

@INBOOK{OshersonStWe94,
  chapter = {1},
  pages = {3--23},
  title = {Logic and Learning},
  publisher = {MIT Press},
  year = {1994},
  author = {Daniel N. Osherson and Michael Stob and Scott Weinstein},
  volume = {I: Constraints and Prospects},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@ARTICLE{OshersonStWe92,
  author = {Daniel N. Osherson and Michael Stob and Scott Weinstein},
  title = {A Universal Method of Scientific Inquiry},
  journal = {Machine Learning},
  year = {1992},
  volume = {9},
  pages = {261--271},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{OshersonStWe91,
  author = {Daniel N. Osherson and Michael Stob and Scott Weinstein},
  title = {A Universal Inductive Inference Machine},
  journal = {The Journal of Symbolic Logic},
  year = {1991},
  volume = {56},
  pages = {661--672},
  number = {2},
  month = jun
}

@INPROCEEDINGS{OshersonStWe90,
  author = {D. N. Osherson and M. Stob and S. Weinstein},
  title = {A mechanical method of successful scientific inquiry},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1990},
  pages = {187--201},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{OshersonStWe89,
  author = {D. N. Osherson and M. Stob and S. Weinstein},
  title = {On approximate truth},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1989},
  pages = {88--101},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{OshersonStWe88,
  author = {Osherson, Daniel N. and Michael Stob and Scott Weinstein},
  title = {Mathematical/Mechanical? Learners pay a price for {B}ayesianism},
  journal = {The Journal of Symbolic Logic},
  year = {1988},
  volume = {53},
  pages = {1245--1251},
  number = {4},
  tag = {??}
}

@ARTICLE{OshersonStWe88a,
  author = {Daniel N. Osherson and Michael Stob and Scott Weinstein},
  title = {Synthesising Inductive Expertise},
  journal = {Inform. Comput.},
  year = {1988},
  volume = {77},
  pages = {138--161},
  number = {2}
}

@ARTICLE{OshersonStWe86a,
  author = {Daniel N. Osherson and Michael Stob and Scott Weinstein},
  title = {Aggregating Inductive Expertise},
  journal = {Inform. Control},
  year = {1986},
  volume = {70},
  pages = {69--95},
  number = {1}
}

@ARTICLE{OshersonStWe84,
  author = {Osherson, Daniel N. and Michael Stob and Scott Weinstein},
  title = {Learning Theory and Natural Language},
  journal = {Cognition},
  year = {1984},
  volume = {17},
  pages = {1--28},
  comment = {Presents argument that number of natural languages is finite.},
  tag = {TOC-display}
}

@ARTICLE{OshersonStWe82a,
  author = {Daniel N. Osherson and Michael Stob and Scott Weinstein},
  title = {Learning Strategies},
  journal = {Inform. Control},
  year = {1982},
  volume = {53},
  pages = {32--51},
  number = {1/2}
}

@ARTICLE{OshersonWe86,
  author = {Osherson, Daniel N. and Scott Weinstein},
  title = {Identification in the Limit of First Order Structures},
  journal = {Journal of Philosophical Logic},
  year = {1986},
  volume = {15},
  pages = {55--81},
  tag = {TOC-display}
}

@ARTICLE{OshersonWe82,
  author = {Osherson, Daniel N. and Scot[222zt Weinstein},
  title = {Criteria of Language Learning},
  journal = InfCtrl,
  year = {1982},
  volume = {52},
  pages = {123--138},
  comment = {Studies relationship between intensional/extensional learning.},
  tag = {TOC-display}
}

@BOOK{OsteyeeGo74,
  title = {Information, Weight of Evidence, the Singularity between Probability
	Measures and Signal Detection},
  publisher = {Springer-Verlag},
  year = {1974},
  author = {Osteyee, David Bridston},
  number = {376},
  series = {Lecture Notes in Mathematics},
  comment = {Text.}
}

@INPROCEEDINGS{OstrovskyRa00,
  author = {R. Ostrovsky and Y. Rabani},
  title = {Polynomial time approximation schemes for geometric $k$-clustering},
  booktitle = FOCS,
  year = {2000},
  pages = {349--358},
  month = {Nov},
  publisher = {IEEE}
}

@INPROCEEDINGS{Otsuki93,
  author = {S. Otsuki},
  title = {Discovery learning in intelligent tutoring systems},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1993},
  volume = {743},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {3--12},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{OttSt99,
  author = {Matthias Ott and Frank Stephan},
  title = {Avoiding Coding Tricks by Hyperrobust Learning},
  booktitle = EuroCOLT,
  year = {1999},
  volume = {1572},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {183--197},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{OttSt97,
  author = {Matthias Ott and Frank Stephan},
  title = {Structural measures for games and process control in the branch learning
	model},
  booktitle = EuroCOLT,
  year = {1997},
  volume = {1208},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {94--108},
  publisher = {Springer-Verlag}
}

@ARTICLE{OttmannSoWo85,
  author = {T. Ottmann and E. Soisalon-Soininen and D. Wood},
  title = {On the definition and computation of rectilinear convex hulls},
  journal = {Inform. Sci.},
  year = {1985},
  volume = {33},
  pages = {157--171}
}

@ARTICLE{OvermarsLe81,
  author = {M. H. Overmars and J. van Leeuwen},
  title = {Maintenance of configurations in the plane},
  journal = {J. Comput. Syst. Sci.},
  year = {1981},
  volume = {23},
  pages = {166--204}
}

@BOOK{Owen82,
  title = {Game Theory},
  publisher = {Academic Press},
  year = {1982},
  author = {Owen, Guillermo}
}

@ARTICLE{Owens93,
  author = {Christopher Owens},
  title = {Integrating Feature Extraction and Memory Search},
  journal = {Machine Learning},
  year = {1993},
  volume = {10},
  pages = {311--339},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{Pacsca07,
  author = {Pa\c{s}ca, M.},
  title = {Organizing and Searching the World Wide Web of Facts — Step Two:
	Harnessing the Wisdom of the Crowds},
  booktitle = {WWW},
  year = {2007},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@INPROCEEDINGS{Pasca07,
  author = {Pa\c{s}ca, Marius},
  title = {Organizing and searching the world wide web of facts -- step two:
	harnessing the wisdom of the crowds},
  booktitle = WWW,
  year = {2007},
  pages = {101--110},
  address = {New York, NY, USA},
  publisher = {ACM Press},
  doi = {http://dx.doi.org/10.1145/1242572.1242587},
  isbn = {9781595936547},
  keywords = {query-log},
  url = {http://dx.doi.org/10.1145/1242572.1242587}
}

@INPROCEEDINGS{PacscaVa08,
  author = {Pa\c{s}ca, M. and Van Durme, B.},
  title = {Weakly-Supervised Acquisition of Open-Domain Classes and Class Attributes
	from Web Documents and Query Logs},
  booktitle = {ACL-HLT},
  year = {2008},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@INPROCEEDINGS{PascaVa08,
  author = {Pa\c{s}ca, Marius and Van Durme, Benjamin},
  title = {Weakly-Supervised Acquisition of Open-Domain Classes and Class Attributes
	from Web Documents and Query Logs},
  booktitle = {ACL-HLT},
  year = {2008},
  pages = {19--27},
  address = {Columbus, Ohio},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P08/P08-1003}
}

@BOOK{PachAg95,
  title = {Combinatorial Geometry},
  publisher = {John Wiley \& Sons},
  year = {1995},
  author = {J. Pach and P. K. Agarwal},
  address = {New York, NY},
  isbn = {0-471-58890-3},
  url = {http://www.addall.com/Browse/Detail/0471588903.html}
}

@UNPUBLISHED{PachPiSh02,
  author = {J.~Pach and R.~Pinchasi and M.~Sharir},
  title = {Almost planar topological graphs},
  note = {manuscript},
  year = {2002}
}

@ARTICLE{PachT03,
  author = {J. Pach and G. T{\' o}th},
  title = {Conflict free colorings},
  journal = DCG,
  year = {2003},
  note = {to appear (The Goodman-Pollack festschrift.)},
  address = {Berlin},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Pad'oPaEr07,
  author = {Pad\'o, Sebastian and Pad\'o, Ulrike and Erk, Katrin},
  title = {Flexible, Corpus-Based Modelling of Human Plausibility Judgements},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {400--409},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1042}
}

@INPROCEEDINGS{PGJM09,
  author = {Pado, S. and Galley, M. and Jurafsky, D. and Manning, C. D.},
  title = {Robust Machine Translation Evaluation with Entailment Features},
  booktitle = ACL,
  year = {2009},
  pages = {297--305},
  address = {Suntec, Singapore},
  month = {August},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P09/P09-1034}
}

@ARTICLE{PagalloHa90,
  author = {Giulia Pagallo and David Haussler},
  title = {Boolean Feature Discovery in Empirical Learning},
  journal = {Machine Learning},
  year = {1990},
  volume = {5},
  pages = {71--99},
  publisher = {Kluwer Academic Publishers, Boston}
}

@TECHREPORT{PagalloHa89,
  author = {G. Pagallo and D. Haussler},
  title = {A greedy method for learning $\mu$-{DNF} functions under the uniforn
	distribution},
  institution = {University of California at Santa Cruz, UCSC-CRL-89-12},
  year = {1989}
}

@INCOLLECTION{PageFr92,
  author = {Page, D. and Frisch, A.},
  title = {Generalization and Learnability: A study of Constrianed Atoms},
  booktitle = ILP,
  publisher = {Academic Press},
  year = {1992},
  editor = {Muggleton, S.}
}

@BOOK{Palay85,
  title = {Searching with Probabilities},
  publisher = {Pitman},
  year = {1985},
  author = {Palay, Andrew J.},
  comment = {Integration of probabilities into B* algorithm (Ph.D. thesis with
	Hans Berliner).}
}

@INPROCEEDINGS{PalhangSo99,
  author = {Maziar Palhang and Arcot Sowmya},
  title = {Learning discriminatory and descriptive rules by an inductive logic
	programming system},
  booktitle = ICML,
  year = {1999},
  pages = {288--297},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{PaliourasKaSp99,
  author = {G. Paliouras and V. Karkaletsis and C. D. Spyropoulos},
  title = {Learning Rules for Large Vocabulary Word Sense Disambiguation},
  booktitle = IJCAI,
  year = {1999},
  pages = {674--679}
}

@INPROCEEDINGS{PKS99,
  author = {G. Paliouras and V. Karkaletsis and C. D. Spyropoulos},
  title = {Learning Rules for Large Vocabulary Word Sense Disambiguation},
  booktitle = IJCAI,
  year = {1999},
  pages = {674--679}
}

@INPROCEEDINGS{PallottaSeAi07,
  author = {Pallotta, Vincenzo and Seretan, Violeta and Ailomaa, Marita},
  title = {User Requirements Analysis for Meeting Information Retrieval Based
	on Query Elicitation},
  booktitle = ACL,
  year = {2007},
  pages = {1008--1015},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1127}
}

@INPROCEEDINGS{PPBS07,
  author = {Palmer, Alexis and Ponvert, Elias and Baldridge, Jason and Smith,
	Carlota},
  title = {A Sequencing Model for Situation Entity Classification},
  booktitle = ACL,
  year = {2007},
  pages = {896--903},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1113}
}

@ARTICLE{PalmerGiKi05,
  author = {M. Palmer and D. Gildea and P. Kingsbury},
  title = {{The Proposition Bank: An Annotated Corpus of Semantic Roles}},
  journal = {{Computational Linguistics}},
  year = {2005},
  volume = {31},
  pages = {71--106},
  number = {1},
  month = {March},
  url = {http://dx.doi.org/10.1162/0891201053630264}
}

@INPROCEEDINGS{PandeyChAg07,
  author = {S. Pandey and D. Chakrabarti and D. Agarwal},
  title = {Multi-armed bandit problems with dependent arms},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {721--728},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@PHDTHESIS{Pantel03,
  author = {Patrick Andre Pantel},
  title = {Clustering by committee},
  school = {University of Alberta},
  year = {2003},
  note = {Adviser-Dekang Lin},
  description = {Clustering by committee},
  isbn = {0-612-82151-X},
  keywords = {clustering }
}

@PHDTHESIS{Pantel03a,
  author = {Patrick Andre Pantel},
  title = {Clustering by committee},
  year = {2003},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@INCOLLECTION{Pantel+01,
  author = {P. Pantel and D. Lin},
  title = {A Statistical Corpus-Based Term Extractor},
  booktitle = AI,
  publisher = {Springer Verlag},
  year = {2001},
  editor = {E. Stroulia and S. Matwin},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {36--46}
}

@INCOLLECTION{PantelLi01,
  author = {P. Pantel and D. Lin},
  title = {A Statistical Corpus-Based Term Extractor},
  booktitle = AI,
  publisher = {Springer Verlag},
  year = {2001},
  editor = {E. Stroulia and S. Matwin},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {36--46}
}

@INPROCEEDINGS{PantelLin02kdd,
  author = {P. Pantel and D. Lin},
  title = {Discovering Word Senses from Text},
  booktitle = SIGKDD,
  year = {2002}
}

@INPROCEEDINGS{PantelPe06,
  author = {P. Pantel and M. Pennacchiotti},
  title = {Espresso: Leveraging Generic Patterns for Automatically Harvesting
	Semantic Relations},
  booktitle = ACL,
  year = {2006},
  pages = {113--120}
}

@ARTICLE{PaoCa78,
  author = {Pao, T. W. and J. W. {Carr III}},
  title = {A solution of the syntactical induction-inference problem for regular
	languages},
  journal = {Computat. Lang.},
  year = {1978},
  volume = {3},
  pages = {53--64}
}

@ARTICLE{Papadimitriou85,
  author = {C. H. Papadimitriou},
  title = {An algorithm for shortest-path motion in three dimensions},
  journal = IPL,
  year = {1985},
  volume = {20},
  pages = {259--263},
  keywords = {motion planning, path planning, geodesic distance, shortest paths}
}

@ARTICLE{Papadimitriou81,
  author = {Papadimitriou, Christos H.},
  title = {Worst-Case and Probabilistic Analysis of a Geometric Location Problem},
  journal = {SIAM J. Computing},
  year = {1981},
  volume = {10},
  pages = {542--557},
  number = {3},
  month = Aug
}

@ARTICLE{Papadimitriou79,
  author = {C. H. Papadimitriou},
  title = {Efficient Search for Rationals},
  journal = {Info. Process. Lett.},
  year = {1979},
  volume = {8},
  pages = {1--4},
  number = {1}
}

@ARTICLE{Papadimitriou76,
  author = {Papadimitriou, Christos H.},
  title = {On the complexity of edge traversing},
  journal = {J. Assoc. Comp. Mach.},
  year = {1976},
  volume = {23},
  pages = {544--554}
}

@TECHREPORT{PapadimitriouTs85,
  author = {Papadimitriou, Christos H. and John N. Tsitsiklis},
  title = {The Complexity of Markov Decision Processes},
  institution = {MIT Laboratory for Information and Decision Sciences},
  year = {1985},
  number = {LIDS-P-1479},
  comment = {Ordinary versions are complete for P; partially observed are PSPACE-complete.}
}

@ARTICLE{PapadimitriouYa91a,
  author = {Papadimitriou, Christos H. and M. Yanakakis},
  title = {Shortest paths without a map},
  journal = {Theoretical Computer Science},
  year = {1991},
  volume = {84},
  pages = {127--150}
}

@ARTICLE{PapadimitriouYa96,
  author = {Christos H. Papadimitriou and Mihalis Yannakakis},
  title = {On Limited Nondeterminism and the Complexity of the {V-C} Dimension},
  journal = {J. Comput. Syst. Sci.},
  year = {1996},
  volume = {53},
  pages = {161--170},
  number = {2}
}

@ARTICLE{PapadimitriouYa91,
  author = {C. H. Papadimitriou and M. Yannakakis},
  title = {{Optimization, approximation, and complexity classes}},
  journal = {Journal of Computer and System Sciences},
  year = {1991},
  volume = {43},
  pages = {425--440}
}

@INPROCEEDINGS{PapadopoulouLe95,
  author = {E. Papadopoulou and D. T. Lee},
  title = {Efficient computation of the geodesic {Voronoi} diagram of points
	in a simple polygon},
  booktitle = ESA,
  year = {1995},
  volume = {979},
  series = {Lecture Notes Comput. Sci.},
  pages = {238--251},
  publisher = {Springer-Verlag},
  issn = {3-540-60313-1},
  site = {Corfu, Greece}
}

@INPROCEEDINGS{ParekhHo99,
  author = {Rajesh Parekh and Vasant Honavar},
  title = {Simple {DFA} are polynomially probably exactly learnable from simple
	examples},
  booktitle = ICML,
  year = {1999},
  pages = {298--306},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{ParekhHo97,
  author = {Rajesh Parekh and Vasant Honavar},
  title = {Learning {DFA} from simple examples},
  booktitle = ALT,
  year = {1997},
  volume = {1316},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {116--131},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{ParekhNiHo98,
  author = {Rajes Parekh and Corin Nichitiu and Vasant Honavar},
  title = {A polynomial time incremental algorithm for learning {DFA}},
  booktitle = {International Workshop on Algorithmic Learning},
  year = {1998},
  volume = {1433},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {37--49},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{ParkerFeTa07,
  author = {C. Parker and A. Fern and P. Tadepalli},
  title = {Learning for efficient retrieval of structured data with noisy queries},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {729--736},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{PPLL07,
  author = {R. Parr and C. Painter-Wakefield and L. Li and M. Littman},
  title = {Analyzing feature generation for value-function approximation},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {737--744},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@ARTICLE{ParsonsFoBu95,
  author = {Rebecca J. Parsons and Stephanie Forrest and Christian Burks},
  title = {Genetic Algorithms, Operators, and {DNA} Fragment Assembly},
  journal = {Machine Learning},
  year = {1995},
  volume = {21},
  pages = {11--33},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{PLBLJ06,
  author = {M. Pasca and D. Lin and J. Bigham and A. Lifchits and A. Jain},
  title = {Names and Similarities on the Web: Fact Extraction in the Fast Lane},
  booktitle = ACL,
  year = {2006},
  pages = {809-816}
}

@ARTICLE{PaskVF60,
  author = {Pask, Gordon and Heinz Von Foerster},
  title = {A predictive model for self organizing systems, Parts I and II},
  journal = {Cybernetica},
  year = {1960 and 1961},
  volume = {III and IV},
  pages = {258--300 and 20--55},
  comment = {n-person game theory. Learning automata.}
}

@INPROCEEDINGS{PasulaRu01,
  author = {Pasula, H. and Russell, S. J.},
  title = {Approximate inference for first-order probabilistic languages},
  booktitle = IJCAI,
  year = {2001},
  pages = {741-748}
}

@ARTICLE{Patel-Schneider89,
  author = {Patel-Schneider, P. F.},
  title = {A four-valued semantics for terminological logics},
  journal = {Artificial Intelligence},
  year = {1989},
  volume = {38},
  pages = {319--351},
  number = {3}
}

@ARTICLE{Patel-Schneider89a,
  author = {Patel-Schneider, P. F.},
  title = {Undecidability of Subsumption is NIKL},
  journal = {Artificial Intelligence},
  year = {1989},
  volume = {39},
  pages = {263--272},
  number = {2}
}

@INPROCEEDINGS{Patel-Schneider84,
  author = {Patel-Schneider, P. F.},
  title = {Small can be beautiful in knowledge representation},
  booktitle = {IEEE Workshop on Principles of Knowledge-Based Systems},
  year = {1984},
  pages = {559-565},
  publisher = {IEEE Computer Society}
}

@ARTICLE{Patel-Schneideretal90,
  author = {Patel-Schneider, P. F. et al},
  title = {Term subsumption languages in knowledge representation},
  journal = {AI Magazine},
  year = {1990},
  volume = {11},
  pages = {16--23}
}

@ARTICLE{Pattipati90,
  author = {K. R. Pattipati and M. M. Kostreva and J. L. Teele},
  title = {Approximate Mean Value Analysis Algorithms for Queuing Networks:
	Existence, Uniqueness, and Convergence Results},
  journal = jacm,
  year = {1990},
  volume = {37},
  pages = {643-673},
  number = {3},
  month = jul,
  keywords = {System Modeling and Analysis; Algorithms; Performance; closed product-form
	queuing networks; convex programming; mean value analysis; primal-dual
	methods; Schweitzer-Bard approximation; throughput bounds; }
}

@INPROCEEDINGS{PaturiRaRe89,
  author = {R. Paturi and S. Rajasekaran and J. Reif},
  title = {The light bulb problem},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1989},
  pages = {261--268},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{PaturiSa90,
  author = {R. Paturi and M. E. Saks},
  title = {On threshold circuits for parity},
  booktitle = FOCS,
  year = {1990},
  pages = {397--404},
  publisher = {IEEE Computer Society Press, Los Alamitos, CA}
}

@MASTERSTHESIS{Patwardhan03,
  author = {Patwardhan, S.},
  title = {{Incorporating Dictionary and Corpus Information into a Context Vector
	Measure of Semantic Relatedness}},
  school = {University of Minnesota, Duluth},
  year = {2003},
  month = {August},
  url = {http://www.cs.utah.edu/~sidd/papers/Patwardhan03.pdf}
}

@INPROCEEDINGS{PatwardhanRi07,
  author = {Patwardhan, Siddharth and Riloff, Ellen},
  title = {Effective Information Extraction with Semantic Affinity Patterns
	and Relevant Regions},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {717--727},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1075}
}

@BOOK{Pavlov28,
  title = {Lectures on Conditioned Reflexes},
  publisher = {International Publishers},
  year = {1928},
  author = {Pavlov, I. P.},
  address = {New York}
}

@ARTICLE{Pazzani96a,
  author = {Michael Pazzani},
  title = {Review of {\it Inductive Logic Programming: Techniques and Applications}
	by Nada Lavra\u{c}, Sa\u{s}o {D}\u{z}eroski},
  journal = {Machine Learning},
  year = {1996},
  volume = {23},
  pages = {103--108},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Pazzani93,
  author = {Michael Pazzani},
  title = {Learning Causal Patterns: Making a Transition from Data-Driven to
	Theory-Driven Learning},
  journal = {Machine Learning},
  year = {1993},
  volume = {11},
  pages = {173--194},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Pazzani93a,
  author = {Michael Pazzani},
  title = {A Reply to Cohen's Book Review of Creating a Memory of Causal Relationships},
  journal = {Machine Learning},
  year = {1993},
  volume = {10},
  pages = {185--190},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{PazzaniKi92,
  author = {Michael Pazzani and Dennis Kibler},
  title = {The Utility of Knowledge in Inductive Learning},
  journal = {Machine Learning},
  year = {1992},
  volume = {9},
  pages = {57--94},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{PMMAHB94,
  author = {Michael Pazzani and Christopher Merz and Patrick Murphy and Kamal
	Ali and Timothy Hume and Clifford Brunk},
  title = {Reducing misclassification costs},
  booktitle = ICML,
  year = {1994},
  pages = {217--225},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{PazzaniSa92,
  author = {Michael J. Pazzani and Wendy Sarrett},
  title = {A Framework for Average Case Analysis of Conjunctive Learning Algorithms},
  journal = {Machine Learning},
  year = {1992},
  volume = {9},
  pages = {349--372},
  publisher = {Kluwer Academic Publishers, Boston}
}

@BOOK{Pearl88,
  title = {Probabilistic reasoning in intelligent systems: networks of plausible
	inference},
  publisher = {Morgan Kaufmann, San Mateo (Calif.)},
  year = {1988},
  author = {Judea Pearl}
}

@BOOK{Pearl88a,
  title = {Probabilistic Reasoning in Intelligent Systems},
  publisher = {Morgan Kaufman},
  year = {1988},
  author = {Pearl, J. },
  address = {San Mateo},
  citeulike-article-id = {2335577},
  keywords = {bibtex-import},
  owner = {dxquang},
  posted-at = {2008-02-26 22:24:44},
  priority = {2},
  timestamp = {2010.12.12}
}

@ARTICLE{Pearl86,
  author = {Pearl, J.},
  title = {Fusion, Propagation, and Structuring in Belief Networks},
  journal = {Artificial Intelligence},
  year = {1986},
  volume = {29},
  pages = {241-288}
}

@TECHREPORT{Pearl85,
  author = {J. Pearl},
  title = {On Evidential Reasoning In {A} Hierarchy Of Hypothesis},
  institution = {UCLA Computer Science Department},
  year = {1985},
  number = {CSD-850032},
  month = sep
}

@TECHREPORT{Pearl85a,
  author = {J. Pearl},
  title = {Bayesian Networks: {A} Model of Self-Activated Memory for Evidential
	Reasoning},
  institution = {UCLA Computer Science Department},
  year = {1985},
  number = {CSD-850021, R-43},
  month = jun,
  comment = {Describes Bayesian networks and propagation in singly-connected networks.}
}

@TECHREPORT{Pearl85b,
  author = {Pearl, Judea},
  title = {How to do with Probabilities What People Say You Can't},
  institution = {UCLA Computer Science Department},
  year = {1985},
  number = {CSD-850031, R-49},
  month = Sep,
  comment = {Describes Bayesian networks and propagation of beliefs.}
}

@TECHREPORT{Pearl85c,
  author = {Pearl, Judea},
  title = {Bayes Decision Methods},
  institution = {UCLA Computer Science Department},
  year = {1985},
  number = {CSD-850023},
  month = Jun
}

@UNPUBLISHED{Pearl84,
  author = {Pearl, Judea},
  title = {Jeffrey's Rule and the Problem of Autonomous Inference Agents},
  note = {Class notes for 274A, Fall 1984},
  year = {1984},
  comment = {Stresses dangers of using posterior probabilities as new prior probabilities.}
}

@ARTICLE{Pearl79,
  author = {Pearl, Judea},
  title = {Capacity and Error Estimates for Boolean Classifiers with Limited
	Complexity},
  journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence},
  year = {1979},
  volume = {PAMI-1},
  pages = {350--355},
  number = {4},
  month = Oct,
  comment = {An extension of [Pe78].}
}

@ARTICLE{Pearl78,
  author = {Pearl, Judea},
  title = {On the Connection Between the Complexity and Credibility of Inferred
	Models},
  journal = {Journal of General Systems},
  year = {1978},
  volume = {4},
  pages = {255--264},
  comment = {Studies tradeoff between uniqueness and ambiguity in the selection
	of hypotheses. Introduces the use of the Vapnik-Chervonenkis dimension.}
}

@INPROCEEDINGS{PearlDe89,
  author = {J. Pearl and R. Dechter},
  title = {Learning structure from data: a survey},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1989},
  pages = {230--244},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{PearlPa86,
  author = {Pearl, Judea and Azaria Paz},
  title = {On the Logic of Representing Dependencies by Graphs},
  booktitle = {Canadian AI Conference},
  year = {1986},
  month = May,
  comment = {Defines and studies graphoids for representing dependencies}
}

@TECHREPORT{PearlPa85,
  author = {J. Pearl and A. Paz},
  title = {{GRAPHOIDS}: {A} Graph-Based Logic for Reasoning about Relevance
	Relations, or When would x tell you more about y if you already know
	z},
  institution = {UCLA Computer Science Department},
  year = {1985},
  month = dec,
  comment = {Axiomatic definition of graphoids.}
}

@TECHREPORT{PearlVe90,
  author = {Pearl, Judea and T.S. Verma},
  title = {A Formal Theory of Inductive Causation},
  institution = {UCLA Cognitive Systems Laboratory},
  year = {1990},
  number = {R-1555 (I)},
  month = Oct
}

@INPROCEEDINGS{PearsonSm96,
  author = {R. A. Pearson and E. K. T. Smith},
  title = {Reducing complexity of decision trees with two variable tests},
  booktitle = ALT,
  year = {1996},
  volume = {1160},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {91--99},
  publisher = {Springer-Verlag}
}

@ARTICLE{Pedersen99,
  author = {Pedersen, A.G. and P Baldi, P. and Chauvin, Y. and Brunak, S.},
  title = {The Biology of Eukaryotic Promoter Prediction - a review},
  journal = {Computers and Chemistry},
  year = {1999},
  pages = {191--207}
}

@INPROCEEDINGS{PedersenPaMi04,
  author = {Pedersen, T. and Patwardhan, S. and Michelizzi, J.},
  title = {WordNet::Similarity - Measuring the Relatedness of Concepts},
  booktitle = {HLT-NAACL Demonstration Papers},
  year = {2004},
  editor = {Susan Dumais, Daniel Marcu and Salim Roukos},
  pages = {38--41}
}

@INPROCEEDINGS{PedersenWNSim,
  author = {Ted Pedersen and Siddharth Patwardhan and Jason Michelizzi},
  title = {WordNet::{S}imilarity - {M}easuring the {R}elatedness of {C}oncepts},
  booktitle = NAACL,
  year = {2004},
  pages = {38--41}
}

@ARTICLE{PeeblesSi90,
  author = {P. J. E. Peebles and Joseph Silk},
  title = {A cosmic book of phenonmena},
  journal = {Nature},
  year = {1990},
  volume = {346},
  pages = {233--239},
  month = Jul,
  comment = {Careful comparison of various theories about the universewith a variety
	of experimental data.Date is July 19, 1990.}
}

@ARTICLE{Peleg89,
  author = {David Peleg and Eli Upfal},
  title = {A Trade-Off between Space and Efficiency for Routing Tables},
  journal = jacm,
  year = {1989},
  volume = {36},
  pages = {510-530},
  number = {3},
  month = jul,
  keywords = {Computer Systems; Algorithms; Design; Performance; Theory; Verification;
	hierarchical routing; lower bound; random graphs; routing schemes;
	routing tables; stretch factor; }
}

@INPROCEEDINGS{PendrithMc98,
  author = {Mark D. Pendrith and Michael J. McGarity},
  title = {An analysis of direct reinforcement learning in non-{M}arkovian domains},
  booktitle = ICML,
  year = {1998},
  pages = {421--429},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{PendrithRy96,
  author = {Mark D. Pendrith and Malcolm R. K. Ryan},
  title = {Actual return reinforcement learning versus temporal differences:
	some theoretical and experimental results},
  booktitle = ICML,
  year = {1996},
  pages = {373--381},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{PengMc06,
  author = {F. Peng and A. McCallum},
  title = {Information extraction from research papers using conditional random
	fields},
  journal = {Inf. Process. Manage.},
  year = {2006},
  volume = {42},
  pages = {963--979},
  number = {4}
}

@INPROCEEDINGS{Peng95,
  author = {Jing Peng},
  title = {Efficient memory-based dynamic programming},
  booktitle = ICML,
  year = {1995},
  pages = {438--446},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{PengWi96,
  author = {Jing Peng and Ronald J. Williams},
  title = {Incremental Multi-Step {Q}-Learning},
  journal = {Machine Learning},
  year = {1996},
  volume = {22},
  pages = {283--290},
  annote = {Earlier version in ML94},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{Pereira93a,
  author = {Fernando Pereira},
  title = {Distributional clustering of english words},
  booktitle = {ACL},
  year = {1993},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@INPROCEEDINGS{Pereira92b,
  author = {Fernando Pereira and Yves Schabes},
  title = {Inside-outside reestimation from partially bracketed corpora},
  booktitle = ACL,
  year = {1992}
}

@INPROCEEDINGS{PereiraSc92,
  author = {Fernando Pereira and Yves Schabes},
  title = {Inside-outside reestimation from partially bracketed corpora},
  booktitle = ACL,
  year = {1992}
}

@BOOK{PereiraSh87,
  title = {Prolog and natural-language analysis},
  publisher = {Stanford : Center for the Study of Language and Information},
  year = {1987},
  author = {Pereira, F. and Shieber, S.}
}

@INPROCEEDINGS{Pereira92,
  author = {Fernando Pereira and Naftali Tishby},
  title = {Distributional Similarity, Phase Transitions and Hierarchical Clustering},
  booktitle = {Working Notes, AAAI Fall Symposium on Probabilistic Approaches to
	Natural Language},
  year = {1992},
  pages = {108--112}
}

@INPROCEEDINGS{PereiraTi92,
  author = {Fernando Pereira and Naftali Tishby},
  title = {Distributional Similarity, Phase Transitions and Hierarchical Clustering},
  booktitle = {Working Notes, AAAI Fall Symposium on Probabilistic Approaches to
	Natural Language},
  year = {1992},
  pages = {108--112}
}

@INPROCEEDINGS{Pereira93,
  author = {Fernando Pereira and Naftali Tishby and Lillian Lee},
  title = {Distributional clustering of {English} words},
  booktitle = ACL,
  year = {1993},
  pages = {183--190}
}

@INPROCEEDINGS{PereiraTiLe93,
  author = {Fernando Pereira and Naftali Tishby and Lillian Lee},
  title = {Distributional clustering of {English} words},
  booktitle = ACL,
  year = {1993},
  pages = {183--190}
}

@INPROCEEDINGS{Pereira94,
  author = {F. C. N. Pereira},
  title = {Frequencies vs. biases: machine learning problems in natural language
	processing -- abstract},
  booktitle = COLT,
  year = {1994},
  pages = {12},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{PereiraSi99,
  author = {Fernando C. N. Pereira and Yoram Singer},
  title = {An Efficient Extension to Mixture Techniques for Prediction and Decision
	Trees},
  journal = {Machine Learning},
  year = {1999},
  volume = {36},
  pages = {183--199},
  number = {3},
  comment = {first in 10th COLT '97},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{Pereira94a,
  author = {C. N. {Pereira, Fernando}},
  title = {Frequencies vs biases: machine learning problems in natural language
	processing - abstract},
  booktitle = ICML,
  year = {1994},
  pages = {380},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{PerroneBl95,
  author = {Michael P. Perrone and Brian S. Blais},
  title = {Regression {NSS}: an alternative to cross validation},
  booktitle = COLT,
  year = {1995},
  pages = {385--391},
  publisher = {ACM Press, New York, NY}
}

@PHDTHESIS{Persson66,
  author = {S. Persson},
  title = {Some {S}equence {E}xtrapolating {P}rograms: a {S}tudy of {R}epresentation
	and {M}odeling in {I}nquiring {S}ystems},
  school = {Stanford University},
  year = {1966}
}

@MASTERSTHESIS{Perugini89,
  author = {Nancy Perugini},
  title = {Neural Network Learning: Effects of Network and Training Set Size},
  school = {MIT Department of Electrical Engineering and Computer Science},
  year = {1989},
  month = Jun
}

@INPROCEEDINGS{PeshkinMeKa99,
  author = {Leonid Peshkin and Nicolas Meuleau and Leslie Pack Kaelbling},
  title = {Learning policies with external memory},
  booktitle = ICML,
  year = {1999},
  pages = {307--314},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{PetersSc07,
  author = {J. Peters and S. Schaal},
  title = {Reinforcement learning by reward-weighted regression for operational
	space control},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {745--750},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@ARTICLE{PetersonAn87,
  author = {C. Peterson and J. R. Anderson},
  title = {A Mean Field Theory Learning Algorithm for Neural Networks},
  journal = {Complex Systems},
  year = {1987},
  volume = {1},
  pages = {995--1019}
}

@INPROCEEDINGS{PetrovPaKl07,
  author = {Petrov, Slav and Pauls, Adam and Klein, Dan},
  title = {Learning Structured Models for Phone Recognition},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {897--905},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1094}
}

@INPROCEEDINGS{Pfahringer95,
  author = {Bernhard Pfahringer},
  title = {Compression-based discretization of continuous attributes},
  booktitle = ICML,
  year = {1995},
  pages = {456--463},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{PfefferKo00,
  author = {Pfeffer, A. and Koller, D.},
  title = {Semantics and Inference for Recursive Probability Models},
  booktitle = {AAAI-IAAI},
  year = {2000},
  pages = {538-544},
  url = {citeseer.ist.psu.edu/pfeffer00semantics.html}
}

@INPROCEEDINGS{PKMT99,
  author = {Pfeffer, A. and Koller, D. and Milch, B. and Takusagawa. K. T.},
  title = {{SPOOK}: A system for probabilistic object oriented knowledge representation},
  booktitle = UAI,
  year = {1999},
  pages = {541-550}
}

@INPROCEEDINGS{PhuaFi07,
  author = {C. Phua and R. Fitch},
  title = {Tracking value function dynamics to improve reinforcement learning
	with piecewise linear function approximation},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {751--758},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{PCZA98,
  author = {Justus H. Piater and Paul R. Cohen and Xiaoqin Zhang and Michael
	Atighetchi},
  title = {A randomized {ANOVA} procedure for comparing performance curves},
  booktitle = ICML,
  year = {1998},
  pages = {430--438},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{Picchi92,
  author = {Eugenio Picchi and Carol Peters and Elisabetta Marina},
  title = {A translator's workstation},
  booktitle = COLING,
  year = {1992},
  pages = {972--976}
}

@INPROCEEDINGS{PicchiPeMa92,
  author = {Eugenio Picchi and Carol Peters and Elisabetta Marina},
  title = {A translator's workstation},
  booktitle = COLING,
  year = {1992},
  pages = {972--976}
}

@INPROCEEDINGS{Pic'oVi98,
  author = {David Pic{\'o} and Enrique Vidal},
  title = {Transducer-Learning Experiments on Language Understanding},
  booktitle = {International Workshop on Algorithmic Learning},
  year = {1998},
  volume = {1433},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {138--149},
  publisher = {Springer-Verlag}
}

@ARTICLE{DPDPL97,
  author = {S. Della Pietra and V. Della Pietra and J. Lafferty},
  title = {Inducing Features of Random Fields},
  journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence},
  year = {1997},
  volume = {PAMI-19},
  pages = {1--13},
  number = {4},
  month = Apr
}

@ARTICLE{PietraPiLa97,
  author = {S. Della Pietra and V. Della Pietra and J. Lafferty},
  title = {Inducing Features of Random Fields},
  journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence},
  year = {1997},
  volume = {PAMI-19},
  pages = {1--13},
  number = {4},
  month = Apr
}

@INPROCEEDINGS{PillaipakkamnattRa94,
  author = {K. Pillaipakkamnatt and V. Raghavan},
  title = {On the limits of proper learnability of subclasses of {DNF} formulas},
  booktitle = COLT,
  year = {1994},
  pages = {118--129},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{PillaipakkamnattRa94a,
  author = {K. Pillaipakkamnatt and V. Raghavan},
  title = {Read-twice {DNF} Formulas are Properly Learnable},
  booktitle = EuroCOLT,
  year = {1994},
  volume = {New Series Number 53},
  series = {The Institute of Mathematics and its Applications Conference Series},
  pages = {121--132},
  address = {Oxford},
  publisher = {Oxford University Press},
  isbn = {0 19 853492 2}
}

@ARTICLE{PillRag95,
  author = {K. Pillapakkamnatt and V. Raghavan},
  title = {Read Twice {DNF} Formulas are Properly Learnable.},
  journal = InfComp,
  year = {1995},
  volume = {122},
  pages = {236--267},
  number = {2}
}

@ARTICLE{PillRag95a,
  author = {K. Pillapakkamnatt and V. Raghavan},
  title = {On the Limits of Proper Learnabilty of Subclasses of DNF formulas},
  journal = {Machine Learning},
  year = {1995},
  note = {To appear}
}

@INPROCEEDINGS{PillRag94,
  author = {K. Pillapakkamnatt and V. Raghavan},
  title = {On the limits of proper learnability of subsets of {DNF} formulas},
  booktitle = COLT,
  year = {1994},
  pages = {118-129}
}

@INCOLLECTION{Pinker90,
  author = {S. Pinker},
  title = {Language Acquisition},
  booktitle = {Foundations of Cognitive Science},
  publisher = {The MIT Press, Cambridge},
  year = {1990}
}

@BOOK{Pinker89,
  title = {Learnability and Cognition},
  publisher = {Cambridge: MIT Press},
  year = {1989},
  author = {S. Pinker}
}

@ARTICLE{Pinker79,
  author = {S. Pinker},
  title = {Formal Models of Language Learning},
  journal = {Cognition},
  year = {1979},
  volume = {7},
  pages = {217--283}
}

@TECHREPORT{PinkerPr87,
  author = {S. Pinker and A. Prince},
  title = {On Language and Connectionism: Analysis of a Parallel Distributed
	Processing Model of Language Acquisition},
  institution = {MIT Center for Cognitive Science},
  year = {1987},
  number = {Occasional Paper 33},
  comment = {Critique of Rumelhart and McClelland's connectionist approach to learning
	English past tense construction.}
}

@INPROCEEDINGS{Pinter95,
  author = {Charles C. Pinter},
  title = {Complexity of network training for classes of neural networks},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1995},
  volume = {997},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {215--227},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{PiponiBo00,
  author = {D. Piponi and G. Borshukov},
  title = {Seamless Texture Mapping of Subdivision Surfaces by Model Pelting
	and Texture Blending},
  booktitle = {SIGGRAPH},
  year = {2000},
  pages = {471--478},
  month = {August}
}

@ARTICLE{Pippenger89,
  author = {Nicholas Pippenger},
  title = {Invariance of Complexity Measures for Networks with Unreliable Gates},
  journal = jacm,
  year = {1989},
  volume = {36},
  pages = {531-539},
  number = {3},
  month = jul,
  keywords = {Computer Systems; Reliability; Theory; Verification; self-correcting
	networks; size and depth; }
}

@INCOLLECTION{Pippig95,
  author = {E. Pippig},
  title = {Structuring Neural Networks and {PAC} Learning},
  booktitle = {Algorithmic Learning for Knowledge-Based Systems},
  publisher = {Springer--Verlag},
  year = {1995},
  volume = {961},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {417--434}
}

@INPROCEEDINGS{Piramuthu96,
  author = {Selwyn Piramuthu},
  title = {Effects of feature selection with 'blurring' on neurofuzzy systems},
  booktitle = ALT,
  year = {1996},
  volume = {1160},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {135--142},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Pitt97,
  author = {Leonard Pitt},
  title = {On exploiting knowledge and concept use in learning theory},
  booktitle = ALT,
  year = {1997},
  volume = {1316},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {62--84},
  publisher = {Springer-Verlag}
}

@MISC{Pitt90,
  author = {Pitt, Leonard},
  title = {Recent Results in Computational Learning Theory},
  year = {1990}
}

@ARTICLE{Pitt90a,
  author = {Leonard Pitt},
  title = {Introduction: Special Issue on Computational Learning Theory},
  journal = {Machine Learning},
  year = {1990},
  volume = {5},
  pages = {117--120},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Pitt89,
  author = {L. Pitt},
  title = {Probabilistic Inductive Inference},
  journal = jacm,
  year = {1989},
  volume = {36},
  pages = {383-433},
  number = {2},
  month = apr,
  keywords = {Theory of Computation; Theory; inductive inference; }
}

@INPROCEEDINGS{Pitt89a,
  author = {L. Pitt},
  title = {Inductive inference, {D}{F}{A}s, and computational complexity},
  booktitle = AII,
  year = {1989},
  volume = {397},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {18--44},
  publisher = {Springer-Verlag},
  annote = {Earlier version was Univ of Ill. TR 1530 in 1989}
}

@PHDTHESIS{Pitt85,
  author = {L. Pitt},
  title = {Probabilistic {I}nductive {I}nference (Ph.{D} Thesis)},
  school = {Yale University},
  year = {1985},
  note = {Computer Science Dept. TR-400},
  comment = {Ph.D. thesis. Defines probabilistic inference and shows probabilistic
	inference equivalence to teams of inductive inference machines; and
	shows strict hierarchy on probability with cut-points 1/2, 1/3, 1/4,
	...}
}

@INPROCEEDINGS{PittBo90,
  author = {L. Pitt and R. Board},
  title = {On the necessity of {O}ccam algorithms},
  booktitle = STOC,
  year = {1990},
  pages = {54--63},
  publisher = {ACM Press}
}

@ARTICLE{PittRe88,
  author = {Leonard Pitt and Robert E. Reinke},
  title = {Criteria for Polynomial-Time (Conceptual) Clustering},
  journal = {Machine Learning},
  year = {1988},
  volume = {2},
  pages = {371--396},
  number = {4},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{PittSm88,
  author = {L. Pitt and C. Smith},
  title = {Probability and Plurality for Aggregations of Learning Machines},
  journal = {Inform. Comput.},
  year = {1988},
  volume = {77},
  pages = {77--92},
  annote = {Earlier version in 1987 ICALP, and 1986 TR-1686 from Univ. of MD.},
  comment = {Show that one can not always trade off probabilism for plurality and
	vice-versa.}
}

@ARTICLE{PittVa88,
  author = {Pitt, L. and L. G. Valiant},
  title = {Computational Limitations on Learning from Examples},
  journal = JACM,
  year = {1988},
  volume = {35},
  pages = {965--984},
  number = {4}
}

@ARTICLE{Pitt93,
  author = {Leonard Pitt and Manfred K. Warmuth},
  title = {The Minimum Consistent DFA Problem Cannot be Approximated within
	any Polynomial},
  journal = jacm,
  year = {1993},
  volume = {40},
  pages = {95-142},
  number = {1},
  month = jan,
  keywords = {Learning Theory; Algorithms; Languages; Theory; approximation algorithms;
	minimization of finite state machines; nonapproximability; }
}

@ARTICLE{PittWa90,
  author = {Pitt, Leonard and Manfred K. Warmuth},
  title = {Prediction Preserving Reducibility},
  journal = {Journal of Computer and System Sciences},
  year = {1990},
  volume = {41},
  pages = {430--467}
}

@INPROCEEDINGS{PittWa88,
  author = {Pitt, Leonard and Manfred K. Warmuth},
  title = {The Minimum {DFA} Consistency Problem Cannot be Approximated within
	any Polynomial},
  booktitle = STOC,
  year = {1989},
  pages = {421--432},
  address = {Seattle},
  month = May,
  publisher = ACM
}

@INPROCEEDINGS{PittWa89,
  author = {Pitt, Leonard and Manfred K. Warmuth},
  title = {The Minimum {DFA} Consistency Problem Cannot be Approximated within
	any Polynomial},
  booktitle = STOC,
  year = {1989},
  address = {Seattle, Washington},
  month = May
}

@INPROCEEDINGS{PittWa88b,
  author = {Pitt, Leonard and Manfred K. Warmuth},
  title = {Reductions Among Prediction Problems: On the Difficulty of Predicting
	Automata (extended abstract)},
  booktitle = {IEEE Conference on Structure in Commplexity Theory},
  year = {1988},
  pages = {60--69},
  address = {Washington, DC},
  month = Jun
}

@INCOLLECTION{PivarFi64,
  author = {M. Pivar and M. Finkelstein},
  title = {Automation, using {LISP}, of inductive inference on sequences},
  booktitle = {The Programming Language LISP},
  publisher = {MIT Press},
  year = {1964},
  pages = {125--136},
  key = {Pivar and Finkelstein}
}

@INCOLLECTION{PivarGo64,
  author = {M. Pivar and E. Gord},
  title = {The {LISP} program for inductive inference on sequences},
  booktitle = {The Programming Language LISP},
  publisher = {MIT Press},
  year = {1964},
  pages = {260--289}
}

@ARTICLE{Platt99,
  author = {Platt, John C.},
  title = {Fast training of support vector machines using sequential minimal
	optimization},
  journal = {Advances in kernel methods: support vector learning},
  year = {1999}
}

@ARTICLE{Platzman89,
  author = {Loren K. Platzman and Bartholdi, III, John J.},
  title = {Spacefilling Curves and the Planar Travelling Salesman Problem},
  journal = jacm,
  year = {1989},
  volume = {36},
  pages = {719-737},
  number = {4},
  month = oct,
  keywords = {Combinatorics and Graph Theory; Algorithms; Performance; Verification;
	fractal geometry; spacefilling curves; }
}

@INCOLLECTION{Plotkin70,
  author = {G. D. Plotkin},
  title = {A note on inductive generalization},
  booktitle = {Machine Intelligence},
  publisher = {American Elsevier},
  year = {1970},
  editor = {B. Meltzer and D. Michie},
  pages = {153--163}
}

@PHDTHESIS{Plotkin71,
  author = {G. D. Plotkin},
  title = {Automatic {M}ethods of {I}nductive {I}nference},
  school = {Edinburgh University},
  year = {1971}
}

@INCOLLECTION{Plotkin71a,
  author = {G. D. Plotkin},
  title = {A further note on inductive generalization},
  booktitle = {Machine Intelligence},
  publisher = {American Elsevier},
  year = {1971},
  pages = {101--124}
}

@ARTICLE{PocchiolaVe96,
  author = {M. Pocchiola and G. Vegter},
  title = {Topologically sweeping visibility complexes via pseudo-triangulations},
  journal = DCG,
  year = {1996},
  volume = {16},
  pages = {419--453},
  month = dec,
  keywords = {topological sweep, visibility complex, visibility graph, triangulation,
	pseudo-triangulation}
}

@ARTICLE{Podnieks77,
  author = {K. Podnieks},
  title = {Probabilistic Program Synthesis},
  journal = {Theory of Algorithms and Programs, Latvian State University, Riga},
  year = {1977},
  volume = {16},
  pages = {57--88}
}

@ARTICLE{Podnieks75,
  author = {K. Podnieks},
  title = {Comparing Various Concepts of Function Prediction, {P}art 2},
  journal = {Theory of Algorithms and Programs, Latvian State University, Riga},
  year = {1975},
  volume = {233},
  annote = {Journal also called {\it Latv. Gosudarst. Univ Uch. Zapiski}}
}

@ARTICLE{Podnieks74,
  author = {K. Podnieks},
  title = {Comparing Various Concepts of Function Prediction, {P}art 1},
  journal = {Theory of Algorithms and Programs, Latvian State University, Riga},
  year = {1974},
  volume = {210},
  pages = {68--81},
  annote = {Journal also called {\it Latv. Gosudarst. Univ. Uch. Zapiski}}
}

@ARTICLE{Podnieks75a,
  author = {K. M. Podnieks},
  title = {Probabilistic synthesis of enumerated classes of functions},
  journal = {Soviet Math. Doklady},
  year = {1975},
  volume = {16},
  pages = {1042--1045}
}

@INCOLLECTION{Poesio95,
  author = {M. Poesio},
  title = {Semantic Ambiguity and Perceived Ambiguity},
  booktitle = {Semantic Ambiguity and Under-specification},
  year = {1995},
  editor = {K. van Deemter and S. Peters},
  address = {CLSI}
}

@TECHREPORT{PoggioGi90,
  author = {T. Poggio and F. Girosi},
  title = {Extensions of a Theory of Networks for Approximation and Learning:
	dimensionality and reduction and clustering},
  institution = {MIT Artificial Intelligence Laboratory},
  year = {1990},
  number = {AIM1167},
  month = apr
}

@ARTICLE{PoggioGi90a,
  author = {T. Poggio and F. Girosi},
  title = {Regularization Algorithms for Learning That Are Equivalent to Multilayer
	Networks},
  journal = {Science},
  year = {1990},
  volume = {247},
  pages = {978--982},
  month = feb # { 23}
}

@TECHREPORT{PoggioGi89,
  author = {T. Poggio and F. Girosi},
  title = {Networks and the Best Approximation Property},
  institution = {MIT Artificial Intelligence Laboratory},
  year = {1989},
  number = {AIM1164},
  month = oct
}

@TECHREPORT{PoggioGi89a,
  author = {Poggio, Tomaso and Federico Girosi},
  title = {A Theory of Networks for Approximation and Learning},
  institution = {MIT Artificial Intelligence Laboratory},
  year = {1989},
  number = {AIM1140},
  month = {Jul},
  tag = {TOC-display}
}

@ARTICLE{PoggioGi89b,
  author = {T. Poggio and F. Girosi},
  title = {Representation Propoerties of Networks: Kolmogorov's Theorm Is Irrelevant},
  journal = {Neural Computation},
  year = {1989},
  volume = {1},
  pages = {465--469}
}

@BOOK{Pogorelov73,
  title = {{Extrinsic Geometry of Convex Surfaces}},
  publisher = {American Mathematical Society},
  year = {1973},
  author = {A. V. Pogorelov},
  volume = {35},
  series = {Translations of Mathematical Monographs},
  address = {Providence, Rhode Island}
}

@ARTICLE{Pollack91,
  author = {Jordan B. Pollack},
  title = {The Induction of Dynamical Recognizers},
  journal = {Machine Learning},
  year = {1991},
  volume = {7},
  pages = {227--252},
  publisher = {Kluwer Academic Publishers, Boston}
}

@BOOK{Pollard84,
  title = {Convergence of Stochastic Processes},
  publisher = {Springer-Verlag},
  year = {1984},
  author = {D. Pollard}
}

@ARTICLE{Pomerleau95,
  author = {Dean A. Pomerleau},
  title = {A Reply to Towell's Book Review of {\it Neural Network Perception
	for Mobile Robot Guidance}},
  journal = {Machine Learning},
  year = {1995},
  volume = {18},
  pages = {121--122},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Pomerleau94,
  author = {Dean A. Pomerleau},
  title = {Neural Network-Based Vision for Precise Control of a Walking Robot},
  journal = {Machine Learning},
  year = {1994},
  volume = {15},
  pages = {125--135},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{Pompe99,
  author = {Uro{\v s} Pompe},
  title = {Noise-tolerant recursive best-first induction},
  booktitle = ICML,
  year = {1999},
  pages = {315--324},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{PonzettoSt07,
  author = {S. P. Ponzetto and M. Strube},
  title = {Deriving a Large Scale Taxonomy from Wikipedia},
  booktitle = AAAI,
  year = {2007},
  url = {http://www.eml-research.de/english/homes/strube/papers/aaai07.pdf}
}

@ARTICLE{PonzettoSt07a,
  author = {S. P. Ponzetto and M. Strube},
  title = {Deriving a Large Scale Taxonomy from Wikipedia},
  journal = {AAAI},
  year = {2007},
  owner = {dxquang},
  timestamp = {2010.12.12},
  url = {http://www.eml-research.de/english/homes/strube/papers/aaai07.pdf}
}

@INPROCEEDINGS{Poole03,
  author = {Poole, D.},
  title = {First-order probabilistic inference},
  booktitle = IJCAI,
  year = {2003},
  pages = {985-991}
}

@INPROCEEDINGS{Poole98,
  author = {David Poole},
  title = {Context-specific approximation in probabilistic inference},
  booktitle = UAI,
  year = {1998},
  pages = {447--454},
  url = {citeseer.ist.psu.edu/poole98contextspecific.html}
}

@ARTICLE{Poole96,
  author = {David Poole},
  title = {Probabilistic Conflicts in a Search Algorithm for Estimating Posterior
	Probabilities in {B}ayesian Networks},
  journal = {Artificial Intelligence},
  year = {1996},
  volume = {88},
  pages = {69--100},
  number = {1--2},
  url = {citeseer.ist.psu.edu/poole96probabilistic.html}
}

@ARTICLE{Poole93,
  author = {Poole, D.},
  title = {Probabilistic {Horn} Abduction and {Bayesian} Networks},
  journal = {Artificial Intelligence},
  year = {1993},
  volume = {64},
  pages = {81-129},
  number = {1},
  url = {citeseer.nj.nec.com/poole93probabilistic.html}
}

@INPROCEEDINGS{PopescuEtKa03,
  author = {A. Popescu and O. Etzioni and H. Kautz},
  title = {Towards a Theory of Natural Language Interfaces to Databases},
  booktitle = IUI,
  year = {2007},
  pages = {678--687}
}

@TECHREPORT{Porat87,
  author = {S. Porat},
  title = {Stability and Looping in Connectionist Models with Assymmetric Weights},
  institution = {University of Rochester Computer Science Department},
  year = {1987},
  number = {TR 210},
  month = mar,
  comment = {Show that determining whether a network stabilizes is NP-hard, under
	both synchronous and fair asynchronous updating rules.}
}

@ARTICLE{PoratFe91,
  author = {Sara Porat and Jerome A. Feldman},
  title = {Learning Automata from Ordered Examples},
  journal = {Machine Learning},
  year = {1991},
  volume = {7},
  pages = {109--138},
  annote = {Earlier version in COLT88},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{PorterKi86,
  author = {Bruce W. Porter and Dennis F. Kibler},
  title = {Experimental Goal Regression: {A} Method for Learning Problem-Solving
	Heuristics},
  journal = {Machine Learning},
  year = {1986},
  volume = {1},
  pages = {249--286},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{PosnerKu93,
  author = {S. E. Posner and S. R. Kulkarni},
  title = {On-line learning of functions of bounded variation under various
	sampling schemes},
  booktitle = COLT,
  year = {1993},
  pages = {439--445},
  publisher = {ACM Press, New York, NY}
}

@INCOLLECTION{PosthoffSc95,
  author = {Christian Posthoff and Michael Schlosser},
  title = {Optimal Strategies -- Learning from Examples -- Boolean Equations},
  booktitle = {Algorithmic Learning for Knowledge-Based Systems},
  publisher = {Springer--Verlag},
  year = {1995},
  volume = {961},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {363--390}
}

@INPROCEEDINGS{Powell87,
  author = {M. J. D. Powell},
  title = {Radial Basis Functions for Multivariable Interpolation: {A} Review},
  booktitle = {Algorithms for Approximation},
  year = {1987},
  pages = {143--167},
  address = {Oxford},
  publisher = {Clarendon Press},
  comment = {Studies carefully conditions for nonsingularity of matrix needed for
	interpolation}
}

@TECHREPORT{PHKWMJ03,
  author = {S. Pradhan and K. Hacioglu and V. Krugler and W. Ward and J. Martin
	and D. Jurafsky},
  title = {Support Vector Learning for Semantic Argument Classification},
  institution = {Center for Spoken Language Research at the University of Colorado},
  year = {2003},
  number = {TR-CSLR-2003-03}
}

@INPROCEEDINGS{PHWMJ03,
  author = {S. Pradhan and K. Hacioglu and W. Ward and J. Martin and D. Jurafsky},
  title = {Semantic Role Parsing Adding Semantic Structure to Unstructured Text},
  booktitle = ICDM,
  year = {2003},
  pages = {629--632}
}

@INPROCEEDINGS{PWHMJ04,
  author = {S. Pradhan and W. Ward and K. Hacioglu and J. H. Martin and D. Jurafsky},
  title = {Shallow Semantic Parsing Using Support Vector Machines},
  booktitle = NAACL-HLT,
  year = {2004},
  pages = {233--240}
}

@INBOOK{Pratt94,
  chapter = {19},
  pages = {523--560},
  title = {Experiments on the transfer of knowledge between neural networks},
  publisher = {MIT Press},
  year = {1994},
  author = {Lorien Y. Pratt},
  volume = {I: Constraints and Prospects},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@INPROCEEDINGS{PrecupSu97,
  author = {Doina Precup and Richard S. Sutton},
  title = {Exponentiated gradient methods for reinforcement learning},
  booktitle = ICML,
  year = {1997},
  pages = {272--277},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{PrecupUt98,
  author = {Doina Precup and Paul E. Utgoff},
  title = {Classification using {$\Phi$}-machines and constructive function
	approximation},
  booktitle = ICML,
  year = {1998},
  pages = {439--444},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{PreissBrKo07,
  author = {Preiss, Judita and Briscoe, Ted and Korhonen, Anna},
  title = {A System for Large-Scale Acquisition of Verbal, Nominal and Adjectival
	Subcategorization Frames from Corpora},
  booktitle = ACL,
  year = {2007},
  pages = {912--919},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1115}
}

@BOOK{PreparataSh85,
  title = {Computational Geometry: An Introduction},
  publisher = {Springer-Verlag},
  year = {1985},
  author = {F. P. Preparata and M. I. Shamos},
  address = {New York, NY},
  comments = {corrected and expanded second printing, 1988},
  keywords = {book}
}

@ARTICLE{PreparataTa92,
  author = {F. P. Preparata and R. Tamassia},
  title = {Efficient point location in a convex spatial cell-complex},
  journal = SICOMP,
  year = {1992},
  volume = {21},
  pages = {267--280}
}

@INPROCEEDINGS{PriceBo99,
  author = {Bob Price and Craig Boutilier},
  title = {Implicit imitation in multiagent reinforcement learning},
  booktitle = ICML,
  year = {1999},
  pages = {325--334},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@ARTICLE{Prieditis93,
  author = {Armand E. Prieditis},
  title = {Machine Discovery of Effective Admissible Heuristics},
  journal = {Machine Learning},
  year = {1993},
  volume = {12},
  pages = {117--141},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{ProcopiucAgHa02,
  author = {C.~M. Procopiuc and P. K. Agarwal and S.~{Har-Peled}},
  title = {{STAR-Tree}: An Efficient Self-Adjusting Index for Moving Objects},
  booktitle = {ALENEX},
  year = {2002},
  editor = {D. M. Mount and C. Stein},
  volume = {2409},
  series = LNCS,
  pages = {178--193},
  url = {http://www.uiuc.edu/~sariel/research/papers/01/star_tree/}
}

@INPROCEEDINGS{ProvostFaKo98,
  author = {Foster Provost and Tom Fawcett and Ron Kohavi},
  title = {The case against accuracy estimation for comparing induction algorithms},
  booktitle = ICML,
  year = {1998},
  pages = {445--453},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@ARTICLE{ProvostAr96,
  author = {Foster John Provost and John M. Aronis},
  title = {Scaling Up Inductive Learning with Massive Parallelism},
  journal = {Machine Learning},
  year = {1996},
  volume = {23},
  pages = {33--46},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{ProvostBu95,
  author = {John Foster Provost and Bruce G. Buchanan},
  title = {Inductive Policy: The Pragmatics of Bias Selection},
  journal = {Machine Learning},
  year = {1995},
  volume = {20},
  pages = {35--61},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{PudlakSp79,
  author = {P. Pudlak and F. N. Springsteel},
  title = {Complexity of mechanized hypothesis formation},
  journal = {Theoret. Comput. Sci.},
  year = {1979},
  volume = {8},
  pages = {203--225}
}

@ARTICLE{Puget94,
  author = {Jean-Francois Puget},
  title = {Explicit Representation of Concept Negation},
  journal = {Machine Learning},
  year = {1994},
  volume = {14},
  pages = {233--247},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{PusaraBr04,
  author = {M. Pusara and C. Brodley},
  title = {User Re-authentication Via Mouse Movements},
  booktitle = {ACM workshop on Visualization and Data Mining for Computer Security},
  year = {2004}
}

@INCOLLECTION{Putnam75,
  author = {H. Putnam},
  title = {Probability and confirmation},
  booktitle = {Mathematics, Matter and Method},
  publisher = {Cambridge University Press},
  year = {1975}
}

@INPROCEEDINGS{PuurulaKu07,
  author = {Puurula, Antti and Kurimo, Mikko},
  title = {Vocabulary Decomposition for Estonian Open Vocabulary Speech Recognition},
  booktitle = ACL,
  year = {2007},
  pages = {89--95},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1012}
}

@INPROCEEDINGS{Polt94,
  author = {S. P{\"o}lt},
  title = {Improved Sample Size Bounds for {PAB}-decisions},
  booktitle = EuroCOLT,
  year = {1994},
  volume = {New Series Number 53},
  series = {The Institute of Mathematics and its Applications Conference Series},
  pages = {229--239},
  address = {Oxford},
  publisher = {Oxford University Press},
  isbn = {0 19 853492 2}
}

@INPROCEEDINGS{P'erezRe96,
  author = {Eduardo P{\'e}rez and Larry A. Rendell},
  title = {Learning despite concept variation by finding structure in attribute-based
	data},
  booktitle = ICML,
  year = {1996},
  pages = {391--399},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{P'erezRe95,
  author = {Eduardo P{\'e}rez and Larry A. Rendell},
  title = {Using multidimensional projection to find relations},
  booktitle = ICML,
  year = {1995},
  pages = {447--455},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{P'erez96,
  author = {M. Alicia P{\'e}rez},
  title = {representing and learning quality-improving search control knowledge},
  booktitle = ICML,
  year = {1996},
  pages = {382--390},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{QiaoRaPr97,
  author = {Hongzhu Qiao and Nageswara S. V. Rao and V. Protopopescu},
  title = {{PAC} learning using {N}adaraya-{W}atson estimator based on orthonormal
	systems},
  booktitle = ALT,
  year = {1997},
  volume = {1316},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {146--160},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{QiuKaCh06,
  author = {Qiu, L. and Kan, M.-Y. and Chua, T.-S.},
  title = {Paraphrase recognition via dissimilarity significance classification},
  booktitle = SIGDAT,
  year = {2006},
  pages = {18--26}
}

@INPROCEEDINGS{Qiu93,
  author = {Yonggang Qiu},
  title = {Concept based query expansion},
  booktitle = SIGIR,
  year = {1993},
  pages = {160--169}
}

@ARTICLE{QuattoniWaMoCoDa07,
  author = {Quattoni, Ariadna and Wang, Sybor and Morency, Louis-Philippe and
	Collins, Michael and Darrell, Trevor},
  title = {Hidden Conditional Random Fields},
  journal = {IEEE Trans. Pattern Anal. Mach. Intell.},
  year = {2007},
  volume = {29},
  pages = {1848--1852},
  number = {10},
  address = {Washington, DC, USA},
  doi = {http://dx.doi.org/10.1109/TPAMI.2007.1124},
  issn = {0162-8828},
  publisher = {IEEE Computer Society}
}

@INBOOK{Quinlan83,
  pages = {463--482},
  title = {Learning Efficient Classification Procedures and Their Application
	to Chess End-Games},
  publisher = {Morgan Kaufmann Publishers},
  year = {1983},
  editor = {R.S. Michalski and J.G. Carbonell and T.M. Mitchell},
  author = {J.R. Quinlan},
  address = {Los Altos, CA},
  booktitle = {Machine Learning: An Artificial Intelligence Approach}
}

@BOOK{Quinlan93a,
  title = {C4.5: Programs for Machine Learning},
  publisher = {Morgan Kaufmann Publishers},
  year = {1993},
  author = {J.R. Quinlan},
  address = {San Mateo, CA}
}

@INPROCEEDINGS{Quinlan93b,
  author = {J. R. Quinlan},
  title = {Past tenses of verbs and first-order learning},
  booktitle = {Australian Joint Conference on Artificial Intelligence},
  year = {1993},
  editor = {Zhang C. and J. Debenham and Lukose D.},
  pages = {13-20},
  publisher = {World Scientific}
}

@INPROCEEDINGS{Quinlan99,
  author = {J. R. Quinlan},
  title = {Some elements of machine learning},
  booktitle = ICML,
  year = {1999},
  pages = {523--525},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{Quinlan96,
  author = {J. R. Quinlan},
  title = {Boosting first-order learning},
  booktitle = ALT,
  year = {1996},
  volume = {1160},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {143--155},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Quinlan95,
  author = {J. R. Quinlan},
  title = {{MDL} and categorical theories (continued)},
  booktitle = ICML,
  year = {1995},
  pages = {464--470},
  publisher = {Morgan Kaufmann}
}

@INBOOK{Quinlan94,
  chapter = {15},
  pages = {445--456},
  title = {Comparing connectionist and symbolic learning methods},
  publisher = {MIT Press},
  year = {1994},
  author = {J. R. Quinlan},
  volume = {I: Constraints and Prospects},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@INPROCEEDINGS{Quinlan94a,
  author = {J. R. Quinlan},
  title = {The minimum description length principle and categorical theories},
  booktitle = ICML,
  year = {1994},
  pages = {233--241},
  publisher = {Morgan Kaufmann}
}

@BOOK{Quinlan93,
  title = {{C4}.5: {P}rograms for machine learning},
  publisher = {Morgan Kaufmann},
  year = {1993},
  author = {J. R. Quinlan}
}

@INPROCEEDINGS{Quinlan91,
  author = {J. R. Quinlan},
  title = {Determinate Literals in Inductive Logic Programming},
  booktitle = {Machine Learning: Proceedings of the Eighth International Workshop},
  year = {1991},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{Quinlan91a,
  author = {J. R. Quinlan},
  title = {Improved Estimates for the Accuracy of Small Disjuncts},
  journal = {Machine Learning},
  year = {1991},
  volume = {6},
  pages = {93--98},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Quinlan90,
  author = {J. R. Quinlan},
  title = {Learning Logical Definitions from Relations},
  journal = {Machine Learning},
  year = {1990},
  volume = {5},
  pages = {239--266},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Quinlan87,
  author = {J. R. Quinlan},
  title = {Simplifying Decision Trees},
  journal = {International Journal of Man-Machine Studies},
  year = {1987},
  volume = {27},
  pages = {221--234},
  number = {3}
}

@INCOLLECTION{Quinlan86,
  author = {J. R. Quinlan},
  title = {The Effect of Noise on Concept Learning},
  booktitle = {Machine Learning, An Artificial Intelligence Approach (Volume II)},
  publisher = {Morgan Kaufmann},
  year = {1986},
  chapter = {6},
  pages = {149--166},
  comment = {An empirical study of the effects of noise on a particular learning
	algorithm. Concludes that classification noise is more harmful than
	attribute noise.}
}

@ARTICLE{Quinlan86a,
  author = {Quinlan, J. R.},
  title = {Induction of Decision Trees},
  journal = {Machine Learning},
  year = {1986},
  volume = {1},
  pages = {81--106},
  comment = {Overview of the induction of decision trees. Proposes information-theoretic
	measure for choosing decision attributes. Discusses issue of noise
	and unknown attribute values.}
}

@ARTICLE{Quinlan83a,
  author = {J. R. Quinlan},
  title = {Inferno: {A} Cautious Approach to Uncertain Inference},
  journal = {The Computer Journal},
  year = {1983},
  volume = {26},
  pages = {255--269},
  number = {3},
  comment = {Survey of previous inference schemes. Proposes `cautious' scheme.}
}

@ARTICLE{QuinlanRi89,
  author = {Quinlan, J. Ross and Ronald L. Rivest},
  title = {Inferring Decision Trees Using the Minimum Description Length Principle},
  journal = {Information and Computation},
  year = {1989},
  volume = {80},
  pages = {227--248},
  number = {3},
  month = Mar,
  note = {(An early version appeared as MIT LCS Technical report MIT/LCS/TM-339
	(September 1987).)},
  tag = {TOC-display}
}

@INPROCEEDINGS{QuirkBrDo04,
  author = {C. Quirk and C. Brockett and W. Dolan},
  title = {Monolingual machine translation for paraphrase generation},
  booktitle = SIGDAT,
  year = {2004},
  pages = {142--149}
}

@INPROCEEDINGS{Richard09,
  author = {R. C. Wang, W. W. Cohen},
  title = {Automatic Set Instance Extraction using the Web},
  booktitle = {ACL-IJCNLP},
  year = {2009}
}

@INPROCEEDINGS{MihalceaCorleyStrapparava06,
  author = {R. Mihalcea, C. Corley and C. Strapparava},
  title = {Corpus-based and Knowledge-based Measures of Text Semantic Similarity},
  booktitle = AAAI,
  year = {2006}
}

@INCOLLECTION{Rabin76,
  author = {M. O. Rabin},
  title = {Probabilistic algorithms},
  booktitle = {Algorithms and Complexity: New Directions and Recent Results},
  publisher = {Academic Press},
  year = {1976},
  editor = {J. F. Traub},
  pages = {21--39},
  address = {New York, NY}
}

@ARTICLE{Rabin89,
  author = {Michael O. Rabin},
  title = {Efficient Dispersal of Information for Security, Load Balancing,
	and Fault Tolerance},
  journal = jacm,
  year = {1989},
  volume = {36},
  pages = {335-348},
  number = {2},
  month = apr,
  keywords = {Distributed Computing; Algorithms; Verification; fault tolerance;
	parallel computers; routing of data; storage of data; }
}

@ARTICLE{Rabiner89,
  author = {Rabiner, L. R.},
  title = {A tutorial on hidden {M}arkov models and selected applications in
	speech recognition},
  journal = {Proceedings of the {IEEE}},
  year = {1989},
  volume = {77},
  pages = {257--285},
  number = {2}
}

@ARTICLE{RabinerJu86,
  author = {L. R. Rabiner and B. H. Juang},
  title = {An Introduction to Hidden Markov Models},
  journal = {IEEE ASSP Magazine},
  year = {1986},
  volume = {3},
  pages = {4--16},
  number = {1},
  month = jan,
  comment = {Good introductory overview.}
}

@ARTICLE{RabinerLeSo83,
  author = {L. R. Rabiner and S. E. Levinson and M. M. Sondhi},
  title = {On the Application of Vector Quantization and Hidden Markov Models
	to Speaker-Independent, Isolated Word Recognition},
  journal = {Bell System Technical Journal},
  year = {1983},
  volume = {62},
  pages = {1075--1105},
  number = {4},
  month = apr,
  comment = {Gets 96.5 percent accuracy on 100-speaker set for digits.}
}

@MASTERSTHESIS{Rabinovich99,
  author = {A. Rabinovich},
  title = {Computing the Shortest Translation Separating Two Convex Polytopes
	in {$\Re^{3}$}},
  school = {Dept. Computer Science, Tel Aviv University},
  year = {1999},
  type = {{M. S.} Thesis},
  address = {Tel Aviv, Israel},
  keywords = {master thesis}
}

@INPROCEEDINGS{RKSA94,
  author = {John Rachlin and Simon Kasif and Steven Salzberg and David W. Aha},
  title = {Towards a better understanding of memory-based reasoning systems},
  booktitle = ICML,
  year = {1994},
  pages = {242--250},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{RaedtBr92,
  author = {Luc De Raedt and Maurice Bruynooghe},
  title = {Interactive Concept-Learning and Constructive Induction by Analogy},
  journal = {Machine Learning},
  year = {1992},
  volume = {8},
  pages = {107--150},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{RaedtDe97,
  author = {Luc De Raedt and Luc Dehaspe},
  title = {Clausal Discovery},
  journal = {Machine Learning},
  year = {1997},
  volume = {26},
  pages = {99--145},
  publisher = {Kluwer Academic Publishers, Boston}
}

@MISC{RaedtKe04,
  author = {L. De Raedt and K. Kersting},
  title = {Probabilistic logic learning},
  year = {2004},
  text = {L. De Raedt and K. Kersting. Probabilistic logic learning. ACM-SIGKDD
	Explor., 5, 2004.},
  url = {citeseer.ist.psu.edu/deraedt04probabilistic.html}
}

@INPROCEEDINGS{RaedtLa95,
  author = {Luc De Raedt and Wim Van Laer},
  title = {Inductive constraint logic},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1995},
  pages = {80--94},
  publisher = {Springer-Verlag}
}

@INBOOK{RagavanRe94,
  chapter = {6},
  pages = {143--161},
  title = {Learning disjunctive concepts using domain knowledge},
  publisher = {MIT Press},
  year = {1994},
  author = {Harish Ragavan and Larry Rendell},
  volume = {I: Constraints and Prospects},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@INPROCEEDINGS{Raghavan88,
  author = {Raghavan, Prabhakar},
  title = {Learning in Threshold Networks},
  booktitle = {First Workshop on Computational Learning Theory},
  year = {1988},
  pages = {19--27},
  month = Aug,
  publisher = {Morgan-Kaufmann}
}

@ARTICLE{Raghavan94,
  author = {Vijay Raghavan},
  title = {Bounded degree graph inference from walks},
  journal = {J. of Comput. Syst. Sci.},
  year = {1994},
  volume = {49},
  pages = {108--132},
  number = {1},
  note = {Earlier version in 5th Colt, 1991}
}

@INPROCEEDINGS{RaghavanSc90,
  author = {V. Raghavan and S. R. Schach},
  title = {Learning switch configurations},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1990},
  pages = {38--51},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{RaghavanWi93,
  author = {V. Raghavan and D. Wilkins},
  title = {Learning $\mu$-branching programs with queries},
  booktitle = COLT,
  year = {1993},
  pages = {27--36},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{RBLPN07,
  author = {R. Raina and A. Battle and H. Lee and B. Packer and A. Ng},
  title = {Self-taught learning: transfer learning from unlabeled data},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {759--766},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{RainaNgMa05,
  author = {R. Raina and A. Ng and C. Manning},
  title = {Robust textual inference via learning and abductive reasoning},
  booktitle = AAAI,
  year = {2005}
}

@INPROCEEDINGS{RainaNgKo06,
  author = {Rajat Raina and Andrew Y. Ng and Daphne Koller},
  title = {Constructing informative priors using transfer learning},
  booktitle = ICML,
  year = {2006},
  pages = {713--720},
  address = {New York, NY, USA},
  publisher = {ACM},
  doi = {http://doi.acm.org/10.1145/1143844.1143934},
  isbn = {1-59593-383-2},
  location = {Pittsburgh, Pennsylvania}
}

@INPROCEEDINGS{RSNM04,
  author = {R. Raina and Y. Shen and A. Ng and A. McCallum},
  title = {Classification with Hybrid Generative/Discriminative Models},
  booktitle = NIPS,
  year = {2004}
}

@ARTICLE{Rajamoney93,
  author = {Shankar A. Rajamoney},
  title = {The Design of Discrimination Experiments},
  journal = {Machine Learning},
  year = {1993},
  volume = {12},
  pages = {185--203},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{RakhlinAbBa07,
  author = {A. Rakhlin and J. Abernethy and P. Bartlett},
  title = {Online discovery of similarity mappings},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {767--774},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{RBCG07,
  author = {A. Rakotomamonjy and F. Bach and S. Canu and Y. Grandvalet},
  title = {More efficiency in multiple kernel learning},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {775--782},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@ARTICLE{Ram93,
  author = {Ashwin Ram},
  title = {Indexing and Elaboration and Refinement: Incremental Learning of
	Explanatory Cases},
  journal = {Machine Learning},
  year = {1993},
  volume = {10},
  pages = {201--248},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{RamachandranMo98,
  author = {Sowmya Ramachandran and Raymond J. Mooney},
  title = {Theory refinement for {B}ayesian networks with hidden variables},
  booktitle = ICML,
  year = {1998},
  pages = {454--462},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INBOOK{Ramacher94,
  chapter = {16},
  pages = {251--277},
  title = {Hamiltonian dynamics of neural networks},
  publisher = {MIT Press},
  year = {1994},
  author = {Ulrich Ramacher},
  volume = {II: Intersections Between Theory and Experiment},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@ARTICLE{Ramesh92,
  author = {R. Ramesh and I. V. Ramakrishnan},
  title = {Nonlinear Pattern Matching in Trees},
  journal = jacm,
  year = {1992},
  volume = {39},
  pages = {295-316},
  number = {2},
  month = apr,
  keywords = {Data Structures and Algorithms; Algorithms; Theory; nonlinear pattern
	matching; rewriting; normalization; theorem proving; }
}

@UNPUBLISHED{Ramos01,
  author = {E. Ramos},
  title = {Smooth surface reconstruction in near linear time},
  note = {manuscript},
  year = {2001}
}

@INPROCEEDINGS{Ramos00,
  author = {E. Ramos},
  title = {Deterministic algorithms for $3$-D dimaeter and some $2$-D lower
	envelopes},
  booktitle = {SOCG},
  year = {2000},
  pages = {290--299}
}

@ARTICLE{Ramos97,
  author = {E. Ramos},
  title = {Intersection of unit-balls and diameter of a point set in {$R^3$}},
  journal = CGTA,
  year = {1997},
  volume = {8},
  pages = {57--65}
}

@INCOLLECTION{RamshawMa96,
  author = {L. A. Ramshaw and M. P. Marcus },
  title = {Exploring the Nature of Transformation-Based Learning},
  booktitle = {The Balancing Act: Combining Symbolic and Statistical Approaches
	to Language},
  publisher = {MIT Press},
  year = {1996},
  editor = { J. Klavans and P. Resnik }
}

@INPROCEEDINGS{RamshawMa95,
  author = {L. A. Ramshaw and M. P. Marcus},
  title = {Text Chunking using transformation-based learning},
  booktitle = {Annual Workshop on Very Large Corpora},
  year = {1995}
}

@MASTERSTHESIS{Ramstad92,
  author = {Robert Ramstad},
  title = {A Constructivist Approach to Artificial Intelligence Reexamined},
  school = {MIT EECS Department},
  year = {1992}
}

@INPROCEEDINGS{RandlovAl98,
  author = {Jette Randl{\o}v and Preben Alstr{\o}m},
  title = {Learning to drive a bicycle using reinforcement learning and shaping},
  booktitle = ICML,
  year = {1998},
  pages = {463--471},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{RaoSa98,
  author = {Rao, K. and Sattar, A.},
  title = {Learning from Entailment of Logic Programs with Local Variables},
  booktitle = {International Conference on Algorithmic Learning Theory},
  year = {1998},
  publisher = {Springer-verlag},
  note = {LNAI 1501}
}

@ARTICLE{Rao00,
  author = {M. R. K. Krishna Rao},
  title = {Some classes of prolog programs inferable from positive data},
  journal = {Theoret. Comput. Sci.},
  year = {2000},
  volume = {241},
  pages = {211--234},
  number = {1-2},
  note = {Special issue for ALT '96}
}

@ARTICLE{Rao97,
  author = {M. R. K. Krishna Rao},
  title = {A framework for incremental learning of logic programs},
  journal = {Theoret. Comput. Sci.},
  year = {1997},
  volume = {185},
  pages = {193--213},
  number = {1},
  note = {Special issue for ALT '95}
}

@INPROCEEDINGS{Rao95,
  author = {M. R. K. Krishna Rao},
  title = {Incremental learning of logic programs},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1995},
  pages = {95--109},
  publisher = {Springer-Verlag}
}

@TECHREPORT{RaoKaShIy93,
  author = {Rao, Nagewara S. V. and Srikumar Kareti and Weimin Shi},
  title = {Robot Navigation in Unknown Terrains: IntroductorySurvey of Non-Heuristic
	Algorithms},
  institution = {Oak Ridge National Laboratory},
  year = {1993},
  number = {ORNL/TM-12410},
  month = Jul
}

@TECHREPORT{RaoObGlLi,
  author = {Rao, Nagewara S. V. and E.M. Oblow and Charles W. Glover andGunar
	E. Liepins},
  title = {N-Learners Problem: Fusion of Concepts},
  institution = {Oak Ridge National Laboratory},
  year = {1991},
  number = {ORNL/TM-11904, CESAR-91/23},
  month = Sep
}

@INBOOK{RaoOb97,
  chapter = {12},
  pages = {189--210},
  title = {{N}-learners problem: system of {PAC} learners},
  publisher = {MIT Press},
  year = {1997},
  author = {Nageswara S. V. Rao and E. M. Oblow},
  volume = {IV: Making Learning Systems Practical},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@TECHREPORT{ROGL91,
  author = {N. S. V. Rao and E. M. Oblow and C. W. Glover and G. E. Liepins},
  title = {{N}-Learners Problem: Fusion of Concepts},
  institution = {Oak Ridge National Laboratory},
  year = {1991},
  number = {ORNL/TM-11904, CESAR-91/23},
  month = sep
}

@INPROCEEDINGS{RaoGoSp95,
  author = {R. Bharat Rao and Diana Gordon and William Spears},
  title = {For every generalization action is there really an equal and opposite
	reaction? Analysis of the conservation law for generalization performance},
  booktitle = ICML,
  year = {1995},
  pages = {471--479},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{RaoSm98,
  author = {S. Rao and W. D. Smith},
  title = {Improved approximation schemes for geometric graphs via ``spanners''
	and ``banyans''},
  booktitle = STOC,
  year = {1998},
  pages = {540--550}
}

@INPROCEEDINGS{Rapp95,
  author = {Reinhard Rapp},
  title = {Identifying word translations in non-parallel texts},
  booktitle = ACL,
  year = {1995}
}

@TECHREPORT{RatinovDoRo10,
  author = {Lev Ratinov and Doug Downey and Dan Roth},
  title = {Wikification for Information Retrieval},
  year = {2010},
  address = {University of Illinois},
  note = {http://L2R.cs.uiuc.edu/$\sim$ danr/Papers/RatinovDoRo10.pdf},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@INPROCEEDINGS{RatinovRo09,
  author = {Lev Ratinov and Dan Roth},
  title = {Design Challenges and Misconceptions in Named Entity Recognition},
  booktitle = {Proceedings of CoNLL-09},
  year = {2009},
  pages = {147--155},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@INCOLLECTION{Ratnaparkhi96,
  author = {A Ratnaparkhi},
  title = {A Maximum Entropy Model for Part-of-Speech Tagging},
  booktitle = EMNLP,
  publisher = {Association for Computational Linguistics},
  year = {1996},
  editor = {Eric Brill and Kenneth Church},
  pages = {133--142},
  address = {Somerset, New Jersey},
  timestamp = {2007.01.26}
}

@ARTICLE{Ratnaparkhi99,
  author = {Adwait Ratnaparkhi},
  title = {Learning to Parse Natural Language with Maximum Entropy Models},
  journal = {Machine Learning},
  year = {1999},
  volume = {34},
  pages = {151--175},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{Ratnaparkhi97,
  author = {A. Ratnaparkhi},
  title = {A Linear Observed Time Statistical Parser Based on Maximum Entropy
	Models},
  booktitle = EMNLP,
  year = {1997},
  pages = {1-10}
}

@INPROCEEDINGS{RatnaparkhiReRo94,
  author = {A. Ratnaparkhi and J. Reynar and S. Roukos},
  title = {A maximum entropy model for prepositional phrase attachment},
  booktitle = ARPA,
  year = {1994},
  address = {Plainsboro, {NJ}},
  month = mar
}

@INPROCEEDINGS{RRR94,
  author = {A. Ratnaparkhi and J. Reynar and S. Roukos},
  title = {A maximum entropy model for prepositional phrase attachment},
  booktitle = ARPA,
  year = {1994},
  address = {Plainsboro, {NJ}},
  month = mar
}

@ARTICLE{RatsabyMa99,
  author = {J. Ratsaby and V. Maiorov},
  title = {On the learnability of rich function classes},
  journal = {J. of Comput. Syst. Sci.},
  year = {1999},
  volume = {58},
  pages = {183--192},
  number = {1}
}

@INPROCEEDINGS{RatsabyMa97,
  author = {Joel Ratsaby and Vitaly Maiorov},
  title = {Generalization of the {PAC}-model for learning with partial information},
  booktitle = EuroCOLT,
  year = {1997},
  pages = {51--65},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{RatsabyMeMa96,
  author = {Joel Ratsaby and Ronny Meir and Vitaly Maiorov},
  title = {Towards robust model selection using estimation and approximation
	error bounds},
  booktitle = COLT,
  year = {1996},
  pages = {57--67},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{RatsabyVe95,
  author = {Joel Ratsaby and Santosh S. Venkatesh},
  title = {Learning from a mixture of labeled and unlabeled examples with parametric
	side information},
  booktitle = COLT,
  year = {1995},
  pages = {412--417},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{RattiganMaJe07,
  author = {M. Rattigan and M. Maier and D. Jensen},
  title = {Graph clustering with network structure indices},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {783--790},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{RavichandranPaHo05,
  author = {Ravichandran, D. and Pantel, P. and Hovy, E. },
  title = {Randomized algorithms and NLP: using locality sensitive hash function
	for high speed noun clustering},
  booktitle = ACL,
  year = {2005},
  pages = {622--629},
  address = {Morristown, NJ, USA},
  publisher = {Association for Computational Linguistics},
  keywords = {computational-lexical-semantics, distributional-similarity},
  url = {http://dx.doi.org/10.3115/1219840.1219917}
}

@INPROCEEDINGS{RavichandranPaHo05a,
  author = {Ravichandran, Deepak and Pantel, Patrick and Hovy, Eduard },
  title = {Randomized algorithms and NLP: using locality sensitive hash function
	for high speed noun clustering},
  booktitle = {ACL},
  year = {2005},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@INPROCEEDINGS{Ravis'eSe96,
  author = {Caroline Ravis{'e} and Mich{\`e}le Sebag},
  title = {An advanced evolution should not repeat its past errors},
  booktitle = ICML,
  year = {1996},
  pages = {400--408},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{RawlinsWo88,
  author = {G. J. E. Rawlins and D. Wood},
  title = {Computational geometry with restricted orientations},
  booktitle = IFIP,
  year = {1988},
  volume = {113},
  series = {Lecture Notes in Control and Information Science},
  pages = {375--384},
  publisher = {Springer-Verlag}
}

@ARTICLE{RawlinsWo87,
  author = {G. J. E. Rawlins and D. Wood},
  title = {Optimal computation of finitely oriented convex hulls},
  journal = {Inform. Comput.},
  year = {1987},
  volume = {72},
  pages = {150--166}
}

@ARTICLE{Raynaud70,
  author = {H. Raynaud},
  title = {Sur l'enveloppe convex des nuages de points aleatoires dans {$R^{n}$}},
  journal = {J. Appl. Probab.},
  year = {1970},
  volume = {7},
  pages = {35--48},
  annote = {163}
}

@ARTICLE{Raz92,
  author = {Ran Raz and Avi Wigderson},
  title = {Monotone Circuits for Matching Linear Depth},
  journal = jacm,
  year = {1992},
  volume = {39},
  pages = {736-744},
  number = {3},
  month = jul,
  keywords = {Theory of Computation; Theory; circuit depth; monotone computation;
	perfect matching; }
}

@INPROCEEDINGS{ReddyTa98,
  author = {Reddy, C. and Tadepalli, P.},
  title = {Learning First Order Acyclic {H}orn Programs from Entailment},
  booktitle = ILP,
  year = {1998},
  pages = {23--37},
  address = {Madison, WI},
  publisher = {Springer},
  note = {LNAI 1446}
}

@INPROCEEDINGS{ReddyTa97,
  author = {Chandra Reddy and Prasad Tadepalli},
  title = {Learning goal-decomposition rules using exercises},
  booktitle = ICML,
  year = {1997},
  pages = {278--286},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{ReddyTaRo96,
  author = {Chandra Reddy and Prasad Tadepalli and Silvana Roncagliolo},
  title = {Theory-guided empirical speedup learning of goal decomposition rules},
  booktitle = ICML,
  year = {1996},
  pages = {409--417},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{LiereTa97,
  author = {L. Reddy and P. Tadepalli},
  title = {Active Learning with Committees for Text Categorization},
  booktitle = {The National Conference on Artificial Intelligence},
  year = {1997},
  pages = {602--608}
}

@ARTICLE{RednerWa84,
  author = {R. A. Redner and H. F. Walker},
  title = {Mixture densities, maximum likelihood, and the {EM} algorithm},
  journal = {Siam Review},
  year = {1984},
  volume = {26},
  pages = {195--239}
}

@INCOLLECTION{ReekeSpEd89,
  author = {G. N. {Reeke, Jr} and O. Sporns and G. M. Edelman},
  title = {Synthetic Neural Modelling: Comparisons of Population and Connectionist
	Approaches},
  booktitle = {Connectionism in Perspective},
  publisher = {Elsevier Science B. V. (North-Holland)},
  year = {1989}
}

@ARTICLE{Reese97,
  author = {Reese, M.G. and Eeckman, F.H. and Kulp, D. and Haussler, D.},
  title = {Improved Splice Site Detection in Genie},
  journal = {Journal of Computational Biology},
  year = {1997},
  volume = {4},
  pages = {311--324}
}

@BOOK{Reeves93,
  title = {Modern Heuristic Techniques for Combinatorial Problems},
  publisher = {Halsted Press},
  year = {1993},
  author = {C. R. Reeves},
  address = {New York}
}

@INPROCEEDINGS{RehbeinGe07,
  author = {Rehbein, Ines and van Genabith, Josef},
  title = {Treebank Annotation Schemes and Parser Evaluation for {G}erman},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {630--639},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1066}
}

@ARTICLE{Reich91,
  author = {Yoram Reich},
  title = {Exemplar-Based Knowledge Acquisition},
  journal = {Machine Learning},
  year = {1991},
  volume = {6},
  pages = {99--103},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{ReichartRa07,
  author = {Reichart, Roi and Rappoport, Ari},
  title = {An Ensemble Method for Selection of High Quality Parses},
  booktitle = ACL,
  year = {2007},
  pages = {408--415},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1052}
}

@INPROCEEDINGS{ReichartRa07a,
  author = {Reichart, Roi and Rappoport, Ari},
  title = {Self-Training for Enhancement and Domain Adaptation of Statistical
	Parsers Trained on Small Datasets},
  booktitle = ACL,
  year = {2007},
  pages = {616--623},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1078}
}

@ARTICLE{ReifSt94,
  author = {J. H. Reif and J. A. Storer},
  title = {A single-exponential upper bound for finding shortest paths in three
	dimensions},
  journal = JACM,
  year = {1994},
  volume = {41},
  pages = {1013--1019},
  number = {5}
}

@BOOK{Reinhart83,
  title = {Anaphora},
  publisher = {Croom Helm},
  year = {1983},
  author = {T. Reinhart},
  address = {London}
}

@INPROCEEDINGS{ReischukZe99,
  author = {R.~Reischuk and T.~Zeugmann},
  title = {A Complete and Tight Average-Case Analysis of Learning Monomials},
  booktitle = STACS,
  year = {1999},
  volume = {1563},
  series = {Lecture Notes in Computer Science},
  pages = {414--423},
  publisher = {Springer-Verlag}
}

@TECHREPORT{ReischukZe98,
  author = {R. Reischuk and T. Zeugmann},
  title = {Analyzing the Average-Case Behavior of Conjunctive Learning Algorithms},
  institution = {Department of Informatics, Kyushu University},
  year = {1998},
  number = {DOI-TR-153},
  month = aug
}

@ARTICLE{ReischukZe00,
  author = {R{\"u}diger Reischuk and Thomas Zeugmann},
  title = {An Average-Case Optimal One-Variable Pattern Language Learner},
  journal = {J. of Comput. Syst. Sci.},
  year = {2000},
  volume = {60},
  pages = {302--335},
  number = {2},
  note = {Special Issue for COLT '98}
}

@INPROCEEDINGS{ReischukZe98a,
  author = {R{\"u}diger Reischuk and Thomas Zeugmann},
  title = {Learning one-variable pattern languages in linear average time},
  booktitle = COLT,
  year = {1998},
  pages = {198--208},
  publisher = {ACM Press, New York, NY}
}

@INCOLLECTION{Reiter87,
  author = {Reiter, R.},
  title = {Nonmonotonic Reasoning},
  booktitle = {Annual Reviews of Computer Science},
  year = {1987},
  pages = {147--188}
}

@ARTICLE{Reiter80,
  author = {Reiter, R.},
  title = {A logic for default reasoning},
  journal = {Artificial Intelligence},
  year = {1980},
  volume = {13},
  number = {1,2}
}

@INPROCEEDINGS{ReitterMo07,
  author = {Reitter, David and Moore, Johanna D.},
  title = {Predicting Success in Dialogue},
  booktitle = ACL,
  year = {2007},
  pages = {808--815},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1102}
}

@ARTICLE{Rendell86,
  author = {Larry Rendell},
  title = {A General Framework for Induction and a Study of Selective Induction},
  journal = {Machine Learning},
  year = {1986},
  volume = {1},
  pages = {177--226},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{RendellCh90,
  author = {Larry Rendell and Howard Cho},
  title = {Empirical Learning as a Function of Concept Character},
  journal = {Machine Learning},
  year = {1990},
  volume = {5},
  pages = {267--298},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INBOOK{RendellSe94,
  chapter = {5},
  pages = {83--141},
  title = {Learning hard concepts through constructive induction: framework
	and rationale},
  publisher = {MIT Press},
  year = {1994},
  author = {Larry Rendell and Raj Seshu},
  volume = {I: Constraints and Prospects},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@INPROCEEDINGS{RennieMc99,
  author = {Jason Rennie and Andrew Kachites McCallum},
  title = {Using reinforcement learning to spider the web efficiently},
  booktitle = ICML,
  year = {1999},
  pages = {335--343},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{RSTK03,
  author = {J.D.M. Rennie and L. Shih and J. Teevan and D.R. Karger},
  title = {Tackling the Poor Assumptions of naive {B}ayes Text Classifiers},
  booktitle = ICML,
  year = {2003}
}

@INCOLLECTION{RescolaWa72,
  author = {Rescola, R. A. and A. R. Wagner},
  title = {A theory of Pavlovian conditoning: Variations in the effectiveness
	of reinforcement and nonreinforcement.},
  booktitle = {Classical conditioning II: current research and theory},
  publisher = {Appleton-Century-Crofts},
  year = {1972},
  editor = {Black, A. H. and W. F. Proaski},
  address = {New York}
}

@INPROCEEDINGS{Resnik95,
  author = {P. Resnik},
  title = {Disambiguating Noun Groupings with Respect to WordNet Senses},
  booktitle = {Annual Workshop on Very Large Corpora},
  year = {1995}
}

@INPROCEEDINGS{Resnik95b,
  author = {P. Resnik},
  title = {Disambiguating Noun Groupings with Respect to WordNet Senses},
  booktitle = {Annual Workshop on Very Large Corpora},
  year = {1995}
}

@INPROCEEDINGS{Resnik93,
  author = {P. Resnik},
  title = {Semantic classes and syntactic ambiguity},
  booktitle = ARPA,
  year = {1993}
}

@INPROCEEDINGS{Resnik92,
  author = {P. Resnik},
  title = {WordNet and distributional analysis: A class-based approach to lexical
	discovery},
  booktitle = {AAAI Workshop on Statistically-based Natural Language Processing
	Techniques},
  year = {1992},
  pages = {54--64},
  month = {July},
  place = {San Jose, California}
}

@INPROCEEDINGS{Reveilles93,
  author = {Jean-Pierre Reveilles},
  title = {Mathematical foundations of Discrete Geometry},
  booktitle = {European Workshop Computational Geometry},
  year = {1993}
}

@INPROCEEDINGS{Rich88,
  author = {Rich, E. and LuperFoy, S.},
  title = {An architecture for anaphora resolution},
  booktitle = ANLP,
  year = {1988}
}

@INPROCEEDINGS{RichLu88,
  author = {Rich, E. and LuperFoy, S.},
  title = {An architecture for anaphora resolution},
  booktitle = ANLP,
  year = {1988}
}

@INPROCEEDINGS{Richard09a,
  author = {Richard C. Wang, William W. Cohen},
  title = {Automatic Set Instance Extraction using the Web},
  booktitle = {ACL-IJCNLP},
  year = {2009},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@ARTICLE{RichardsMo95,
  author = {Bradley L. Richards and Raymond J. Mooney},
  title = {Automated Refinement of First-Order Horn-Clause Domain Theories},
  journal = {Machine Learning},
  year = {1995},
  volume = {19},
  pages = {95--131},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{RichardsMo92,
  author = {B. L. Richards and R. J. Mooney},
  title = {Learning Relations by Pathfinding},
  booktitle = {National Conference on Artificial Intelligence},
  year = {1992},
  pages = {50-55}
}

@ARTICLE{RichardsonDo06,
  author = {M. Richardson and P. Domingos},
  title = {Markov logic networks},
  journal = {Machine Learning Journal},
  year = {2006},
  volume = {62},
  pages = {107--136},
  number = {1-2},
  address = {Hingham, MA, USA},
  doi = {http://dx.doi.org/10.1007/s10994-006-5833-1},
  issn = {0885-6125},
  publisher = {Kluwer Academic Publishers}
}

@TECHREPORT{RichardsonDo04,
  author = {M. Richardson and P. Domingos},
  title = {Markov Logic Networks},
  institution = {Department of Computer Science, University of Washington},
  year = {2004}
}

@INPROCEEDINGS{RRZM87,
  author = {R. F. Richbourg and N. C. Rowe and M. J. Zyda and R. McGhee},
  title = {Solving Global Two-Dimensional Routing Problems Using {Snell's} law},
  booktitle = {IEEE International Conference Robotics Automation},
  year = {1987},
  pages = {1631--1636},
  site = {Raleigh, NC}
}

@INPROCEEDINGS{RichmanSc08,
  author = {Richman, A. E. and Schone, P.},
  title = {Mining Wiki Resources for Multilingual Named Entity Recognition},
  booktitle = ACL,
  year = {2008},
  pages = {1--9},
  address = {Columbus, Ohio},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P08/P08-1001}
}

@INPROCEEDINGS{RichmanSc08a,
  author = {Richman, Alexander E. and Schone, Patrick},
  title = {Mining Wiki Resources for Multilingual Named Entity Recognition},
  booktitle = {ACL-HLT},
  year = {2008},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@INPROCEEDINGS{Richter94,
  author = {M. M. Richter},
  title = {A unified approach to inductive logic and case-based reasoning},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1994},
  pages = {210--210},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{RSWZ98,
  author = {M. M.~Richter and C. H.~Smith and R.~Wiehagen and T. Zeugmann},
  title = {Editors' Introduction},
  booktitle = ALT,
  year = {1998},
  volume = {1501},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {1--10},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{RiedelCl06,
  author = {Sebastian Riedel and James Clarke},
  title = {Incremental Integer Linear Programming for Non-projective Dependency
	Parsing},
  booktitle = EMNLP,
  year = {2006},
  pages = {129--137},
  address = {Sydney, Australia},
  url = {http://aclweb.org/anthology-new/W/W06/W06-1616.pdf}
}

@INPROCEEDINGS{RVTML07,
  author = {Riezler, Stefan and Vasserman, Alexander and Tsochantaridis, Ioannis
	and Mittal, Vibhu and Liu, Yi},
  title = {Statistical Machine Translation for Query Expansion in Answer Retrieval},
  booktitle = ACL,
  year = {2007},
  pages = {464--471},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1059}
}

@INPROCEEDINGS{RifkinPoVe99,
  author = {Ryan Rifkin and Massimiliano Pontil and Alessandro Verri},
  title = {A Note on Support Vector Machine Degeneracy},
  booktitle = ALT,
  year = {1999},
  volume = {1720},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {252--263},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Riloff93,
  author = {E. Riloff},
  title = {Automatically Constructing a Dictionary for Information Extraction
	Tasks},
  booktitle = AAAI,
  year = {1993},
  pages = {811--816},
  address = {Menlo Park, CA, USA},
  month = jul,
  publisher = {AAAI Press}
}

@ARTICLE{Ring97,
  author = {Mark B. Ring},
  title = {{CHILD}: a first step towards continual learning},
  journal = {Machine Learning},
  year = {1997},
  volume = {28},
  pages = {77--104},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{Rissanen85,
  author = {J. Rissanen},
  title = {Minimum Description Length Principle},
  booktitle = {Encyclopedia of Statistical Sciences},
  year = {1985},
  editor = {S. Kotz and N. L. Johnson},
  pages = {523--527},
  address = {New York},
  publisher = {Wiley}
}

@ARTICLE{Rissanen97,
  author = {Jorma Rissanen},
  title = {Stochastic Complexity in Learning},
  journal = {J. Comput. Syst. Sci.},
  year = {1997},
  volume = {55},
  pages = {89--95},
  number = {1},
  note = {First appeared in EuroCOLT '95}
}

@BOOK{Rissanen89,
  title = {Stochastic Complexity in Statistical Inquiry},
  publisher = {World Scientific},
  year = {1989},
  author = {J. Rissanen},
  volume = {15},
  series = {Series in Computer Science}
}

@ARTICLE{Rissanen86,
  author = {J. Rissanen},
  title = {Stochastic Complexity and Modeling},
  journal = {Ann. of Statist.},
  year = {1986},
  volume = {14},
  pages = {1080--1100},
  number = {3},
  comment = {Minimum Description Length Principle, and applications.}
}

@TECHREPORT{Rissanen86a,
  author = {J. Rissanen},
  title = {Stochastic Complexity and Sufficient Statistics},
  institution = {IBM Research Laboratory (San Jose)},
  year = {1986},
  comment = {Defines notion of stochastic complexity of a string relative to a
	class of models. Describes to ways to approximate stochastic complexity.}
}

@ARTICLE{Ri83,
  author = {Rissanen, Jorma},
  title = {A Universal Prior for Integers and Estimation by Minimum Description
	Length},
  journal = {The Annals of Statistics},
  year = {1983},
  volume = {11},
  pages = {416--431},
  number = {2}
}

@ARTICLE{Rissanen83,
  author = {Rissanen, Jorma},
  title = {A Universal Prior for Integers and Estimation by Minimum Description
	Length},
  journal = {The Annals of Statistics},
  year = {1983},
  volume = {11},
  pages = {416--431},
  number = {2}
}

@ARTICLE{Rissanen78,
  author = {Rissanen, Jorma},
  title = {Modeling By Shortest Data Description},
  journal = {Automatica},
  year = {1978},
  volume = {14},
  pages = {465--471},
  comment = {Proposes that the best model is the one that minimizes the overall
	description length of the data, including the parameters of the model.}
}

@ARTICLE{RissanenLa81,
  author = {Rissanen, Jorma and Langdon, Jr., Glen G.},
  title = {Universal Modeling and Coding},
  journal = {IEEE Transactions on Information Theory},
  year = {1981},
  volume = {IT-27},
  pages = {12--23},
  number = {1},
  month = Jan,
  comment = {Overview of first-in first-out arithmetic codes. Proves that alphabet
	extensions don't help coding efficiency.}
}

@ARTICLE{RistadYi98,
  author = {Eric Sven Ristad and Peter N. Yianilos},
  title = {Learning String Edit Distance},
  journal = {IEEE Transactions on Pattern Recognition and Machine Intelligence},
  year = {1998},
  volume = {20},
  pages = {522--532},
  number = {5},
  month = {May}
}

@INPROCEEDINGS{RistadYi97,
  author = {Eric Sven Ristad and Peter N. Yianilos},
  title = {Learning string edit distance},
  booktitle = ICML,
  year = {1997},
  pages = {287--295},
  publisher = {Morgan Kaufmann}
}

@UNPUBLISHED{RivestSc87,
  author = {R. Rivest and R. Schapire},
  title = {Inference of visible simple assignment automata with planned experiments},
  note = {Preprint, MIT Laboratory for Computer Science.},
  year = {1987}
}

@INCOLLECTION{Rivest91,
  author = {Rivest, Ronald L.},
  title = {Theory of Learning: What's Hard and What's Easy to Learn},
  booktitle = {Research Directions in Computer Science: An {MIT} Perspective},
  publisher = {MIT Press},
  year = {1991},
  editor = {Albert R. Meyer and John V. Guttag and Ronald L. Rivest and Peter
	Szolovits},
  chapter = {11},
  pages = {217--227}
}

@ARTICLE{Rivest87,
  author = {Rivest, R. L.},
  title = {Learning Decision Lists},
  journal = {Machine Learning},
  year = {1987},
  volume = {2},
  pages = {229--246},
  number = {3},
  tag = {TOC-display}
}

@ARTICLE{Rivest87b,
  author = {Ronald L. Rivest},
  title = {Game Tree Searching by Min/Max Approximation},
  journal = {Artificial Intelligence},
  year = {1987},
  volume = {34},
  pages = {77--96},
  month = Dec
}

@INCOLLECTION{RivestRe91,
  author = {Rivest, Ronald L. and Werner Remmele},
  title = {Machine Learning},
  booktitle = {Applied Computer Science and Software: Turing Theoryinto Practice},
  publisher = {Springer-Verlag},
  year = {1991},
  editor = {Heinz Schw\"{a}rtzel},
  pages = {186--200},
  comment = {Proceedings of International Symposium, September 30 --October 1,
	1991, in Munich}
}

@ARTICLE{RivestRe88,
  author = {Rivest, Ronald L. and Werner Remmele},
  title = {Machine Learning: the Human Connection},
  journal = {Siemens Review},
  year = {1988},
  volume = {55},
  pages = {33--38},
  number = {2/88},
  month = {March/April},
  tag = {TOC-display}
}

@ARTICLE{RivestSc93,
  author = {R. L. Rivest and R. E. Schapire},
  title = {Inference of Finite Automata using Homing Sequences},
  journal = {Inform. Comput.},
  year = {1993},
  volume = {103},
  pages = {299--347},
  number = {2},
  month = apr,
  annote = {Earlier version in FOCS89}
}

@INPROCEEDINGS{RivestSc89,
  author = {Ronald L. Rivest and Robert E. Schapire},
  title = {Inference of Finite Automata using Homing Sequences},
  booktitle = STOC,
  year = {1989},
  pages = {411-420},
  address = {Seattle, Washington},
  month = May,
  tag = {TOC-display}
}

@INPROCEEDINGS{RivestSc87a,
  author = {Rivest, Ronald L. and Robert E. Schapire},
  title = {Diversity-Based Inference of Finite Automata},
  booktitle = FOCS,
  year = {1987},
  pages = {78--87},
  address = {Los Angeles, California},
  month = Oct
}

@INPROCEEDINGS{RivestSc87b,
  author = {R. L. Rivest and R. E. Schapire},
  title = {A New Approach to Unsupervised Learning in Deterministic Environments},
  booktitle = {International Workshop on Machine},
  year = {1987},
  pages = {364--375},
  address = {San Mateo, CA},
  month = jun,
  publisher = {Morgan Kaufmann}
}

@ARTICLE{RivestShAd78,
  author = {R. L. Rivest and A. Shamir and L. Adleman},
  title = {A method for obtaining digital signatures and public key cryptosytems},
  journal = {Commun. ACM},
  year = {1978},
  volume = {21},
  pages = {120--126},
  number = {2}
}

@INPROCEEDINGS{RivestSl88a,
  author = {Rivest, Ronald L. and Robert Sloan},
  title = {A New Model for Inductive Inference},
  booktitle = {Conference on Theoretical Aspects of Reasoning about Knowledge},
  year = {1988},
  editor = {Moshe Vardi},
  pages = {13--27},
  month = Mar,
  publisher = {Morgan Kaufmann},
  tag = {TOC-display}
}

@INPROCEEDINGS{RivestSl88b,
  author = {Ronald L. Rivest and Robert Sloan},
  title = {Learning Complicated Concepts Reliably and Usefully},
  booktitle = AAAI,
  year = {1988},
  pages = {635--639},
  month = aug,
  orgainzation = {American Association for Artificial Intelligence},
  tag = {TOC-display}
}

@ARTICLE{RivestSl93,
  author = {Ronald L. Rivest and Robert H. Sloan},
  title = {On Choosing between Experimenting and Thinking whenLearning},
  journal = {Information and Computation},
  year = {1993},
  volume = {106},
  pages = {1--25},
  number = {1},
  month = Sep
}

@ARTICLE{RivestWi90,
  author = {R. L. Rivest and P. Winston},
  title = {Machine Learning Research at {MIT}},
  journal = {Siemens Review},
  year = {1990},
  pages = {12--14}
}

@INPROCEEDINGS{RivestYi90,
  author = {Ronald L. Rivest and Yiqun Yin},
  title = {Simulation Results for a new two-armed bandit heuristic},
  booktitle = CoNLL,
  year = {1990},
  note = {To appear}
}

@INPROCEEDINGS{RivestYi95,
  author = {Ronald L. Rivest and Yiqun L. Yin},
  title = {Being taught can be faster than asking questions},
  booktitle = COLT,
  year = {1995},
  pages = {144--151},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{Rivlin79,
  author = {T. J. Rivlin},
  title = {Approximating by circles},
  journal = {Computing},
  year = {1979},
  volume = {21},
  pages = {93--104}
}

@ARTICLE{Robbins52,
  author = {H. Robbins},
  title = {Some aspects of the sequential design of experiments},
  journal = {Bull. Amer. Math. Soc.},
  year = {1952},
  volume = {55},
  pages = {527--535}
}

@ARTICLE{RobertsonRi88,
  author = {George G. Robertson and Rick L. Riolo},
  title = {A Tale of Two Classifier Systems},
  journal = {Machine Learning},
  year = {1988},
  volume = {3},
  pages = {139--159},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{RobertsonJo76,
  author = {S.E. Robertson and K. Sparck Jones},
  title = {{Relevance weighting of search terms}},
  journal = {{Journal of the American Society for Information Science}},
  year = {1976},
  volume = {27},
  pages = {129--146},
  number = {3}
}

@ARTICLE{RobertsonSp76,
  author = {S.E. Robertson and K. Sparck Jones},
  title = {{Relevance weighting of search terms}},
  journal = {{Journal of the American Society for Information Science}},
  year = {1976},
  volume = {27},
  pages = {129--146},
  number = {3}
}

@TECHREPORT{Robins86,
  author = {Robins, G.},
  title = {The NIKL manual, The knowledge Representation project},
  institution = {Information Sciences Institute, University of SouthernCalifornia},
  year = {1986}
}

@INPROCEEDINGS{Robnik-vKo99,
  author = {Marko Robnik-{\v S}ikonja and Igor Kononenko},
  title = {Attribute dependencies, understandability and split selection in
	tree based models},
  booktitle = ICML,
  year = {1999},
  pages = {344--353},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{Robnik-vKo97,
  author = {Marko Robnik-{\v S}ikonja and Igor Kononenko},
  title = {An adaptation of {R}elief for attribute estimation in regression},
  booktitle = ICML,
  year = {1997},
  pages = {296--304},
  publisher = {Morgan Kaufmann}
}

@INBOOK{Rocchio71,
  pages = {313--323},
  title = {{Relevance feedback in Information Retrieval}},
  publisher = {Prentice Hall},
  year = {1971},
  author = {J. Rocchio},
  booktitle = {The SMART Retrieval System: Experiments in Automatic Document Processing}
}

@ARTICLE{RohdeGoPl04,
  author = {D.L.T. Rohde and L.M. Gonnerman and D. C. Plaut},
  title = {An Improved Model of Semantic Similarity Based on Lexical Co-Occurrence},
  journal = Manuscript,
  year = {2004}
}

@ARTICLE{RolandDiEl07,
  author = {D. Roland and F. Dick and J. L. Elman},
  title = {Frequency of basic english grammatical structures: A corpus analysis},
  journal = {Journal of Memory and Language},
  year = {2007},
  volume = {57},
  pages = {348-379}
}

@INPROCEEDINGS{Romanik92,
  author = {K. Romanik},
  title = {Approximate testing and learnability},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1992},
  pages = {327--332},
  publisher = {ACM Press, New York, NY}
}

@TECHREPORT{Romanik91,
  author = {K. Romanik},
  title = {Testing As {A} Dual To Learning},
  institution = {Dept. of Computer Science, University of Maryland},
  year = {1991},
  number = {UMIACS-TR-91.93, CS-TR-2704},
  month = jun
}

@INPROCEEDINGS{RKSDL06,
  author = {Lorenza Romano and Milen Kouylekov and Idan Szpektor and Ido Dagan
	and Alberto Lavelli},
  title = {Investigating a Generic Paraphrase-based Approach For Relation Extraction},
  booktitle = EACL,
  year = {2006},
  url = {citeseer.ist.psu.edu/article/romano06investigating.html}
}

@ARTICLE{RonRu97,
  author = {Dana Ron and Ronitt Rubinfeld},
  title = {Exactly Learning Automata of Small Cover Time},
  journal = {Machine Learning},
  year = {1997},
  volume = {27},
  pages = {69--96},
  annote = {Earlier version in COLT95},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{RonRu95,
  author = {Dana Ron and Ronitt Rubinfeld},
  title = {Learning Fallible Deterministic Finite Automata},
  journal = {Machine Learning},
  year = {1995},
  volume = {18},
  pages = {149--185},
  number = {2/3},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{RonSiTi95,
  author = {Dana Ron and Yoram Singer and Naftali Tishby},
  title = {On the learnability and usage of acyclic probabilistic finite automata},
  booktitle = COLT,
  year = {1995},
  pages = {31--40},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{RonSiTi95a,
  author = {Dana Ron and Yoram Singer and Naftali Tishby},
  title = {The Power of Amnesia: Learning Probabilistic Automata with Variable
	Memory Length},
  journal = {Machine Learning},
  year = {1995},
  note = {()}
}

@INPROCEEDINGS{RonSiTi94,
  author = {D. Ron and Y. Singer and N. Tishby},
  title = {Learning probabilistic automata with variable memory length},
  booktitle = COLT,
  year = {1994},
  pages = {35--46},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{RonSiTi93,
  author = {Dana Ron and Yoram Singer and Naftali Tishby},
  title = {The Power of Amnesia},
  booktitle = NIPS,
  year = {1993},
  volume = {6},
  publisher = {Morgan Kaufman}
}

@INPROCEEDINGS{RoscaBa94,
  author = {Justinian P. Rosca and Dana H. Ballard},
  title = {Hierarchical self-organization in genetic programming},
  booktitle = ICML,
  year = {1994},
  pages = {251--258},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{RoschMeGrJoBr76,
  author = {E. Rosch and C. Mervis and W. D. Gray and D. Johnson and P. B. Braem},
  title = {Basic objects in natural categories},
  journal = {Cognitive Psychology},
  year = {1976},
  volume = {8},
  pages = {382--439}
}

@ARTICLE{RoseLa86,
  author = {Donald Rose and Pat Langley},
  title = {Chemical Discovery as Belief Revision},
  journal = {Machine Learning},
  year = {1986},
  volume = {1},
  pages = {423--451},
  publisher = {Kluwer Academic Publishers, Boston}
}

@MASTERSTHESIS{Rosen99,
  author = {J. Rosen},
  title = {Scaling up Context Sensitive Text Correction},
  school = {UIUC, Department of Computer Science},
  year = {1999},
  month = May
}

@INPROCEEDINGS{RGSS04,
  author = {M. Rosen-Zvi and T. Griffiths and M. Steyvers and P. Smyth},
  title = {the Author-Topic Model for Authors and Documents},
  booktitle = UAI,
  year = {2004}
}

@INPROCEEDINGS{RosenbergHi07,
  author = {Rosenberg, Andrew and Hirschberg, Julia},
  title = {{V}-Measure: A Conditional Entropy-Based External Cluster Evaluation
	Measure},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {410--420},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1043}
}

@BOOK{Rosenblatt62,
  title = {Principles of Neurodynamics},
  publisher = {Spartan},
  year = {1962},
  author = {Rosenblatt, F.},
  address = {New York}
}

@ARTICLE{Rosenblatt58,
  author = {F. Rosenblatt},
  title = {The Perceptron: {A} Probabilistic Model for Information Storage and
	Organization in the Brain},
  journal = {Psych. Rev.},
  year = {1958},
  volume = {65},
  pages = {386--407},
  note = {(Reprinted in {\sl Neurocomputing} (MIT Press, 1988).)},
  comment = {Classic article introducing the perceptron model}
}

@INPROCEEDINGS{RosenfeldFe07,
  author = {Rosenfeld, Benjamin and Feldman, Ronen},
  title = {Using Corpus Statistics on Entities to Improve Semi-supervised Relation
	Extraction from the Web},
  booktitle = ACL,
  year = {2007},
  pages = {600--607},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1076}
}

@INPROCEEDINGS{Rosenfeld97,
  author = {R. Rosenfeld},
  title = {A whole sentence Maximum Entropy Language Model},
  booktitle = ASRU,
  year = {1997}
}

@ARTICLE{Rosenfeld96,
  author = {R. Rosenfeld},
  title = {A Maximum Entropy Approach to Adaptive Statistical Language Modeling},
  journal = {Computer, Speech and Language},
  year = {1996},
  volume = {10}
}

@BOOK{Rosenfield88,
  title = {The Invention of Memory: A New View of the Brain},
  publisher = {Basic Books, Inc.},
  year = {1988},
  author = {Rosenfield, I.},
  comment = {WID-LC QP406.R67}
}

@ARTICLE{Rosenschein85,
  author = {Rosenschein, S.},
  title = {Formal Theories of Knowledge in AI and Robotics},
  journal = {New Generation Computing},
  year = {1985},
  volume = {3},
  pages = {345--357}
}

@ARTICLE{Rosenthal89,
  author = {Arnon Rosenthal and Jos{\'e} A. Pino},
  title = {A Generalized Algorithm for Centrality Problems on Trees},
  journal = jacm,
  year = {1989},
  volume = {36},
  pages = {349-361},
  number = {2},
  month = apr,
  keywords = {Operations Research; Algorithms; Verification; center; centralized
	network; centroid; eccentricity; facility location; generalized algorithm;
	linear time; Lossy network; r-domination problem; tree traversal;
	uninterplated function; }
}

@ARTICLE{Rosin00,
  author = {Christopher D. Rosin},
  title = {Sample Complexity of Model-Based Search},
  journal = {J. of Comput. Syst. Sci.},
  year = {2000},
  volume = {60},
  pages = {278--301},
  number = {2},
  note = {Special Issue for COLT '98}
}

@INPROCEEDINGS{RosinBe96,
  author = {Christopher D. Rosin and Richard K. Belew},
  title = {A competitive approach to game learning},
  booktitle = COLT,
  year = {1996},
  pages = {292--302},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{Ross91,
  author = {Keith W. Ross and David D. Yao},
  title = {Optimal Load Balancing and Scheduling in a Distributed Computer System},
  journal = jacm,
  year = {1991},
  volume = {38},
  pages = {676-690},
  number = {3},
  month = jul,
  keywords = {System Modeling and Analysis; Algorithms; Management; Performance;
	load balancing; queuing theory; scheduling; }
}

@INPROCEEDINGS{Rossmanith99,
  author = {Peter Rossmanith},
  title = {Learning from Random Text},
  booktitle = ALT,
  year = {1999},
  volume = {1720},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {132--144},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{RossmanithZe98,
  author = {Peter Rossmanith and Thomas Zeugmann},
  title = {Learning $k$-Variable Pattern Languages Efficiently Stochastically
	Finite on Average from Positive Data},
  booktitle = {International Workshop on Algorithmic Learning},
  year = {1998},
  volume = {1433},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {13--24},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{RostiMaSc07,
  author = {Rosti, Antti-Veikko and Matsoukas, Spyros and Schwartz, Richard},
  title = {Improved Word-Level System Combination for Machine Translation},
  booktitle = ACL,
  year = {2007},
  pages = {312--319},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1040}
}

@INPROCEEDINGS{RAXMSD07,
  author = {Antti-Veikko I. Rosti and Necip Fazil Ayan and Bing Xiang and Spyros
	Matsoukas and Richard Schwartz and Bonnie J. Dorr},
  title = {Combining Outputs from Multiple Machine Translation Systems},
  booktitle = NAACL,
  year = {2007},
  pages = {228--235}
}

@INPROCEEDINGS{RotaruLi07,
  author = {Rotaru, Mihai and Litman, Diane},
  title = {The Utility of a Graphical Representation of Discourse Structure
	in Spoken Dialogue Systems},
  booktitle = ACL,
  year = {2007},
  pages = {360--367},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1046}
}

@ARTICLE{Roth96,
  author = {Roth,, Dan},
  title = {On the hardness of approximate reasoning},
  journal = {Artif. Intell.},
  year = {1996},
  volume = {82},
  pages = {273--302},
  number = {1-2},
  address = {Essex, UK},
  doi = {http://dx.doi.org/10.1016/0004-3702(94)00092-1},
  issn = {0004-3702},
  owner = {dxquang},
  publisher = {Elsevier Science Publishers Ltd.},
  timestamp = {2010.12.12}
}

@INPROCEEDINGS{RothYi07,
  author = {Dan Roth and Wen Tau Yih},
  title = {Global Inference for Entity and Relation Identification via a Linear
	Programming Formulation},
  booktitle = {Introduction to Statistical Relational Learning},
  year = {2007},
  editor = {Lise Getoor and Ben Taskar},
  publisher = {MIT Press},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@INPROCEEDINGS{RothYi04,
  author = {Dan Roth and Wen Tau Yih},
  title = {A Linear Programming Formulation for Global Inference in Natural
	Language Tasks},
  booktitle = {Proceedings of CoNLL-04},
  year = {2004},
  pages = {1--8},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@ARTICLE{RoussopoulosLe85,
  author = {N. Roussopoulos and D. Leifker},
  title = {Direct spatial search on pictorial databases using packed {R}-trees},
  journal = {Proc.\ ACM SIGACT-SIGMOD Conf.\ Principles Database Systems},
  year = {1985},
  pages = {17--31}
}

@ARTICLE{Rouveirol94,
  author = {C{\'{e}}line Rouveirol},
  title = {Flattening and Saturation: Two Representation Changes for Generalization},
  journal = {Machine Learning},
  year = {1994},
  volume = {14},
  pages = {219--232},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{Roverso96,
  author = {Davide Roverso},
  title = {Analogy access by mapping spreading and abstraction in large, multifunctional
	knowledge bases},
  booktitle = ICML,
  year = {1996},
  pages = {418--426},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{RoyRe05,
  author = {D. Roy and E. Reiter},
  title = {Connecting Language to the world},
  journal = AI,
  year = {2005},
  volume = {167},
  pages = {1--12},
  number = {1-2},
  month = {Sept}
}

@ARTICLE{RoyLiWo91,
  author = {U. Roy and C. R. Liu and T. C. Woo},
  title = {Review of dimensioning and tolerancing: {Representation} and processing},
  journal = {Comput. Aided Design},
  year = {1991},
  volume = {23},
  pages = {466--483},
  number = {7}
}

@ARTICLE{RoyZh92,
  author = {U. Roy and X. Zhang},
  title = {Establishment of a pair of concentric circles with the minimum radial
	separation for assessing roundness error},
  journal = {Comput. Aided Design},
  year = {1992},
  volume = {24},
  pages = {161--168},
  number = {3}
}

@INPROCEEDINGS{RSOK91,
  author = {V. Roychowdhury and K. Siu and A. Orlitsky and T. Kailath},
  title = {A geometric approach to threshold circuit complexity},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1991},
  pages = {97--111},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@BOOK{Royden63,
  title = {Real Analysis},
  publisher = {Macmillan},
  year = {1963},
  author = {H. Royden},
  address = {New York, NY}
}

@ARTICLE{Royer86,
  author = {J. Royer},
  title = {Inductive Inference of approximations},
  journal = {Inform. Control},
  year = {1986},
  volume = {70},
  pages = {156--178}
}

@INPROCEEDINGS{Rudich85,
  author = {S. Rudich},
  title = {Inferring the structure of a {M}arkov chain from its output},
  booktitle = FOCS,
  year = {1985},
  pages = {321--326},
  month = oct,
  comment = {No journal version, as of 3/5/91. (Unlikely to be one...)}
}

@INPROCEEDINGS{RuizEsGa98,
  author = {J. Ruiz and S. Espana and P. Garci{\'a}},
  title = {Locally threshold testable languages in strict sense: application
	to the inference problem},
  booktitle = {International Workshop on Algorithmic Learning},
  year = {1998},
  volume = {1433},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {150--161},
  publisher = {Springer-Verlag}
}

@INBOOK{Rumelhart-et-al86,
  pages = {318--364},
  title = {Learning Internal Representations by Error Propagation},
  publisher = {MIT Press},
  year = {1986},
  editor = {D.E.Rumelhart and J.L. McClelland},
  author = {D.E. Rumelhart and G.E. Hinton and R.J. Williams},
  address = {Cambridge, MA},
  booktitle = {Parallel Distributed Processing}
}

@INBOOK{RumelhartHiWi86,
  pages = {318--364},
  title = {Learning Internal Representations by Error Propagation},
  publisher = {MIT Press},
  year = {1986},
  editor = {D.E.Rumelhart and J.L. McClelland},
  author = {D.E. Rumelhart and G.E. Hinton and R.J. Williams},
  address = {Cambridge, MA},
  booktitle = {Parallel Distributed Processing}
}

@INCOLLECTION{RumelhartHiMc86,
  author = {Rumelhart, D. E. and G. E. Hinton and J. L. McClelland},
  title = {A General Framework for Parallel Distributed Processing},
  booktitle = {Parallel Distributed Processing},
  publisher = {MIT Press},
  year = {1986},
  editor = {D. E. Rumelhart and J. L. McClelland},
  chapter = {2},
  pages = {45--76},
  comment = {Overview of various models}
}

@ARTICLE{RumelhartHiWi86a,
  author = {D. E. Rumelhart and G. E. Hinton and R. J. Williams},
  title = {Learning Representations By Back-Propagating Errors},
  journal = {Nature},
  year = {1986},
  volume = {323},
  pages = {533--536}
}

@TECHREPORT{RumelhartHiWi85,
  author = {Rumelhart, D. E. and G. E. Hinton and R. J. Williams},
  title = {Learning Internal Representations by Error Propagation},
  institution = {Institute for Cognitive Science, U.C. San Diego},
  year = {1985},
  number = {ICS Report 8506},
  month = Sep,
  note = {To appear in {\sl Parallel Distributed Processing: Explorations in
	the Microstructure of Cognition}, Vol. 1, edited by Rumelhart and
	McClelland (MIT Press)},
  comment = {Introduces `generalized delta rule' for back-propagating information
	in a network of deterministic sigmoid (logistic) rules.}
}

@BOOK{RumelhartMcPD86,
  title = {Parallel Distributed Processing --- Explorations in the Microstructure
	of Cognition},
  publisher = {MIT Press},
  year = {1986},
  author = {David E. Rumelhart and James L. McClelland and the PDP Research Group},
  volume = {2},
  address = {Cambridge, Massachusetts}
}

@ARTICLE{RumelhartZi85,
  author = {Rumelhart, D. E. and D. Zipser},
  title = {Feature Discovery by Competitive Learning},
  journal = {Cognitive Science},
  year = {1985},
  volume = {9},
  pages = {75--112},
  comment = {Historical survey of perceptrons etc.; competitive learning in a layered
	network with inhibitory clusters}
}

@INPROCEEDINGS{RusinkiewiczLe00,
  author = {S. Rusinkiewicz and M. Levoy},
  title = {{QS}plat: {A} Multiresolution Point Rendering System for Large Meshes},
  booktitle = {SIGGRAPH},
  year = {2000},
  editor = {Kurt Akeley},
  pages = {343--352},
  publisher = {ACM Press / ACM SIGGRAPH / Addison Wesley Longman}
}

@INPROCEEDINGS{Russell98,
  author = {Stuart Russell},
  title = {Learning agents for uncertain environments},
  booktitle = COLT,
  year = {1998},
  pages = {101--103},
  publisher = {ACM Press, New York, NY}
}

@BOOK{RussellNo03,
  title = {Artificial Intelligence: A Modern Approach},
  publisher = {Prentice-Hall, Englewood Cliffs, NJ},
  year = {2003},
  author = {Stuart Russell and Peter Norvig},
  edition = {2nd edition}
}

@INPROCEEDINGS{RyanPe98,
  author = {Malcolm R. K. Ryan and Mark D. Pendrith},
  title = {{RL-TOP}s: an architecture for modularity and re-use in reinforcement
	learning},
  booktitle = ICML,
  year = {1998},
  pages = {481--487},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@ARTICLE{Ryu90,
  author = {In Kyung Ryu and Alexander Thomasian},
  title = {Analysis of Database Performance with Dynamic Locking},
  journal = jacm,
  year = {1990},
  volume = {37},
  pages = {491-523},
  number = {3},
  month = jul,
  keywords = {Database Theory; Performance; Theory; concurrency control; database
	locking; data contention; decomposition; queuing network models;}
}

@INPROCEEDINGS{RWMOLM00,
  author = {G. R{\"a}tsch and M. Warmuth and S. Mika and T. Onoda and S. Lemm
	and K. R. M{\"u}ller},
  title = {Barrier Boosting},
  booktitle = COLT,
  year = {2000},
  pages = {170--179},
  publisher = {Morgan Kaufmann, San Francisco}
}

@INBOOK{RoscheisenHoTr94,
  chapter = {4},
  pages = {53--64},
  title = {Incorporating prior knowledge into networks of locally-tuned units},
  publisher = {MIT Press},
  year = {1994},
  author = {Martin R{\"o}scheisen and Reimar Hoffman and Volker Tresp},
  volume = {II: Intersections Between Theory and Experiment},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@ARTICLE{Ruger98,
  author = {S. M. R{\"u}ger},
  title = {A Class of Asymptotically Stable Algorithms for Learning-Rate Adaptation},
  journal = {Algorithmica},
  year = {1998},
  volume = {22},
  pages = {198--210},
  number = {1/2}
}

@INPROCEEDINGS{PatwardhanBanerjeePedersen03,
  author = {S. Patwardhan, S. Banerjee and T. Pedersen},
  title = {Using Measures of Semantic Relatedness for Word Sense Disambiguation},
  booktitle = {International Conference on Intelligent Text Processing and Computational
	Linguistics},
  year = {2003}
}

@INPROCEEDINGS{Saalfeld91,
  author = {A. Saalfeld},
  title = {Delaunay edge refinements},
  booktitle = {CCCG},
  year = {1991},
  pages = {33--36}
}

@BOOK{Sadler89,
  title = {Working with analogical semantics: Disambiguation techniques in DLT},
  publisher = {Foris Publications},
  year = {1989},
  author = {Sadler, V.}
}

@INPROCEEDINGS{SadoharaHa95,
  author = {Ken Sadohara and Makoto Haraguchi},
  title = {Analogical logic program synthesis algorithm that can refute inappropriate
	similarities},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1995},
  volume = {997},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {266--281},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Saerens96,
  author = {Marco Saerens},
  title = {Non mean square error criteria for the training of learning machines},
  booktitle = ICML,
  year = {1996},
  pages = {427--434},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{SBBC02,
  author = {I. Sag and T. Baldwin and F. Bond and A. Copestake},
  title = {Multiword expressions: A pain in the neck for nlp},
  booktitle = CICLing,
  year = {2002},
  pages = {1--15}
}

@INPROCEEDINGS{SagaeMiTs07,
  author = {Sagae, Kenji and Miyao, Yusuke and Tsujii, Jun'ichi},
  title = {HPSG Parsing with Shallow Dependency Constraints},
  booktitle = ACL,
  year = {2007},
  pages = {624--631},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1079}
}

@INPROCEEDINGS{SagaeTs07,
  author = {Sagae, Kenji and Tsujii, Jun'ichi},
  title = {Dependency Parsing and Domain Adaptation with {LR} Models and Parser
	Ensembles},
  booktitle = {CoNLL Shared Task Session of EMNLP-CoNLL},
  year = {2007},
  pages = {1044--1050},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1111}
}

@BOOK{Sager81,
  title = {Natural language information processing: A computer grammar of English
	and its applications},
  publisher = {Addison-Wesley},
  year = {1981},
  author = {N. Sager}
}

@ARTICLE{Sagiv91,
  author = {Yehoshua Sagiv},
  title = {Evaluation of Queries in Independent Database Schemes},
  journal = jacm,
  year = {1991},
  volume = {38},
  pages = {120-161},
  number = {1},
  month = jan,
  keywords = {Database Theory; Algorithms; Design; Theory; chase; expanded cover;
	extension join; functional dependency; independent database scheme;
	join dependency; lossless join; null value; query evaluation; relational
	algebra; relational database; representative instance; restricted
	projection; tableau; union of tableaux; }
}

@ARTICLE{SagivDePaFa81,
  author = {Sagiv, Y. and C. Delobel and D. S. Parker and R. Fagin},
  title = {An Equivalence between Relational Database Dependencies and a Fragment
	of Propositional Logic},
  journal = JACM,
  year = {1984},
  volume = {28},
  pages = {435--453},
  number = {3}
}

@INPROCEEDINGS{SahamiHeSa96,
  author = {M. Sahami and M. Hearst and E. Saund},
  title = {Applying the multiple cause mixture model to text categorization},
  booktitle = ICML,
  year = {1996},
  pages = {435--443},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{SahamiHe06,
  author = {M. Sahami and T. Heilman},
  title = {A Web-based Kernel Function for Measuring the Similarity of Short
	Text Snippets},
  booktitle = WWW,
  year = {2006}
}

@INPROCEEDINGS{Sahami,
  author = {Mehran Sahami and Timothy D. Heilman},
  title = {A {W}eb-based {K}ernel {F}unction for {M}easuring the {S}imilarity
	of {S}hort {T}ext {S}nippets},
  booktitle = WWW,
  year = {2006},
  pages = {377--386}
}

@INPROCEEDINGS{SaidiTa98,
  author = {A. S. Saidi and S. Tayeb-bey},
  title = {Grammatical inference in document recognition},
  booktitle = {International Workshop on Algorithmic Learning},
  year = {1998},
  volume = {1433},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {175--186},
  publisher = {Springer-Verlag}
}

@BOOK{DeSaintExupery43,
  title = {The Little Prince},
  publisher = {Harcourt, Brace, \& World},
  year = {1943},
  author = {Saint-Exup\`ery, Antoine de}
}

@ARTICLE{SaittaBe93,
  author = {Lorenza Saitta and Francesco Bergadano},
  title = {Pattern Recognition and {V}aliant's Learning Framework},
  journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence},
  year = {1993},
  volume = {15},
  pages = {145--155},
  number = {2},
  month = Feb
}

@ARTICLE{SaittaBoNe93,
  author = {Lorenza Saitta and Marco Botta and Filippo Neri},
  title = {Multistrategy Learning and Theory Revision},
  journal = {Machine Learning},
  year = {1993},
  volume = {11},
  pages = {153--172},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{SaittaNe98,
  author = {Lorenzo Saitta and Filippo Neri},
  title = {Learning in the 'real world'},
  journal = {Machine Learning},
  year = {1998},
  volume = {30},
  pages = {133--163},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{SakaiMa94,
  author = {Y. Sakai and A. Maruoka},
  title = {Learning monotone log-term {DNF} formulas},
  booktitle = COLT,
  year = {1994},
  pages = {165--172},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{SakaiMa93,
  author = {Y. Sakai and A. Maruoka},
  title = {Learning $k$-term monotone {B}oolean formulae},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1993},
  volume = {743},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {197--207},
  publisher = {Springer-Verlag}
}

@ARTICLE{SakaiTaMa99,
  author = {Y. Sakai and E. Takimoto and A. Maruoka},
  title = {Proper learning algorithm for functions of $k$ terms under smooth
	distributions},
  journal = {Inform. Comput.},
  year = {1999},
  volume = {152},
  pages = {188--204},
  number = {2},
  note = {First appeared in COLT'95}
}

@INPROCEEDINGS{Sakaki92,
  author = {Y. Sakaki},
  title = {The logic of molecular geneticists for the understanding of genetic
	information},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1992},
  pages = {3--5},
  publisher = {IOS Press}
}

@ARTICLE{Sakakibara97,
  author = {Yasubumi Sakakibara},
  title = {Recent advances of grammatical inference},
  journal = {Theoret. Comput. Sci.},
  year = {1997},
  volume = {185},
  pages = {15--45},
  number = {1},
  note = {Special issue for ALT '95}
}

@ARTICLE{Sakakibara93,
  author = {Yasubumi Sakakibara},
  title = {Noise-Tolerant Occam Algorithms and Their Applications to Learning
	Decision Trees},
  journal = {Machine Learning},
  year = {1993},
  volume = {11},
  pages = {37--62},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Sakakibara92,
  author = {Yasubumi Sakakibara},
  title = {Efficient learning of context-free grammars from positive structural
	examples},
  journal = {Inform. Comput.},
  year = {1992},
  volume = {97},
  pages = {23--60}
}

@PHDTHESIS{Sakakibara91,
  author = {Y. Sakakibara},
  title = {Algorithmic Learning of Formal Languages and Decision Trees},
  school = {Tokyo Institute of Technology},
  year = {1991},
  month = oct,
  note = {(International Institute for Advanced Study of Social Information
	Science, Fujitsu Laboratories Ltd, Research Report IIAS-RR-91-22E)}
}

@ARTICLE{Sakakibara91a,
  author = {Y. Sakakibara},
  title = {On Learning from Queries and Counterexamples in the Presence of Noise},
  journal = {Inform. Proc. Lett.},
  year = {1991},
  volume = {37},
  pages = {279--284},
  number = {5},
  month = mar
}

@TECHREPORT{Sakakibara90,
  author = {Yasubumi Sakakibara},
  title = {An Efficient Robust Algorithm for Learning Decision Lists},
  institution = {International Institute for Advanced Study of SocialInformation Science,
	Fujitsu Laboratories Ltd},
  year = {1990},
  number = {No. 105},
  month = Aug,
  comment = {Learns k-DL in the presence of classification noise}
}

@ARTICLE{Sakakibara90a,
  author = {Y. Sakakibara},
  title = {Learning context-free grammars from structural data in polynomial
	time},
  journal = {Theoret. Comput. Sci.},
  year = {1990},
  pages = {223--242},
  annote = {Earlier version in COLT88}
}

@INPROCEEDINGS{Sakakibara89,
  author = {Y. Sakakibara},
  title = {Learnability in the Presence of Classification Noise},
  booktitle = {Fujitsu IIAS-SIS Workshop on Computational Learning Theory},
  year = {1989},
  pages = {1--27},
  month = nov
}

@TECHREPORT{Sakakibara87,
  author = {Y. Sakakibara},
  title = {Inductive inference of logic programs based on algebraic semantics},
  institution = {IIAS-SIS, Fujitsu Limited, Research Report No. 79},
  year = {1987}
}

@TECHREPORT{Sakakibara87a,
  author = {Y. Sakakibara},
  title = {Inferring Parsers of Context Free Languages from Structural Examples},
  institution = {Fujitsu Ltd.},
  year = {1987},
  number = {81}
}

@TECHREPORT{Sakakibara87b,
  author = {Y. Sakakibara},
  title = {Inferring parsers of context-free languages from structural examples},
  institution = {IIAS-SIS, Fujitsu Limited, Research Report No. 81},
  year = {1987}
}

@INPROCEEDINGS{SBHMSUH94,
  author = {Yasubumi Sakakibara and Michael Brown and Richard Hughey and I. Saira
	Mian and Kimmen Sj{\"o}lander and Rebecca C. Underwood and David
	Haussler},
  title = {Recent Methods for {RNA} Modeling Using Stochastic Context-Free Grammars},
  booktitle = {Asilomar Conference on Combinatorial Pattern Matching},
  year = {1994},
  address = {New York, NY},
  publisher = {Springer-Verlag}
}

@ARTICLE{SBHMSUH94a,
  author = {Yasubumi Sakakibara and Michael Brown and Richard Hughey and I. Saira
	Mian and Kimmen Sj{\"o}lander and Rebecca C. Underwood and David
	Haussler},
  title = {Stochastic Context-Free Grammars for t{RNA} modeling},
  journal = {Nucleic Acids Research},
  year = {1994},
  volume = {22},
  pages = {5112--5120}
}

@INPROCEEDINGS{SakakibaraJaLa94,
  author = {Y. Sakakibara and K. P. Jantke and S. Lange},
  title = {Learning languages by collecting classes and tuning parameters},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1994},
  pages = {532--546},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{SakakibaraKo99,
  author = {Yasubumi Sakakibara and Mitsuhiro Kondo},
  title = {{GA}-based learning of context-free grammars using tabular representations},
  booktitle = ICML,
  year = {1999},
  pages = {354--360},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{SakakibaraSi92,
  author = {Y. Sakakibara and R. Siromoney},
  title = {A noise model on learning sets of strings},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1992},
  pages = {295--302},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{Sakamoto98,
  author = {H. Sakamoto},
  title = {Finding a One-Variable Pattern from Incomplete Data},
  booktitle = ALT,
  year = {1998},
  volume = {1501},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {234--246},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Sakamoto97,
  author = {Hiroshi Sakamoto},
  title = {Learning simple deterministic finite-memory automata},
  booktitle = ALT,
  year = {1997},
  volume = {1316},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {416--431},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Sakamoto95,
  author = {Hiroshi Sakamoto},
  title = {Language learning from membership queries and characteristic examples},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1995},
  volume = {997},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {55--65},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{SLCHG97,
  author = {M. F. Sakr and S. P. Levitan and D. M. Chiarulli and B. G. Horne
	and C. L. Giles},
  title = {Predicting multiprocessor memory access patterns with learning models},
  booktitle = ICML,
  year = {1997},
  pages = {305--312},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{Sakurai95,
  author = {Akito Sakurai},
  title = {On the {VC}-dimension of depth four threshold circuits and the complexity
	of Boolean-valued functions},
  journal = {Theoret. Comput. Sci.},
  year = {1995},
  volume = {137},
  pages = {109--127},
  number = {1},
  note = {Special Issue for ALT '93}
}

@INPROCEEDINGS{Sakurai92,
  author = {A. Sakurai},
  title = {Inductive inference of formal languages from positive data enumerated
	primitive-recursively},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1992},
  pages = {73--83},
  publisher = {IOS Press}
}

@INPROCEEDINGS{SakuraiHa92,
  author = {S. Sakurai and M. Haraguchi},
  title = {Towards learning by abstraction},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1992},
  pages = {288--298},
  publisher = {IOS Press}
}

@INPROCEEDINGS{SalakhutdinovMnHi07,
  author = {R. Salakhutdinov and A. Mnih and G. Hinton},
  title = {Restricted {Boltzmann} machines for collaborative filtering},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {791--798},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{SalganicoffUn95,
  author = {Marcos Salganicoff and Lyle H. Ungar},
  title = {Active exploration and learning in real-valued spaces using multi-armed
	bandit allocation indices},
  booktitle = ICML,
  year = {1995},
  pages = {480--487},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{SalganicoffUnBa96,
  author = {Marcos Salganicoff and Lyle H. Ungar and Ruzena Bajcsy},
  title = {Active Learning for Vision-Based Robot Grasping},
  journal = {Machine Learning},
  year = {1996},
  volume = {23},
  pages = {251--278},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{SJLL00,
  author = {S. Saltenis and C. S. Jensen and S. Leutenegger and M. Lopez},
  title = {Indexing the Positions of Continuously Moving Objects},
  booktitle = {ACM SIGMOD International Conference on Management of Data},
  year = {2000},
  pages = {331--342},
  url = {http://www.cs.auc.dk/research/DP/tdb/TimeCenter/TimeCenterPublications/TR-44.ps.gz}
}

@BOOK{Salton89,
  title = {Automatic Text Processing},
  publisher = {Addison-Wesley Publishing Company},
  year = {1989},
  author = {Gerard Salton}
}

@INPROCEEDINGS{Salton88,
  author = {Gerard Salton},
  title = {Syntactic approaches to automatic book indexing},
  booktitle = ACL,
  year = {1988},
  pages = {204--210}
}

@BOOK{Salton83,
  title = {Introduction to Modern Information Retrieval},
  publisher = {McGrew-Hill Book Company},
  year = {1983},
  author = {Gerard Salton and Michael McGill}
}

@BOOK{SaltonMc83,
  title = {Introduction to Modern Information Retrieval},
  publisher = {McGrew-Hill Book Company},
  year = {1983},
  author = {Gerard Salton and Michael McGill}
}

@ARTICLE{SaltonWoYa75,
  author = {G. Salton and A. Wong and C. S. Yang},
  title = {A Vector Space Model for Automatic Indexing},
  journal = CACM,
  year = {1975},
  volume = {18},
  pages = {613--620}
}

@INCOLLECTION{Salzberg98,
  author = {Salzberg, S.},
  title = {Decision Trees and {M}arkov Chains for Gene Finding},
  booktitle = {Computational Methods in Molecular Biology},
  publisher = {Elsevier-Science B.V.},
  year = {1998},
  editor = {Salzberg, S.L. and Searls, D.B. and Kasif, S.},
  pages = {187--203}
}

@ARTICLE{Salzberg91,
  author = {Steven Salzberg},
  title = {A Nearest Hyperrectangle Learning Method},
  journal = {Machine Learning},
  year = {1991},
  volume = {6},
  pages = {251--276},
  publisher = {Kluwer Academic Publishers, Boston}
}

@TECHREPORT{Salzberg88,
  author = {S. Salzberg},
  title = {Exemplar-based learning: theory and implementation},
  institution = {Harvard University},
  year = {1988},
  type = {Center for Research in Computing Technology},
  number = {TR-10-88},
  address = {Cambridge, Mass.},
  month = oct,
  comment = {Actually uses learning of differences of orthogonal rectangles stuff
	in a practical application (analyzing breast cancer statistics)}
}

@ARTICLE{Salzberg97,
  author = {Salzberg, S. L.},
  title = {A Method for Identifying Splice Sites and Translational Start Sites
	in Eukaryotic m{RNA}},
  journal = {Computer Applications in the Biosciences},
  year = {1997},
  volume = {13},
  pages = {365--376}
}

@ARTICLE{Salzberg94,
  author = {Steven L. Salzberg},
  title = {Book Review: {\it C4.5: Programs for Machine Learning} by {J}. Ross
	Quinlan. Morgan Kaufmann Publishers, Inc., 1993.},
  journal = {Machine Learning},
  year = {1994},
  volume = {16},
  pages = {235--240},
  publisher = {Kluwer Academic Publishers, Boston}
}

@BOOK{Samet89,
  title = {Spatial Data Structures: Quadtrees, Octrees, and Other Hierarchical
	Methods},
  publisher = {Addison-Wesley},
  year = {1989},
  author = {H. Samet},
  address = {Reading, MA}
}

@INPROCEEDINGS{SammonsVyRo10,
  author = {M. Sammons and V.G. Vydiswaran and D. Roth},
  title = {Ask not what Textual Entailment can do for you...},
  booktitle = {ACL},
  year = {2010},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@INCOLLECTION{SammutBa86,
  author = {C. Sammut and R. Banerji},
  title = {Learning Concepts by Asking Questions},
  booktitle = {Machine Learning : An AI Approach, Vol2},
  publisher = {Morgan Kaufman},
  year = {1986}
}

@INBOOK{Samuel59,
  chapter = {: Some studies in machine learning using the game of checkers},
  title = {Computers and thought},
  publisher = {McGraw Hill},
  year = {1959},
  author = {A. L. Samuel}
}

@ARTICLE{Samuel59a,
  author = {A. L. Samuel},
  title = {Some studies in machine learning using the game of checkers},
  journal = {IBM Journal of Research and Development},
  year = {1959},
  volume = {3},
  pages = {211--229},
  month = Jul,
  note = {(Reprinted in {\em Computers and Thought}, (eds. E. A. Feigenbaum
	and J. Feldman), McGraw-Hill, 1963, pages 39--70).}
}

@INPROCEEDINGS{SamuelCaVi98,
  author = {Ken Samuel and Sandra Carberry and K. Vijay-Shanker},
  title = {An investigation of transformation-based learning in discourse},
  booktitle = ICML,
  year = {1998},
  pages = {497--505},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{Samuelsson96,
  author = {C. Samuelsson},
  title = {Handling sparse data by successive abstraction},
  booktitle = COLING,
  year = {1996}
}

@ARTICLE{Sandewall86,
  author = {Sandewall, E.},
  title = {Non-monotonic inference rules for multiple inheritance with exceptions},
  journal = {Proceedings of The IEEE},
  year = {1986},
  volume = {74}
}

@ARTICLE{Sanger89,
  author = {T. D. Sanger},
  title = {Optimal unsupervised learning in a single-layer linear feedforward
	neural network},
  journal = {Neural Networks},
  year = {1989},
  volume = {2},
  pages = {459--473}
}

@INPROCEEDINGS{Saoudi94,
  author = {A. Saoudi},
  title = {Learning Local and Recognizable $\omega$-languages and Monadic Logic
	Programs},
  booktitle = EuroCOLT,
  year = {1994},
  volume = {New Series Number 53},
  series = {The Institute of Mathematics and its Applications Conference Series},
  pages = {157--169},
  address = {Oxford},
  publisher = {Oxford University Press},
  isbn = {0 19 853492 2}
}

@INPROCEEDINGS{SarawagiCo04,
  author = {Sunita Sarawagi and William W. Cohen},
  title = {Semi-Markov Conditional Random Fields for Information Extraction},
  booktitle = NIPS,
  year = {2004},
  pages = {1185--1192}
}

@INPROCEEDINGS{SarkansB98,
  author = { U. Sarkans and J. B{\=a}rzdi{\c n}{\u s}},
  title = {Using Attribute Grammars for Description of Inductive Inference Search
	Space},
  booktitle = ALT,
  year = {1998},
  volume = {1501},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {400--408},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{SJRO07a,
  author = {Sarmento, L. and Jijkuon, V. and de Rijke, M. and Oliveira, E.},
  title = {"More like these": growing entity classes from seeds},
  booktitle = {CIKM},
  year = {2007},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@INPROCEEDINGS{SJRO07,
  author = {Sarmento, L. and Jijkuon, V. and de Rijke, M. and Oliveira, E.},
  title = {"More like these": growing entity classes from seeds},
  booktitle = CIKM,
  year = {200}
}

@ARTICLE{SarnakTa86,
  author = {N. Sarnak and R. E. Tarjan},
  title = {Planar point location using persistent search trees},
  journal = {Commun. ACM},
  year = {1986},
  volume = {29},
  pages = {669--679},
  number = {7},
  month = jul
}

@INPROCEEDINGS{Sasaki99,
  author = {Yutaka Sasaki},
  title = {Induction of Logic Programs Based on $\psi$-Terms},
  booktitle = ALT,
  year = {1999},
  volume = {1720},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {169--181},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{SatoNa07,
  author = {Sato, Issei and Nakagawa, Hiroshi},
  title = {{Bayesian} Document Generative Model with Explicit Multiple Topics},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {421--429},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1044}
}

@INPROCEEDINGS{Sato97,
  author = {Masahiko Sato},
  title = {Classical {B}rouwer-{H}eyting-{K}olmogorov interpretation},
  booktitle = ALT,
  year = {1997},
  volume = {1316},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {176--196},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{SatoMuZh98,
  author = {M. Sato and Y. Mukouchi and D. Zheng},
  title = {Characteristic Sets for Unions of Regular Pattern Languages and Compactness},
  booktitle = ALT,
  year = {1998},
  volume = {1501},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {220--233},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{SatoUm92,
  author = {M. Sato and K. Umayahara},
  title = {Inductive inferability for formal languages from positive data},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1992},
  pages = {84--92},
  publisher = {IOS Press}
}

@INPROCEEDINGS{SatoAk93,
  author = {T. Sato and S. Akiba},
  title = {Inductive resolution},
  booktitle = {International Workshop on Analogical and Inductive Inference and
	International Workshop on Algorithmic Learning Theory},
  year = {1993},
  volume = {744},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {101--110},
  publisher = {Springer-Verlag}
}

@MISC{SatoKa00,
  author = {T. Sato and Y. Kameya},
  title = {A Viterbi-like algorithm and EM learning for statistical abduction},
  year = {2000},
  text = {Sato,T. and Kameya, Y., A Viterbi-like algorithm and EM learning for
	statistical abduction, Proc. of UAI2000 Workshop on Fusion of Domain
	Ifnowlcdgc with Data for Decision Support, 2000.},
  url = {citeseer.nj.nec.com/sato00viterbilike.html}
}

@INPROCEEDINGS{SatoKa97,
  author = {Taisuke Sato and Yoshitaka Kameya},
  title = {PRISM: A Language for Symbolic-Statistical Modeling.},
  booktitle = IJCAI,
  year = {1997},
  pages = {1330-1339},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@INPROCEEDINGS{Satoh98,
  author = {K. Satoh},
  title = {Analysis of Case-Based Representability of Boolean Functions by Monotone
	Theory},
  booktitle = ALT,
  year = {1998},
  volume = {1501},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {179--190},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Saul98,
  author = {Lawrence K. Saul},
  title = {Automatic segmentation of continuous trajectories with invariance
	to nonlinear warpings of time},
  booktitle = ICML,
  year = {1998},
  pages = {506--514},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@ARTICLE{SaulJo99,
  author = {Lawrence K. Saul and Michael I. Jordan},
  title = {Mixed Memory Markov Models: {D}ecomposing Complex Stochastic Processes
	as Mixtures of Simpler Ones},
  journal = {Machine Learning},
  year = {1999},
  volume = {37},
  pages = {75--87},
  number = {1},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{SaulSi96,
  author = {Lawrence K. Saul and Satinder P. Singh},
  title = {Learning curve bounds for a {M}arkov decision process with undiscounted
	rewards},
  booktitle = COLT,
  year = {1996},
  pages = {147--156},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{SaulSi95,
  author = {Lawrence K. Saul and Satinder P. Singh},
  title = {Markov decision processes in large state spaces},
  booktitle = COLT,
  year = {1995},
  pages = {281--288},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{SaundersGaVo98,
  author = {G. Saunders and A. Gammerman and V. Vovk},
  title = {Ridge regression learning algorithm in dual variables},
  booktitle = ICML,
  year = {1998},
  pages = {515--521},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{SSKS07,
  author = {A. K. Saxena and G. V. Sambhu and S. Kaushik and L. V. Subramaniam},
  title = {IITD-IBMIRL System for Question Answering Using Pattern Matching,
	Semantic Type and Semantic Category Recognition},
  booktitle = {TREC},
  year = {2007},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@ARTICLE{SayAk97,
  author = {B. Say and V. Akman},
  title = {Current Approaches to Punctuation in Computational Linguistics},
  journal = {Computers and the Humanities},
  year = {1997},
  volume = {30(6)},
  pages = {457--469}
}

@INPROCEEDINGS{SalustowiczSc98,
  author = {Rafa{\l} Sa{\l}ustowicz and J{\"u}rgen Schmidhuber},
  title = {Evolving structured programs with hierarchical instructions and skip
	nodes},
  booktitle = ICML,
  year = {1998},
  pages = {488--496},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INCOLLECTION{Schutze,
  author = {H. Sch\"{u}tze},
  title = {Towards connectionist lexical semantics},
  booktitle = {The Reality of Linguistic Rules},
  publisher = {John Benjamins},
  editor = {Roberta Corrigan and Gregory K. Iverson and Susan D. Lima},
  address = {Amsterdam; Philadelphia}
}

@INCOLLECTION{Schutze92conn,
  author = {H. Sch\"{u}tze},
  title = {Towards connectionist lexical semantics},
  booktitle = {The Reality of Linguistic Rules},
  publisher = {John Benjamins},
  editor = {Roberta Corrigan and Gregory K. Iverson and Susan D. Lima},
  address = {Amsterdam; Philadelphia}
}

@INPROCEEDINGS{Schutze93a,
  author = {H. Sch\"{u}tze},
  title = {Translation by Confusion},
  booktitle = {Working Notes of the AAAI Spring Symposium on Building Lexicons for
	Machine Translation},
  year = {1993},
  editor = {Bonnie Dorr},
  address = {Stanford CA},
  organization = {AAAI Press}
}

@INCOLLECTION{Schutze93,
  author = {Hinrich Sch\"{u}tze},
  title = {Word Space},
  booktitle = NIPS,
  publisher = {Morgan Kaufman Publishers},
  year = {1993},
  editor = {S. J. Hanson and J. D. Cowan and C. L. Giles},
  pages = {895--902},
  address = {San Mateo CA}
}

@INPROCEEDINGS{Schutze95,
  author = {H. Sch\"{u}tze},
  title = {Distributional Part-of-Speech Tagging},
  booktitle = EACL,
  year = {1995},
  comment = {similarity measures}
}

@INPROCEEDINGS{Schutze94,
  author = {H. Sch\"{u}tze},
  title = {A Connectionist Model of Verb Subcategorization},
  booktitle = CogSci,
  year = {1994},
  address = {Georgia Tech},
  comment = {verbsubcat.ps.Z.}
}

@INPROCEEDINGS{Schutze93b,
  author = {H. Sch\"{u}tze},
  title = {Distributed Syntactic Representations with an Application to Part-of-Speech
	Tagging},
  booktitle = {IEEE International Conference on Neural Networks},
  year = {1993},
  comment = {schuetze.tagging.ps.Z}
}

@INPROCEEDINGS{Schutze93c,
  author = {H. Sch\"{u}tze},
  title = {Part-of-Speech Induction from Scratch},
  booktitle = ACL,
  year = {1993},
  address = {Ohio State University},
  comment = {schuetze.positive.ps.Z}
}

@INPROCEEDINGS{Schutze93d,
  author = {H. Sch\"{u}tze},
  title = {Distributed Syntactic Representations with an Application to Part-of-Speech
	Tagging},
  booktitle = {IEEE International Conference on Neural Networks},
  year = {1993},
  comment = {schuetze.tagging.ps.Z}
}

@INPROCEEDINGS{Schutze92,
  author = {Hinrich Sch\"{u}tze},
  title = {Dimensions of meaning},
  booktitle = {Supercomputing},
  year = {1992},
  pages = {787-796}
}

@INPROCEEDINGS{Schutze92a,
  author = {Hinrich Sch\"{u}tze},
  title = {Context space},
  booktitle = {Working Notes, AAAI Fall Symposium on Probabilistic Approaches to
	Natural Language},
  year = {1992}
}

@INPROCEEDINGS{Schutze92b,
  author = {H. Sch\"{u}tze},
  title = {Dimensions of Meaning},
  booktitle = {Supercomputing},
  year = {1992},
  comment = {schuetze.meaning.ps.Z}
}

@INPROCEEDINGS{Shutze92min,
  author = {H. Sch\"{u}tze},
  title = {Dimensions of Meaning},
  booktitle = {Supercomputing},
  year = {1992},
  comment = {schuetze.meaning.ps.Z}
}

@INPROCEEDINGS{SchutzeHuPe95,
  author = {H. Sch\"{u}tze and D. A. Hull and J. O. Pedersen},
  title = {A Comparison of Classifiers and Document Representations for the
	Routing Problem},
  booktitle = SIGIR,
  year = {1995}
}

@INPROCEEDINGS{SchutzePe93,
  author = {H. Sch\"{u}tze and J. Pedersen},
  title = {A Vector Model for syntagmatic and paradigmatic relatedness},
  booktitle = {Annual Conference of the University of Waterloo Centre for the New
	OED and Text Research},
  year = {1993},
  address = {Oxford, England},
  comment = {hinjan.synpar.ps.Z}
}

@INPROCEEDINGS{SchutzePe95,
  author = {H. Sch\"{u}tze and J. O. Pedersen},
  title = {Information Retrieval Based on Word Senses},
  booktitle = {Fourth Annual Symposium on Document Analysis and Information Retrieval},
  year = {1995},
  address = {Las Vegas NV}
}

@INPROCEEDINGS{SchutzePe94,
  author = {H. Sch\"{u}tze and J. O. Pedersen},
  title = {A Co-occurrence-Based Thesaurus and Two Applications to Information
	Retrieval},
  booktitle = {RIAO},
  year = {1994},
  address = {Rockefeller University}
}

@INPROCEEDINGS{SchutzePeHe95,
  author = {H. Sch\"{u}tze and J. O. Pedersen and M. A. Hearst},
  title = {Xerox {TREC} 3 Report: {C}ombining Exact and Fuzzy Predictors},
  booktitle = TREC,
  year = {1995},
  editor = {D.K. Harman},
  address = {Washington DC},
  publisher = {U.S. Department of Commerce}
}

@INPROCEEDINGS{SchutzeSi94,
  author = {H. Sch\"{u}tze and Y. Singer},
  title = {Part-of-speech tagging using a variable memory markov model},
  booktitle = ACL,
  year = {1994},
  comment = {vartagging.ps.Z}
}

@INPROCEEDINGS{Schabes92,
  author = {Yves Schabes},
  title = {Stochastic lexicalized tree-adjoining grammars},
  booktitle = COLING,
  year = {1992}
}

@ARTICLE{Schaefer99,
  author = {M. Schaefer},
  title = {Deciding the Vapnik-Cervonenkis dimension is ${\Sigma}^p_3$-complete},
  journal = {J. of Comput. Syst. Sci.},
  year = {1999},
  volume = {58},
  pages = {177--182},
  number = {1}
}

@ARTICLE{Schaffer93,
  author = {Cullen Schaffer},
  title = {Bivariate Scientific Function Finding in a Sampled, Real-Data Testbed},
  journal = {Machine Learning},
  year = {1993},
  volume = {12},
  pages = {167--183},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Schaffer93a,
  author = {Cullen Schaffer},
  title = {Overfitting Avoidance as Bias},
  journal = {Machine Learning},
  year = {1993},
  volume = {10},
  pages = {153--178},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Schaffer93b,
  author = {Cullen Schaffer},
  title = {Selecting a Classification Method by Cross-Validation},
  journal = {Machine Learning},
  year = {1993},
  volume = {13},
  pages = {135--143},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{Schapire99,
  author = {Robert E. Schapire},
  title = {Drifting Games},
  booktitle = COLT,
  year = {1999},
  pages = {114--124},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{Schapire99a,
  author = {Robert E. Schapire},
  title = {Theoretical Views of Boosting},
  booktitle = EuroCOLT,
  year = {1999},
  volume = {1572},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {1--10},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Schapire99b,
  author = {Robert E. Schapire},
  title = {Theoretical Views of Boosting and Applications},
  booktitle = ALT,
  year = {1999},
  volume = {1720},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {13--25},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Schapire97,
  author = {Robert E. Schapire},
  title = {Using output codes to boost multiclass learning problems},
  booktitle = ICML,
  year = {1997},
  pages = {313--321},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{Schapire94,
  author = {Robert E. Schapire},
  title = {Learning Probabilistic Read-once Formulas on Product Distributions},
  journal = {Machine Learning},
  year = {1994},
  volume = {14},
  pages = {47--81},
  number = {1},
  annote = {Earlier version in COLT 1991},
  publisher = {Kluwer Academic Publishers, Boston}
}

@BOOK{Schapire92,
  title = {The Design and Analysis of Efficient Learning Algorithms},
  publisher = {{MIT} {P}ress},
  year = {1992},
  author = {R. E. Schapire},
  address = {Cambridge, MA},
  comment = {His PhD thesis in book form. Ph.D was in 1991.}
}

@PHDTHESIS{Schapire91,
  author = {Robert Elias Schapire},
  title = {The Design and Analysis of Efficient Learning Algorithms},
  school = {MIT EECS Department},
  year = {1991},
  month = Feb,
  note = {(MIT Laboratory for Computer Science Technical ReportMIT/LCS/TR-493;
	reprinted by MIT Press.)}
}

@INPROCEEDINGS{Schapire91b,
  author = {Schapire, Robert E.},
  title = {Learning Probabilistic Read-Once Formulas on ProductDistributions},
  booktitle = COLT,
  year = {1991},
  pages = {184--198},
  address = {Santa Cruz, California},
  month = Aug
}

@INPROCEEDINGS{Schapire89b,
  author = {Schapire, R. E.},
  title = {Pattern Languages are Not Learnable},
  booktitle = COLT,
  year = {1990},
  pages = {122--129},
  publisher = {Morgan Kaufmann},
  tag = {TOC-display}
}

@ARTICLE{Schapire90,
  author = {Schapire, R. E.},
  title = {The Strength of Weak Learnability},
  journal = {Machine Learning},
  year = {1990},
  volume = {5},
  pages = {197--227},
  number = {2},
  tag = {TOC-display}
}

@INPROCEEDINGS{Schapire89,
  author = {Schapire, Robert E.},
  title = {The Strength of Weak Learnability},
  booktitle = FOCS,
  year = {1989},
  address = {Research Triangle Park, North Carolina},
  month = Oct,
  tag = {TOC-display}
}

@MASTERSTHESIS{Schapire88,
  author = {Schapire, Robert E.},
  title = {Diversity-Based Inference of Finite Automata},
  school = {MIT Lab.\ for Computer Science},
  year = {1988},
  month = may,
  note = {Technical Report MIT/LCS/TR-413},
  tag = {TOC-display}
}

@ARTICLE{SchapireFrBaLe98,
  author = {R. E. Schapire and Y. Freund and P. Bartlett and W. S. Lee},
  title = {Boosting the margin: A new explanation for the effectiveness of voting
	methods},
  journal = {Annals of Statistics},
  year = {1998},
  volume = {26(5)},
  pages = {1651-1686}
}

@INPROCEEDINGS{SFBL97,
  author = {Robert E. Schapire and Yoav Freund and Peter Bartlett and Wee Sun
	Lee},
  title = {Boosting the margin: a new explanation for the effectiveness of voting
	methods},
  booktitle = ICML,
  year = {1997},
  pages = {322--330},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{SchapireSe96,
  author = {Robert E. Schapire and Linda M. Sellie},
  title = {Learning sparse multivariate polynomials over a field with queries
	and counterexamples},
  journal = {J. of Comput. Syst. Sci.},
  year = {1996},
  volume = {52},
  pages = {201--213},
  number = {2},
  note = {Earlier version in 6th COLT, 1993}
}

@ARTICLE{SchapireSi00,
  author = {Robert E. Schapire and Yoram Singer},
  title = {BoosTexter: {A} Boosting-based System for Text Categorization},
  journal = {Machine Learning},
  year = {2000},
  volume = {39},
  pages = {135--168},
  number = {2/3},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{SchapireSi99,
  author = {Robert E. Schapire and Yoram Singer},
  title = {Improved Boosting Algorithms Using Confidence-rated Predictions},
  journal = {Machine Learning},
  year = {1999},
  volume = {37},
  pages = {297--336},
  number = {3},
  comment = {first in 11th COLT '98},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{SchapireWa96,
  author = {Robert E. Schapire and Manfred K. Warmuth},
  title = {On the Worst-Case Analysis of Temporal-Difference Learning Algorithms},
  journal = {Machine Learning},
  year = {1996},
  volume = {22},
  pages = {95--121},
  number = {1/2/3},
  annote = {Earlier version in 11th ML conference, 1994},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Schatz97,
  author = {Schatz, R. B.},
  title = {Information Retrieval in Digital Libraries: Bringing Search to the
	Net},
  journal = {Science},
  year = {1997},
  volume = {275},
  pages = {273--444},
  month = {Jan}
}

@INPROCEEDINGS{SchefferGrDa97,
  author = {Tobias Scheffer and Russell Greiner and Christian Darken},
  title = {Why experimentation can be better than Perfect Guidance},
  booktitle = ICML,
  year = {1997},
  pages = {331--339},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{SchefferJo99,
  author = {Tobias Scheffer and Thorsten Joachims},
  title = {Expected error analysis for model selection},
  booktitle = ICML,
  year = {1999},
  pages = {361--370},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{SchiehlenSp07,
  author = {Schiehlen, Michael and Spranger, Kristina},
  title = {Global Learning of Labeled Dependency Trees},
  booktitle = {CoNLL Shared Task Session of EMNLP-CoNLL},
  year = {2007},
  pages = {1156--1160},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1127}
}

@INCOLLECTION{Schirra99,
  author = {S. Schirra},
  title = {Robustness Issuess},
  booktitle = {Handbook of Computational Geometry},
  publisher = {Elsevier Science Publishers B. V. North-Holland},
  year = {1999},
  editor = {J.-R. Sack and J. Urrutia},
  address = {Amsterdam},
  note = {to appear}
}

@INBOOK{SANU97,
  chapter = {20},
  pages = {353--362},
  title = {A comparison of {RBF} and {MLP} networks for classification of biomagnetic
	fields},
  publisher = {MIT Press},
  year = {1997},
  author = {Martin F. Schlang and Klaus Abraham-Fuchs and Ralph Neuneier and
	Johann Uebler},
  volume = {IV: Making Learning Systems Practical},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@ARTICLE{SchlimmerGr86,
  author = {Jeffrey C. Schlimmer and Jr. Richard H. Granger},
  title = {Incremental Learning from Noisy Data},
  journal = {Machine Learning},
  year = {1986},
  volume = {1},
  pages = {317--354},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INCOLLECTION{Schmid94,
  author = {H. Schmid},
  title = {Part-of-Speech Tagging with Neural Networks},
  booktitle = COLING,
  year = {1994},
  pages = {172-176}
}

@INPROCEEDINGS{Schmidhuber95,
  author = {J{\"u}rgen Schmidhuber},
  title = {Discovering solutions with low {K}olmogorov complexity and high generalization
	capability},
  booktitle = ICML,
  year = {1995},
  pages = {488--496},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{SchmidhuberZhWi97,
  author = {J{\"u}rgen Schmidhuber and Jieyu Zhao and Marco Wiering},
  title = {Shifting inductive bias with success-story algorithm, adaptive {L}evin
	search, and incremental self-improvement},
  journal = {Machine Learning},
  year = {1997},
  volume = {28},
  pages = {105--130},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{SchmidtLi96,
  author = {William C. Schmidt and Charles X. Ling},
  title = {A Decision-Tree Model of Balance Scale Development},
  journal = {Machine Learning},
  year = {1996},
  volume = {24},
  pages = {203--229},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Schmitt99,
  author = {Michael Schmitt},
  title = {On the Sample Complexity for Nonoverlapping Neural Networks},
  journal = {Machine Learning},
  year = {1999},
  volume = {37},
  pages = {131--141},
  number = {2},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{Schmitt98,
  author = {M. Schmitt},
  title = {On the Sample Complexity for Neural Trees},
  booktitle = ALT,
  year = {1998},
  volume = {1501},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {375--384},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{SKRK07,
  author = {Schneider, Gerold and Kaljurand, Kaarel and Rinaldi, Fabio and Kuhn,
	Tobias},
  title = {{Pro3Gres} Parser in the {CoNLL} Domain Adaptation Shared Task},
  booktitle = {CoNLL Shared Task Session of EMNLP-CoNLL},
  year = {2007},
  pages = {1161--1165},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1128}
}

@INPROCEEDINGS{SWMR99,
  author = {Jeff Schneider and Weng-Keen Wong and Andrew Moore and Martin Riedmiller},
  title = {Distributed value functions},
  booktitle = ICML,
  year = {1999},
  pages = {371--378},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{SchneiderBoMo98,
  author = {Jeff G. Schneider and Justin A. Boyan and Andrew W. Moore},
  title = {Value function based production scheduling},
  booktitle = ICML,
  year = {1998},
  pages = {522--530},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{Schneiderman00a,
  author = {Schneiderman, H. and Kanade, T.},
  title = {A Statistical Method for {3D} Object Detection Applied to Faces and
	Cars},
  booktitle = CVPR,
  year = {2000},
  volume = {1},
  pages = {746-751}
}

@BOOK{ScholkopfSm01,
  title = {Learning with Kernels: Support Vector Machines, Regularization, Optimization,
	and Beyond},
  publisher = {MIT Press},
  year = {2001},
  author = {Bernhard Scholkopf and Alexander J. Smola},
  address = {Cambridge, MA, USA}
}

@ARTICLE{SDJKTV01,
  author = {Matthias Schonlau and William DuMouchel and Wen-Hua Ju and Alan F.
	Karr and Martin Theus and Yehuda Vardi},
  title = {Computer Intrusion: Detecting Masquerades},
  journal = {Statistical Science},
  year = {2001},
  volume = {16},
  pages = {58--74},
  number = {1}
}

@ARTICLE{SchraudolphBe92,
  author = {Nicol N. Schraudolph and Richard K. Belew},
  title = {Dynamic Parameter Encoding for Genetic Algorithms},
  journal = {Machine Learning},
  year = {1992},
  volume = {9},
  pages = {9--21},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INCOLLECTION{Schubert86,
  author = {L. K. Schubert},
  title = {From English to Logic: Contex-Free Computation of 'Conventional'
	Logical Translations},
  booktitle = {Natural Language Processing},
  publisher = {Kaufmann},
  year = {1986},
  editor = {B. J. Grosz and K. {Sparck Jones} and B. L. Webber},
  address-local = {Los Altos, CA},
  keywords = {ling, n-l-p}
}

@INCOLLECTION{Schubert:86,
  author = {L. K. Schubert},
  title = {From English to Logic: Contex-Free Computation of 'Conventional'
	Logical Translations},
  booktitle = {Natural Language Processing},
  publisher = {Kaufmann},
  year = {1986},
  editor = {B. J. Grosz and K. {Sparck Jones} and B. L. Webber},
  address = {Los Altos, CA},
  keywords = {ling, n-l-p}
}

@INCOLLECTION{SchubertPaTa87,
  author = {Schubert, L.K., M. A. Papalaskaris and J. Taugher},
  title = {Accelerating Deductive Inference: Special methods fortaxonomies,
	colours, and times.},
  booktitle = {The knowledge Frontier: Essays in the Representation ofKnowledge},
  publisher = {Springer Verlag},
  year = {1987},
  editor = {Cercone, N. J. and G. Mccalla}
}

@INPROCEEDINGS{Schuler99,
  author = {Rainer Schuler},
  title = {Universal Distributions and Time-Bounded Kolmogorov Complexity},
  booktitle = STACS,
  year = {1999},
  volume = {1563},
  series = {Lecture Notes in Computer Science},
  pages = {434--443},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Schuler03,
  author = {William Schuler},
  title = {Using Model-Theoretic Semantic Interpretation to Guide Statistical
	Parsing and Word Recognition in a Spoken Language Interface},
  booktitle = ACL,
  year = {2003},
  address = {Sapporo, Japan},
  publisher = {ACL}
}

@INPROCEEDINGS{Schuler02,
  author = {William Schuler},
  title = {Interleaved Semantic Interpretation in Environment-based Parsing},
  booktitle = COLING,
  year = {2002},
  address = {Taipe, Taiwan}
}

@INPROCEEDINGS{SchulerMi05,
  author = {William Schuler and Tim Miller},
  title = {Integrating Denotational Meaning into a DBN Language Model},
  booktitle = {Eurospeech/Interspeech},
  year = {2005},
  address = {Lisbon, Portugal}
}

@ARTICLE{Schuurmans97,
  author = {Dale Schuurmans},
  title = {Characterizing Rational Versus Exponential Learning Curves},
  journal = {J. Comput. Syst. Sci.},
  year = {1997},
  volume = {55},
  pages = {140--160},
  number = {1},
  note = {First appeared in EuroCOLT '95}
}

@INBOOK{SchuurmansGr97,
  chapter = {10},
  title = {Fast Distribution-Specific Learning},
  publisher = {MIT Press},
  year = {1997},
  author = {Dale Schuurmans and Russell Greiner},
  booktitle = {Computational Learning Theory and Natural Learning Systems IV: Making
	Learning Systems Practical}
}

@INBOOK{SchuurmansGr97a,
  chapter = {6},
  pages = {87--105},
  title = {Learning to Classify Incomplete Examples},
  publisher = {MIT Press},
  year = {1997},
  author = {Dale Schuurmans and Russell Greiner},
  booktitle = {Computational Learning Theory and Natural Learning Systems IV: Making
	Learning Systems Practical}
}

@INPROCEEDINGS{SchuurmansGr95,
  author = {Dale Schuurmans and Russell Greiner},
  title = {Practical {PAC} Learning},
  booktitle = IJCAI,
  year = {1995},
  addres = {Montreal}
}

@INPROCEEDINGS{SchuurmansGr95a,
  author = {Dale Schuurmans and Russell Greiner},
  title = {Sequential {PAC} learning},
  booktitle = COLT,
  year = {1995},
  pages = {377--384},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{SchuurmansGr94,
  author = {Dale Schuurmans and Russell Greiner},
  title = {Learning Default Concepts},
  booktitle = {Canadian Conference on Artificial Intelligence},
  year = {1994},
  pages = {519--523}
}

@INPROCEEDINGS{SchuurmansUnFo97,
  author = {Dale Schuurmans and Lyle H. Ungar and Dean P. Foster},
  title = {Characterizing the generalization performance of model selection
	strategies},
  booktitle = ICML,
  year = {1997},
  pages = {340--348},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{SchwankeHa94,
  author = {Robert W. Schwanke and Stephen Jose{\'e} Hanson},
  title = {Using neural networks to modularize software},
  journal = {Machine Learning},
  year = {1994},
  volume = {15},
  pages = {137--168},
  number = {2}
}

@INPROCEEDINGS{SchwartzDiHe07,
  author = {Schwartz, Ariel and Divoli, Anna and Hearst, Marti},
  title = {Multiple Alignment of Citation Sentences with Conditional Random
	Fields and Posterior Decoding},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {847--857},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1089}
}

@INPROCEEDINGS{SchwartzHoHu89,
  author = {D. B. Schwartz and R. E. Howard and W. E. Hubbard},
  title = {Adaptive Neural Networks Using {MOS} Charge Storage},
  booktitle = NIPS,
  year = {1989},
  pages = {761--768}
}

@INPROCEEDINGS{SchwenkR.R.07,
  author = {Schwenk, Holger and R. Costa-jussa, Marta and R. Fonollosa, Jose
	A.},
  title = {Smooth Bilingual $N$-Gram Translation},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {430--438},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1045}
}

@INPROCEEDINGS{Schafer-Richter86,
  author = {G. Sch{\"a}fer-Richter},
  title = {Some Results in the Theory of Effective Program Synthesis - Learning
	by Defective Information},
  booktitle = {International Spring School on Mathematical Methods of Specification
	and Synthesis of Software Systems},
  year = {1986},
  volume = {215},
  series = {Lecture Notes in Computer Science},
  pages = {219--225}
}

@ARTICLE{ScottMa93,
  author = {Paul D. Scott and Shaul Markovitch},
  title = {Experience Selection and Problem Choice in an Exploratory Learning
	System},
  journal = {Machine Learning},
  year = {1993},
  volume = {12},
  pages = {49--67},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{ScottFi08,
  author = {R. M. Scott and C. Fisher},
  title = {2-year-olds use distributional cues to interpret transitivity-alternating
	verbs},
  journal = {Language and Cognitive Processes},
  year = {2008}
}

@INPROCEEDINGS{ScottMa99,
  author = {Sam Scott and Stan Matwin},
  title = {Feature engineering for text classification},
  booktitle = ICML,
  year = {1999},
  pages = {379--388},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{Sebag96,
  author = {Michele Sebag},
  title = {Delaying the choice of bias: a disjunctive version space approach},
  booktitle = ICML,
  year = {1996},
  pages = {444--452},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{Sebag94,
  author = {Mich{\`e}le Sebag},
  title = {A constraint-based induction algorithm in {FOL}},
  booktitle = ICML,
  year = {1994},
  pages = {275--283},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{SebagRo00,
  author = {M. Sebag and C. Rouveirol},
  title = {Resource-bounded Relational Reasoning: Induction and Deduction Through
	Stochastic Matching},
  journal = {Machine Learning},
  year = {2000},
  volume = {38},
  pages = {41--62},
  number = {1/2},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{SebagRo99,
  author = {Sebag, M. and C. Rouveirol},
  title = {Any-time Relational Reasoning: Resource-Bounded Induction and Deduction
	through Stochastic Matching},
  journal = {Machine Learning},
  year = {1999},
  volume = {35},
  pages = {147--164}
}

@INPROCEEDINGS{SebagRo97,
  author = {M. Sebag and C. Rouveirol},
  title = {Tractable induction and classification in FOL},
  booktitle = IJCAI,
  year = {1997},
  pages = {888--892}
}

@ARTICLE{Sebastiani02,
  author = {F. Sebastiani},
  title = {Machine learning in automated text categorization},
  journal = {ACM Computing Surveys},
  year = {2002},
  volume = {34},
  pages = {1--47},
  number = {1},
  url = {http://www.math.unipd.it/~fabseb60/Publications/ACMCS02.pdf}
}

@INPROCEEDINGS{Seginer07,
  author = {Seginer, Yoav},
  title = {Fast Unsupervised Incremental Parsing},
  booktitle = ACL,
  year = {2007},
  pages = {384--391},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1049}
}

@ARTICLE{SegreElRu91,
  author = {Alberto Segre and Charles Elkan and Alexander Russell},
  title = {A Critical Look at Experimental Evaluations of {EBL}},
  journal = {Machine Learning},
  year = {1991},
  volume = {6},
  pages = {183--195},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INCOLLECTION{Seidel93,
  author = {R. Seidel},
  title = {Backwards Analysis of Randomized Geometric Algorithms},
  booktitle = {New Trends in Discrete and Computational Geometry},
  publisher = {Springer-Verlag},
  year = {1993},
  editor = {J. Pach},
  volume = {10},
  series = {Algorithms and Combinatorics},
  pages = {37--68},
  keywords = {survey paper, randomized algorithms, backwards analysis, Delaunay
	triangulation, segment intersection, convex hull, quicksort, linear
	programming}
}

@ARTICLE{Seidel91,
  author = {R. Seidel},
  title = {A simple and fast incremental randomized algorithm for computing
	trapezoidal decompositions and for triangulating polygons},
  journal = CGTA,
  year = {1991},
  volume = {1},
  pages = {51--64}
}

@ARTICLE{SeidelAr96,
  author = {R. Seidel and C. R. Aragon},
  title = {Randomized search trees},
  journal = {Algorithmica},
  year = {1996},
  volume = {16},
  pages = {464--497}
}

@ARTICLE{SHJCMV94,
  author = {C. M. Seifert and K. J. Hammond and H. M. Johnson and T. M. Converse
	and T. F. Mcdoughal and S. W. Vanderstoep},
  title = {Case-Based Learning: Predictive Features in Indexing},
  journal = {Machine Learning},
  year = {1994},
  volume = {16},
  pages = {37--56},
  number = {1/2},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{SejnowskiDaMo95,
  author = {Terrence J. Sejnowski and Peter Dayan and P. Read Montague},
  title = {Predictive {H}ebbian learning},
  booktitle = COLT,
  year = {1995},
  pages = {15--18},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{SejnowskiRo87,
  author = {Sejnowski, Terrence J. and Charles R. Rosenberg},
  title = {Parallel Networks that Learn to Pronounce English Text},
  journal = {Journal of Complex Systems},
  year = {1987},
  volume = {1},
  pages = {145--168},
  number = {1},
  month = Feb,
  comment = {Classic paper covering the NETtalk system, which learns to convert
	English text to speech.}
}

@INPROCEEDINGS{Sekine06,
  author = {S. Sekine},
  title = {On-Demand Information Extraction},
  booktitle = ACL,
  year = {2006},
  pages = {731--738}
}

@UNPUBLISHED{SelfCh,
  author = {Self, Matthew and Cheeseman, Peter C.},
  title = {Bayesian Prediction for Artificial Intelligence},
  note = {(unpublished manuscript)}
}

@INPROCEEDINGS{SellisRoFa87,
  author = {T. Sellis and N. Roussopoulos and C. Faloutsos},
  title = {The {$\rm R^+$}-tree: {A} dynamic index for multi-dimensional objects},
  booktitle = {VLDB},
  year = {1987},
  pages = {507--517}
}

@PHDTHESIS{Selman90,
  author = {Selman, B.},
  title = {Tractable Default Reasoning},
  school = {Department of Computer Science, University of Toronto},
  year = {1990}
}

@INPROCEEDINGS{SelmanKa91a,
  author = {Selman, B. and H. Kautz},
  title = {Knowledge Compilation using Horn Approximations},
  booktitle = AAAI,
  year = {1991}
}

@ARTICLE{SelmanKa90,
  author = {Selman, B. and H. Kautz},
  title = {Model-Preference Default Theories},
  journal = {Artificial Intelligence},
  year = {1990},
  volume = {45},
  pages = {287--322}
}

@INPROCEEDINGS{SelmanLe90,
  author = {Selman, B. and H. Levesque},
  title = {Abductive and default reasoning: A computational core},
  year = {1990},
  journal = {Proceedings of AAAI-90}
}

@INPROCEEDINGS{SelmanLe89,
  author = {Selman, B. and H. Levesque},
  title = {The Tractability of Path-Based Inheritance},
  year = {1989},
  journal = {Proceedings of IJCAI-89}
}

@INPROCEEDINGS{SempereNa98,
  author = {J. M. Sempere and G. Nagaraja},
  title = {Learning a subclass of linear languages from positive structural
	information},
  booktitle = {International Workshop on Algorithmic Learning},
  year = {1998},
  volume = {1433},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {162--174},
  publisher = {Springer-Verlag}
}

@ARTICLE{Servan-SchreiberClMc91,
  author = {David Servan-Schreiber and Axel Cleeremans and James L. Mcclelland},
  title = {Graded State Machines: The Representation of Temporal Contingencies
	in Simple Recurrent Networks},
  journal = {Machine Learning},
  year = {1991},
  volume = {7},
  pages = {161--193},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Servedio00,
  author = {Rocco A. Servedio},
  title = {Computational Sample Complexity and Attribute-Efficient Learning},
  journal = {J. of Comput. Syst. Sci.},
  year = {2000},
  volume = {60},
  pages = {161--178},
  number = {1}
}

@INPROCEEDINGS{Servedio00a,
  author = {Rocco A. Servedio},
  title = {{PAC} Analogues of Perceptron and Winnow via Boosting the Margin},
  booktitle = COLT,
  year = {2000},
  pages = {148--157},
  publisher = {Morgan Kaufmann, San Francisco}
}

@INPROCEEDINGS{Servedio99,
  author = {Rocco A. Servedio},
  title = {On {PAC} learning using winnow, perceptron, and a perceptron-like
	algorithm},
  booktitle = COLT,
  year = {1999},
  pages = {296--307},
  publisher = {ACM Press, New York, NY}
}

@INBOOK{Seshu94,
  chapter = {8},
  pages = {213--247},
  title = {Binary decision trees and an 'average-case' model for concept learning:
	implications for feature construction and the study of bias},
  publisher = {MIT Press},
  year = {1994},
  author = {Raj Seshu},
  volume = {I: Constraints and Prospects},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@INPROCEEDINGS{SetiawanKaLi07,
  author = {Setiawan, Hendra and Kan, Min-Yen and Li, Haizhou},
  title = {Ordering Phrases with Function Words},
  booktitle = ACL,
  year = {2007},
  pages = {712--719},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1090}
}

@INPROCEEDINGS{SeungOpSo92,
  author = {H. S. Seung and M. Opper and H. Sompolinsky},
  title = {Query by committee},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1992},
  pages = {287--294},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{ShachamWi07,
  author = {Shacham, Danny and Wintner, Shuly},
  title = {Morphological Disambiguation of {H}ebrew: A Case Study in Classifier
	Combination},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {439--447},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1046}
}

@INPROCEEDINGS{ShachterD'Fa90,
  author = {Ross D. Shachter and Bruce D'Ambrosio and Brendan Del Favero},
  title = {Symbolic Probabilistic Inference in Belief Networks},
  booktitle = {AAAI},
  year = {1990},
  pages = {126-131},
  bibsource = {DBLP, http://dblp.uni-trier.de},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@INPROCEEDINGS{ShachterDAFa90,
  author = {R. D. Shachter and B. D'Ambrosio and B. D. Favero},
  title = {Symbolic Probabilistic Inference in Belief Networks},
  booktitle = AAAI,
  year = {1990},
  pages = {126-131}
}

@INPROCEEDINGS{ShackelfordVo88,
  author = {G. Shackelford and D. Volper},
  title = {Learning $k$-{DNF} with Noise in the Attributes},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1988},
  pages = {97--103},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{Shaffer94,
  author = {Cullen Shaffer},
  title = {A conservation law for generalization performance},
  booktitle = ICML,
  year = {1994},
  pages = {259--265},
  publisher = {Morgan Kaufmann}
}

@UNPUBLISHED{ShafferGa01,
  author = {E. Shaffer and M. Garland},
  title = {Efficient adaptive simplification of massive meshes},
  note = {manuscript},
  year = {2001}
}

@INPROCEEDINGS{Shah07,
  author = {M. Shah},
  title = {Sample compression bounds for decision trees},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {799--806},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@ARTICLE{Shahrokhi90,
  author = {Farhad Shahrokhi and D. W. Matula},
  title = {The Maximum Concurrent Flow Problem},
  journal = jacm,
  year = {1990},
  volume = {37},
  pages = {318-334},
  number = {2},
  month = apr,
  keywords = {Operations Research; Algorithms; Experimentation; Theory; concurrent
	network flow; cut saturation; duality theorems; multicommodity flow;
	network partitioning; polynomial-time approximation scheme; primal-dual
	algorithms; routing in networks; throughput; }
}

@INPROCEEDINGS{Shalev-ShwartzSiSr07,
  author = {S. Shalev-Shwartz and Y. Singer and N. Srebro},
  title = {Pegasos: primal estimated sub-gradient solver for {SVM}},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {807--814},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@ARTICLE{Shamir92,
  author = {Adi Shamir},
  title = {{IP} = {PSPACE}},
  journal = jacm,
  year = {1992},
  volume = {39},
  pages = {869-877},
  number = {4},
  month = oct,
  keywords = {Complexity Theory; Algorithms; Theorem; interactive proofs; IP, PSPACE;}
}

@ARTICLE{Shamir62,
  author = {E. Shamir},
  title = {A remark on discovery algorithms for grammars},
  journal = {Inform. Control},
  year = {1962},
  volume = {5},
  pages = {246--251}
}

@INPROCEEDINGS{ShamirSc95,
  author = {Eli Shamir and Clara Schwartzman},
  title = {Learning by extended statistical queries and its relation to {PAC}
	learning},
  booktitle = EuroCOLT,
  year = {1995},
  pages = {357--366},
  publisher = {Springer-Verlag}
}

@ARTICLE{Shannon49,
  author = {Shannon, Claude},
  title = {Communication theory of secrecy systems},
  journal = {Bell System Technical Journal},
  year = {1949},
  volume = {28},
  pages = {656--715},
  month = Oct
}

@INPROCEEDINGS{Shapiro83a,
  author = {Ehud Shapiro},
  title = {Logic programs with uncertainties: A tool for implementing expert
	systems},
  booktitle = IJCAI,
  year = {1983},
  pages = {529-532},
  publisher = {William Kaufmann}
}

@INPROCEEDINGS{Shapiro81a,
  author = {E. Shapiro},
  title = {A General Incremental Algorithm that Infers Theory from Facts},
  booktitle = IJCAI,
  year = {1981}
}

@BOOK{Shapiro83,
  title = {Algorithmic Program Debugging},
  publisher = {MIT Press},
  year = {1983},
  author = {E. Y. Shapiro},
  address = {Cambridge, MA}
}

@TECHREPORT{Shapiro81,
  author = {Shapiro, Ehud Y.},
  title = {Inductive Inference of Theories From Facts},
  institution = {Yale University Department of Computer Science},
  year = {1981},
  number = {Research Report 192},
  month = Feb,
  comment = {Uses Horn clauses as representation and backtracing as a method to
	discover axiom system for a given set of examples}
}

@ARTICLE{Shapiro71,
  author = {N. Shapiro},
  title = {Review of ``{L}imiting recursion'' by {E.M. Gold} and ``{T}rial and
	error predicates and the solution to a problem of {M}ostowski'' by
	{H. Putnam}},
  journal = {J. Symbolic Logic},
  year = {1971},
  volume = {36},
  pages = {342}
}

@ARTICLE{Shapley71,
  author = {Lloyd S. Shapley},
  title = {Cores of Convex games},
  journal = {International Journal of Game Theory},
  year = {1971},
  volume = {1},
  pages = {11--26},
  number = {1}
}

@ARTICLE{Sharir97,
  author = {M. Sharir},
  title = {A Near-Linear Algorithm for the Planar $2$-Center Problem},
  journal = DCG,
  year = {1997},
  volume = {18},
  pages = {125--134}
}

@ARTICLE{Sharir94,
  author = {M. Sharir},
  title = {On Joints in Arrangements of Lines in Space and Related Problems},
  journal = {J. Comb. Theo.},
  year = {1994},
  volume = {67},
  pages = {89--99},
  number = {1},
  annote = {225}
}

@ARTICLE{Sharir87,
  author = {M. Sharir},
  title = {On shortest paths amidst convex polyhedra},
  journal = SICOMP,
  year = {1987},
  volume = {16},
  pages = {561--572},
  keywords = {shortest paths, polyhedra, convex, Davenport-Schinzel sequences, Voronoi
	diagrams}
}

@BOOK{SharirAg95,
  title = {{Davenport-Schinzel} Sequences and Their Geometric Applications},
  publisher = {Cambridge University Press},
  year = {1995},
  author = {M. Sharir and P. K. Agarwal},
  address = {New York},
  url = {http://us.cambridge.org/titles/catalogue.asp?isbn=0521470250}
}

@ARTICLE{SharirSc86,
  author = {M. Sharir and A. Schorr},
  title = {{On shortest paths in polyhedral spaces}},
  journal = SICOMP,
  year = {1986},
  volume = {15},
  pages = {193--215}
}

@ARTICLE{Sharma00,
  author = {Arun Sharma},
  title = {Editorial},
  journal = {Theoret. Comput. Sci.},
  year = {2000},
  volume = {241},
  pages = {1--2},
  number = {1-2},
  note = {Special issue for ALT '96}
}

@PHDTHESIS{Sharma90,
  author = {A. Sharma},
  title = {Program Size and Teams for Computational Learning},
  school = {SUNY at Buffalo},
  year = {1990}
}

@INPROCEEDINGS{SharmaStVe97,
  author = {Arun Sharma and Frank Stephan and Yuri Ventsov},
  title = {Generalized Notions of Mind Change Complexity},
  booktitle = COLT,
  year = {1997},
  pages = {96--108},
  publisher = {ACM Press, New York, NY}
}

@TECHREPORT{Shastri97,
  author = {Shastri, L},
  title = {Exploiting temporal binding to learn relational rules within a connectionist
	network},
  institution = {International Computer Science Institute},
  year = {1997},
  number = {TR-97-003},
  month = Jun
}

@ARTICLE{Shastry89,
  author = {Shastry, L.},
  title = {Default Reasoning in Semantic Networks: A formalization ofrecognition
	and inheritance},
  journal = {Artificial Intelligence},
  year = {1989},
  volume = {39},
  pages = {331--392},
  number = {3}
}

@BOOK{Shastry88,
  title = {Semantic Networks: An Evidental Formalization and itsConnectionist
	Realization},
  publisher = {Pitman Publishing},
  year = {1988},
  author = {Shastry, L.}
}

@INPROCEEDINGS{ShastryAj90,
  author = {Shastry, L. and V. Ajjanagadde},
  title = {An Optimally Efficient Limited Inference System},
  booktitle = AAAI,
  year = {1990},
  publisher = {Morgan Kaufman}
}

@INPROCEEDINGS{ShatkayKa98,
  author = {Hagit Shatkay and Leslie P. Kaelbling},
  title = {Heading in the right direction},
  booktitle = ICML,
  year = {1998},
  pages = {531--539},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@ARTICLE{Shavlik94,
  author = {Jude Shavlik},
  title = {Combining symbolic and neural learning, extended abstract},
  journal = {Machine Learning},
  year = {1994},
  volume = {14},
  pages = {321--331},
  number = {3}
}

@ARTICLE{Shavlik94a,
  author = {Jude W. Shavlik},
  title = {Combining Symbolic and Neural Learning},
  journal = {Machine Learning},
  year = {1994},
  volume = {14},
  pages = {321--331},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Shavlik90,
  author = {Jude W. Shavlik},
  title = {Acquiring Recursive and Iterative Concepts with Explanation-Based
	Learning},
  journal = {Machine Learning},
  year = {1990},
  volume = {5},
  pages = {39--40},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{ShavlikMoTo91,
  author = {Jude W. Shavlik and Raymond J. Mooney and Geoffrey G. Towell},
  title = {Symbolic and Neural Learning Algorithms: An Experimental Comparison},
  journal = {Machine Learning},
  year = {1991},
  volume = {6},
  pages = {111--143},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{ShawGr75,
  author = {S. W. {Shaw, D} and C. Green},
  title = {Inferring {LISP} programs from example problems},
  booktitle = ICGI,
  year = {1975},
  pages = {260--267},
  organization = {IJCAI}
}

@INPROCEEDINGS{ShawFo94,
  author = {Joseph A. Shaw and Edward A. Fox},
  title = {Combination of Multiple Searches},
  booktitle = TREC,
  year = {1994},
  pages = {243-252}
}

@ARTICLE{Shawe-Taylor99,
  author = {John Shawe-Taylor},
  title = {Introducing the Special Issue of Machine Learning Selected from Papers
	Presented at the 1997 Conference on Computational Learning Theory,
	{COLT}'97},
  journal = {Machine Learning},
  year = {1999},
  volume = {35},
  pages = {191--192},
  number = {3},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{ShawTaylor98,
  author = {J. Shawe-Taylor},
  title = {Classification Accuracy Based on Observed Margin},
  journal = {Algorithmica},
  year = {1998},
  volume = {22},
  pages = {157--172},
  number = {1/2}
}

@INPROCEEDINGS{Shawe-Taylor97,
  author = {John Shawe-Taylor},
  title = {Confidence estimates of classification accuracy on new examples},
  booktitle = EuroCOLT,
  year = {1997},
  pages = {260--271},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Shawe-Taylor95,
  author = {John Shawe-Taylor},
  title = {Sample sizes for sigmoidal neural networks},
  booktitle = COLT,
  year = {1995},
  pages = {258--264},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{SBWA96,
  author = {John Shawe-Taylor and Peter L. Bartlett and Robert C. Williamson
	and Martin Anthony},
  title = {A framework for structural risk minimization},
  booktitle = COLT,
  year = {1996},
  pages = {68--76},
  publisher = {ACM Press, New York, NY}
}

@BOOK{ShawTaylorCh00,
  title = {An Introduction to Support Vector Machines: And Other kernel based
	methods},
  publisher = {Cambridge University Press},
  year = {2000},
  author = {Shawe-Taylor, J. and Christianini, N.},
  month = {March}
}

@INPROCEEDINGS{ShawTaylorCh99b,
  author = {J. Shawe-Taylor and N Christianini},
  title = {Margin Distribution Bounds on Generalization},
  booktitle = EuroCOLT,
  year = {1999},
  volume = {1572},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {263--273},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Shawe-TaylorCr99,
  author = {John Shawe-Taylor and Nello Cristianini},
  title = {Further results on the margin distribution},
  booktitle = COLT,
  year = {1999},
  pages = {278--285},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{Shawe-TaylorWi97,
  author = {John Shawe-Taylor and Robert C. Williamson},
  title = {A {PAC} Analysis of a Bayesian Estimator},
  booktitle = COLT,
  year = {1997},
  pages = {2--9},
  publisher = {ACM Press, New York, NY}
}

@TECHREPORT{Shawe-TaylorAnBi89,
  author = {J. {Shawe-Taylor} and M. Anthony and R. L. Biggs},
  title = {Bounding sample size with the Vapnik-Chervonenkis dimension},
  institution = {University of London, Royal Halloway and New Bedford College},
  year = {1989},
  number = {CSD-TR-618}
}

@INPROCEEDINGS{Shemtov93,
  author = {Hadar Shemtov},
  title = {Text alignment in a tool for translating revised documents},
  booktitle = EACL,
  year = {1993}
}

@ARTICLE{Shen92,
  author = {A. Shen},
  title = {{IP} = {PSPACE}: Simplified Proof},
  journal = jacm,
  year = {1992},
  volume = {39},
  pages = {878-880},
  number = {4},
  month = oct,
  keywords = {Complexity Theory; Theory; interactive proofs; PSPACE; }
}

@INPROCEEDINGS{ShenLa07,
  author = {Shen, Dan and Lapata, Mirella},
  title = {Using Semantic Roles to Improve Question Answering},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {12--21},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1002}
}

@INPROCEEDINGS{ShenSaJo07,
  author = {Shen, Libin and Satta, Giorgio and Joshi, Aravind},
  title = {Guided Learning for Bidirectional Sequence Classification},
  booktitle = ACL,
  year = {2007},
  pages = {760--767},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1096}
}

@INPROCEEDINGS{ShenLiDo05,
  author = {W. Shen and X. Li and A. Doan},
  title = {Constraint-Based Entity Matching},
  booktitle = AAAI,
  year = {2005}
}

@INBOOK{Shen95,
  chapter = {12},
  pages = {225--242},
  title = {Learning finite automata using local distinguishing experiments},
  publisher = {MIT Press},
  year = {1995},
  author = {Wei-Min Shen},
  volume = {III: Selecting Good Models},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@ARTICLE{Shen93,
  author = {Wei-Min Shen},
  title = {Discovery as Autonomous Learning from the Environment},
  journal = {Machine Learning},
  year = {1993},
  volume = {12},
  pages = {143--165},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Shepard87,
  author = {R. Shepard},
  title = {Toward a Universal Law of Generalization for Psychological Science},
  journal = {Science},
  year = {1987},
  volume = {237},
  pages = {1317-1323}
}

@INPROCEEDINGS{SherifKo07,
  author = {Sherif, Tarek and Kondrak, Grzegorz},
  title = {Bootstrapping a Stochastic Transducer for Arabic-English Transliteration
	Extraction},
  booktitle = ACL,
  year = {2007},
  pages = {864--871},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1109}
}

@INPROCEEDINGS{SherifKo07a,
  author = {Sherif, Tarek and Kondrak, Grzegorz},
  title = {Substring-Based Transliteration},
  booktitle = ACL,
  year = {2007},
  pages = {944--951},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1119}
}

@INPROCEEDINGS{ShermerYa95,
  author = {T. C. Shermer and C. K. Yap},
  title = {Probing for near centers and relative roundness},
  booktitle = {ASME Workshop on Tolerancing and Metrology},
  year = {1995}
}

@INPROCEEDINGS{ShevchenkoZo98,
  author = {V. N. Shevchenko and N. Yu. Zolotykh},
  title = {Lower Bounds for the Complexity of Learning Half-Spaces with Membership
	Queries},
  booktitle = ALT,
  year = {1998},
  volume = {1501},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {61--71},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{SASV07,
  author = {Shi, Qinfeng and Altun, Yasemin and Smola, Alex and Vishwanathan,
	S.V.N.},
  title = {Semi-{M}arkov Models for Sequence Segmentation},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {640--648},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1067}
}

@INPROCEEDINGS{ShimboHa07,
  author = {Shimbo, Masashi and Hara, Kazuo},
  title = {A Discriminative Learning Model for Coordinate Conjunctions},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {610--619},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1064}
}

@INPROCEEDINGS{ShimizuNa07,
  author = {Shimizu, Nobuyuki and Nakagawa, Hiroshi},
  title = {Structural Correspondence Learning for Dependency Parsing},
  booktitle = {CoNLL Shared Task Session of EMNLP-CoNLL},
  year = {2007},
  pages = {1166--1169},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1129}
}

@ARTICLE{Shimodaira00,
  author = {Shimodaira, H},
  title = {Improving predictive inference un- der covariate shift by weighting
	the log-likelihood func- tion},
  journal = {Journal of Statistical Planning and Inference},
  year = {2000},
  volume = {90},
  key = {227-244}
}

@ARTICLE{ShimojoIc89,
  author = {Shinsuke Shimojo and Shin'ichi Ichikawa},
  title = {Intuitive reasoning about probability: Theoretical and experimental
	analyses of the ``problem of the three prisoners''},
  journal = {Cognition},
  year = {1989},
  volume = {32},
  pages = {1--24}
}

@ARTICLE{Shinohara95,
  author = {Ayumi Shinohara},
  title = {Complexity of computing {V}apnik-{C}hervonenkis dimension and some
	generalized dimensions},
  journal = {Theoret. Comput. Sci.},
  year = {1995},
  volume = {137},
  pages = {129--144},
  number = {1},
  note = {Special Issue for ALT '93}
}

@ARTICLE{ShinoharaMi91,
  author = {A. Shinohara and S. Miyano},
  title = {Teachability in Computational Learning},
  journal = {New Generation Computing},
  year = {1991},
  volume = {8},
  pages = {337--348},
  number = {4}
}

@ARTICLE{Shinohara91,
  author = {T. Shinohara},
  title = {Inductive Inference of Monotonic Formal Systems From Positive Data},
  journal = {New Generation Computing},
  year = {1991},
  volume = {8},
  pages = {371--384},
  number = {4}
}

@INPROCEEDINGS{Shinohara90,
  author = {T. Shinohara},
  title = {Inductive inference from positive data is powerful},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1990},
  pages = {97--110},
  publisher = {Morgan Kaufmann},
  annote = {Was also Research Institute of Fundamental Information Science Report
	RIFIS-TR-CS-20}
}

@INPROCEEDINGS{Shinohara86,
  author = {T. Shinohara},
  title = {Some Problems on Inductive Inference from Positive Data},
  booktitle = {International Spring School on Mathematical Methods of Specification
	and Synthesis of Software Systems},
  year = {1986},
  volume = {215},
  series = {Lecture Notes in Computer Science},
  pages = {41--58}
}

@PHDTHESIS{Shinohara86a,
  author = {T. Shinohara},
  title = {Studies on Inductive Inference from Positive Data},
  school = {Kyushu University, Kyushu, Japan},
  year = {1986}
}

@INPROCEEDINGS{Shinohara82,
  author = {T. Shinohara},
  title = {Polynomial Time Inference of Extended Regular Pattern Languages},
  booktitle = {RIMS Symposium on Software Science and Engineering},
  year = {1982},
  volume = {147},
  series = {Lecture Notes in Computer Science},
  pages = {115--127},
  publisher = {Springer Verlag}
}

@UNPUBLISHED{Shinohara82a,
  author = {T. Shinohara},
  title = {Polynomial time inference of pattern languages and its applications},
  note = {Proc. 7th IBM Symposium on Mathematical Foundations of Computer Science},
  year = {1982}
}

@INCOLLECTION{ShinoharaAr95,
  author = {T. Shinohara and S. Arikawa},
  title = {Pattern Inference},
  booktitle = {Algorithmic Learning for Knowledge-Based Systems},
  publisher = {Springer--Verlag},
  year = {1995},
  volume = {961},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {259--291}
}

@ARTICLE{ShinoharaAr00,
  author = {Takeshi Shinohara and Hiroki Arimura},
  title = {Inductive inference of unbounded unions of pattern languages from
	positive data},
  journal = {Theoret. Comput. Sci.},
  year = {2000},
  volume = {241},
  pages = {191--209},
  number = {1-2},
  note = {Special issue for ALT '96}
}

@INBOOK{ShklarHi97,
  chapter = {3},
  pages = {35--49},
  title = {Imposing bounds on the number of categories for incremental concept
	formation},
  publisher = {MIT Press},
  year = {1997},
  author = {Leon Shklar and Haym Hirsh},
  volume = {IV: Making Learning Systems Practical},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@INPROCEEDINGS{Shmoys99,
  author = {David B. Shmoys},
  title = {Approximation algorithms for clustering problems},
  booktitle = COLT,
  year = {1999},
  pages = {100--101},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{ShoreGr82,
  author = {Shore, John E. and Robert M. Gray},
  title = {Minimum Cross-Entropy Pattern Classification and Cluster Analysis},
  journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence},
  year = {1982},
  volume = {PAMI-4},
  pages = {11--17},
  number = {1},
  month = Jan,
  comment = {Uses minimum cross-entropy distribution to derive variation on nearest-neighbor
	classification rules.}
}

@ARTICLE{ShoreJo81,
  author = {Shore, John E. and Rodney W. Johnson},
  title = {Properties of Cross-Entropy Minimization},
  journal = {IEEE Transactions on Information Theory},
  year = {1981},
  volume = {IT-27},
  pages = {472--482},
  number = {4},
  month = Jul,
  comment = {General overview of properties.}
}

@ARTICLE{ShoreJo80,
  author = {Shore, John E. and Rodney W. Johnson},
  title = {Axiomatic Derivation of the Principle of Maximum Entropy and the
	Principle of Minimum Cross-Entropy},
  journal = {IEEE Transactions on Information Theory},
  year = {1980},
  volume = {IT-26},
  pages = {26--37},
  number = {1},
  month = Jan,
  comment = {Derives maximum entropy principle from principles of uniqueness, invariance
	under coordinate systems, system independence, and subset independence}
}

@ARTICLE{Shrager87,
  author = {Jeff Shrager},
  title = {Theory Change via View Application in Instructionless Learning},
  journal = {Machine Learning},
  year = {1987},
  volume = {2},
  pages = {247--276},
  number = {3},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Shtarkov87,
  author = {Y. M. Shtarkov},
  title = {Univresal sequential Coding of Single Messages},
  journal = {Prob. Pered. Inf.},
  year = {1987},
  volume = {23},
  pages = {175--186}
}

@INBOOK{ShultzBuOs94,
  chapter = {20},
  pages = {347--362},
  title = {A connectionist model of the learning of personal pronouns in {E}nglish},
  publisher = {MIT Press},
  year = {1994},
  author = {Thomas R. Shultz and David Buckingham and Yuriko Oshima-Takane},
  volume = {II: Intersections Between Theory and Experiment},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@ARTICLE{ShultzMaSc94,
  author = {Thomas R. Shultz and Denis Mareschal and William C. Schmidt},
  title = {Modeling Cognitive Development on Balance Scale Phenomena},
  journal = {Machine Learning},
  year = {1994},
  volume = {16},
  pages = {57--86},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Shvaytser90,
  author = {Haim Shvaytser},
  title = {A Necessary Condition for Learning from Positive Examples},
  journal = {Machine Learning},
  year = {1990},
  volume = {5},
  pages = {101--113},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Shvaytser90a,
  author = {Shvaytser, H.},
  title = {Learnable and Nonlearnable Visual Concepts},
  journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence},
  year = {1990},
  volume = {12},
  pages = {459--466},
  number = {5},
  month = May
}

@UNPUBLISHED{Shvaytser88,
  author = {H. Shvaytser},
  title = {Linear manifolds are learnable from positive examples},
  note = {Unpublished manuscript},
  year = {1988}
}

@INPROCEEDINGS{Shvaytser88a,
  author = {H. Shvaytser},
  title = {Non-learnable classes of {B}oolean formulae that are closed under
	variable permutation},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1988},
  pages = {155--166},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{SiegelmannSo95,
  author = {Hava T. Siegelmann and Eduardo D. Sontag},
  title = {On the computational power of neural nets},
  journal = {J. of Comput. Syst. Sci.},
  year = {1995},
  volume = {50},
  pages = {132--150},
  number = {1},
  note = {Earlier version in 5th COLT, 1992}
}

@INPROCEEDINGS{SiklossySy75,
  author = {L. Siklossy and D. Sykes},
  title = {Automatic program synthesis for example problems},
  booktitle = ICGI,
  year = {1975},
  pages = {268--273},
  organization = {IJCAI}
}

@INPROCEEDINGS{Simard92,
  author = {M. Simard and G. Foster and P. Isabelle},
  title = {Using cognates to align sentences in bilingual corpora},
  booktitle = TMI,
  year = {1992}
}

@INPROCEEDINGS{SimardFoIs92,
  author = {M. Simard and G. Foster and P. Isabelle},
  title = {Using cognates to align sentences in bilingual corpora},
  booktitle = TMI,
  year = {1992}
}

@TECHREPORT{Simard95,
  author = {Simard, M. and G. Foster and F. Perrault},
  title = {{TransSearch}: a Bilingual Concordance Tool},
  institution = {CITI},
  year = {1995},
  address = {Laval, Canada}
}

@INCOLLECTION{Simon83a,
  author = {H. A. Simon},
  title = {Why Should Machines Learn?},
  booktitle = {Machine Learning, An Artificial Intelligence Approach},
  publisher = {Tioga},
  year = {1983},
  address = {Palo Alto, California}
}

@ARTICLE{Simon56,
  author = {Simon, Herbert A.},
  title = {Rational Choice and the Structure of the Environment},
  journal = {Psychological Review},
  year = {1956},
  volume = {63},
  pages = {129--138},
  number = {2},
  comment = {Model of a creature with multiple goals (e.g. food, water), in a tree-structured
	environment with limited look-ahead.}
}

@ARTICLE{Simon54,
  author = {Simon, Herbert A.},
  title = {Spurious Correlation: A Causal Interpretation},
  journal = {Journal of the American Statistical Association},
  year = {1954},
  pages = {407--479},
  comment = {Concludes we need a priori assumptions of independence or causality.}
}

@ARTICLE{SimonKo63,
  author = {H. A. Simon and K. Kotovsky},
  title = {Human acquisition of concepts for sequential patterns},
  journal = {Psych. Rev.},
  year = {1963},
  volume = {70},
  pages = {534--546}
}

@ARTICLE{Simon97,
  author = {Hans Ulrich Simon},
  title = {Bounds on the Number of Examples Needed for Learning Functions},
  journal = {{SIAM} J. Comput.},
  year = {1997},
  volume = {26},
  pages = {751--763},
  number = {3},
  note = {first in EuroColt '93}
}

@ARTICLE{Simon96,
  author = {Hans Ulrich Simon},
  title = {General bounds on the number of examples needed for learning probabilistic
	concepts},
  journal = {J. of Comput. Syst. Sci.},
  year = {1996},
  volume = {52},
  pages = {239--254},
  number = {2},
  note = {Earlier version in 6th COLT, 1993}
}

@INPROCEEDINGS{Simon95,
  author = {Hans Ulrich Simon},
  title = {Learning decision lists and trees with equivalence-queries},
  booktitle = EuroCOLT,
  year = {1995},
  number = {904},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {322--336},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Simon93,
  author = {Simon, Hans Ulrich},
  title = {General Bounds on the Number of Examples Needed for Learning Probabilistic
	Concepts},
  booktitle = COLT,
  year = {1993},
  publisher = {{ACM} Press}
}

@INPROCEEDINGS{Simon90,
  author = {H. U. Simon},
  title = {On the number of examples and stages needed for learning decision
	trees},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1990},
  pages = {303--313},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{Simon83,
  author = {Simon, H.~U.},
  title = {A Tight $\Omega (\log\log n)$-Bound on the Time for Parallel RAM's
	to Compute Nondegenerate Boolean Functions},
  booktitle = ICALP,
  year = {1983},
  number = {158},
  series = {Lecture Notes in Computer Science},
  pages = {439--444},
  publisher = {Springer-Verlag}
}

@INCOLLECTION{Simpson88,
  author = {Simpson, Greg B. and Curt Burgess},
  title = {Implications of lexical ambiguity resolution for word recognition},
  booktitle = {Lexical Ambiguity Resolution},
  publisher = {Morgan Kaufman Publishers},
  year = {1988},
  editor = {Small, S. L., G. W. Cotrell and M. K. Tanenhaus},
  pages = {271--288}
}

@INCOLLECTION{SimpsonBu88,
  author = {Simpson, Greg B. and Curt Burgess},
  title = {Implications of lexical ambiguity resolution for word recognition},
  booktitle = {Lexical Ambiguity Resolution},
  publisher = {Morgan Kaufman Publishers},
  year = {1988},
  editor = {Small, S. L., G. W. Cotrell and M. K. Tanenhaus},
  pages = {271--288}
}

@ARTICLE{SinclairJe89,
  author = {Sinclair, Alistair and Mark Jerrum},
  title = {Approximate Counting, Uniform Generation and Rapidly Mixing Markov
	Chains},
  journal = {Information and Computation},
  year = {1989},
  volume = {82},
  pages = {93--133},
  number = {1},
  month = Jul
}

@INPROCEEDINGS{SinghPr96,
  author = {Moninder Singh and Gregory M. Provan},
  title = {Efficient learning of selective {B}ayesian network classifiers},
  booktitle = ICML,
  year = {1996},
  pages = {453--461},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{SinghPr95,
  author = {Moninder Singh and Gregory M. Provan},
  title = {A comparison of inductive algorithms for selective and non-selective
	{B}ayesian classifiers},
  booktitle = ICML,
  year = {1995},
  pages = {497--505},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{SJLS00,
  author = {Satinder Singh and Tommi Jaakkola and Michael L. Littman and Csaba
	Szepesv{\'a}ri},
  title = {Convergence Results for Single-Step On-Policy Reinforcement-Learning
	Algorithms},
  journal = {Machine Learning},
  year = {2000},
  volume = {38},
  pages = {287--308},
  number = {3},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Singh92,
  author = {Satinder Pal Singh},
  title = {Transfer of Learning by Composing Solutions of Elemental Sequential
	Tasks},
  journal = {Machine Learning},
  year = {1992},
  volume = {8},
  pages = {323--339},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{SinghJaJo94,
  author = {Satinder P. Singh and Tommi Jaakkola and Michael I. Jordan},
  title = {Learning without state-estimation in partially observable {M}arkovian
	decision processes},
  booktitle = ICML,
  year = {1994},
  pages = {284--292},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{SinghSu96,
  author = {Satinder P Singh and Richard S. Sutton},
  title = {Reinforcement Learning with Replacing Eligibility Traces},
  journal = {Machine Learning},
  year = {1996},
  volume = {22},
  pages = {123--158},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{SinghYe94,
  author = {Satinder P. Singh and Richard C. Yee},
  title = {Technical note: an upper bound on the loss from approximate optimal-value
	functions},
  journal = {Machine Learning},
  year = {1994},
  volume = {16},
  pages = {227--234},
  number = {3}
}

@ARTICLE{SinghYe94a,
  author = {Satinder P. Singh and Richard C. Yee},
  title = {An Upper Bound on the Loss from Approximate Optimal-Value Functions},
  journal = {Machine Learning},
  year = {1994},
  volume = {16},
  pages = {227--233},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{SABCHP00,
  author = {A. Singhal and S. Abney and M. Bacchiani and M. Collins and D. Hindle
	and F. Pereira},
  title = {{AT\&T} at {TREC-8}},
  booktitle = TREC,
  year = {2000},
  place = {in Voorhees}
}

@INPROCEEDINGS{Singhal00,
  author = {A. Singhal and S. Abney and M. Bacchiani and M. Collins and D. Hindle
	and F. Pereira},
  title = {{AT\&T} at {TREC-8}},
  booktitle = TREC,
  year = {2000},
  place = {in Voorhees}
}

@INPROCEEDINGS{SinglaDo08,
  author = {P. Singla and P. Domingos},
  title = {Lifted First-Order Belief Propagation},
  booktitle = AAAI,
  year = {2008},
  pages = {1094-1099}
}

@ARTICLE{DocClusDS,
  author = {Mark P. Sinka and David W. Corne},
  title = {A large benchmark dataset for web document clustering},
  journal = {Soft Computing Systems: Design, Management and Applications, Frontiers
	in Artificial Intelligence and Applications},
  year = {2002},
  volume = {87},
  pages = {881--890},
  editor = {Abraham, A. and Ruiz-del-Solar, J. and Koeppen, M.}
}

@ARTICLE{SinkaCo02,
  author = {M. P. Sinka and D. W. Corne},
  title = {A large benchmark dataset for web document clustering},
  journal = {Soft Computing Systems: Design, Management and Applications, Frontiers
	in Artificial Intelligence and Applications},
  year = {2002},
  volume = {87},
  pages = {881--890},
  editor = {Abraham, A. and Ruiz-del-Solar, J. and Koeppen, M.}
}

@INPROCEEDINGS{STSD93,
  author = {R. Siromoney and D. G. Thomas and K. G. Subramanian and V. R. Dare},
  title = {Thue systems and {DNA} - a learning algorithm for a subclass},
  booktitle = {International Workshop on Analogical and Inductive Inference and
	International Workshop on Algorithmic Learning Theory},
  year = {1993},
  volume = {744},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {314--327},
  publisher = {Springer-Verlag}
}

@ARTICLE{SisonNuSh00,
  author = {Raymund C. Sison and Masayuki Numao and Masamichi Shimura},
  title = {Multistrategy Discovery and Detection of Novice Programmer Errors},
  journal = {Machine Learning},
  year = {2000},
  volume = {38},
  pages = {157--180},
  number = {1/2},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{SWCD97,
  author = {A. P. Sistla and O. Wolfson and S. Chamberlain and S. Dao},
  title = {Modeling and querying moving objects},
  booktitle = {International Conference Data Engineering},
  year = {1997},
  pages = {422--432}
}

@INPROCEEDINGS{SitharamSt97,
  author = {Meera Sitharam and Timothy Straney},
  title = {Derandomized learning of {B}oolean functions},
  booktitle = ALT,
  year = {1997},
  volume = {1316},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {100--115},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Skalak94,
  author = {David B. Skalak},
  title = {Prototype and feature selection by sampling and random mutation hill
	climbing algorithms},
  booktitle = ICML,
  year = {1994},
  pages = {293--301},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{SlamanSo91,
  author = {T. A. Slaman and R. M. Solovay},
  title = {When oracles do not help},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1991},
  pages = {379--383},
  publisher = {Morgan Kaufmann},
  annote = {Subsumed by {\it Structure of the Degrees of Inferability} in COLT93}
}

@ARTICLE{Sleeman94,
  author = {D. Sleeman},
  title = {Introduction to the Abstracts of the Invited Talks Presented at {ML92}
	Conference in Aberdeen, 1-3 July 1992},
  journal = {Machine Learning},
  year = {1994},
  volume = {14},
  pages = {303--303},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{SHEK90,
  author = {D. Sleeman and H. Hirsh and I. Ellery and {In-Y}ung Kim},
  title = {Extending Domain Theories: Two Case Studies in Student Modeling},
  journal = {Machine Learning},
  year = {1990},
  volume = {5},
  pages = {11--37},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{Sloan88,
  author = {Robert H. Sloan},
  title = {Types of Noise in Data for Concept Learning},
  booktitle = {First Workshop on Computational Learning Theory},
  year = {1988},
  editor = {D. Haussler and L. Pitt},
  pages = {91--96},
  month = aug,
  publisher = {Morgan Kaufmann}
}

@ARTICLE{Sloan95,
  author = {R. H. Sloan},
  title = {Four types of noise in data for {PAC} Learning},
  journal = {Information Processing Letters},
  year = {1995},
  volume = {54},
  pages = {157--162},
  comment = {Earlier version appeared in 1st COLT, 1988}
}

@INPROCEEDINGS{Sloan92,
  author = {R. H. Sloan},
  title = {Corrigendum to {T}ypes of noise in data for concept learning},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1992},
  pages = {450},
  publisher = {ACM Press, New York, NY}
}

@PHDTHESIS{Sloan89,
  author = {R. H. Sloan},
  title = {Computational {L}earning {T}heory: {N}ew {M}odels and {A}lgorithms},
  school = {MIT},
  year = {1989},
  note = {Issued as MIT/LCS/TR-448.}
}

@UNPUBLISHED{Sloan87,
  author = {Sloan, Robert H.},
  title = {Some Notes on {C}hernoff Bounds},
  note = {(Unpublished)},
  year = {1987}
}

@INPROCEEDINGS{SloanTu99,
  author = {Robert H. Sloan and Gy{\"o}rgy Tur{\'a}n},
  title = {On theory revision with queries},
  booktitle = COLT,
  year = {1999},
  pages = {41--52},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{SloanTu97,
  author = {Robert H. Sloan and Gy{\"o}rgy Tur{\'a}n},
  title = {Learning from incomplete boundary queries using split graphs and
	hypergraphs},
  booktitle = EuroCOLT,
  year = {1997},
  number = {1208},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {38--50},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{SloanTu94,
  author = {R. H. Sloan and G. Tur{\'a}n},
  title = {Learning with queries but incomplete information},
  booktitle = COLT,
  year = {1994},
  pages = {237--245},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{SlobinBe82,
  author = {D. I. Slobin and T. G. Bever},
  title = {Children use canonical sentence schemas: A crosslinguistic study
	of word order and inflections},
  journal = {Cognition},
  year = {1982},
  volume = {12},
  pages = {229-265}
}

@ARTICLE{Smadja93,
  author = {Frank Smadja},
  title = {Retrieving collocations from text: {X}tract},
  journal = CL,
  year = {1993},
  volume = {19},
  pages = {143--177},
  number = {1}
}

@INPROCEEDINGS{Smadja92,
  author = {Frank Smadja},
  title = {How to compile a bilingual collocational lexicon automatically},
  booktitle = {AAAI Workshop on Statistically-based Natural Language Processing
	Techniques},
  year = {1992},
  month = {July},
  place = {San Jose, California}
}

@INPROCEEDINGS{Smadja90,
  author = {Frank Smadja and Katheleen McKeown},
  title = {Automatically extracting and representing collocations for language
	generation},
  booktitle = ACL,
  year = {1990}
}

@INPROCEEDINGS{SmadjaMc90,
  author = {Frank Smadja and Katheleen McKeown},
  title = {Automatically extracting and representing collocations for language
	generation},
  booktitle = ACL,
  year = {1990}
}

@ARTICLE{Smadja96,
  author = {Frank Smadja and Katheleen R. McKeown and Vasileios Hatzivassiloglou},
  title = {Translating collocations for bilingual lexicons: a statistical approach},
  journal = CL,
  year = {1996},
  volume = {22},
  pages = {1--38},
  number = {1}
}

@ARTICLE{SmadjaMcHa96,
  author = {Frank Smadja and Katheleen R. McKeown and Vasileios Hatzivassiloglou},
  title = {Translating collocations for bilingual lexicons: a statistical approach},
  journal = CL,
  year = {1996},
  volume = {22},
  pages = {1--38},
  number = {1}
}

@INCOLLECTION{Smid00,
  author = {M. Smid},
  title = {Closest-Point Problems in computational geometry},
  booktitle = {Handbook of Computational Geometry},
  publisher = {Elsevier Science Publishers B. V. North-Holland},
  year = {2000},
  editor = {J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia},
  pages = {877--935},
  address = {Amsterdam}
}

@ARTICLE{SmidJa99,
  author = {M. Smid and R. Janardan},
  title = {On the Width and Roundness of a Set of Points in the Plane},
  journal = IJCGA,
  year = {1999},
  volume = {9},
  pages = {97--108},
  number = {1},
  url = {http://www.worldscinet.com/ijcga/09/0901/S021819599900008X.html}
}

@INPROCEEDINGS{SmidJa95,
  author = {M. Smid and R. Janardan},
  title = {On the Width and Roundness of a Set of Points in the Plane},
  booktitle = {CCCG},
  year = {1995},
  pages = {193--198}
}

@PHDTHESIS{Smith82,
  author = {Smith, B. C.},
  title = {Reflection and semantics in a procedural language},
  school = {Department of Computer Science, MIT},
  year = {1982}
}

@ARTICLE{Smith82a,
  author = {C. Smith},
  title = {The Power of Pluralism for Automatic Program Synthesis},
  journal = {J. ACM},
  year = {1982},
  volume = {29},
  pages = {1144--1165},
  annote = {Earlier version in FOCS81}
}

@ARTICLE{SmithVe90,
  author = {Carl Smith and Mahendra Velauthapillai},
  title = {On the inference of approximate programs},
  journal = {Theoret. Comput. Sci.},
  year = {1990},
  volume = {77},
  note = {Earlier version in U. of MD. TR 1427, in 1985}
}

@INPROCEEDINGS{SmithVe86,
  author = {C. Smith and M. Velauthapillai},
  title = {On the Inference of Programs Approximately Computing the Desired
	Function},
  booktitle = {International Workshop on Analogical and Inductive Inference},
  year = {1986},
  volume = {265},
  series = {Lecture Notes in Computer Science},
  pages = {164--176},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Smith94,
  author = {C. H. Smith},
  title = {Three decades of team learning},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1994},
  volume = {872},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {211--228},
  publisher = {Springer-Verlag}
}

@PHDTHESIS{Smith79,
  author = {C. H. Smith},
  title = {Hierarchies of {I}dentification {C}riteria for {M}echanized {I}nductive
	{I}nference},
  school = {SUNY Buffalo},
  year = {1979}
}

@TECHREPORT{Smith79a,
  author = {C. H. Smith},
  title = {An inductive inference bibliography},
  institution = {Purdue University Computer Science Dept., CSD TR 323},
  year = {1979}
}

@ARTICLE{SmithGa95,
  author = {Carl H. Smith and William I. Gasarch},
  title = {Recursion theoretic models of learning: some results and intuitions},
  journal = {Annals of Mathematics and Artificial Intelligence},
  year = {1995},
  volume = {15},
  pages = {151--166},
  number = {2}
}

@ARTICLE{SmithWiZe97,
  author = {C. H. Smith and R. Wiehagen and T. Zeugmann},
  title = {Classifying Predicates and Languages},
  journal = {International Journal of Foundations of Computer Science},
  year = {1997},
  volume = {8},
  pages = {15--41}
}

@INPROCEEDINGS{SmithEi07,
  author = {Smith, David A. and Eisner, Jason},
  title = {Bootstrapping Feature-Rich Dependency Parsers with Entropic Priors},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {667--677},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1070}
}

@INPROCEEDINGS{SmithSm07,
  author = {Smith, David A. and Smith, Noah A.},
  title = {Probabilistic Models of Nonprojective Dependency Trees},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {132--140},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1014}
}

@INCOLLECTION{Smith82b,
  author = {D. R. Smith},
  title = {A survey of the synthesis of {LISP} programs from examples},
  booktitle = {Automatic Program Construction Techniques},
  publisher = {MacMillan Co.},
  year = {1982}
}

@TECHREPORT{Smith77,
  author = {D. R. Smith},
  title = {A class of synthesizeable {LISP} programs},
  institution = {Duke University Computer Science Dept., CS-1977-4},
  year = {1977}
}

@INPROCEEDINGS{SmithVaLa07,
  author = {Smith, Noah A. and Vail, Douglas L. and Lafferty, John D.},
  title = {Computationally Efficient M-Estimation of Log-Linear Structure Models},
  booktitle = ACL,
  year = {2007},
  pages = {752--759},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1095}
}

@INPROCEEDINGS{SmithEi05,
  author = {N. Smith and J. Eisner},
  title = {Contrastive Estimation: Training Log-Linear Models on Unlabeled Data},
  booktitle = ACL,
  year = {2005}
}

@ARTICLE{SmolaSc98,
  author = {Alex J. Smola and Bernhard Sch{\"o}lkopf},
  title = {On a Kernel-Based Method for Pattern Recognition, Regression, Approximation,
	and Operator Inversion},
  journal = {Algorithmica},
  year = {1998},
  volume = {22},
  pages = {211--231},
  number = {1/2}
}

@INPROCEEDINGS{SWMS99,
  author = {Alex J. Smola and Robert C. Williamson and Sebastian Mika and Bernhard
	Sch{\"o}lkopf},
  title = {Regularized Principal Manifolds},
  booktitle = EuroCOLT,
  year = {1999},
  volume = {1572},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {214--229},
  publisher = {Springer-Verlag}
}

@PHDTHESIS{Smorodinsky03a,
  author = {S. Smorodinsky},
  title = {Combinatorial Problems in Computational Geometry},
  school = {School of Computer Science},
  year = {2003},
  url = {http://www.math.tau.ac.il/~shakhar/my_papers/phd.ps.gz}
}

@INPROCEEDINGS{Smotrovs97,
  author = {Juris Smotrovs},
  title = {Closedness properties in team learning of recursive functions},
  booktitle = EuroCOLT,
  year = {1997},
  pages = {79--93},
  publisher = {Springer-Verlag}
}

@INBOOK{Smyth95,
  chapter = {9},
  pages = {163--182},
  title = {Learning with probabilistic supervision},
  publisher = {MIT Press},
  year = {1995},
  author = {Padhraic Smyth},
  volume = {III: Selecting Good Models},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@INBOOK{Smyth94,
  chapter = {15},
  pages = {233--248},
  title = {Probability density estimation and local basis function neural networks},
  publisher = {MIT Press},
  year = {1994},
  author = {Padhraic Smyth},
  volume = {II: Intersections Between Theory and Experiment},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@INPROCEEDINGS{SmythGrFa95,
  author = {Padhraic Smyth and Alexander Gray and Usama M. Fayyad},
  title = {Retrofitting decision tree classifiers using kernel density estimation},
  booktitle = ICML,
  year = {1995},
  pages = {506--514},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{SmythWo99,
  author = {Padhraic Smyth and David Wolpert},
  title = {Linearly Combining Density Estimators via Stacking},
  journal = {Machine Learning},
  year = {1999},
  volume = {36},
  pages = {59--83},
  number = {1/2},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{SnepscheutSw89,
  author = {Jan L. A. van de Snepscheut and Johan B. Swenker},
  title = {On the Design of Some Systolic Algorithms},
  journal = jacm,
  year = {1989},
  volume = {36},
  pages = {826-840},
  number = {4},
  month = oct,
  keywords = {Distributed Computing; Computer Systems Organization; Software; Theory
	of Computation; concurrent assignment statement; design; heuristics;
	programming methods; systolic algorithms; systolic arrays; }
}

@INPROCEEDINGS{SnowJuNg06,
  author = {Snow, R. and Jurafsky, D. and Ng, A. Y. },
  title = {Semantic taxonomy induction from heterogenous evidence},
  booktitle = ACL,
  year = {2006},
  pages = {801--808},
  address = {Morristown, NJ, USA},
  publisher = {Association for Computational Linguistics},
  doi = {http://dx.doi.org/http://dx.doi.org/10.3115/1220175.1220276},
  url = {http://dx.doi.org/http://dx.doi.org/10.3115/1220175.1220276}
}

@INPROCEEDINGS{SnowJuNg06a,
  author = {Snow, R. and Jurafsky, D. and Ng, A. Y. },
  title = {Semantic taxonomy induction from heterogenous evidence},
  booktitle = {ACL},
  year = {2006},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@INPROCEEDINGS{SnowJuNg05,
  author = {R. Snow and D. Jurafsky and A. Y. Ng},
  title = {Learning syntactic patterns for automatic hypernym discovery},
  booktitle = {NIPS},
  year = {2005},
  journal = {NIPS},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@INPROCEEDINGS{SOJN08,
  author = {Snow, Rion and O'Connor, Brendan and Jurafsky, Daniel and Ng, Andrew
	
	},
  title = {Cheap and Fast -- But is it Good? Evaluating Non-Expert Annotations
	for Natural Language Tasks},
  booktitle = EMNLP,
  year = {2008},
  pages = {254--263},
  address = {Honolulu, Hawaii},
  month = {October},
  publisher = {Association for Computational Linguistics},
  citeulike-article-id = {3924580},
  keywords = {annotations, natural-language-processing, user-contributed-metadata},
  posted-at = {2009-01-22 17:29:11},
  priority = {3},
  url = {http://www.aclweb.org/anthology-new/D/D08/D08-1027.bib}
}

@INPROCEEDINGS{SPJN07,
  author = {Snow, Rion and Prakash, Sushant and Jurafsky, Daniel and Ng, Andrew
	Y.},
  title = {Learning to Merge Word Senses},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {1005--1014},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1107}
}

@ARTICLE{SnyderStormo95,
  author = {Snyder, E.E. and Stormo, G.D.},
  title = {Identification of Protein Coding Regions in Genomic {DNA}},
  journal = {Journal of Molecular Biology},
  year = {1995},
  volume = {248},
  pages = {1--18}
}

@ARTICLE{Soderland99,
  author = {S. Soderland},
  title = {Learning Information Extraction Rules for Semi-Structured and Free
	Text},
  journal = MLJ,
  year = {1999},
  volume = {34},
  pages = {233--272},
  number = {1-3},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{SoderlandLe94,
  author = {S. Soderland and W. Lehnert},
  title = {Wrap-Up: a trainable discourse module for information extraction},
  journal = JAIR,
  year = {1994},
  volume = {2},
  pages = {131--158}
}

@INPROCEEDINGS{Solan98,
  author = {A. Solan},
  title = {{Cutting cycles of rods in space}},
  booktitle = {SOCG},
  year = {1998},
  pages = {135--142}
}

@ARTICLE{SollaLeFl88,
  author = {S. A. Solla and E. Levin and M. Fleisher},
  title = {Accelerated Learning in Layered Neural Networks},
  journal = {Complex Systems},
  year = {1988},
  volume = {2},
  pages = {625--639}
}

@ARTICLE{Solomonoff97,
  author = {Ray J. Solomonoff},
  title = {The Discovery of Algorithmic Probability},
  journal = {J. Comput. Syst. Sci.},
  year = {1997},
  volume = {55},
  pages = {73--88},
  number = {1},
  note = {First appeared in EuroCOLT '95}
}

@ARTICLE{Solomonoff78,
  author = {R. J. Solomonoff},
  title = {Complexity-based induction systems: comparisons and convergence theorems},
  journal = {IEEE Trans. Inform. Theory},
  year = {1978},
  volume = {IT-24},
  pages = {422--432}
}

@INPROCEEDINGS{Solomonoff75,
  author = {R. J. Solomonoff},
  title = {Inductive inference theory - a unified approach to problems in pattern
	recognition and artificial intelligence},
  booktitle = ICGI,
  year = {1975},
  pages = {274--280},
  publisher = {IJCAI}
}

@ARTICLE{Solomonoff64,
  author = {R. J. Solomonoff},
  title = {A Formal Theory of Inductive Inference: Part 1},
  journal = {Inform. Control},
  year = {1964},
  volume = {7},
  pages = {1--22},
  comment = {Concerned with extrapolation of sequences. Defines probability of
	extension via likelihood random TM program will generate it.}
}

@ARTICLE{Solomonoff64a,
  author = {R. J. Solomonoff},
  title = {A Formal Theory of Inductive Inference: Part 2},
  journal = {Inform. Control},
  year = {1964},
  volume = {7},
  pages = {224--254},
  comment = {Continues Part I. Inference of probabilities and grammars.}
}

@INPROCEEDINGS{SompolinskySeTi91,
  author = {H. Sompolinsky and H. S. Seung and N. Tishby},
  title = {Learning curves in large neural networks},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1991},
  pages = {112--127},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{SompolinskyTiSe90,
  author = {H. Sompolinsky and N. Tishby and H. S. Seung},
  title = {Learning from Examples in Large Neural Networks},
  journal = {Phys. Rev. Lett.},
  year = {1990},
  volume = {65},
  pages = {1683--1686}
}

@INPROCEEDINGS{SongStGo02,
  author = {D.~Song and A. F. van~der Stappen and K.~Goldberg},
  title = {Exact and distributed algorithms for collaborative camera control},
  booktitle = {WAFR},
  year = {2002},
  url = {http://www.ieor.berkeley.edu/~dzsong/pdfs/dez-sharecam-wafr2002-v24.pdf}
}

@INPROCEEDINGS{SongAm01,
  author = {G. Song and N. M. Amato},
  title = {Using motion planning to study protein folding pathways},
  booktitle = {RECOMB},
  year = {2001},
  pages = {287--296},
  annote = {{biology}}
}

@INPROCEEDINGS{SSGB07,
  author = {L. Song and A. Smola and A. Gretton and K. Borgwardt},
  title = {A dependence maximization view of clustering},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {815--822},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{SSGBB07,
  author = {L. Song and A. Smola and A. Gretton and K. Borgwardt and J. Bedo},
  title = {Supervised feature selection via dependence estimation},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {823--830},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@TECHREPORT{Sontag95,
  author = {Eduardo D. Sontag},
  title = {Critical Points for Least-Squares Problems Involving Certain Analytic
	Functions, with Applications to Sigmoidal Nets},
  institution = {Rutgers University, New Brunswick, Department of Mathematics},
  year = {1995},
  number = {Unpublished}
}

@ARTICLE{SontagSu91,
  author = {E. D. Sontag and H. J. Sussmann},
  title = {Back Propagation Separates Where Perceptrons Do},
  journal = {Neural Networks},
  year = {1991},
  volume = {4},
  pages = {243-249},
  number = {3}
}

@ARTICLE{SontagSu89,
  author = {E. D. Sontag and H. J. Sussmann},
  title = {Backpropagation Can Give Rise to Spurious Local Minima Even for Networks
	without Hidden Layers},
  journal = {Complex Systems},
  year = {1989},
  volume = {3},
  pages = {91--106},
  number = {1},
  month = feb,
  annote = {Local Minima in Binary Networks}
}

@BOOK{SoucekSo88,
  title = {Neural and massively parallel computers},
  publisher = {John Wiley and sons},
  year = {1988},
  author = {Soucek, B. and Soucek, M.},
  comment = {QA76.5.s6573, Cabot}
}

@ARTICLE{Silva89,
  author = {Edmundo de Souza e Silva and H. Richard Gail},
  title = {Calculating Availability and Performability Measures of Repairable
	Computer Systems Using Randomization},
  journal = jacm,
  year = {1989},
  volume = {36},
  pages = {171-193},
  number = {1},
  month = jan,
  keywords = {System Modeling and Analysis; Algorithms; Performance; Reliability;
	Markov reward models; near coincident faults; performability distribution;
	performance/reliability measures; randomization technique; transient
	analysis; }
}

@INBOOK{Sowa92,
  chapter = {1 {\em Conceptual Graphs Summary}},
  pages = {3-51},
  title = {Conceptual Structures: Current Research and Practice},
  publisher = {Ellis Horwood},
  year = {1992},
  editor = {T.E. Nagle and J.A. Nagle and L.L. Gerholz and P.W. Eklund},
  author = {J.F. Sowa}
}

@BOOK{Sowa84,
  title = {Conceptual structures in mind and machines},
  publisher = {Addison-Wesley},
  year = {1984},
  author = {J.F. Sowa}
}

@ARTICLE{Specht67,
  author = {D. F. Specht},
  title = {Generation of polynomial discriminant functions for pattern recognition},
  journal = {IEEE Transactions on Electronic Computers},
  year = {1967},
  volume = {EC-16},
  pages = {308--319},
  number = {3}
}

@INPROCEEDINGS{SpeciaStVo07,
  author = {Specia, Lucia and Stevenson, Mark and Volpe Nunes, Maria das Gra\c
	cas},
  title = {Learning Expressive Models for Word Sense Disambiguation},
  booktitle = ACL,
  year = {2007},
  pages = {41--48},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1006}
}

@ARTICLE{SpirkovskaRe94,
  author = {Lilly Spirkovska and Max B. Reid},
  title = {Higher-Order Neural Networks Applied to 2{D} and 3{D} Object Recognition},
  journal = {Machine Learning},
  year = {1994},
  volume = {15},
  pages = {169--199},
  number = {2},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{SDZB07,
  author = {Spitters, Martijn and De Boni, Marco and Zavrel, Jakub and Bonnema,
	Remko},
  title = {Learning to Compose Effective Strategies from a Library of Dialogue
	Components},
  booktitle = ACL,
  year = {2007},
  pages = {792--799},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1100}
}

@INPROCEEDINGS{SporlederLi09,
  author = {Sporleder, C. and Li, L.},
  title = {Unsupervised Recognition of Literal and Non-Literal Use of Idiomatic
	Expressions},
  booktitle = EACL,
  year = {2009},
  pages = {754--762},
  url = {http://www.aclweb.org/anthology/E09-1086}
}

@ARTICLE{SprinkleChCh92,
  author = {S. D. Sprinkle and P. Charles and J. Chepaitis},
  title = {Computing {N}ew {S}olutions},
  journal = {Bobbin},
  year = {1992},
  volume = {July},
  pages = {43-50}
}

@INPROCEEDINGS{SproatHiYa92,
  author = {Sproat, R.~ and Hirschberg, J.~ and Yarowsky, D.~},
  title = {A Corpus-Based Synthesizer},
  booktitle = ICSLP,
  year = {1992},
  pages = {563-566},
  address = {Banff},
  month = {October},
  organization = {ICSLP}
}

@ARTICLE{Sprugnoli92,
  author = {Renzo Sprugnoli},
  title = {The Generation of Binary Trees as a Numerical Problem},
  journal = jacm,
  year = {1992},
  volume = {39},
  pages = {317-327},
  number = {2},
  month = apr,
  keywords = {Data Structures and Algorithms; Algorithms; binary trees; generation
	of binary trees; }
}

@INPROCEEDINGS{SquiresSa95,
  author = {Brett Squires and Claude Sammut},
  title = {Automatic speaker recognition: an application of machine learning},
  booktitle = ICML,
  year = {1995},
  pages = {515--521},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{Srebro03,
  author = {N. Srebro},
  title = {Maximum likelihood bounded tree-width Markov networks},
  journal = AI,
  year = {2003},
  volume = {143},
  pages = {123--138},
  number = {1},
  issn = {0004-3702}
}

@INPROCEEDINGS{SrihariLi99,
  author = {R. Srihari and W. Li},
  title = {Information Extraction Supported Question Answering},
  booktitle = TREC,
  year = {1999}
}

@ARTICLE{Srinivasan96,
  author = {A. Srinivasan and S. Mugleton and R. D. King and M. Sternberg},
  title = {Theories for mutagenicity: a study of first order and feature based
	induction},
  journal = {Artificial Intelligence},
  year = {1996},
  volume = {85(1-2)},
  pages = {277--299}
}

@INPROCEEDINGS{SriperumbudurToLa07,
  author = {B. Sriperumbudur and D. Torres and G. Lanckriet},
  title = {Sparse eigen methods by {D.C.} programming},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {831--838},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@ARTICLE{Stahl95,
  author = {Irene Stahl},
  title = {The Appropriateness of Predicate Invention as Bias Shift Operation
	in {ILP}},
  journal = {Machine Learning},
  year = {1995},
  volume = {20},
  pages = {95--117},
  number = {1/2},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{StanfillWa86,
  author = {Stanfill, C. and D. Waltz},
  title = {Toward memory-based reasoning},
  journal = CACM,
  year = {1986},
  volume = {29},
  pages = {1213--1228},
  number = {12},
  month = Dec
}

@ARTICLE{Stein89,
  author = {Stein, L.A.},
  title = {Skeptical inheritance: Computing the intersection},
  journal = {Proceedings of IJCAI-89},
  year = {1989},
  pages = {1153--1160}
}

@INPROCEEDINGS{Stein98,
  author = {W. Stein},
  title = {Consistent Polynomial Identification in the Limit},
  booktitle = ALT,
  year = {1998},
  volume = {1501},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {424--438},
  publisher = {Springer-Verlag}
}

@ARTICLE{Stephan97,
  author = {Frank Stephan},
  title = {Noisy inference and oracles},
  journal = {Theoret. Comput. Sci.},
  year = {1997},
  volume = {185},
  pages = {129--157},
  number = {1},
  note = {Special issue for ALT '95}
}

@INPROCEEDINGS{Stephan95,
  author = {Frank Stephan},
  title = {Learning via queries and oracles},
  booktitle = COLT,
  year = {1995},
  pages = {162--169},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{StephanTe99,
  author = {F. Stephan and S. A. Terwijn},
  title = {The complexity of universal text-learners},
  journal = {Inform. Comput.},
  year = {1999},
  volume = {154},
  pages = {149--166},
  number = {2}
}

@INPROCEEDINGS{StephanVe98,
  author = {F. Stephan and Y. Ventsov},
  title = {Learning Algebraic Structures from Text Using Semantical Knowledge},
  booktitle = ALT,
  year = {1998},
  volume = {1501},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {321--335},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{StephanZe00,
  author = {Frank Stephan and Thomas Zeugmann},
  title = {Average-Case Complexity of Learning Polynomials},
  booktitle = COLT,
  year = {2000},
  pages = {59--68},
  publisher = {Morgan Kaufmann, San Francisco}
}

@TECHREPORT{StephanZe99,
  author = {F. Stephan and T. Zeugmann},
  title = {Learning Classes of Approximations to Non-Recursive Functions},
  institution = {Department of Informatics, Kyushu University},
  year = {1999},
  number = {DOI-TR-166},
  month = jul
}

@INPROCEEDINGS{StephanZe99a,
  author = {Frank Stephan and Thomas Zeugmann},
  title = {On the Uniform Learnability of Approximations to Non-Recursive Functions},
  booktitle = ALT,
  year = {1999},
  volume = {1720},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {276--290},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{SternHeGr07,
  author = {D. Stern and R. Herbrich and T. Graepel},
  title = {Learning to solve game trees},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {839--846},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INBOOK{SterzingSc95,
  chapter = {7},
  pages = {115--130},
  title = {Recurrent neural networks with time-dependent inputs and outputs},
  publisher = {MIT Press},
  year = {1995},
  author = {Volkmar Sterzing and Bernd Sch{\"u}rmann},
  volume = {III: Selecting Good Models},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@INPROCEEDINGS{StevensonFaNo04,
  author = {S. Stevenson and A. Fazly and R. North},
  title = {Statistical measures of the semi-productivity of light verb constructions},
  booktitle = {ACL Workshop on Multiword Expressions: Integrating Processing},
  year = {2004},
  pages = {1--8}
}

@ARTICLE{Stewart91,
  author = {Bradley S. Stewart and White, III, Chelsea C.},
  title = {Multiobjective A*},
  journal = jacm,
  year = {1991},
  volume = {38},
  pages = {775-814},
  number = {4},
  month = oct,
  keywords = {Artificial Intelligence; Algorithms; Theory; A* multiobjective decisionmaking;}
}

@INCOLLECTION{SteyversGr07,
  author = {M. Steyvers and T. Griffiths},
  title = {Probabilistic Topic Models},
  booktitle = {Handbook of Latent Semantic Analysis},
  publisher = {Lawrence Erlbaum Associates},
  year = {2007},
  editor = {T. Landauer and D. McNamara and S. Dennis and W. Kintsch},
  pages = {427-448}
}

@INPROCEEDINGS{SteyversSmGr04,
  author = {M. Steyvers and P. Smyth and T. Griffiths},
  title = {Probabilistic Author-Topic Models for Information Discovery},
  booktitle = KDD,
  year = {2004}
}

@INCOLLECTION{Stickel89,
  author = {Stickel, M. E.},
  title = {Rationale and methods for abductive reasoning in natural-language
	interpretation},
  booktitle = {Natural Language and Logic},
  publisher = {Lecture notes in AI, 459 Springer-Verlag},
  year = {1989},
  editor = {Studer,. R}
}

@INPROCEEDINGS{StolckeOm94,
  author = {A. Stolcke and S. Omohundro},
  title = {Inducing probabilistic grammars by {B}yasian model merging},
  booktitle = ICGI,
  year = {1994},
  volume = {862},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {106--118},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{StolckeOm93,
  author = {Andreas Stolcke and Stephen Omohundro},
  title = {{H}idden {M}arkov {M}odel Induction by {B}ayesian Model Merging},
  booktitle = NIPS,
  year = {1993},
  publisher = {Morgan Kaufman},
  bookeditor = {C. L. Giles and S. J. Hanson and J. D. Cowan}
}

@PHDTHESIS{Stolfo79,
  author = {S. J. Stolfo},
  title = {Automatic {D}iscovery {H}euristics for {N}ondeterministic {P}rograms
	{F}rom {S}ample {E}xecution {T}races},
  school = {New York University},
  year = {1979}
}

@TECHREPORT{StolfoHa79,
  author = {S. J. Stolfo and M. C. Harrison},
  title = {Automatic discovery of heuristics for nondeterministic programs},
  institution = {New York University Computer Science Dept., No. 7},
  year = {1979}
}

@INPROCEEDINGS{StormoHa94,
  author = {G. D. Stormo and D. Haussler},
  title = {Optimally Parsing a Sequence into Different Classes Based on Multiple
	Types of Information},
  booktitle = {International Conference on Intelligent Systems for Molecular},
  year = {1994},
  pages = {369--375},
  address = {Menlo Park, CA},
  month = aug,
  publisher = {AAAI/MIT Press}
}

@BOOK{Strang86,
  title = {Introduction to Applied Mathematics},
  publisher = {Wellesley-Cambridge Press},
  year = {1986},
  author = {Strang, Gilbert}
}

@INPROCEEDINGS{Street98,
  author = {W. Nick Street},
  title = {A neural network model for prognostic prediction},
  booktitle = ICML,
  year = {1998},
  pages = {540--546},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{StreetMaWo95,
  author = {W. Nick Street and O. L. Mangasarian and W. H. Wolberg},
  title = {An inductive learning approach to prognostic prediction},
  booktitle = ICML,
  year = {1995},
  pages = {522--530},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{Streinu00,
  author = {I. Streinu},
  title = {A combinatorial approach to planar non-colliding robot arm motion
	planning},
  booktitle = FOCS,
  year = {2000},
  month = nov,
  publisher = {IEEE},
  note = {443--453},
  nickname = {FOCS 2000},
  site = {Redondo Beach, California}
}

@PHDTHESIS{Striegnitz04,
  author = {Kristina Striegnitz},
  title = {Generating Anaphoric Expressions --- Contextual Inference in Sentence
	Planning},
  school = {Henri Poincare - Nancy and Saarlandes},
  year = {2004}
}

@INPROCEEDINGS{StuartBr98,
  author = {Joshua M. Stuart and Elizabeth Bradley},
  title = {Learning the grammar of dance},
  booktitle = ICML,
  year = {1998},
  pages = {547--555},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{Su94,
  author = {Keh-Yih Su and Ming-Wen Wu and Jing-Shin Chang},
  title = {A corpus-based approach to automatic compound extraction},
  booktitle = ACL,
  year = {1994},
  pages = {242-247}
}

@INPROCEEDINGS{SuWuCh94,
  author = {Keh-Yih Su and Ming-Wen Wu and Jing-Shin Chang},
  title = {A corpus-based approach to automatic compound extraction},
  booktitle = ACL,
  year = {1994},
  pages = {242-247}
}

@ARTICLE{Subramanian95,
  author = {Devika Subramanian},
  title = {Shifting Vocabulary Bias in Speedup Learning},
  journal = {Machine Learning},
  year = {1995},
  volume = {20},
  pages = {155--191},
  number = {1/2},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{SuchanekKaWe07,
  author = {Fabian M. Suchanek and Gjergji Kasneci and Gerhard Weikum},
  title = {{Yago: A Core of Semantic Knowledge}},
  booktitle = WWW,
  year = {2007},
  address = {New York, NY, USA},
  publisher = {ACM Press},
  location = {Banff, Canada}
}

@INPROCEEDINGS{SuchanekKaWe07a,
  author = {F. M. Suchanek and G. Kasneci and G. Weikum},
  title = {{Yago: A Core of Semantic Knowledge}},
  booktitle = {WWW},
  year = {2007},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@INPROCEEDINGS{SuematsuHaLi97,
  author = {N. Suematsu and A. Hayashi and S. Li},
  title = {A {B}ayesian approach to model learning in non-{M}arkovian environments},
  booktitle = ICML,
  year = {1997},
  pages = {349--357},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{Sugimoto98,
  author = {Noriko Sugimoto},
  title = {Learnability of Translations from Positive Examples},
  booktitle = ALT,
  year = {1998},
  volume = {1501},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {169--178},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{SugimotoHiIs96,
  author = {N. Sugimoto and K. Hirata and H. Ishizaka},
  title = {Constructive learning of translations based on dictionaries},
  booktitle = ALT,
  year = {1996},
  volume = {1160},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {177--184},
  publisher = {Springer-Verlag}
}

@ARTICLE{SugiyamaKrM07,
  author = {Sugiyama, Masashi and Krauledat, Matthias and M\"{u}ller, Klaus-Robert},
  title = {Covariate Shift Adaptation by Importance Weighted Cross Validation},
  journal = {J. Mach. Learn. Res.},
  year = {2007},
  volume = {8},
  pages = {985--1005},
  address = {Cambridge, MA, USA},
  issn = {1533-7928},
  publisher = {MIT Press}
}

@ARTICLE{Summers77,
  author = {Summers, Phillip D.},
  title = {A methodology for {LISP} program construction from examples},
  journal = jacm,
  year = {1977},
  volume = {24},
  pages = {161--175},
  number = {1},
  month = Jan
}

@PHDTHESIS{Summers76,
  author = {P. D. Summers},
  title = {Program {C}onstruction {F}rom {E}xamples},
  school = {Yale University},
  year = {1976}
}

@INPROCEEDINGS{SLCZXLL07,
  author = {Sun, Guihua and Liu, Xiaohua and Cong, Gao and Zhou, Ming and Xiong,
	Zhongyang and Lee, John and Lin, Chin-Yew},
  title = {Detecting Erroneous Sentences using Automatically Mined Sequential
	Patterns},
  booktitle = ACL,
  year = {2007},
  pages = {81--88},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1011}
}

@INPROCEEDINGS{SunKaRa07,
  author = {J. Sun and A. Kaban and S. Raychaudhury},
  title = {Robust mixtures in the presence of measurement errors},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {847--854},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{SJSF07,
  author = {X. Sun and D. Janzing and B. Sch\"{o}lkopf and K. Fukumizu},
  title = {A kernel-based causal learning algorithm},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {855--862},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@ARTICLE{SuppesBLi95,
  author = {Patrick Suppes and Michael B{\"{o}}ttner and Lin Liang},
  title = {Comprehension Grammars Generated from Machine Learning of Natural
	Languages},
  journal = {Machine Learning},
  year = {1995},
  volume = {19},
  pages = {133--152},
  number = {2},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{SHWA03,
  author = {M. Surdeanu and S. Harabagiu and J. Williams and P. Aarseth},
  title = {Using Predicate-Argument Structures for Information Extraction},
  booktitle = ACL,
  year = {2003},
  pages = {8--15}
}

@INPROCEEDINGS{SuttonMc07,
  author = {C. Sutton and A. McCallum},
  title = {Piecewise pseudolikelihood for efficient training of conditional
	random fields},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {863--870},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{SuttonKoSi07,
  author = {R. Sutton and A. Koop and D. Silver},
  title = {On the role of tracking in stationary environments},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {871--878},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{Sutton99,
  author = {Richard S. Sutton},
  title = {Open Theoretical Questions in Reinforcement Learning},
  booktitle = EuroCOLT,
  year = {1999},
  volume = {1572},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {11--17},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Sutton95,
  author = {Richard S. Sutton},
  title = {{TD} models: modeling the world at a mixture of time scales},
  booktitle = ICML,
  year = {1995},
  pages = {531--539},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{Sutton91,
  author = {Sutton, Richard S.},
  title = {Reinforcement Learning Architectures for Animats},
  booktitle = {First International Conference on Simulation of AdaptiveBehavior},
  year = {1991}
}

@ARTICLE{Sutton88,
  author = {Richard S. Sutton},
  title = {Learning to Predict by the Methods of Temporal Differences},
  journal = {Machine Learning},
  year = {1988},
  volume = {3},
  pages = {9--44},
  number = {1},
  publisher = {Kluwer Academic Publishers, Boston}
}

@UNPUBLISHED{SuttonBa85,
  author = {Sutton, Richard S. and Andrew G. Barto},
  title = {An adaptive network that constructs and uses an internal model of
	its world},
  note = {~},
  year = {1985},
  comment = {Maze-learning with adaptive predictor neuron models.}
}

@ARTICLE{SuttonBa81,
  author = {Sutton, Richard S. and Andrew G. Barto},
  title = {Toward a Modern Theory of Adaptive Networks: Expectation and Prediction},
  journal = {Psychological Review},
  year = {1981},
  volume = {88},
  pages = {135--170},
  number = {2},
  comment = {Model of neuron where neuron increases output in expectation of being
	stimulated}
}

@INPROCEEDINGS{SuttonPrSi98,
  author = {Richard S. Sutton and Doina Precup and Satinder Singh},
  title = {Intra-option learning about temporally abstract actions},
  booktitle = ICML,
  year = {1998},
  pages = {556--564},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{SuwaMo93,
  author = {M. Suwa and H. Motoda},
  title = {A perceptual criterion for visually controlling learning},
  booktitle = {International Workshop on Analogical and Inductive Inference and
	International Workshop on Algorithmic Learning Theory},
  year = {1993},
  volume = {744},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {356--369},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{SuwaMo92,
  author = {M. Suwa and H. Motoda},
  title = {The use of abstract primitives in representing the meaning of Verbs
	for understanding metaphors},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1992},
  pages = {231--242},
  publisher = {IOS Press}
}

@INPROCEEDINGS{Suzuki96,
  author = {Joe Suzuki},
  title = {Learning {B}ayesian belief networks based on the minimum description
	length principle: an efficient algorithm using the {B \& B} technique},
  booktitle = ICML,
  year = {1996},
  pages = {462--470},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{SuzukiFuIs07,
  author = {Suzuki, Jun and Fujino, Akinori and Isozaki, Hideki},
  title = {Semi-Supervised Structured Output Learning Based on a Hybrid Generative
	and Discriminative Approach},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {791--800},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1083}
}

@INPROCEEDINGS{SvoreVaBu07,
  author = {Svore, Krysta and Vanderwende, Lucy and Burges, Christopher},
  title = {Enhancing Single-Document Summarization by Combining {R}ank{N}et
	and Third-Party Sources},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {448--457},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1047}
}

@ARTICLE{SwansonLeWu95,
  author = {K. Swanson and D. T. Lee and V. L. Wu},
  title = {An optimal algorithm for roundness determination on convex polygons},
  journal = CGTA,
  year = {1995},
  volume = {5},
  pages = {225--235}
}

@INPROCEEDINGS{Szab'o86,
  author = {Zs. Szab{\'o}},
  title = {Stratified Inductive Hypothesis Generation},
  booktitle = {International Workshop on Analogical and Inductive Inference},
  year = {1986},
  volume = {265},
  series = {Lecture Notes in Computer Science},
  pages = {177--195}
}

@ARTICLE{Szpankowski90,
  author = {Wojciech Szpankowski},
  title = {Patricia Tries Again Revisited},
  journal = jacm,
  year = {1990},
  volume = {37},
  pages = {691-711},
  number = {4},
  month = oct,
  keywords = {Data Structure and Algorithms; Algorithms; Performance; balanced trees;
	data structures; digital search trees; Patricia tries; probabilistic
	analysis of algorithms; random shape of trees; successful search;
	unsuccessful search; }
}

@INPROCEEDINGS{SzpektorShDa07,
  author = {Szpektor, Idan and Shnarch, Eyal and Dagan, Ido},
  title = {Instance-based Evaluation of Entailment Rule Acquisition},
  booktitle = ACL,
  year = {2007},
  pages = {456--463},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1058}
}

@INPROCEEDINGS{STDC04,
  author = {I. Szpektor and H. Tanev and I. Dagan and B. Coppola},
  title = {Scaling web-based of entailment relations},
  booktitle = SIGDAT,
  year = {2004},
  pages = {49--56}
}

@INPROCEEDINGS{GraepelHeWi01,
  author = {T. Graepel, R. Herbrich and R. C. Williamson},
  title = {From Margin to Sparsity},
  booktitle = NIPS,
  year = {2001},
  pages = {xxx--yyy},
  publisher = {MIT Press}
}

@TECHREPORT{TabeZe95,
  author = {T. Tabe and T. Zeugmann},
  title = {Two Variations of Inductive Inference of Languages from Positive
	Data},
  institution = {RIFIS, Kyushu University 33},
  year = {1995},
  number = {RIFIS-TR-CS-105}
}

@INPROCEEDINGS{TadepalliDi97,
  author = {Prasad Tadepalli and Thomas G. Dietterich},
  title = {Hierarchical explanation-based reinforcement learning},
  booktitle = ICML,
  year = {1997},
  pages = {358--366},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{TadepalliOk96,
  author = {Prasad Tadepalli and Do{K}yeong Ok},
  title = {Scaling up average reward reinforcement learning by approximating
	the domain models and the value function},
  booktitle = ICML,
  year = {1996},
  pages = {471--479},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{Tadic99,
  author = {Vladislav Tadic},
  title = {On the Asymptotic Behaviour of a Constant Stepsize Temporal-Difference
	Learning Algorithm},
  booktitle = EuroCOLT,
  year = {1999},
  volume = {1572},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {126--137},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Tadi'c99,
  author = {Vladislav Tadi{\'c}},
  title = {Convergence analysis of temporal-difference learning algorithms with
	linear function approximation},
  booktitle = COLT,
  year = {1999},
  pages = {193--202},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{TaeCo96,
  author = {Kang Soo Tae and Diane J. Cook},
  title = {Experimental knowledge acquisition for planning},
  booktitle = ICML,
  year = {1996},
  pages = {480--488},
  publisher = {Morgan Kaufmann}
}

@INCOLLECTION{Takada95,
  author = {Yuji Takada},
  title = {Learning Formal Languages Based on Control Sets},
  booktitle = {Algorithmic Learning for Knowledge-Based Systems},
  publisher = {Springer--Verlag},
  year = {1995},
  volume = {961},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {316--339}
}

@INPROCEEDINGS{Takada94,
  author = {Yuji Takada},
  title = {A hierarchy of language families learnable by regular language learners},
  booktitle = ICGI,
  year = {1994},
  volume = {862},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {16--24},
  publisher = {Springer-Verlag}
}

@ARTICLE{Takada88,
  author = {Yuji Takada},
  title = {Grammatical inference for even linear languages based on control
	sets},
  journal = {Inform. Process. Lett.},
  year = {1988},
  volume = {28},
  pages = {193--199}
}

@INPROCEEDINGS{TakadaSaOh92,
  author = {Y. Takada and Y. Sakakibara and T. Ohtani},
  title = {{ACE}: a syntax-directed editor customizable from examples and queries},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1992},
  pages = {126--138},
  publisher = {IOS Press}
}

@ARTICLE{Takashi95,
  author = {Yokomori Takashi},
  title = {On Polynomial-Time Learnability in the Limit of Strictly Deterministic
	Automata},
  journal = {Machine Learning},
  year = {1995},
  volume = {19},
  pages = {153--179},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{TSNR07,
  author = {Takeuchi, Hironori and Subramaniam, L Venkata and Nasukawa, Tetsuya
	and Roy, Shourya},
  title = {Automatic Identification of Important Segments and Expressions for
	Mining of Business-Oriented Conversations at Contact Centers},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {458--467},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1048}
}

@INPROCEEDINGS{Takeuchi93,
  author = {J. Takeuchi},
  title = {Some improved sample complexity bounds in the probabilistic {PAC}
	learning model},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1993},
  volume = {743},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {208--219},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{TakimotoHiMa97,
  author = {Eiji Takimoto and Ken'ichi Hirai and Akira Maruoka},
  title = {A simple algorithm for predicting nearly as well as the best pruning
	labeled with the best prediction values of a decision tree},
  booktitle = ALT,
  year = {1997},
  volume = {1316},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {385--400},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{TakimotoMa98,
  author = {Eiji Takimoto and Akira Maruoka},
  title = {On the boosting algorithm for multiclass functions based on information-theoretic
	criterion for approximation},
  booktitle = {International Conference on Discovery Science},
  year = {1998},
  volume = {1532},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {256--267},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{TakimotoMa93,
  author = {E. Takimoto and A. Maruoka},
  title = {Conservativeness and monotonicity for learning algorithms},
  booktitle = COLT,
  year = {1993},
  pages = {377--383},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{TakimotoMa93a,
  author = {E. Takimoto and A. Maruoka},
  title = {On the sample complexity of consistent learning with one-sided error},
  booktitle = {International Workshop on Analogical and Inductive Inference and
	International Workshop on Algorithmic Learning Theory},
  year = {1993},
  volume = {744},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {265--278},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{TakimotoMa92,
  author = {E. Takimoto and A. Maruoka},
  title = {Relationships between {PAC}-learning algorithms and weak {O}ccam
	algorithms},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1992},
  pages = {151--162},
  publisher = {IOS Press}
}

@ARTICLE{TMMS97,
  author = {Eiji Takimoto and Akira Miyashiro and Akira Maruoka and Yoshifumi
	Sakai},
  title = {Learning orthogonal ${H}$-{H}orn formulas},
  journal = {Theoret. Comput. Sci.},
  year = {1997},
  volume = {185},
  pages = {177--190},
  number = {1},
  note = {Special issue for ALT '95}
}

@ARTICLE{TakimotoSaMa00,
  author = {Eiji Takimoto and Yoshifumi Sakai and Akira Maruoka},
  title = {The learnability of exclusive-or expansions based on monotone {DNF}
	formulas},
  journal = {Theoret. Comput. Sci.},
  year = {2000},
  volume = {241},
  pages = {37--50},
  number = {1-2},
  note = {Special issue for ALT '96}
}

@INPROCEEDINGS{TakimotoTaMa94,
  author = {E. Takimoto and I. Tajika and A. Maruoka},
  title = {Mutual information gaining algorithm and its relation to {PAC}-learning
	algorithm},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1994},
  volume = {872},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {547--559},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{TakimotoWa00,
  author = {Eiji Takimoto and Manfred Warmuth},
  title = {The Minimax Strategy for {G}aussian Density Estimation},
  booktitle = COLT,
  year = {2000},
  pages = {100--106},
  publisher = {Morgan Kaufmann, San Francisco}
}

@INPROCEEDINGS{TakimotoWa99,
  author = {Eiji Takimoto and Manfred K. Warmuth},
  title = {Predicting Nearly as Well as the Best Pruning of a Planar Decision
	Graph},
  booktitle = ALT,
  year = {1999},
  volume = {1720},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {335--346},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Talavera99,
  author = {Luis Talavera},
  title = {Feature selection as a preprocessing step for hierarchical clustering},
  booktitle = ICML,
  year = {1999},
  pages = {389--397},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{TalbertFi99,
  author = {Douglas A. Talbert and Douglas H. Fisher},
  title = {{OPT-KD}: an algorithm for optimizing kd-trees},
  booktitle = ICML,
  year = {1999},
  pages = {398--405},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{TalbotOs07,
  author = {Talbot, David and Osborne, Miles},
  title = {Smoothed {Bloom} Filter Language Models: Tera-Scale {LMs} on the
	Cheap},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {468--476},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1049}
}

@INPROCEEDINGS{TalbotOs07a,
  author = {Talbot, David and Osborne, Miles},
  title = {Randomised Language Modelling for Statistical Machine Translation},
  booktitle = ACL,
  year = {2007},
  pages = {512--519},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1065}
}

@ARTICLE{TalmonFoBr93,
  author = {Jan L. Talmon and Herco Fonteijn and Peter J. Braspenning},
  title = {An Analysis of the {WITT} Algorithm},
  journal = {Machine Learning},
  year = {1993},
  volume = {11},
  pages = {91--104},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{TBLP06,
  author = {Talukdar, P. P. and Brants, T. and Liberman, M. and Pereira, F.},
  title = {A Context Pattern Induction Method for Named Entity Extraction},
  booktitle = {CONLL},
  year = {2006},
  url = {http://www.aclweb.org/anthology/W/W06/W06-2919}
}

@INPROCEEDINGS{TBLP06a,
  author = {Talukdar, Partha Pratim and Brants, Thorsten and Liberman, Mark and
	Pereira, Fernando},
  title = {A Context Pattern Induction Method for Named Entity Extraction},
  booktitle = {CoNLL-X},
  year = {2006},
  owner = {dxquang},
  timestamp = {2010.12.12},
  url = {http://www.aclweb.org/anthology/W/W06/W06-2919}
}

@INPROCEEDINGS{TamLaSc07,
  author = {Tam, Yik-Cheung and Lane, Ian and Schultz, Tanja},
  title = {Bilingual-LSA Based LM Adaptation for Spoken Language Translation},
  booktitle = ACL,
  year = {2007},
  pages = {520--527},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1066}
}

@ARTICLE{TamakiTo98,
  author = {H. Tamaki and T. Tokuyama},
  title = {How to Cut Pseudo-Parabolas into Segments},
  journal = DCG,
  year = {1998},
  volume = {19},
  pages = {265--290}
}

@INPROCEEDINGS{TamakiTo97,
  author = {H. Tamaki and T. Tokuyama},
  title = {A Characterization of Planar Graphs by Pseudo-Line Arrangements},
  booktitle = {ISAAC},
  year = {1997},
  volume = {1350},
  series = {Lecture Notes Comput. Sci.},
  pages = {123--132},
  publisher = {Springer-Verlag},
  annote = {210},
  nickname = {ISAAC '97},
  site = {Singapore}
}

@ARTICLE{TambeNeRo90,
  author = {Milind Tambe and Allen Newell and Paul S. Rosenbloom},
  title = {The Problem of Expensive Chunks and its Solution by Restricting Expressiveness},
  journal = {Machine Learning},
  year = {1990},
  volume = {5},
  pages = {299--348},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{TamuraTaOk07,
  author = {Tamura, Akihiro and Takamura, Hiroya and Okumura, Manabu},
  title = {{J}apanese Dependency Analysis Using the Ancestor-Descendant Relation},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {600--609},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1063}
}

@ARTICLE{Tan93,
  author = {Ming Tan},
  title = {Cost-Sensitive Learning of Classification Knowledge and Its Applications
	in Robotics},
  journal = {Machine Learning},
  year = {1993},
  volume = {13},
  pages = {7--33},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{TanHiIn90,
  author = {X.-H. Tan and T. Hirata and Y. Inagaki},
  title = {Spatial point location and its applications},
  booktitle = {Annual SIGAL International Symposium Algorithms},
  year = {1990},
  volume = {450},
  series = {Lecture Notes in Computer Science},
  pages = {241--250},
  publisher = {Springer-Verlag}
}

@ARTICLE{TanakaWa73,
  author = {M. Tanaka and T. Wachi},
  title = {Computerized {M}arker {M}aking},
  journal = {Journal of The Textile Machinery Society of Japan},
  year = {1973},
  volume = {26},
  pages = {74-81},
  number = {7}
}

@INPROCEEDINGS{TBBFH07,
  author = {Tanaka, Takaaki and Bond, Francis and Baldwin, Timothy and Fujita,
	Sanae and Hashimoto, Chikara},
  title = {Word Sense Disambiguation Incorporating Lexical and Structural Semantic
	Information},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {477--485},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1050}
}

@INPROCEEDINGS{TangMo00,
  author = {Tang, L. and Mooney, R.},
  title = {Automated construction of database interfaces: integrating statistical
	and relational learning for semantic parsing},
  booktitle = SIGDAT,
  year = {2000},
  pages = {133--141},
  address = {Morristown, NJ, USA},
  publisher = {Association for Computational Linguistics},
  doi = {http://dx.doi.org/10.3115/1117794.1117811},
  location = {Hong Kong}
}

@INPROCEEDINGS{TangMo01,
  author = {L. R. Tang and R. J. Mooney},
  title = {Using Multiple Clause Constructors in Inductive Logic Programming
	for Semantic Parsing },
  booktitle = ECML,
  year = {2001}
}

@INPROCEEDINGS{TangkitvanichSh92,
  author = {S. Tangkitvanich and M. Shimura},
  title = {Recovery from multiple faults in relational theory},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1992},
  pages = {277--287},
  publisher = {IOS Press}
}

@INPROCEEDINGS{Tani92,
  author = {S. Tani},
  title = {On the role of equivalence quries in {MAT} learning},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1992},
  pages = {115--125},
  publisher = {IOS Press}
}

@INPROCEEDINGS{TanidaYo94,
  author = {N. Tanida and T. Yokomori},
  title = {Inductive inference of monogenic pure context-free languages},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1994},
  volume = {872},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {560--574},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{TanidaYo92,
  author = {N. Tanida and T. Yokomori},
  title = {Polynomial-time identification of very regular languages in the limit},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1992},
  pages = {61--72},
  publisher = {IOS Press}
}

@INPROCEEDINGS{TYFSZ06,
  author = {T. Tao and S. Yoon and A. Fister and R. Sproat and C. Zhai},
  title = {Unsupervised Named Entitly Transliteration Using Temporal and Phonetic
	Correlation},
  booktitle = EMNLP,
  year = {2006},
  pages = {250--257}
}

@INPROCEEDINGS{TapanainenJa97,
  author = {P. Tapanainen and T. J\"arvinen},
  title = {A non-projective dependency parser.},
  booktitle = {Conference on Applied Natural Language Processing},
  year = {1997},
  address = {Washington DC}
}

@ARTICLE{Tarjan75,
  author = {Tarjan, Robert E.},
  title = {Efficiency of a good but not linear set union algorithm},
  journal = {Journal of the ACM},
  year = {1975},
  volume = {22},
  pages = {215--225},
  number = {2},
  month = Apr
}

@TECHREPORT{TarsiPe84,
  author = {Tarsi, Michael and Judea Pearl},
  title = {Algorithmic Reconstruction of Trees},
  institution = {UCLA Computer Science Department},
  year = {1984},
  number = {UCLA-ENG-8498},
  month = Dec,
  comment = {Describes how to build a tree with n leaves in time n log(n) using
	only test as to whether deepest common ancester of u and v is on
	the path from root to w, if the max degree is bounded.}
}

@INPROCEEDINGS{TCKG05,
  author = {B. Taskar and V. Chatalbashev and D. Koller and C. Guestrin},
  title = {Learning structured prediction models: a large margin approach},
  booktitle = ICML,
  year = {2005}
}

@INPROCEEDINGS{TaskarGuKo04,
  author = {B. Taskar and C. Guestrin and D. Koller},
  title = {Max-Margin Markov Networks},
  booktitle = NIPS,
  year = {2004}
}

@INPROCEEDINGS{TaskarLaKl05,
  author = {Taskar, B. and Lacoste-Julien, S. and Klein, D.},
  title = {A discriminative matching approach to word alignment},
  booktitle = HLT-EMNLP,
  year = {2005},
  pages = {73--80}
}

@INPROCEEDINGS{TateishiMaMi96,
  author = {Erika Tateishi and Osamu Maruyama and Satoru Miyano},
  title = {Extracting Best Consensus Motifs from Positive and Negative Examples},
  booktitle = STACS,
  year = {1996},
  volume = {1046},
  series = {Lecture Notes in Computer Science},
  pages = {219--230},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{TISNM05,
  author = {Marta Tatu and Brandon Iles and John Slavick and Adrian Novischi
	and Dan Moldovan},
  title = {COGEX at the Second Recognizing Textual Entailment Challenge},
  booktitle = {PASCAL Challenges Workshop on Recognizing Textual Entailment},
  year = {2005}
}

@INPROCEEDINGS{TaylorSt07,
  author = {M. Taylor and P. Stone},
  title = {Cross-domain transfer for reinforcement learning},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {879--886},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{TchoumatchenkoGa94,
  author = {Irina Tchoumatchenko and Jean-Gabriel Ganascia},
  title = {A {B}ayesian framework to integrate symbolic and neural learning},
  booktitle = ICML,
  year = {1994},
  pages = {302--308},
  publisher = {Morgan Kaufmann}
}

@MISC{PARC05,
  author = {PARC Aquaint Team},
  title = {Proposed Examples for Pilot Evaluation for Knowledge-Oriented Approaches
	to Question Answering},
  year = {2005}
}

@ARTICLE{Tecuci93,
  author = {Gheorghe Tecuci},
  title = {Plausible Justification Trees: {A} Framework for Deep and Dynamic
	Integration of Learning Strategies},
  journal = {Machine Learning},
  year = {1993},
  volume = {11},
  pages = {237--261},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{TecuciKe98,
  author = {Gheorghe Tecuci and Harry Keeling},
  title = {Teaching an agent to test students},
  booktitle = ICML,
  year = {1998},
  pages = {565--573},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{Tellier98,
  author = {Isabelle Tellier},
  title = {Meaning helps learning syntax},
  booktitle = {International Workshop on Algorithmic Learning},
  year = {1998},
  volume = {1433},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {25--36},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Teng99,
  author = {Choh Man Teng},
  title = {Correcting noisy data},
  booktitle = ICML,
  year = {1999},
  pages = {239--248},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@PHDTHESIS{Teng90,
  author = {S. H. Teng},
  title = {Points, Spheres, and Separators: a unified geometric approach to
	graph partitioning},
  school = {School Comp. Sci., Carnegie-Mellon Univ.},
  year = {1990},
  note = {Report CMU-CS-91-184},
  keywords = {doctoral thesis},
  update = {97.11 bibrelex}
}

@INPROCEEDINGS{TeodoroPhKa01,
  author = {M. L. Teodoro and G. N. Phillips and L. E. Kavraki},
  title = {Molecular Docking: A Problem with Thousands of Degrees of Freedom},
  booktitle = {ICRA},
  year = {2001},
  address = {Seoul, Korea}
}

@INPROCEEDINGS{TeowLo00,
  author = {Teow, L-W. and K-F. Loe},
  title = {Handwritten Digit Recognition with a novel vision model that extracts
	linerly separable features},
  booktitle = CVPR,
  year = {2000},
  pages = {76--81}
}

@INPROCEEDINGS{Terwijn99,
  author = {Sebastiaan A. Terwijn},
  title = {Extensional set learning},
  booktitle = COLT,
  year = {1999},
  pages = {243--248},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{Tesauro92,
  author = {Gerald Tesauro},
  title = {Practical Issues in Temporal Difference Learning},
  journal = {Machine Learning},
  year = {1992},
  volume = {8},
  pages = {257--277},
  publisher = {Kluwer Academic Publishers, Boston}
}

@TECHREPORT{Tesauro90,
  author = {G. Tesauro},
  title = {Neurogammon: {A} Neural-Network Backgammon Program},
  institution = {IBM T.J. Watson Research Center},
  year = {1990},
  number = {RC 15619 (69436)},
  month = mar
}

@ARTICLE{Tesauro87,
  author = {G. Tesauro},
  title = {Scaling relationships in back-propagation learning: dependence on
	training set size},
  journal = {Complex Systems},
  year = {1987},
  volume = {1},
  pages = {367--372},
  comment = {Studies learning of 32-bit parity with 8 or 16 or 32 hidden units.
	Training time seems to go as 4/3 power of number of samples, up to
	point where capacity is exceeded.}
}

@INCOLLECTION{TesauroCo91,
  author = {G. Tesauro and D. Cohn},
  title = {Can neural networks do better than the {V}apnik-{C}hervonenkis bounds?},
  booktitle = NIPS,
  publisher = {Morgan Kaufmann},
  year = {1991},
  pages = {911--917}
}

@ARTICLE{TesauroJa88,
  author = {G. Tesauro and B. Janssens},
  title = {Scaling relationships in back-propagation learning},
  journal = {Complex Systems},
  year = {1988},
  volume = {2},
  pages = {39--44},
  comment = {Training time for parity behaves as $4^n$, where $n$ is the number
	of inputs.}
}

@INPROCEEDINGS{ThamPr94,
  author = {Chen K. Tham and Richard W. Prager},
  title = {A modular {Q}-learning architecture for manipulator task decomposition},
  booktitle = ICML,
  year = {1994},
  pages = {309--317},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{ThelenRi02,
  author = {M. Thelen and E. Riloff},
  title = {A bootstrapping method for learning semantic lexicons using extraction
	pattern contexts},
  booktitle = SIGDAT,
  year = {2002}
}

@ARTICLE{TheronCl96,
  author = {Hendrik Theron and Ian Cloete},
  title = {{BEXA}: {A} Covering Algorithm for Learning Propositional Concept
	Descriptions},
  journal = {Machine Learning},
  year = {1996},
  volume = {24},
  pages = {5--40},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Thiele73,
  author = {H. Thiele},
  title = {Lernverfahren zur {E}rkennung formaler {S}prachen},
  journal = {Kybernetik-Forschung},
  year = {1973},
  volume = {3},
  pages = {11--93}
}

@UNPUBLISHED{Thiele91,
  author = {T. Thiele},
  title = {Diplomarbeit},
  note = {Free University Berlin},
  month = {August},
  year = {1991},
  annote = {81}
}

@INPROCEEDINGS{Thielen95,
  author = {C. Thielen},
  title = {An Approach to Proper Name Tagging for German},
  booktitle = EACL,
  year = {1995},
  comment = {similarity measures}
}

@INCOLLECTION{ThomasonHo89,
  author = {Thomason, R. and J. Horty},
  title = {Logics for nonmonotonic inheritance},
  booktitle = {Proceedings of the SecondInternational Workshop on Non-Monotonic
	Reasoning},
  publisher = {Springer Verlag},
  year = {1989},
  editor = {M. Reinfrank, J. de Kleer, M. Ginsberg and E. Sandewall}
}

@INPROCEEDINGS{ThompsonCaMo99,
  author = {Cynthia A. Thompson and Mary Elaine Califf and Raymond J. Mooney},
  title = {Active learning for natural language parsing and information extraction},
  booktitle = ICML,
  year = {1999},
  pages = {406--414},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{ThompsonMo99,
  author = {C. A. Thompson and R. J. Mooney},
  title = {Automatic construction of semantic lexicons for learning natural
	language interfaces},
  booktitle = AAAI,
  year = {1999}
}

@INPROCEEDINGS{ThompsonMoTa97,
  author = {C. Thompson and R. Mooney and L. Tang},
  title = {Learning to Parse {NL} Database Queries into Logical Form},
  booktitle = {Workshop on Automata Induction, Grammatical Inference and Language
	Acquisition},
  year = {1997}
}

@INPROCEEDINGS{ThrunLaFo99,
  author = {Sebastian Thrun and John C. Langford and Dieter Fox},
  title = {Monte {C}arlo hidden {M}arkov models: learning non-parametric models
	of partially observable stochastic processes},
  booktitle = ICML,
  year = {1999},
  pages = {415--424},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{ThrunO'96,
  author = {Sebastian Thrun and Joseph O'Sullivan},
  title = {Discovering structure in multiple learning tasks: the {TC} algorithm},
  booktitle = ICML,
  year = {1996},
  pages = {489--497},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{TikochinskyTiLe84,
  author = {Tikochinsky, Y. and N. Z. Tishby and R. D. Levine},
  title = {Consistent Inference of Probabilities for Reproducible Experiments},
  journal = {Physical Review Letters},
  year = {1984},
  volume = {52},
  pages = {1357--1360},
  number = {16},
  comment = {Justification for maximum-entropy approach.}
}

@INPROCEEDINGS{Ting96,
  author = {Kai Ming Ting},
  title = {The characterisation of predictive accuracy and decision combination},
  booktitle = ICML,
  year = {1996},
  pages = {498--506},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{TingWi97,
  author = {Kai Ming Ting and Ian H. Witten},
  title = {Stacking bagged and dagged models},
  booktitle = ICML,
  year = {1997},
  pages = {367--375},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{Tiomkin91,
  author = {Michael Tiomkin and Michael Kaminski},
  title = {Nonmonotonic Default Modal Logics},
  journal = jacm,
  year = {1991},
  volume = {38},
  pages = {963-984},
  number = {4},
  month = oct,
  keywords = {Logic; Theory; deduction theorem for modal logic; modal logic; }
}

@INBOOK{Tirri94,
  chapter = {13},
  pages = {205--213},
  title = {Learning with instance-based encodings},
  publisher = {MIT Press},
  year = {1994},
  author = {Henry Tirri},
  volume = {II: Intersections Between Theory and Experiment},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@INPROCEEDINGS{TirriKoMy96,
  author = {Henry Tirri and Petri Kontkanen and Petri Myllym{\"a}ki},
  title = {Probabilistic instance-based learning},
  booktitle = ICML,
  year = {1996},
  pages = {507--515},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{TishbyLeSo89,
  author = {N. Tishby and E. Levin and S. Solla},
  title = {Consistent inference of probabilities in layered networks: predictions
	and generalizations},
  booktitle = IJCNN,
  year = {1989},
  volume = {II},
  pages = {403--409},
  publisher = {IEEE}
}

@INPROCEEDINGS{TitovHe07,
  author = {I. Titov and J. Henderson},
  title = {Incremental {Bayesian} networks for structure prediction},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {887--894},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{TitovHe07a,
  author = {Titov, Ivan and Henderson, James},
  title = {Fast and Robust Multilingual Dependency Parsing with a Generative
	Latent Variable Model},
  booktitle = {CoNLL Shared Task Session of EMNLP-CoNLL},
  year = {2007},
  pages = {947--951},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1099}
}

@INPROCEEDINGS{TitovHe07b,
  author = {Titov, Ivan and Henderson, James},
  title = {Constituent Parsing with Incremental Sigmoid Belief Networks},
  booktitle = ACL,
  year = {2007},
  pages = {632--639},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1080}
}

@INPROCEEDINGS{Tjong00,
  author = {Tjong Kim Sang, E. F.},
  title = {Text Chunking by System Combination},
  booktitle = CoNLL-LLL,
  year = {2000},
  address = {Lisbon, Portugal}
}

@INPROCEEDINGS{TjongBu00,
  author = {Tjong Kim Sang, E. F. and S. Buchholz},
  title = {Introduction to the {CoNLL}-2000 shared task: Chunking},
  booktitle = CoNLL-LLL,
  year = {2000},
  pages = {127--132}
}

@INPROCEEDINGS{TjongD01,
  author = {Tjong Kim Sang, E. F. and H. D\'{e}jean},
  title = {Introduction to the {CoNLL}-2001 shared task: Clause Identification},
  booktitle = CoNLL,
  year = {2001},
  pages = {53--57}
}

@INPROCEEDINGS{TjongDe03a,
  author = {Tjong Kim Sang, Erik F. and De Meulder, Fien},
  title = {Introduction to the CoNLL-2003 Shared Task: Language-Independent
	Named Entity Recognition},
  booktitle = CoNLL,
  year = {2003},
  editor = {Walter Daelemans and Miles Osborne},
  pages = {142--147},
  publisher = {Edmonton, Canada}
}

@ARTICLE{TobinFrMi89,
  author = {R. L. Tobin and T. L. Friesz and T. Miller},
  title = {Existence theory for spatially competitive network facility location
	models},
  journal = {Annals of Operations Research},
  year = {1989},
  volume = {18},
  pages = {267--276}
}

@INPROCEEDINGS{TodorovskiD97,
  author = {Ljup{\v c}o Todorovski and Sa{\v s}o D{\v z}eroski},
  title = {Declarative bias in equation discovery},
  booktitle = ICML,
  year = {1997},
  pages = {376--384},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{Tomabechi85,
  author = {Hideto Tomabechi and Masaru Tomita},
  title = {Integration of unification-based syntax/semantics and memory-based
	pragmatics for real time understanding of continuous speech input},
  booktitle = AAAI,
  year = {1985}
}

@INPROCEEDINGS{TomanekWeHa07,
  author = {Tomanek, Katrin and Wermter, Joachim and Hahn, Udo},
  title = {An Approach to Text Corpus Construction which Cuts Annotation Costs
	and Maintains Reusability of Annotated Data},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {486--495},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1051}
}

@ARTICLE{Tomasello00,
  author = {M. Tomasello},
  title = {Do young children have adult syntactic competence?},
  journal = {Cognition},
  year = {2000},
  volume = {74},
  pages = {209-253}
}

@INPROCEEDINGS{TomiokaAi07,
  author = {R. Tomioka and K. Aihara},
  title = {Classifying matrices with a spectral regularization},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {895--902},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{Torgo97,
  author = {Lu{\'i}s Torgo},
  title = {Functional models for regression tree leaves},
  booktitle = ICML,
  year = {1997},
  pages = {385--393},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{Toran91,
  author = {Jacobo Tor{\'a}n},
  title = {Compexity Classes Defined by Counting Quantifiers},
  journal = jacm,
  year = {1991},
  volume = {38},
  pages = {753-774},
  number = {3},
  month = jul,
  keywords = {Theory of Computation; Theory; counting complexity classes; }
}

@BOOK{TouGo74,
  title = {Pattern Recognition Principles},
  publisher = {Addison-Wesley},
  year = {1974},
  author = {J. T. Tou and R. C. Gonzalez}
}

@BOOK{Touretzky86,
  title = {The Mathematics of Inheritance Systems},
  publisher = {Morgan Kaufman},
  year = {1986},
  author = {Touretzky, D.}
}

@INPROCEEDINGS{TouretzkyHoTh87,
  author = {Touretzky, D. and J. Horty and R. Thomason},
  title = {A Clash of Intuitions: The Current State of NonmonotonicMultiple
	Inheritance Systems},
  booktitle = IJCAI,
  year = {1987},
  publisher = {Morgan Kaufman}
}

@INPROCEEDINGS{Toussaint83,
  author = {G. T. Toussaint},
  title = {Solving geometric problems with the rotating calipers},
  booktitle = {IEEE MELECON},
  year = {1983},
  pages = {A10.02/1--4},
  site = {Athens, Greece}
}

@INPROCEEDINGS{Toutanova06,
  author = {Toutanova, Kristina},
  title = {Competitive generative models with structure learning for NLP classification
	tasks},
  booktitle = EMNLP,
  year = {2006},
  pages = {576--584},
  month = {July}
}

@INPROCEEDINGS{ToutanovaHaMa05,
  author = {K. Toutanova and A. Haghighi and C. D. Manning},
  title = {Joint Learning Improves Semantic Role Labeling},
  booktitle = ACL,
  year = {2005}
}

@INPROCEEDINGS{ToutanovaKlMa3,
  author = {K. Toutanova and D. Klein and C. Manning},
  title = {Feature-Rich Part-of-Speech Tagging with a Cyclic Dependency Network},
  booktitle = HLT-NAACL,
  year = {2003},
  timestamp = {2007.01.26}
}

@INBOOK{Towell97,
  chapter = {7},
  pages = {107--119},
  title = {Supervised learning using labeled and unlabeled examples},
  publisher = {MIT Press},
  year = {1997},
  author = {Geoffrey Towell},
  volume = {IV: Making Learning Systems Practical},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@ARTICLE{Towell95,
  author = {Geoffrey Towell},
  title = {Book Review: {\it Neural Network Perception for Mobile Robot Guidance}
	by Dean {A}. Pomerleau. Kluwer Academic Publishers, 1993.},
  journal = {Machine Learning},
  year = {1995},
  volume = {18},
  pages = {115--119},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INBOOK{TowellLe95,
  chapter = {4},
  pages = {55--74},
  title = {A knowledge-based model of geometry learning},
  publisher = {MIT Press},
  year = {1995},
  author = {Geoffrey Towell and Richard Lehrer},
  volume = {III: Selecting Good Models},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@INPROCEEDINGS{TVGJ95,
  author = {Geoffrey Towell and Ellen M. Voorhees and Narendra K. Gupta and Ben
	Johnson-Laird},
  title = {Learning collection fusion strategies for information retrieval},
  booktitle = ICML,
  year = {1995},
  pages = {540--548},
  publisher = {Morgan Kaufmann}
}

@INBOOK{TowellSh94,
  chapter = {5},
  pages = {65--80},
  title = {Using knowledge-based neural networks to refine roughly-correct information},
  publisher = {MIT Press},
  year = {1994},
  author = {Geoffrey G. Towell and Jude W. Shavlik},
  volume = {II: Intersections Between Theory and Experiment},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@ARTICLE{TowellSh93,
  author = {Geoffrey G. Towell and Jude W. Shavlik},
  title = {Extracting Refined Rules from Knowledge-Based Neural Networks},
  journal = {Machine Learning},
  year = {1993},
  volume = {13},
  pages = {71--101},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{TrespHoAh97,
  author = {Volker Tresp and J{\"u}rgen Hollatz and Subutai Ahmad},
  title = {Representing Probabilistic Rules with Networks of Gaussian Basis
	Functions},
  journal = {Machine Learning},
  year = {1997},
  volume = {27},
  pages = {173--200},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INBOOK{TrespMoDe94,
  chapter = {21},
  pages = {363--378},
  title = {Neural network modeling of physiological processes},
  publisher = {MIT Press},
  year = {1994},
  author = {Volker Tresp and John Moody and Wolf-R{\"u}diger Delong},
  volume = {II: Intersections Between Theory and Experiment},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@INPROCEEDINGS{TWLH05,
  author = {Tsai, T.H. and Wu, C.W. and Lin, Y.C. and Hsu, W.L.},
  title = {Exploiting Full Parsing Information to Label Semantic Roles Using
	an Ensemble of {ME} and {SVM} via Integer Linear Programming},
  booktitle = CoNLL,
  year = {2005},
  pages = {233--236},
  address = {Ann Arbor, Michigan},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/W/W05/W05-0638}
}

@INPROCEEDINGS{TsampoukaSh07,
  author = {P. Tsampouka and J. Shawe-Taylor},
  title = {Approximate maximum margin algorithms with rules controlled by the
	number of mistakes},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {903--910},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{TsangKoKw07,
  author = {I. Tsang and A. Kocsor and J. Kwok},
  title = {Simpler core vector machines with enclosing balls},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {911--918},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{TsaparaTu98,
  author = {Irene Tsapara and Gy{\"o}rgy Tur{\'a}n},
  title = {Learning atomic formulas with prescribed properties},
  booktitle = COLT,
  year = {1998},
  pages = {166--174},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{Tsitsiklis94,
  author = {John N. Tsitsiklis},
  title = {Asynchronous Stochastic Approximation and {Q}-Learning},
  journal = {Machine Learning},
  year = {1994},
  volume = {16},
  pages = {185--202},
  number = {3},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Tsitsiklis86,
  author = {John N. Tsitsiklis},
  title = {A Lemma on the Multiarmed Bandit Problem},
  journal = {IEEE Transactions on Automatic Control},
  year = {1986},
  volume = {AC-31},
  number = {6},
  month = Jun
}

@ARTICLE{TsitsiklisRo96,
  author = {John N. Tsitsiklis and Benjamin van Roy},
  title = {Feature-Based Methods for Large Scale Dynamic Programming},
  journal = {Machine Learning},
  year = {1996},
  volume = {22},
  pages = {59--94},
  number = {1/2/3},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{THJA04,
  author = {I. Tsochantaridis and T. Hofmann and T. Joachims and Y. Altun},
  title = {Support Vector Machine Learning for Interdependent and Structured
	Output Spaces},
  booktitle = ICML,
  year = {2004}
}

@INPROCEEDINGS{Tsuda07,
  author = {K. Tsuda},
  title = {Entire regularization paths for graph data},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {919--926},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{TsukadaKo92,
  author = {Y. Tsukada and K. Koyama},
  title = {A knowledge transfer model: from zero-knowledge toward full knowledge},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1992},
  pages = {187--195},
  publisher = {IOS Press}
}

@INPROCEEDINGS{TsumotoTa93,
  author = {S. Tsumoto and H. Tanaka},
  title = {Induction of probabilistic rules based on rough set theory},
  booktitle = {International Workshop on Analogical and Inductive Inference and
	International Workshop on Algorithmic Learning Theory},
  year = {1993},
  volume = {744},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {410--423},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{TuSm94,
  author = {H.-C. Tu and C. H. Smith},
  title = {Training digraphs},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1994},
  pages = {176--186},
  publisher = {Springer-Verlag}
}

@ARTICLE{TulvingSc90,
  author = {Tulving, E. and D. L.. Schacter},
  title = {Priming and human memory systems},
  journal = {Science},
  year = {1990},
  volume = {47},
  pages = {301--306}
}

@INPROCEEDINGS{TurianRaBe10,
  author = {Turian, Joseph and Ratinov, Lev-Arie and Bengio, Yoshua},
  title = {Word Representations: A Simple and General Method for Semi-Supervised
	Learning},
  booktitle = {Proceedings of the 48th Annual Meeting of the Association for Computational
	Linguistics},
  year = {2010},
  pages = {384--394},
  address = {Uppsala, Sweden},
  month = {July},
  publisher = {Association for Computational Linguistics},
  owner = {dxquang},
  timestamp = {2010.12.12},
  url = {http://www.aclweb.org/anthology/P10-1040}
}

@ARTICLE{Turing50,
  author = {A. M. Turing},
  title = {Computing Machinery and intelligence},
  journal = {Mind},
  year = {1950},
  volume = {59},
  pages = {433--460},
  month = Oct,
  note = {(Reprinted in {\em Computers and Thought}, (eds. E. A. Feigenbaum
	and J. Feldman), McGraw-Hill, 1963, pages 11--38).},
  comment = {Classic article on whether computers can think; introduces the `Turing
	test'.}
}

@BOOK{Turner84,
  title = {Logic for Artificial Intelligence},
  publisher = {Ellis Horwood Limited},
  year = {1984},
  author = {Turner, R.},
  address = {West Sussex, England},
  comment = {Q335.T87}
}

@ARTICLE{Turney95,
  author = {Peter Turney},
  title = {Technical Note: Bias and the Quantification of Stability},
  journal = {Machine Learning},
  year = {1995},
  volume = {20},
  pages = {23--33},
  number = {1/2},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{Tur'an93,
  author = {G. Tur{\'a}n},
  title = {Lower bounds for {PAC} learning with queries},
  booktitle = COLT,
  year = {1993},
  pages = {384--391},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{Tverberg81,
  author = {H. Tverberg},
  title = {A generalization of {Radon}'s theorem {II}},
  journal = {Bull. Australian Math. Soc.},
  year = {1981},
  volume = {24},
  pages = {321--325}
}

@ARTICLE{Tverberg66,
  author = {H. Tverberg},
  title = {A generalization of {Radon}'s theorem},
  journal = {J. London Math. Soc.},
  year = {1966},
  volume = {41},
  pages = {123--128},
  update = {97.11 bibrelex}
}

@INPROCEEDINGS{Tzeng89,
  author = {W. Tzeng},
  title = {The equivalence and learning of probabilistic automata},
  booktitle = FOCS,
  year = {1989},
  pages = {268--273},
  publisher = {IEEE Computer Society Press, Los Alamitos, CA}
}

@ARTICLE{Tzeng92,
  author = {Wen-Guey Tzeng},
  title = {Learning Probabilistic Automata and Markov Chains via Queries},
  journal = {Machine Learning},
  year = {1992},
  volume = {8},
  pages = {151--166},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{T'oth01,
  author = {G. T{\'o}th},
  title = {Point sets with many $k$-sets},
  journal = DCG,
  year = {2001},
  volume = {26},
  pages = {187--194},
  number = {2}
}

@INPROCEEDINGS{T'oth00,
  author = {G. T{\'o}th},
  title = {Point sets with many k-sets},
  booktitle = {SOCG},
  year = {2000},
  pages = {37--42}
}

@INPROCEEDINGS{UedaNa93,
  author = {K. Ueda and S. Nagano},
  title = {Implementation of heuristic problem solving process including analogical
	reasoning},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1993},
  volume = {743},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {171--182},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{UeffingHaSa07,
  author = {Ueffing, Nicola and Haffari, Gholamreza and Sarkar, Anoop},
  title = {Transductive learning for statistical machine translation},
  booktitle = ACL,
  year = {2007},
  pages = {25--32},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1004}
}

@INPROCEEDINGS{UeharaTsWe97,
  author = {Ryuhei Uehara and Kensei Tsuchida and Ingo Wegener},
  title = {Optimal attribute-efficient learning of disjunction, parity, and
	threshold functions},
  booktitle = EuroCOLT,
  year = {1997},
  pages = {171--184},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Ukkonen83,
  author = {Esko Ukkonen},
  title = {On approximate string matching},
  booktitle = FOCS,
  year = {1983},
  pages = {487--495}
}

@ARTICLE{Upfal92,
  author = {Eli Upfal},
  title = {An $\uppercase{O}$(log $\uppercase{N}$) Deterministic Packet-Routing
	Scheme},
  journal = jacm,
  year = {1992},
  volume = {39},
  pages = {55-70},
  number = {1},
  month = jan,
  keywords = {Computer Systems; Algorithms; Design; Performance; Theory; deterministic
	routing; network routing; parallel computer; }
}

@INCOLLECTION{Urrutia00,
  author = {J. Urrutia},
  title = {Art Gallery and Illumination Problems},
  booktitle = {Handbook of Computational Geometry},
  publisher = {North-Holland},
  year = {2000},
  editor = {J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia},
  pages = {973--1027}
}

@INPROCEEDINGS{UrtasunDa07,
  author = {R. Urtasun and T. Darrell},
  title = {Discriminative {Gaussian} process latent variable models for classification},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {927--934},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INCOLLECTION{Utgoff87,
  author = {P. Utgoff},
  title = {Shift of Bias for Inductive Concept Learning},
  booktitle = {Machine Learning Vol2},
  publisher = {Morgan Kaufman},
  year = {1987}
}

@INPROCEEDINGS{Utgoff94,
  author = {Paul E. Utgoff},
  title = {An improved algorithm for incremental induction of decision trees},
  booktitle = ICML,
  year = {1994},
  pages = {318--325},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{Utgoff89,
  author = {Paul E. Utgoff},
  title = {Incremental Induction of Decision Trees},
  journal = {Machine Learning},
  year = {1989},
  volume = {4},
  pages = {161--186},
  publisher = {Kluwer Academic Publishers, Boston}
}

@BOOK{Utgoff86,
  title = {Machine Learning of Inductive Bias},
  publisher = {Kluwer Academic},
  year = {1986},
  author = {P. E. Utgoff}
}

@ARTICLE{UtgoffBeCl97,
  author = {Paul E. Utgoff and Neil C. Berkman and Jeffery A. Clouse},
  title = {Decision tree induction based on efficient tree restructuring},
  journal = {Machine Learning},
  year = {1997},
  volume = {29},
  pages = {5--44},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{UtgoffSt99,
  author = {Paul E. Utgoff and David J. Stracuzzi},
  title = {Approximation via value unification},
  booktitle = ICML,
  year = {1999},
  pages = {425--432},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{Vishnu09,
  author = {V. Vyas, P. Pantel},
  title = {Semi-Automatic Entity Set Refinement},
  booktitle = NAACL,
  year = {2009}
}

@INPROCEEDINGS{VadasCu07,
  author = {Vadas, David and Curran, James},
  title = {Adding Noun Phrase Structure to the Penn Treebank},
  booktitle = ACL,
  year = {2007},
  pages = {240--247},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1031}
}

@ARTICLE{Vaidya89,
  author = {P. M. Vaidya},
  title = {An {$O(n \log n)$} algorithm for the all-nearest-neighbors problem},
  journal = DCG,
  year = {1989},
  volume = {4},
  pages = {101--115}
}

@INPROCEEDINGS{Vaidya86,
  author = {P. M. Vaidya},
  title = {An optimal algorithm for the all-nearest-neighbors problem},
  booktitle = FOCS,
  year = {1986},
  pages = {117--122}
}

@INBOOK{VainaSuHa97,
  chapter = {21},
  pages = {363--378},
  title = {Fast perceptual learning of motion in humans and neural networks},
  publisher = {MIT Press},
  year = {1997},
  author = {Lucia M. Vaina and Venkrataraman Sundareswaran and John G. Harris},
  volume = {IV: Making Learning Systems Practical},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@INPROCEEDINGS{VaithyanathanDo99,
  author = {Shivakumar Vaithyanathan and Byron Dom},
  title = {Model selection in unsupervised learning with applications to document
	clustering},
  booktitle = ICML,
  year = {1999},
  pages = {433--443},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{Valdes-PerezP94,
  author = {Ra{\'u}l E. Vald{\'e}s-P{\'e}rez and Aurora P{\'e}rez},
  title = {A powerful heuristic for the discovery of complex patterned behavior},
  booktitle = ICML,
  year = {1994},
  pages = {326--334},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{Valdes-Perez94,
  author = {Ra{\'{u}}l E. Vald{\'{e}}s-P{\'{e}}rez},
  title = {Algebraic Reasoning about Reactions: Discovery of Conserved Properties
	in Particle Physics},
  journal = {Machine Learning},
  year = {1994},
  volume = {17},
  pages = {47--67},
  number = {1},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{Valiant06,
  author = {L. Valiant},
  title = {Knowledge infusion},
  booktitle = AAAI,
  year = {2006},
  pages = {1546--1551},
  address = {Boston, MA},
  publisher = {AAAI}
}

@INPROCEEDINGS{Valiant94,
  author = {L. Valiant},
  title = {A Neuroidal Model for Cognitive Functions},
  booktitle = EuroCOLT,
  year = {1994},
  volume = {New Series Number 53},
  series = {The Institute of Mathematics and its Applications Conference Series},
  pages = {2},
  address = {Oxford},
  publisher = {Oxford University Press},
  isbn = {0 19 853492 2}
}

@ARTICLE{Valiant84,
  author = {L. Valiant},
  title = {Deductive learning},
  journal = {Phil. Trans. Roy. Soc. Lond. A},
  year = {1984},
  volume = {312},
  pages = {441--446}
}

@INPROCEEDINGS{Valiant99,
  author = {L. G. Valiant},
  title = {Robust Logic},
  booktitle = STOC,
  year = {1999}
}

@ARTICLE{Valiant99a,
  author = {Leslie G. Valiant},
  title = {Projection Learning},
  journal = {Machine Learning},
  year = {1999},
  volume = {37},
  pages = {115--130},
  number = {2},
  comment = {first in 11th COLT '98},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{Valiant98colt,
  author = {L. G. Valiant},
  title = {Projection Learning},
  booktitle = COLT,
  year = {1998},
  pages = {287--293}
}

@INCOLLECTION{Valiant98icalp,
  author = {Valiant, L. G.},
  title = {Neuroidal Architecture for Cognitive Computation},
  booktitle = ICALP,
  publisher = {Springer-verlag},
  year = {1998},
  pages = {642--669},
  note = {Lecture notes in Computer Science, vol. 1443}
}

@INPROCEEDINGS{Valiant96,
  author = {Leslie G. Valiant},
  title = {Managing complexity in neuroidal circuits},
  booktitle = ALT,
  year = {1996},
  volume = {1160},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {1--11},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Valiant95,
  author = {L. G. Valiant},
  title = {Rationality},
  booktitle = COLT,
  year = {1995},
  pages = {3--14},
  month = {July}
}

@INPROCEEDINGS{Valiant95a,
  author = {Leslie G. Valiant},
  title = {Cognitive Computation (Extended Abstract)},
  booktitle = FOCS,
  year = {1995},
  pages = {2--3},
  publisher = {IEEE Computer Society Press, Los Alamitos, CA}
}

@BOOK{Valiant94a,
  title = {Circuits of the Mind},
  publisher = {Oxford University Press},
  year = {1994},
  author = {Valiant, L. G.},
  month = Nov
}

@INPROCEEDINGS{Valiant89,
  author = {Valiant, Leslie G.},
  title = {A View of Computational Learning Theory},
  booktitle = {NEC Research Symposium},
  year = {1989},
  pages = {32--51},
  organization = {Society for Industrial and Applied Mathematics, Philadelphia},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{Valiant88a,
  author = {L. G. Valiant},
  title = {Functionality in neural networks},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1988},
  pages = {28--39},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{Valiant85,
  author = {L. G. Valiant},
  title = {Learning Disjunctions of Conjunctions},
  booktitle = {Proceedings of the 9th {I}nternational {J}oint {C}onference on {A}rtificial
	{I}ntelligence, vol. 1},
  year = {1985},
  pages = {560--566},
  address = {Los Angeles, California},
  organization = {International Joint Committee for Artificial Intelligence},
  comment = {Introduces the malicious error noise model for pac learning}
}

@ARTICLE{Valiant84a,
  author = {Valiant, L. G.},
  title = {A Theory of the Learnable},
  journal = CACM,
  year = {1984},
  volume = {27},
  pages = {1134--1142},
  number = {11},
  month = Nov,
  comment = {Defines `learnability' wrt EXAMPLES and ORACLE using arbitrary probability
	measure on event space. Shows k-CNF learnable from examples only.}
}

@ARTICLE{VanGelder91,
  author = {Allen {Van Gelder} and Kenneth A. Ross and John S. Schlipf},
  title = {The Well-Founded Semantics for General Logic Programs},
  journal = jacm,
  year = {1991},
  volume = {38},
  pages = {620-650},
  number = {3},
  month = jul,
  keywords = {Logic Programming; Languages; Theory; fixpoints; negation as failure;
	stable models; three-valued logic; unfounded sets; well-founded models;}
}

@BOOK{Van89,
  title = {{Constraint Satisfaction in Logic Programming}},
  publisher = {Logic Programming Series, The MIT Press},
  year = {1989},
  author = {Van Hentenryck, P. },
  address = {Cambridge, MA}
}

@INPROCEEDINGS{VanKhNa07,
  author = {J. {Van Hulse} and T. Khoshgoftaar and A. Napolitano},
  title = {Experimental perspectives on learning from imbalanced data},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {935--942},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@BOOK{Vanderbei97,
  title = {Linear programming: Foundations and extensions},
  publisher = {Kluwer},
  year = {1997},
  author = {R. J. Vanderbei}
}

@ARTICLE{Vanlehn89,
  author = {Kurt Vanlehn},
  title = {Efficient Specialization of Relational Concepts},
  journal = {Machine Learning},
  year = {1989},
  volume = {4},
  pages = {99--106},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{VanLehn87,
  author = {VanLehn, Kurt},
  title = {Learning One Subprocedure per Lesson},
  journal = {Artificial Intelligence},
  year = {1987},
  volume = {31},
  pages = {1--40},
  number = {1},
  month = Jan
}

@ARTICLE{VanlehnBa87,
  author = {Kurt Vanlehn and William Ball},
  title = {A Version Space Approach to Learning Context-free Grammars},
  journal = {Machine Learning},
  year = {1987},
  volume = {2},
  pages = {39--74},
  publisher = {Kluwer Academic Publishers, Boston}
}

@BOOK{Vapnik98,
  title = {Statistical Learning Theory},
  publisher = {Springer},
  year = {1998},
  author = {V. Vapnik}
}

@INPROCEEDINGS{Vapnik96,
  author = {Vladimir Vapnik},
  title = {Statistical theory of generalization (abstract)},
  booktitle = ICML,
  year = {1996},
  pages = {557},
  publisher = {Morgan Kaufmann}
}

@BOOK{Vapnik95,
  title = {The Nature of Statistical Learning Theory},
  publisher = {Springer-Verlag},
  year = {1995},
  author = {Vapnik, V. N.},
  address = {New York}
}

@INPROCEEDINGS{Vapnik89,
  author = {V. N. Vapnik},
  title = {Inductive Principles of the Search for Empirical Dependences (Methods
	Based on Weak Convergence of Probability Measures)},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1989},
  pages = {3--21},
  address = {San Mateo, CA},
  month = aug,
  publisher = {Morgan Kaufmann}
}

@BOOK{Vapnik82,
  title = {Estimation of Dependences Based on Empirical Data},
  publisher = {Springer-Verlag},
  year = {1982},
  author = {Vapnik, V. N.},
  address = {New York},
  comment = {QA276.8.V3613 1982, McKay, Cabot}
}

@BOOK{Vapnik79,
  title = {Theorie der Zeichenerkennung},
  publisher = {Akademie-Verlag},
  year = {1979},
  author = {V. N. Vapnik},
  location = {Berlin}
}

@ARTICLE{VapnikCh71,
  author = {Vapnik, V. N. and A. Ya. Chervonenkis},
  title = {On the Uniform Convergence of Relative Frequencies of Events to their
	probabilities},
  journal = {Theory of Probability and its applications},
  year = {1971},
  volume = {XVI},
  pages = {264--280},
  number = {2},
  comment = {Shows that a sufficient condition for the probability of every set
	converging to its correct probability is finite VC dimension.}
}

@INPROCEEDINGS{VaradarajanAg99,
  author = {K. R. Varadarajan and P. K. Agarwal},
  title = {Approximation algorithms for bipartite and non-bipartite matching
	in the plane},
  booktitle = SODA,
  year = {1999},
  pages = {805--814}
}

@INPROCEEDINGS{VaradarajanAg97,
  author = {K. R. Varadarajan and P. K. Agarwal},
  title = {Approximating Shortest Paths on an Nonconvex Polyhedron},
  booktitle = FOCS,
  year = {1997},
  pages = {To appear},
  nickname = {FOCS '97}
}

@UNPUBLISHED{VaradarajanAg96,
  author = {K. R. Varadarajan and P. K. Agarwal},
  title = {Approximating Shortest Paths on a Polyhedron},
  note = {manuscript},
  year = {1996}
}

@INPROCEEDINGS{VaradarajanVeZh02,
  author = {K. R.~Varadarajan and S.~Venkatesh and J.~Zhang},
  title = {Approximating the radii of point sets in high dimensions},
  booktitle = FOCS,
  year = {2002},
  note = {to appear},
  url = {http://www.cs.uiowa.edu/~kvaradar/paps/venkat.ps}
}

@BOOK{VasersteinBy02,
  title = {Introduction to Linear Programming},
  publisher = {Pearson Education, Inc},
  year = {2002},
  author = {L. Vaserstein and C.C. Byrne}
}

@INPROCEEDINGS{VayatisAz99,
  author = {Nicolas Vayatis and Robert Azencott},
  title = {Distribution-Dependent {V}apnik-{C}hervonenkis Bounds},
  booktitle = EuroCOLT,
  year = {1999},
  volume = {1572},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {230--240},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{VealeHa07,
  author = {Veale, Tony and Hao, Yanfen},
  title = {Making Lexical Ontologies Functional and Context-Sensitive},
  booktitle = ACL,
  year = {2007},
  pages = {57--64},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1008}
}

@ARTICLE{Veelenturf78,
  author = {L. P. J. Veelenturf},
  title = {Inference of sequential machines from sample computations},
  journal = {IEEE Trans. on Computers},
  year = {1978},
  volume = {C-27},
  pages = {167--170}
}

@INPROCEEDINGS{VKKR03,
  author = {W. F. de la Vega and M. Karpinski and C. Kenyon and Y. Rabani},
  title = {Approximation schemes for clustering problems},
  booktitle = STOC,
  year = {2003},
  pages = {50--58}
}

@INPROCEEDINGS{VegterYa90,
  author = {G. Vegter and C. K. Yap},
  title = {Computational complexity of combinatorial surfaces},
  booktitle = {SOCG},
  year = {1990},
  pages = {102--111}
}

@INPROCEEDINGS{Velauthapillai89,
  author = {M. Velauthapillai},
  title = {Inductive inference with bounded number of mind changes},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1989},
  pages = {200--213},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@PHDTHESIS{Velauthapillai86,
  author = {M. Velauthapillai},
  title = {On the Inductive Inference of Programs with Anomalies},
  school = {University of Maryland},
  year = {1986}
}

@ARTICLE{VelosoCa93,
  author = {Manuela M. Veloso and Jaime G. Carbonell},
  title = {Derivational Analogy in Prodigy: Automating Case Acquisition, Storage,
	and Utilization},
  journal = {Machine Learning},
  year = {1993},
  volume = {10},
  pages = {249--278},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{VeltkampHa00,
  author = {R.~C. Veltkamp and M.~Hagedoorn},
  title = {Shape similarity measures, properties, and constructions},
  booktitle = {VISUAL},
  year = {2000},
  volume = {1929},
  series = LNCS,
  pages = {467--476},
  publisher = {Springer},
  url = {http://www.cs.uu.nl/research/techreps/UU-CS-2000-37.html}
}

@INPROCEEDINGS{Vempala97,
  author = {Santosh Vempala},
  title = {A random sampling based algorithm for learning the intersection of
	half-spaces (extended abstract)},
  booktitle = FOCS,
  year = {1997},
  pages = {508--513},
  publisher = {IEEE Computer Society Press, Los Alamitos, CA}
}

@INPROCEEDINGS{Venkatesh91,
  author = {S. S. Venkatesh},
  title = {On learning binary weights for majority functions},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1991},
  pages = {257--266},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{VenkateshSnPs92,
  author = {S. S. Venkatesh and R. R. Snapp and D. Psaltis},
  title = {{BELLMAN STRIKES AGAIN! T}he growth rate of sample complexity with
	dimension for the nearest neighbor classifier},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1992},
  pages = {93--102},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{Verbeurgt90,
  author = {K. Verbeurgt},
  title = {Learning {DNF} under the uniform distribution in quasi-polynomial
	time},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1990},
  pages = {314--326},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{Verbeurgt98,
  author = {K. A. Verbeurgt},
  title = {Learning Sub-classes of Monotone {DNF} on the Uniform Distribution},
  booktitle = ALT,
  year = {1998},
  volume = {1501},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {385--399},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{VerdiereLa02,
  author = {E. C. de Verdiere and F.~Lazarus},
  title = {Optimal System of Loops on an Orientable Surface},
  booktitle = FOCS,
  year = {2002},
  pages = {627--636}
}

@UNPUBLISHED{Vere81,
  author = {S. A. Vere},
  title = {Constrained {N}-to-1 generalization},
  note = {preprint, Jet Prop. Lab.},
  year = {1981}
}

@ARTICLE{Vere80,
  author = {S. A. Vere},
  title = {Multilevel counterfactuals for generalizations of relational concepts
	and productions},
  journal = {Art. Int.},
  year = {1980},
  volume = {14},
  pages = {139--164}
}

@INPROCEEDINGS{Versley07,
  author = {Versley, Yannick},
  title = {Antecedent Selection Techniques for High-Recall Coreference Resolution},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {496--505},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1052}
}

@INPROCEEDINGS{Viechnicki98,
  author = {P. Viechnicki},
  title = {A performance evaluation of automatic survey classifiers},
  booktitle = {International Workshop on Algorithmic Learning},
  year = {1998},
  volume = {1433},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {244--256},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{VMMG08,
  author = {O. Vikas and A. K. Meshram and G. Meena and A. Gupta},
  title = {Multiple Document Summarization Using Principal Component Analysis
	Incorporating Semantic Vector Space Model},
  booktitle = {Computational Linguistics and Chinese Language Processing},
  year = {2008},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@INPROCEEDINGS{Viksna93,
  author = {J. Viksna},
  title = {Learning with growing quality},
  booktitle = {International Workshop on Analogical and Inductive Inference and
	International Workshop on Algorithmic Learning Theory},
  year = {1993},
  volume = {744},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {164--172},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{VilaltaRe97,
  author = {Ricardo Vilalta and Larry Rendell},
  title = {Integrating feature construction with multiple classifiers in decision
	tree induction},
  booktitle = ICML,
  year = {1997},
  pages = {394--402},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{VKZIR07,
  author = {Villavicencio, Aline and Kordoni, Valia and Zhang, Yi and Idiart,
	Marco and Ramisch, Carlos},
  title = {Validation and Evaluation of Automatically Acquired Multiword Expressions
	for Grammar Engineering},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {1034--1043},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1110}
}

@ARTICLE{VishkinSc88,
  author = {U. Vishkin and B. Schieber},
  title = {On Finding Lowest Common Ancestors: Simplification and Parallelization},
  journal = SICOMP,
  year = {1988},
  volume = {17},
  pages = {1253--1262}
}

@INPROCEEDINGS{Vishnu09a,
  author = {Vishnu Vyas, Patrick Pantel},
  title = {Semi-Automatic Entity Set Refinement},
  booktitle = {NAACL-09},
  year = {2009},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@INPROCEEDINGS{VSSM06,
  author = {Vishwanathan, S. V. N. and Schraudolph, N. N. and Schmidt, M. W.
	and Murphy, . P.},
  title = {Accelerated training of conditional random fields with stochastic
	gradient methods},
  booktitle = ICML,
  year = {2006}
}

@ARTICLE{VitterLi92,
  author = {J. Vitter and J. Lin},
  title = {Learning in parallel},
  journal = {Inform. Comput.},
  year = {1992},
  pages = {179--202},
  annote = {Earlier version in COLT88}
}

@ARTICLE{Vit'anyi00,
  author = {Paul Vit{\'a}nyi},
  title = {A discipline of evolutionary programming},
  journal = {Theoret. Comput. Sci.},
  year = {2000},
  volume = {241},
  pages = {3--23},
  number = {1-2},
  note = {Special issue for ALT '96}
}

@INPROCEEDINGS{Vit'anyi96,
  author = {Paul Vit{\'a}nyi},
  title = {Genetic fitness optimization using rapidly mixing {M}arkov chains},
  booktitle = ALT,
  year = {1996},
  volume = {1160},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {67--82},
  publisher = {Springer-Verlag}
}

@ARTICLE{VolkmanCo75,
  author = {Volkman, A. and Collins, FM},
  title = {{Pathogenesis of Salmonella-associated arithritis in the rat.}},
  journal = {Infection and Immunity},
  year = {1975},
  volume = {11},
  pages = {222--230},
  number = {2},
  publisher = {Am Soc Microbiol}
}

@INPROCEEDINGS{Voorhees02,
  author = {E. Voorhees},
  title = {Overview of the {TREC-2002} Question Answering Track},
  booktitle = TREC,
  year = {2002},
  pages = {115--123}
}

@INPROCEEDINGS{Voorhees00,
  author = {E. Voorhees},
  title = {Overview of the TREC-9 Question Answering Track},
  booktitle = TREC,
  year = {2000},
  pages = {71--80},
  publisher = {NIST SP 500-249}
}

@INPROCEEDINGS{Voorhees93,
  author = {Ellen M. Voorhees},
  title = {Using {WordNet} to disambiguate word senses for text retrieval},
  booktitle = SIGIR,
  year = {1993},
  pages = {171--180}
}

@INCOLLECTION{VoorheesHo93,
  author = {Ellen M. Voorhees and Yuan-Wang Hou},
  title = {Vector expansion in a large collection},
  booktitle = TREC,
  publisher = {NIST SP 500-207},
  year = {1993},
  editor = {D. K. Harman},
  pages = {343--351}
}

@INBOOK{VoorheesLeTo95,
  chapter = {15},
  pages = {279--305},
  title = {Learning context to disambiguate word senses},
  publisher = {MIT Press},
  year = {1995},
  author = {Ellen M. Voorhees and Claudia Leacock and Geoffrey Towell},
  volume = {III: Selecting Good Models},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@INPROCEEDINGS{Voutilainen93,
  author = {Atro Voutilainen and Pasi Tapanainen},
  title = {Ambiguity resolution in a reductionistic parser},
  booktitle = EACL,
  year = {1993}
}

@INPROCEEDINGS{VoutilainenTa93,
  author = {Atro Voutilainen and Pasi Tapanainen},
  title = {Ambiguity resolution in a reductionistic parser},
  booktitle = EACL,
  year = {1993}
}

@INPROCEEDINGS{Vovk97,
  author = {V. Vovk},
  title = {Probability theory for the {B}rier game},
  booktitle = ALT,
  year = {1997},
  volume = {1316},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {323--338},
  publisher = {Springer-Verlag}
}

@ARTICLE{Vovk92,
  author = {V. Vovk},
  title = {Universal forecasting algorithms},
  journal = {Inform. Comput.},
  year = {1992},
  volume = {96},
  pages = {245--277},
  number = {2}
}

@INPROCEEDINGS{Vovk90,
  author = {V. Vovk},
  title = {Aggregating Strategies},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1990},
  pages = {371--383},
  publisher = {Morgan Kaufmann},
  location = {Rochester, NY}
}

@INPROCEEDINGS{VovkGaSa99,
  author = {Volodya Vovk and Alex Gammerman and Craig Saunders},
  title = {Machine-learning applications of algorithmic randomness},
  booktitle = ICML,
  year = {1999},
  pages = {444--453},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{VovkWa98,
  author = {V. Vovk and C. Watkins},
  title = {Universal portfolio selection},
  booktitle = COLT,
  year = {1998},
  pages = {12--23},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{Vovk99,
  author = {V. G. Vovk},
  title = {Derandomizing Stochastic Prediction Strategies},
  journal = {Machine Learning},
  year = {1999},
  volume = {35},
  pages = {247--282},
  number = {3},
  comment = {first in 10th COLT '97},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Vovk97a,
  author = {V. G. Vovk},
  title = {Learning about the Parameter of the Bernoulli Model},
  journal = {J. Comput. Syst. Sci.},
  year = {1997},
  volume = {55},
  pages = {96--104},
  number = {1},
  note = {First appeared in EuroCOLT '95}
}

@INPROCEEDINGS{Vovk96,
  author = {V. G. Vovk},
  title = {Learning an optimal decision strategy in an influence diagram with
	latent variables},
  booktitle = COLT,
  year = {1996},
  pages = {110--121},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{Vovk95,
  author = {V. G. Vovk},
  title = {A game of prediction with expert advice},
  booktitle = COLT,
  year = {1995},
  pages = {51--60},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{Vovk95a,
  author = {V. G. Vovk},
  title = {Miminum description length estimators under the optimal coding scheme},
  booktitle = EuroCOLT,
  year = {1995},
  pages = {237--251},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Vovk94,
  author = {V. G. Vovk},
  title = {An optimal-control application of two paradigms of on-line learning},
  booktitle = COLT,
  year = {1994},
  pages = {98--109},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{VyasPa09,
  author = {Vyas, V. and Pantel, P.},
  title = {Semi-Automatic Entity Set Refinement},
  booktitle = NAACL-HLT,
  year = {2009}
}

@INPROCEEDINGS{VyasPa09a,
  author = {Vyas, V. and Pantel, P.},
  title = {Semi-Automatic Entity Set Refinement},
  booktitle = {NAACL-HLT},
  year = {2009},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@INPROCEEDINGS{Viksna96,
  author = {Juris V{\=i}ksna},
  title = {Probabilistic limit identification up to 'small' sets},
  booktitle = ALT,
  year = {1996},
  volume = {1160},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {312--324},
  publisher = {Springer-Verlag}
}

@INCOLLECTION{WoodsSc90,
  author = {Woods W. and Schmulze, J. G.},
  title = {The KL-ONE Family},
  booktitle = {Principles of Semantic Networks: Explorations in theRepresentation
	of Knowledge},
  publisher = {Morgan Kaufmann},
  year = {1990},
  editor = {John Sowa}
}

@INPROCEEDINGS{WachmanKh07,
  author = {G. Wachman and R. Khardon},
  title = {Learning from interpretations: a rooted kernel for ordered hypergraphs},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {943--950},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{WagnerFoGe07,
  author = {Wagner, Joachim and Foster, Jennifer and van Genabith, Josef},
  title = {A Comparative Evaluation of Deep and Shallow Approaches to the Automatic
	Detection of Common Grammatical Errors},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {112--121},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1012}
}

@INBOOK{WGWC95,
  chapter = {8},
  pages = {133--162},
  title = {Soft classification, a.k.a. risk estimation, via penalized log likelihood
	and smoothing spline analysis of variance},
  publisher = {MIT Press},
  year = {1995},
  author = {Grace Wahba and Chong Gu and Yuedong Wang and Richard Chappell},
  volume = {III: Selecting Good Models},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@ARTICLE{Waibel94,
  author = {Alex Waibel},
  title = {Introduction Structured Connectionist Systems},
  journal = {Machine Learning},
  year = {1994},
  volume = {15},
  pages = {121--123},
  publisher = {Kluwer Academic Publishers, Boston}
}

@TECHREPORT{WHGS87,
  author = {A. Waibel and T. Hanazawa and G. Ginton and K. Shikano},
  title = {Phoneme Recognition Using Time-Delay Neural Networks},
  institution = {ATR Interpreting Telephony Laboratories},
  year = {1987}
}

@ARTICLE{WainwrightJo08,
  author = {M. J. Wainwright and M. I. Jordan},
  title = {Graphical Models, Exponential Families, and Variational Inference},
  journal = {Foundations and Trends in Machine Learning},
  year = {2008},
  volume = {1},
  pages = {1-305},
  number = {1-2}
}

@INPROCEEDINGS{Walker89,
  author = {Marylin A. Walker},
  title = {Evaluating discourse processing algorithms},
  booktitle = ACL,
  year = {1989}
}

@INPROCEEDINGS{WallaceKoDa96,
  author = {Chris Wallace and Kevin B. Korb and Honghua Dai},
  title = {Causal discovery via {MML}},
  booktitle = ICML,
  year = {1996},
  pages = {516--524},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{WallaceBo68,
  author = {C. S. Wallace and D. M. Boulton},
  title = {An Information Measure for Classification},
  journal = {The Computer Journal},
  year = {1968},
  volume = {11},
  pages = {185--194},
  number = {2},
  comment = {Introduces idea that `best classification is that which results in
	the briefest recording of all the attribute information'}
}

@ARTICLE{WallacePa93,
  author = {C. S. Wallace and J. D. Patrick},
  title = {Coding Decision Trees},
  journal = {Machine Learning},
  year = {1993},
  volume = {11},
  pages = {7--22},
  publisher = {Kluwer Academic Publishers, Boston}
}

@PHDTHESIS{Wallace89,
  author = {R. S. Wallace},
  title = {Finding Natural Clusters Through Entropy Minimization},
  school = {Carnegie Mellon Computer Science Department},
  year = {1989},
  month = jun,
  note = {Tech. Report CMU-CS-89-183}
}

@INPROCEEDINGS{Wallach06,
  author = {H. Wallach},
  title = {Topic modeling; beyond bag of words},
  booktitle = ICML,
  year = {2006}
}

@INPROCEEDINGS{WallachMuSa09,
  author = {H. Wallach and I. Murray and R. Salakhutdinov},
  title = {Evaluation methods for topic models},
  booktitle = ICML,
  year = {2009}
}

@ARTICLE{Walter51,
  author = {W. G. Walter},
  title = {A Machine That Learns},
  journal = {Scientific American},
  year = {1951},
  pages = {60--63},
  month = aug
}

@ARTICLE{Walter50,
  author = {W. Grey Walter},
  title = {An Imitation of Life},
  journal = {Scientific American},
  year = {1950},
  pages = {42--45},
  month = May
}

@INPROCEEDINGS{WanPa06,
  author = {Wan, S. and Dras, M. and Dale, R. and Paris, C. },
  title = {Using dependency-based features to take the \"para-farce\" out of
	paraphrase},
  booktitle = {Australasian Language Technology Workshop},
  year = {2006}
}

@INPROCEEDINGS{WanYaXi07,
  author = {Wan, Xiaojun and Yang, Jianwu and Xiao, Jianguo},
  title = {Towards an Iterative Reinforcement Approach for Simultaneous Document
	Summarization and Keyword Extraction},
  booktitle = ACL,
  year = {2007},
  pages = {552--559},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1070}
}

@INPROCEEDINGS{WandmacherAn07,
  author = {Wandmacher, Tonio and Antoine, Jean-Yves},
  title = {Methods to Integrate a Language Model with Semantic Information for
	a Word Prediction Component},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {506--513},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1053}
}

@INPROCEEDINGS{WangCoKo07,
  author = {Wang, Chao and Collins, Michael and Koehn, Philipp},
  title = {{C}hinese Syntactic Reordering for Statistical Machine Translation},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {737--745},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1077}
}

@INPROCEEDINGS{WangVe95,
  author = {Changfeng Wang and Santosh S. Venkatesh},
  title = {Criteria for specifying machine complexity in learning},
  booktitle = COLT,
  year = {1995},
  pages = {273--280},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{WangMa99,
  author = {Gang Wang and Sridhar Mahadevan},
  title = {Hierarchical optimization of policy-coupled semi-{M}arkov decision
	processes},
  booktitle = ICML,
  year = {1999},
  pages = {464--473},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{WangYeLo07,
  author = {G. Wang and D. Yeung and F. Lochovsky},
  title = {A kernel path algorithm for support vector machines},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {951--958},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{WYHLT07,
  author = {H. Wang and S. Yan and T. Huang and J. Liu and X. Tang},
  title = {Transductive regression piloted by inter-manifold relations},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {967--974},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{WangZhQi07,
  author = {H. Wang and H. Zha and H. Qin},
  title = {Dirichlet aggregation: unsupervised learning towards an optimal metric
	for proportional data},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {959--966},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{WangFlHe07,
  author = {J. Wang and D. Fleet and A. Hertzmann},
  title = {Multifactor {Gaussian} process models for style-content separation},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {975--982},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{WangYaFe07,
  author = {L. Wang and C. Yang and J. Feng},
  title = {On learning with dissimilarity functions},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {991--998},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{WangZhZo07,
  author = {L. Wang and J. Zhu and H. Zou},
  title = {Hybrid huberized support vector machines for microarray classification},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {983--990},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{WangSmMi07,
  author = {Wang, Mengqiu and Smith, Noah A. and Mitamura, Teruko},
  title = {What is the {J}eopardy Model? A Quasi-Synchronous Grammar for {QA}},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {22--32},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1003}
}

@INPROCEEDINGS{WangCo08,
  author = {Wang, R.C. and Cohen, W.W.},
  title = {Iterative Set Expansion of Named Entities Using the Web},
  booktitle = ICDM,
  year = {2008}
}

@INPROCEEDINGS{WangCo08a,
  author = {Wang, R.C. and Cohen, W.W.},
  title = {Iterative Set Expansion of Named Entities Using the Web},
  year = {2008},
  journal = {ICDM},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@INPROCEEDINGS{WangCo07,
  author = {Wang, R.C. and Cohen, W.W.},
  title = {Language-Independent Set Expansion of Named Entities Using the Web},
  booktitle = ICDM,
  year = {2007}
}

@INPROCEEDINGS{WangCo07a,
  author = {Wang, R.C. and Cohen, W.W.},
  title = {Language-Independent Set Expansion of Named Entities Using the Web},
  year = {2007},
  journal = {ICDM},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@INPROCEEDINGS{WangZhang09,
  author = {Wang, R. and Zhang, Y.},
  title = {Recognizing Textual Relatedness with Predicate-Argument Structures},
  booktitle = EMNLP,
  year = {2009},
  pages = {784--792},
  address = {Singapore},
  month = {August},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/D/D09/D09-1082}
}

@INPROCEEDINGS{WangZhNe09,
  author = {Wang, Rui and Zhang, Yi and Neumann, Guenter},
  title = {A Joint Syntactic-Semantic Representation for Recognizing Textual
	Relatedness},
  booktitle = TAC,
  year = {2009},
  pages = {133--139}
}

@INPROCEEDINGS{WangKnMa07,
  author = {Wang, Wei and Knight, Kevin and Marcu, Daniel},
  title = {Binarizing Syntax Trees to Improve Syntax-Based Machine Translation
	Accuracy},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {746--754},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1078}
}

@INPROCEEDINGS{Wang95,
  author = {Xuemei Wang},
  title = {Learning by observation and practice: an incremental approach for
	planning operator acquisition},
  booktitle = ICML,
  year = {1995},
  pages = {549--557},
  publisher = {Morgan Kaufmann}
}

@TECHREPORT{WangMc05,
  author = {Wang, X. and McCallum, A.},
  title = {A Note on Topical N-grams},
  institution = {University of Massachusetts},
  year = {2005}
}

@INPROCEEDINGS{WangMW07,
  author = {X. Wang and A. McCallum and X. Wei},
  title = {Topical N-grams: Phrase and Topic Discoery with an Application to
	Information Retrieval},
  booktitle = ICDM,
  year = {2007}
}

@UNPUBLISHED{WangAgHa01,
  author = {Y. Wang and P. K. Agarwal and S. {Har-Peled}},
  title = {Occlusion Culling for Fast Walkthrough in Urban Areas},
  note = {manuscript. Available from {\tt{http://www.uiuc.edu/\tildegen{}sariel/papers}}},
  year = {2001}
}

@INPROCEEDINGS{Warmuth07,
  author = {M. Warmuth},
  title = {Winnowing subspaces},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {999--1006},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{Warmuth97,
  author = {Manfred Warmuth},
  title = {Sample compression, learnability, and the {V}apnik-{C}hervonenkis
	dimension},
  booktitle = EuroCOLT,
  year = {1997},
  pages = {1--2},
  publisher = {Springer-Verlag}
}

@UNPUBLISHED{LittlestoneWa89,
  author = {Manfred Warmuth and Nick Littlestone},
  title = {Learning from an adversary},
  note = {In preparation},
  year = {1989}
}

@INPROCEEDINGS{Warmuth89,
  author = {M. K. Warmuth},
  title = {Towards Representation Independence in {PAC}-learning},
  booktitle = AII,
  year = {1989},
  volume = {397},
  series = {Lecture Notes in Artificial Intelligence 397},
  pages = {78--103},
  month = oct,
  publisher = {Springer-Verlag}
}

@ARTICLE{Warntz57,
  author = {W. Warntz},
  title = {Transportation, Social Physics, and the Law of Refraction},
  journal = {The Professional Geographer},
  year = {1957},
  volume = {9},
  pages = {2--7},
  number = {4},
  keywords = {weighted region problem, shortest paths, GIS, Snell's Law}
}

@INPROCEEDINGS{Warwick90,
  author = {S. Warwick and J. Hajic and G. Russell},
  title = {Searching on tagged corpora: linguistically motivated concordance
	analysis},
  booktitle = UWOED,
  year = {1990}
}

@INPROCEEDINGS{WarwickHaRu90,
  author = {S. Warwick and J. Hajic and G. Russell},
  title = {Searching on tagged corpora: linguistically motivated concordance
	analysis},
  booktitle = UWOED,
  year = {1990}
}

@ARTICLE{WasonEv75,
  author = {Wason, P. C. and Evans},
  title = {Dual process in Reasoning},
  journal = {Cognition},
  year = {1975},
  volume = {3},
  pages = {141--154}
}

@INPROCEEDINGS{Watanabe99,
  author = {Osamu Watanabe},
  title = {From Computational Learning Theory to Discovery Science},
  booktitle = ICALP,
  year = {1999},
  volume = {1644},
  series = {Lecture Notes in Computer Science},
  pages = {134--148},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Watanabe90,
  author = {O. Watanabe},
  title = {A formal study of learning via queries},
  booktitle = {Lecture Notes in Computer Science 443: Proceedings of the 17th International
	Colloquium on Automata, Languages and Programming},
  year = {1990},
  pages = {139--152},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Watanabe99a,
  author = {Sumio Watanabe},
  title = {Algebraic Analysis for Singular Statistical Estimation},
  booktitle = ALT,
  year = {1999},
  volume = {1720},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {39--50},
  publisher = {Springer-Verlag}
}

@ARTICLE{Watanabe60,
  author = {S. Watanabe},
  title = {Information-theoretical aspects of inductive and deductive inference},
  journal = {IBM J. of Res. Develop.},
  year = {1960},
  volume = {4},
  pages = {208--231}
}

@INPROCEEDINGS{WSTI07,
  author = {Watanabe, Taro and Suzuki, Jun and Tsukada, Hajime and Isozaki, Hideki},
  title = {Online Large-Margin Training for Statistical Machine Translation},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {764--773},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1080}
}

@INPROCEEDINGS{WatanabeAsMa07,
  author = {Watanabe, Yotaro and Asahara, Masayuki and Matsumoto, Yuji},
  title = {A Graph-Based Approach to Named Entity Categorization in {Wikipedia}
	Using Conditional Random Fields},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {649--657},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1068}
}

@TECHREPORT{WFKRW80,
  author = {D. A. Waterman and William S. Faugh and Philip Klahr and Stanley
	J. Rosenschein and Robert Wesson},
  title = {Design issues for exemplary programming},
  institution = {Rand Corporation, N-1484-RC},
  year = {1980}
}

@ARTICLE{WatkinRaBi93,
  author = {T. L. H. Watkin and A. Rau and M. Biehl},
  title = {The stastical mechanics of learning a rule},
  journal = {Rev. Mod. Phys.},
  year = {1993},
  volume = {65},
  pages = {499--556}
}

@INPROCEEDINGS{Watkins87,
  author = {Watkins, C.J.C.H.},
  title = {Combining Cross--Validation and Search},
  booktitle = {Progress in Machine Learning--Proceedings of EWSL 87: 2nd European
	Working Session on Learning},
  year = {1987},
  editor = {Bratko, I. and N. Lavrac},
  pages = {79--90},
  address = {Bled, Yugoslavia},
  month = may
}

@PHDTHESIS{Watkins89,
  author = {C. J. C. H. Watkins},
  title = {Learning from Delayed Rewards},
  school = {King's College, Oxford},
  year = {1989},
  month = may,
  note = {(To be reprinted by MIT Press.)}
}

@ARTICLE{WatkinsDa92,
  author = {Christopher J. C. H. Watkins and Peter Dayan},
  title = {Technical Note {Q}-Learning},
  journal = {Machine Learning},
  year = {1992},
  volume = {8},
  pages = {279--292},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Watrous92,
  author = {R. L. Watrous},
  title = {A Comparison between Squared Error and Relative Entropy Metrics Using
	Several Optimization Algorithms},
  journal = {Complex Systems},
  year = {1992},
  volume = {6},
  pages = {495--505}
}

@INPROCEEDINGS{Watson99,
  author = {Phil Watson},
  title = {Inductive Learning with Corroboration},
  booktitle = ALT,
  year = {1999},
  volume = {1720},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {145--156},
  publisher = {Springer-Verlag}
}

@INCOLLECTION{Watson95,
  author = {Phil Watson},
  title = {Inductive Inference of Recurrence-Term Languages from Positive Data},
  booktitle = {Algorithmic Learning for Knowledge-Based Systems},
  publisher = {Springer--Verlag},
  year = {1995},
  volume = {961},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {292--315}
}

@INPROCEEDINGS{WatsonBr07,
  author = {Watson, Rebecca and Briscoe, Ted},
  title = {Adapting the {RASP} System for the {CoNLL07} Domain-Adaptation Task},
  booktitle = {CoNLL Shared Task Session of EMNLP-CoNLL},
  year = {2007},
  pages = {1170--1174},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1130}
}

@ARTICLE{WaxmanBo01,
  author = {S. R. Waxman and A. Booth},
  title = {Seeing Pink Elephants: Fourteen-month-olds's interpretations of novel
	nouns and adjectives},
  journal = {Cognitive Psychology},
  year = {2001},
  volume = {43},
  pages = {217-242}
}

@ARTICLE{Webb00,
  author = {Geoffrey I. Webb},
  title = {Multi{B}oosting: {A} Technique for Combining {B}oosting and {W}agging},
  journal = {Machine Learning},
  year = {2000},
  volume = {40},
  pages = {159--196},
  number = {2},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{WebbWeZh99,
  author = {Geoffrey I. Webb and Jason Wells and Zijian Zheng},
  title = {An Experimental Evaluation of Integrating Machine Learning with Knowledge},
  journal = {Machine Learning},
  year = {1999},
  volume = {35},
  pages = {5--23},
  number = {1},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{WeigendHuRu90,
  author = {A. Weigend and B. Huberman and D. Rumelhart},
  title = {Predicting the Future: {A} Connectionist Approach},
  journal = {Internat. J. Neural Syst.},
  year = {1990},
  volume = {1},
  pages = {193--209}
}

@INBOOK{WeigendRu94,
  chapter = {16},
  pages = {457--476},
  title = {Weight elimination and effective network size},
  publisher = {MIT Press},
  year = {1994},
  author = {Andreas S. Weigend and David E. Rumelhart},
  volume = {I: Constraints and Prospects},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@INCOLLECTION{WeilWi93,
  author = {W. Weil and J. A. Wieacker},
  title = {Stochastic Geometry},
  booktitle = {Handbook of Convex Geometry},
  publisher = {North-Holland},
  year = {1993},
  editor = {P. M. Gruber and J. M. Wills},
  volume = {B},
  chapter = {5.2},
  pages = {1393--1438},
  address = {Amsterdam, Netherlands}
}

@ARTICLE{WeinbergerMeFe94,
  author = {M. J. Weinberger and N. Merhav and M. Feder},
  title = {Optimal Sequential Probability Assignment for Individual Sequences},
  journal = {{IEEE} Transactions on Information Theory},
  year = {1994},
  volume = {40},
  pages = {384--396},
  number = {2},
  month = mar
}

@INPROCEEDINGS{Weiss95,
  author = {Gary M. Weiss},
  title = {Learning with rare cases and small disjuncts},
  booktitle = ICML,
  year = {1995},
  pages = {558--565},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{WeissHi98,
  author = {Gary M. Weiss and Haym Hirsh},
  title = {The problem with noise and small disjuncts},
  booktitle = ICML,
  year = {1998},
  pages = {574--578},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@BOOK{WeissKu91,
  title = {Computer Systems that Learn},
  publisher = {Morgan Kaufmann},
  year = {1991},
  author = {S. Weiss and C. Kulikowski},
  address = {San Mateo, CA}
}

@INPROCEEDINGS{WeissIn94,
  author = {Sholom M. Weiss and Nitin Indurkhya},
  title = {Small sample decision tree pruning},
  booktitle = ICML,
  year = {1994},
  pages = {335--342},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{WeissmannMe99,
  author = {Tsachy Weissmann and Neri Merhav},
  title = {On prediction of individual sequences relative to a set of experts
	in the presence of noise},
  booktitle = COLT,
  year = {1999},
  pages = {19--28},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{WeldHoWu08,
  author = {Daniel S. Weld and Raphael Hoffman and Fei Wu},
  title = {Using Wikipedia to Bootstrap Open Information Extraction},
  journal = {ACM SIGMOD Special Issue on Managing Information Extraction},
  year = {2008},
  volume = {37},
  pages = {62--68},
  number = {4},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@ARTICLE{WellmanBrGo92,
  author = {M. P. Wellman and J. S. Breese and R. P. Goldman},
  title = {From Knowledge Bases to Decision Models},
  journal = {Knowledge Engineering Review},
  year = {1992},
  volume = {7},
  pages = {35-53}
}

@INPROCEEDINGS{WellnerPu07,
  author = {Wellner, Ben and Pustejovsky, James},
  title = {Automatically Identifying the Arguments of Discourse Connectives},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {92--101},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1010}
}

@INCOLLECTION{Welzl91,
  author = {E. Welzl},
  title = {Smallest enclosing disks (balls and ellipsoids)},
  booktitle = {New Results and New Trends in Computer Science},
  publisher = {Springer-Verlag},
  year = {1991},
  editor = {H. Maurer},
  volume = {555},
  series = {Lecture Notes Comput. Sci.},
  pages = {359--370}
}

@INCOLLECTION{Welzl92,
  author = {E. Welzl},
  title = {On spanning trees with low crossing numbers},
  booktitle = {Data Structures and Efficient Algorithms, Final Report on the DFG
	Special Joint Initiative},
  publisher = {Springer-Verlag},
  year = {1992},
  volume = {594},
  series = {Lecture Notes Comput. Sci.},
  pages = {233--249},
  url = {http://www.inf.ethz.ch/personal/emo/ps-files/LowCross-LNCS594.ps}
}

@ARTICLE{WenocurDu81,
  author = {Wenocur, R. S. and R. M. Dudley},
  title = {Some Special Vapnik-Chervonenkis Classes},
  journal = {Discrete Mathematics},
  year = {1981},
  volume = {33},
  pages = {313--318},
  comment = {Shows VC dimension of half-spaces in n dimensions is n.}
}

@INPROCEEDINGS{Werner07,
  author = {T. Werner},
  title = {What is decreased by the max-sum arc consistency algorithm?},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {1007--1014},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@BOOK{West01,
  title = {Intorudction to Graph Theory},
  publisher = {Prentice Hall},
  year = {2001},
  author = {D. B. West},
  edition = {2ed}
}

@INPROCEEDINGS{WMCPPV00,
  author = {J. Weston and S. Mukherjee and O. Chapelle and M. Pontil and T. Poggio
	and V. Vapnik},
  title = {Feature Selection for SVMs},
  booktitle = NIPS,
  year = {2000},
  pages = {668-674}
}

@ARTICLE{WettschereckDi95,
  author = {Dietrich Wettschereck and Thomas G. Dietterich},
  title = {An Experimental Comparison of the Nearest-Neighbor and Nearest-Hyperrectangle
	Algorithms},
  journal = {Machine Learning},
  year = {1995},
  volume = {19},
  pages = {5--27},
  number = {1},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Wexler82,
  author = {K. Wexler},
  title = {On Extensional Learnability},
  journal = {Cognition},
  year = {1982},
  volume = {11},
  pages = {89--95}
}

@BOOK{WexlerCu80,
  title = {Formal Principles of Language Acquisition},
  publisher = {MIT Press, Cambridge, Mass.},
  year = {1980},
  author = {K. Wexler and P. Culicover}
}

@INCOLLECTION{WexlerHa73,
  author = {K. Wexler and H. Hamburger},
  title = {On the Sufficiency of Surface Data for the Learning of Transformational
	Languages},
  booktitle = {Approaches to Natural Language},
  publisher = {Dordecht, D. reidel},
  year = {1973}
}

@ARTICLE{Wharton77,
  author = {R. M. Wharton},
  title = {Grammar enumeration and inference},
  journal = {Inform. Control},
  year = {1977},
  volume = {33},
  pages = {253--272}
}

@ARTICLE{Wharton74,
  author = {R. M. Wharton},
  title = {Approximate language identification},
  journal = {Inform. Control},
  year = {1974},
  volume = {26},
  pages = {236--255}
}

@ARTICLE{WhiteLi94,
  author = {Allan P. White and Wei Zhong Liu},
  title = {Bias in Information-Based Measures in Decision Tree Induction},
  journal = {Machine Learning},
  year = {1994},
  volume = {15},
  pages = {321--329},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{White90,
  author = {H. White},
  title = {Connectionist Nonparametric Regression: Multilayer Feedforward Networks
	can Learn Arbitrary Mappings},
  journal = {Neural Networks},
  year = {1990},
  volume = {3},
  pages = {535--549}
}

@ARTICLE{White90a,
  author = {H. White},
  title = {Learning in artificial neural networks: a statistical perspective},
  journal = {Neural Computation},
  year = {1990},
  volume = {1},
  pages = {425--464},
  number = {4}
}

@BOOK{White89,
  title = {Cortical Circuits: Synaptic Organization of the Cerebral Cortex -
	Structure, Function and Theory},
  publisher = {Van Nostrand Reinhold},
  year = {1990},
  author = {White, L. Edward},
  address = {New York},
  comment = {Ch. 7,8, contains a survey of the brain structure}
}

@ARTICLE{WhiteheadBa91,
  author = {Steven D. Whitehead and Dana H. Ballard},
  title = {Learning to Perceive and Act by Trial and Error},
  journal = {Machine Learning},
  year = {1991},
  volume = {7},
  pages = {45--83},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{WDDA93,
  author = {D. Whitley and S. Dominic and R. Das and C. W. Anderson},
  title = {Genetic Reinforcement Learning for Neurocontrol Problems},
  journal = {Machine Learning},
  year = {1993},
  volume = {13},
  pages = {259--284},
  publisher = {Kluwer Academic Publishers, Boston}
}

@BOOK{Whittle83,
  title = {Optimization Over Time},
  publisher = {Wiley},
  year = {1983},
  author = {Peter Whittle},
  volume = {II}
}

@INPROCEEDINGS{Widmer96,
  author = {Gerhard Widmer},
  title = {Recognition and exploitation of contextual clues via incremental
	meta-learning},
  booktitle = ICML,
  year = {1996},
  pages = {525--533},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{WidmerKu96,
  author = {Gerhard Widmer and Miroslav Kubat},
  title = {Learning in the Presence of Concept Drift and Hidden Contexts},
  journal = {Machine Learning},
  year = {1996},
  volume = {23},
  pages = {69--101},
  number = {1},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{WidrowHo60,
  author = {Bernard Widrow and Marcian E. Hoff},
  title = {Adaptive Switching Circuits},
  journal = {1960 IRE WESCON Convention Record},
  year = {1960},
  pages = {96--104},
  note = {Reprinted in {\sl Neurocomputing} (MIT Press, 1988).},
  publisher = {IRE}
}

@BOOK{WidrowSt85,
  title = {Adaptive Signal Processing},
  publisher = {Prentice-Hall},
  year = {1985},
  author = {B. Widrow and S. Stearns},
  address = {Englewood Cliffs, NJ}
}

@INPROCEEDINGS{Wiedermann99,
  author = {Jiri Wiedermann},
  title = {The Computational Limits to the Cognitive Power of the Neuroidal
	Tabula Rasa},
  booktitle = ALT,
  year = {1999},
  volume = {1720},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {63--76},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Wiehagen93,
  author = {R. Wiehagen},
  title = {From inductive inference to algorithmic learning theory},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1993},
  volume = {743},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {13--24},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Wiehagen90,
  author = {R. Wiehagen},
  title = {A Thesis in Inductive Inference},
  booktitle = {Nonmonotonic and Inductive Logic},
  year = {1990},
  pages = {184--207},
  publisher = {Springer Verlag},
  note = {Lecture Notes in Computer Science 543}
}

@INPROCEEDINGS{Wiehagen86,
  author = {R. Wiehagen},
  title = {On the Complexity of Effective Program Synthesis},
  booktitle = {International Workshop on Analogical and Inductive Inference},
  year = {1986},
  volume = {265},
  series = {Lecture Notes in Computer Science},
  pages = {209--219},
  publisher = {Springer-Verlag}
}

@ARTICLE{Wiehagen86a,
  author = {R. Wiehagen},
  title = {On the Complexity of Program Synthesis from Examples},
  journal = {Elektronische Informationsverarbeitung und Kybernetik},
  year = {1986},
  volume = {22},
  pages = {305--323}
}

@INPROCEEDINGS{Wiehagen86b,
  author = {R. Wiehagen},
  title = {How Fast is Program Synthesis from Examples},
  booktitle = {International Spring School on Mathematical Methods of Specification
	and Synthesis of Software Systems},
  year = {1986},
  volume = {215},
  series = {Lecture Notes in Computer Science},
  pages = {231--239}
}

@INPROCEEDINGS{Wiehagen78,
  author = {R. Wiehagen},
  title = {Characterization problems in the theory of inductive inference},
  booktitle = ICALP,
  year = {1978},
  volume = {62},
  series = {Lecture Notes in Compute Science},
  pages = {494--508},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Wiehagen77,
  author = {R. Wiehagen},
  title = {Identification of formal languages},
  booktitle = FOCS,
  year = {1977},
  volume = {53},
  series = {Lecture Notes in Computer Science},
  pages = {571--579},
  publisher = {Springer-Verlag}
}

@ARTICLE{Wiehagen76,
  author = {R. Wiehagen},
  title = {Limes-{E}rkennung rekursiver {F}unktionen durch spezielle {S}trategien},
  journal = {Elektronische Informationsverarbeitung und Kybernetik},
  year = {1976},
  volume = {12},
  pages = {93--99}
}

@INPROCEEDINGS{Wiehagen75,
  author = {R. Wiehagen},
  title = {Inductive inference of recursive functions},
  booktitle = {Lecture Notes in Computer Science 32, Mathematical Foundations of
	Computer Science 75},
  year = {1975},
  pages = {462--464},
  publisher = {Springer-Verlag}
}

@ARTICLE{WiehagenFrKi84,
  author = {R. Wiehagen and R. Freivalds and E. B. Kinber},
  title = {On the Power of Probabilistic Strategies in Inductive Inference},
  journal = {Theoret. Comput. Sci.},
  year = {1984},
  volume = {28},
  pages = {111--133}
}

@ARTICLE{WiehagenJu77,
  author = {R. Wiehagen and H. Jung},
  title = {Rekursionstheoretische {C}harakterisierung von erkennbaren {K}lassen
	rekursiver {F}unktionen},
  journal = {Elektronische Informationsverarbeitung und Kybernetik},
  year = {1977},
  volume = {13},
  pages = {385--397}
}

@ARTICLE{WiehagenLi76,
  author = {R. Wiehagen and W. Liepe},
  title = {Charakteristche {E}igenschaften von erkennbaren {K}lassen rekursiver
	{F}unktionen},
  journal = {Elektronische Informationsverarbeitung und Kybernetik},
  year = {1976},
  volume = {12},
  pages = {421--438}
}

@INPROCEEDINGS{WiehagenSm92,
  author = {R. Wiehagen and C. H. Smith},
  title = {Generalization versus classification},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1992},
  pages = {224--230},
  publisher = {ACM Press, New York, NY}
}

@INCOLLECTION{WiehagenSmZe95,
  author = {R. Wiehagen and C. H. Smith and T. Zeugmann},
  title = {Classifying recursive predicates and languages},
  booktitle = {Algorithmic Learning for Knowledge-Based Systems},
  publisher = {Springer--Verlag},
  year = {1995},
  volume = {961},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {174--189},
  note = {Was GOSLER-Report FB Mathematick und Informatik, TH Lepzig, 21/93
	in 1993}
}

@INPROCEEDINGS{WiehagenSmZe94,
  author = {R. Wiehagen and C. H. Smith and T. Zeugmann},
  title = {Classification of Predicates and Languages},
  booktitle = EuroCOLT,
  year = {1994},
  volume = {New Series Number 53},
  series = {The Institute of Mathematics and its Applications Conference Series},
  pages = {171--181},
  address = {Oxford},
  publisher = {Oxford University Press},
  isbn = {0 19 853492 2}
}

@INCOLLECTION{WiehagenZe95,
  author = {R. Wiehagen and T. Zeugmann},
  title = {Learning and Consistency},
  booktitle = {Algorithmic Learning for Knowledge-Based Systems},
  publisher = {Springer--Verlag},
  year = {1995},
  volume = {961},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {1--24},
  comment = {An earlier version appeared as GOSLER-Report 28/94, FB Mathematik
	und Informatik, TH Lepzig, 1994.}
}

@ARTICLE{WiehagenZe94,
  author = {R. Wiehagen and T. Zeugmann},
  title = {Ignoring data may be the only way to learn efficiently},
  journal = {J. of Experimental and Theoret. Artif. Intell.},
  year = {1994},
  volume = {6},
  pages = {131--144},
  number = {1},
  note = {Special issue for AII '92}
}

@INPROCEEDINGS{WiehagenZe92,
  author = {R. Wiehagen and T. Zeugmann},
  title = {Too Much Information Can be too Much for Efficient Learning},
  booktitle = {International Workshop on Analogical and Inductive Inference},
  year = {1992},
  volume = {642},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {72--86},
  publisher = {Springer--Verlag}
}

@INPROCEEDINGS{WieringSc96,
  author = {Marco Wiering and J{\"u}rgen Schmidhuber},
  title = {Solving {POMDP}s with {L}evin search and {EIRA}},
  booktitle = ICML,
  year = {1996},
  pages = {534--542},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{WiernikSh88,
  author = {A. Wiernik and M. Sharir},
  title = {{Planar realization of nonlinear Davenport-Schinzel sequences by
	segments}},
  journal = DCG,
  year = {1988},
  volume = {3},
  pages = {15--47}
}

@INPROCEEDINGS{Wiklicky94,
  author = {H. Wiklicky},
  title = {The Neural Network Loading Problem is Undecidable},
  booktitle = EuroCOLT,
  year = {1994},
  volume = {New Series Number 53},
  series = {The Institute of Mathematics and its Applications Conference Series},
  pages = {183--192},
  address = {Oxford},
  publisher = {Oxford University Press},
  isbn = {0 19 853492 2}
}

@ARTICLE{Wild06,
  author = {C. Wild},
  title = {The Concept of Distribution},
  journal = {Statistics Education Research Journal},
  year = {2006},
  volume = {5},
  pages = {10--26},
  number = {2}
}

@TECHREPORT{WileyTe85,
  author = {Wiley, R. Paul and Robert R. Tenney},
  title = {Performace Evaluation of Stochastic Timed Decision-Free Petri Nets},
  institution = {MIT Laboratory for Information and Decision Sciences},
  year = {1985},
  number = {LIDS-P-1443},
  month = Mar,
  comment = {Interesting model for a stochastic system.}
}

@TECHREPORT{WilhelmsSk89,
  author = {Wilhelms, Jane and Robert Skinner},
  title = {A "Notion" for Interactive Behavioral Animation Control},
  institution = {University of California, Santa Cruz},
  year = {1989},
  number = {UCSC-CRL-89-01},
  month = Feb
}

@ARTICLE{Wilks75,
  author = {Yorick Wilks},
  title = {An intelligent analyzer and understander of English},
  journal = CACM,
  year = {1975},
  volume = {18},
  pages = {264--274},
  number = {5},
  note = {reprinted in RNLP}
}

@ARTICLE{Wilks75a,
  author = {Yorick Wilks},
  title = {A preferential pattern-seeking semantics for natural language inference},
  journal = AI,
  year = {1975},
  volume = {6},
  pages = {53--74}
}

@INPROCEEDINGS{Wilks85,
  author = {Yorick Wilks and Xiuming Huang and Dan Fass},
  title = {Syntax, preference and right attachment},
  booktitle = IJCAI,
  year = {1985}
}

@INPROCEEDINGS{WilksHuFa85,
  author = {Yorick Wilks and Xiuming Huang and Dan Fass},
  title = {Syntax, preference and right attachment},
  booktitle = IJCAI,
  year = {1985}
}

@UNPUBLISHED{WilksSt96,
  author = {Wilks, Y. and Stevenson, M.},
  title = {The Grammer of sense: Is word-sense tagging much more then Part-Of-Speach
	tagging?},
  note = {cmp-lg/9607028},
  year = {1996}
}

@ARTICLE{Willard91,
  author = {Dan E. Willard},
  title = {Optimial Sample Cost Residues for Differential Database Batch Query
	Problems},
  journal = jacm,
  year = {1991},
  volume = {38},
  pages = {104-119},
  number = {1},
  month = jan,
  keywords = {Data Structure and Algorithms; Measurements; Performance; databases;
	sampling; }
}

@ARTICLE{WillemsShTj95,
  author = {Willems, F.M.J, Y.M Shtarkov and T.J Tjalkens},
  title = {The context tree weighting method: basic propoerties},
  journal = {IEEE Transactions on Information Theory},
  year = {1995},
  volume = {IT-41},
  pages = {653--664},
  number = {3}
}

@ARTICLE{WilliamsVi00,
  author = {Christopher K. I. Williams and Francesco Vivarelli},
  title = {Upper and Lower Bounds on the Learning Curve for Gaussian Processes},
  journal = {Machine Learning},
  year = {2000},
  volume = {40},
  pages = {77--102},
  number = {1},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Williams92,
  author = {Ronald J. Williams},
  title = {Simple Statistical Gradient-Following Algorithms for Connectionist
	Reinforcement Learning},
  journal = {Machine Learning},
  year = {1992},
  volume = {8},
  pages = {229--256},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{WilliamsonSmSc00,
  author = {Robert C. Williamson and Alex J. Smola and Bernhard Sch{\"o}lkopf},
  title = {Entropy Numbers of Linear Function Classes},
  booktitle = COLT,
  year = {2000},
  pages = {309--319},
  publisher = {Morgan Kaufmann, San Francisco}
}

@INPROCEEDINGS{WilliamsonSmSc99,
  author = {Robert C. Williamson and Alex J. Smola and Bernhard Sch{\"o}lkopf},
  title = {Entropy Numbers, Operators and Support Vector Kernels},
  booktitle = EuroCOLT,
  year = {1999},
  volume = {1572},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {285--299},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{WFTR07,
  author = {A. Wilson and A. Fern and P. Tadepalli and S. Ray},
  title = {Multi-task reinforcement learning: a hierarchical {Bayesian} approach},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {1015--1022},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@ARTICLE{WilsonMa00,
  author = {D. Randall Wilson and Tony R. Martinez},
  title = {Reduction Techniques for Instance-Based Learning Algorithms},
  journal = {Machine Learning},
  year = {2000},
  volume = {38},
  pages = {257--286},
  number = {3},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{WilsonMa97,
  author = {D. Randall Wilson and Tony R. Martinez},
  title = {Instance pruning techniques},
  booktitle = ICML,
  year = {1997},
  pages = {403--411},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{Wilson87,
  author = {Stewart W. Wilson},
  title = {Classifier Systems and the Animat Problem},
  journal = {Machine Learning},
  year = {1987},
  volume = {2},
  pages = {199--228},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{Wilson85,
  author = {Wilson, Stuart W.},
  title = {Knowledge Growth in an Artificial Animal},
  booktitle = {International Conference on Genetic Algorithms and their Applications},
  year = {1985},
  pages = {16--23},
  month = Jul,
  comment = {Empirical results for a `critter' wandering around in the woods trying
	to find food, using a genetic algorithm a la Holland to learn general
	situation/action rules.}
}

@INCOLLECTION{Winston75,
  author = {Winston, Patrick H.},
  title = {Learning Structural Descriptions from Examples},
  booktitle = {The Psychology of Computer Vision},
  publisher = {McGraw-Hill},
  year = {1975},
  editor = {Winston, Patrick H.},
  address = {New York},
  tag = {TOC-display}
}

@TECHREPORT{Winston81,
  author = {Winston, Patrick H.},
  title = {Learning New Principles From Precedents and Exercises: The Details},
  institution = {MIT Artificial Intelligence Laboratory},
  year = {1981},
  number = {AIM632},
  month = {May},
  tag = {TOC-display}
}

@INPROCEEDINGS{WipfNa07,
  author = {D. Wipf and S. Nagarajan},
  title = {Beamforming using the relevance vector machine},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {1023--1030},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@ARTICLE{Witten77,
  author = {Witten, Ian H.},
  title = {An Adaptive Optimal Controller for Discrete-Time Markov Environments},
  journal = {Information and Control},
  year = {1977},
  volume = {34},
  pages = {286--295},
  comment = {Controller sees state of environment at each instant, and gets reward
	from that state. Uses discounted expectation of future reward to
	guide action selection.}
}

@INPROCEEDINGS{WittnerDe88,
  author = {B. S. Wittner and J. S. Denker},
  title = {Strategies for Teaching Layered Networks Classification Tasks},
  booktitle = NIPS,
  year = {1988},
  editor = {D. Z. Anderson},
  pages = {850--859},
  address = {New York},
  publisher = {American Insitute of Physics}
}

@ARTICLE{WnekMi94,
  author = {Janusz Wnek and Ryszard S. Michalski},
  title = {Hypothesis-Driven Constructive Induction in {AQ17}-{HCI}: {A} Method
	and Experiments},
  journal = {Machine Learning},
  year = {1994},
  volume = {14},
  pages = {139--168},
  number = {2},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{WolpertMa99,
  author = {David Wolpert and William G. Macready},
  title = {An Efficient Method To Estimate Bagging's Generalization Error},
  journal = {Machine Learning},
  year = {1999},
  volume = {35},
  pages = {41--55},
  number = {1},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INBOOK{Wolpert95,
  chapter = {11},
  pages = {203--224},
  title = {On the {B}ayesian '{O}ccam factors' argument for {O}ccam's razor},
  publisher = {MIT Press},
  year = {1995},
  author = {David H. Wolpert},
  volume = {III: Selecting Good Models},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@INPROCEEDINGS{Wolpert95a,
  author = {David H. Wolpert},
  title = {Horizontal generalization},
  booktitle = ICML,
  year = {1995},
  pages = {566--574},
  publisher = {Morgan Kaufmann}
}

@INBOOK{Wolpert94,
  chapter = {3},
  pages = {29--50},
  title = {Filter likelihoods and exhaustive learning},
  publisher = {MIT Press},
  year = {1994},
  author = {David H. Wolpert},
  volume = {II: Intersections Between Theory and Experiment},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@ARTICLE{Wolpert92,
  author = {Wolpert, David H.},
  title = {On the Connection Between In-Sample Testing andGeneralization Error},
  journal = {Complex Systems},
  year = {1992},
  volume = {6(1)},
  pages = {47-94},
  month = Feb
}

@INBOOK{Wong94,
  chapter = {23},
  pages = {401--413},
  title = {A comparitive study of the {K}ohonen self-organizing map and the
	elastic net},
  publisher = {MIT Press},
  year = {1994},
  author = {Yiu-fai Wong},
  volume = {II: Intersections Between Theory and Experiment},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@INPROCEEDINGS{WongMo07,
  author = {Wong, Y.-W. and Mooney, R.},
  title = {Learning Synchronous Grammars for Semantic Parsing with Lambda Calculus},
  booktitle = ACL,
  year = {2007},
  pages = {960--967},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1121}
}

@INPROCEEDINGS{WongMo06,
  author = {Wong, Y.-W. and Mooney, R.},
  title = {Learning for Semantic Parsing with Statistical Machine Translation},
  booktitle = NAACL,
  year = {2006},
  pages = {439--446},
  address = {New York City, USA},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/N/N06/N06-1056}
}

@ARTICLE{WoodlandSm89,
  author = {P. C. Woodland and S. G. Smyth},
  title = {An Experimental Comparison of Connectionist and Conventional Classification
	Systems on Natural Data},
  journal = {Speech Communication},
  year = {1989},
  volume = {9},
  pages = {73--82},
  month = oct
}

@INCOLLECTION{Woods75,
  author = {Woods, W.},
  title = {What's in a link: foundation of semantic networks},
  booktitle = {Representation and Understanding: Studies inCognitive Science},
  publisher = {Academic Press},
  year = {1975},
  editor = {D. Bobrow and A. Collins}
}

@INCOLLECTION{Woods90,
  author = {Woods, W.},
  title = {Understanding Subsumption and Taxonomy: A Framework forProgress},
  booktitle = {Principles of Semantic Networks: Explorations in theRepresentation
	of Knowledge},
  publisher = {Morgan Kaufmann},
  year = {1990},
  editor = {John Sowa}
}

@ARTICLE{Woods87,
  author = {Woods, W.},
  title = {Don't Blame the Tool},
  journal = {Computational Intelligence},
  year = {1987},
  volume = {3},
  pages = {228--237},
  number = {3}
}

@INCOLLECTION{Woods78,
  author = {Woods, W. A.},
  title = {Semantics and quantification in natural language question answering},
  booktitle = {Advances in Computers},
  publisher = {Academic Press},
  year = {1978},
  editor = {M. Yovits},
  volume = {17},
  pages = {2--64},
  note = {Reprinted in {\em Readings in Natural Language Processing}, B. Grosz,
	K. Spark Jones and B. Lynn Webber (eds), 1986.}
}

@INCOLLECTION{WoodwardMa98,
  author = {A. L. Woodward and E. M. Markman},
  title = {Early word learning},
  booktitle = {Handbook of child psychology, Volume 2: Cognition, perception and
	language},
  publisher = {John Wiley and Sons},
  year = {1998},
  editor = {W. Damon and D. Kuhn and R. Siegler},
  pages = {371-420},
  address = {New York}
}

@INPROCEEDINGS{WoznicaKaHi07,
  author = {A. Woznica and A. Kalousis and M. Hilario},
  title = {Learning to combine distances for complex representations},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {1031--1038},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{Wright90,
  author = {K. Wright},
  title = {Inductive identification of pattern languages with restricted substitutions},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1990},
  pages = {111--121},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{Wright89,
  author = {K. Wright},
  title = {Identification of unions of languages drawn from an identifiable
	class},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1989},
  pages = {328--333},
  publisher = {Morgan Kaufmann},
  note = {(See also the correction by Motoki, Shinohara and Wright in the Proceedings
	of the Fourth Annual Workshop on Computational Learning Theory, page
	375, 1991)}
}

@INPROCEEDINGS{Wrobel98,
  author = {S. Wrobel},
  title = {Scalability Issues in Inductive Logic Programming},
  booktitle = ALT,
  year = {1998},
  volume = {1501},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {11--30},
  publisher = {Springer-Verlag}
}

@ARTICLE{Wrobel94,
  author = {Stefan Wrobel},
  title = {Concept Formation During Interactive Theory Revision},
  journal = {Machine Learning},
  year = {1994},
  volume = {14},
  pages = {169--191},
  number = {2},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{WBSM95,
  author = {Cathy Wu and Michael Berry and Sailaja Shivakumar and Jerry McLarty},
  title = {Neural networks for full-scale protein sequence classification: sequence
	encoding with singular value decomposition},
  journal = {Machine Learning},
  year = {1995},
  volume = {21},
  pages = {177--193},
  number = {1/2}
}

@INPROCEEDINGS{Wu96,
  author = {Dekai Wu},
  title = {A Polynomial-Time Algorithm for Statistical Machine Translation},
  booktitle = ACL,
  year = {1996},
  pages = {152--158},
  address = {Santa Cruz, California},
  month = Jun
}

@INPROCEEDINGS{Wu:acl:96,
  author = {Dekai Wu},
  title = {A Polynomial-Time Algorithm for Statistical Machine Translation},
  booktitle = ACL,
  year = {1996},
  pages = {152--158},
  address = {Santa Cruz, California},
  month = Jun
}

@INPROCEEDINGS{Wu95,
  author = {Dekai Wu},
  title = {An Algorithm for Simultaneously Bracketing Parallel Texts by Aligning
	Words},
  booktitle = ACL,
  year = {1995},
  pages = {244--251},
  address = {Cambridge, Massachusetts},
  month = Jun
}

@INPROCEEDINGS{Wu95a,
  author = {Dekai Wu},
  title = {Trainable Coarse Bilingual Grammars for Parallel Text Bracketing},
  booktitle = {Annual Workshop on Very Large Corpora},
  year = {1995},
  pages = {69--81},
  address = {Cambridge, Massachusetts},
  month = Jun
}

@INPROCEEDINGS{Wu95b,
  author = {Dekai Wu},
  title = {Grammarless Extraction of Phrasal Translation Examples from Parallel
	Texts},
  booktitle = TMI,
  year = {1995},
  volume = {2},
  pages = {354--372},
  address = {Leuven, Belgium},
  month = Jul
}

@INPROCEEDINGS{Wu95c,
  author = {Dekai Wu},
  title = {Stochastic Inversion Transduction Grammars, with Application to Segmentation,
	Bracketing, and Alignment of Parallel Corpora},
  booktitle = IJCAI,
  year = {1995},
  pages = {1328--1334},
  address = {Montreal},
  month = Aug
}

@INPROCEEDINGS{Wu:acl:95,
  author = {Dekai Wu},
  title = {An Algorithm for Simultaneously Bracketing Parallel Texts by Aligning
	Words},
  booktitle = ACL,
  year = {1995},
  pages = {244--251},
  address = {Cambridge, Massachusetts},
  month = Jun
}

@INPROCEEDINGS{Wu:ijcai:95,
  author = {Dekai Wu},
  title = {Stochastic Inversion Transduction Grammars, with Application to Segmentation,
	Bracketing, and Alignment of Parallel Corpora},
  booktitle = IJCAI,
  year = {1995},
  pages = {1328--1334},
  address = {Montreal},
  month = Aug
}

@INPROCEEDINGS{Wu:tmi:95,
  author = {Dekai Wu},
  title = {Grammarless Extraction of Phrasal Translation Examples from Parallel
	Texts},
  booktitle = TMI,
  year = {1995},
  volume = {2},
  pages = {354--372},
  address = {Leuven, Belgium},
  month = Jul
}

@INPROCEEDINGS{Wu:wvlc:95,
  author = {Dekai Wu},
  title = {Trainable Coarse Bilingual Grammars for Parallel Text Bracketing},
  booktitle = {Annual Workshop on Very Large Corpora},
  year = {1995},
  pages = {69--81},
  address = {Cambridge, Massachusetts},
  month = Jun
}

@INPROCEEDINGS{Wu94,
  author = {Dekai Wu},
  title = {Aligning a parallel English-Chinese corpus statistically with lexical
	criteria},
  booktitle = ACL,
  year = {1994},
  pages = {80--87}
}

@INPROCEEDINGS{Wu94a,
  author = {Dekai Wu},
  title = {Aligning a Parallel {E}nglish-{C}hinese Corpus Statistically with
	Lexical Criteria},
  booktitle = ACL,
  year = {1994},
  pages = {80--87},
  address = {Las Cruces, New Mexico},
  month = Jun
}

@INPROCEEDINGS{Wu:acl:94,
  author = {Dekai Wu},
  title = {Aligning a Parallel {E}nglish-{C}hinese Corpus Statistically with
	Lexical Criteria},
  booktitle = ACL,
  year = {1994},
  pages = {80--87},
  address = {Las Cruces, New Mexico},
  month = Jun
}

@INPROCEEDINGS{WBCS99,
  author = {Donghui Wu and Kristin P. Bennett and Nello Cristianini and John
	Shawe-Taylor},
  title = {Large margin trees for induction and transduction},
  booktitle = ICML,
  year = {1999},
  pages = {474--483},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{Wu-Ng:95,
  author = {Dekai Wu and Cindy Ng},
  title = {Using Brackets to Improve Search for Statistical Machine Translation},
  booktitle = PACLIC,
  year = {1995},
  pages = {195--204},
  address = {Hong Kong},
  month = Dec
}

@INPROCEEDINGS{WuNg95,
  author = {Dekai Wu and Cindy Ng},
  title = {Using Brackets to Improve Search for Statistical Machine Translation},
  booktitle = PACLIC,
  year = {1995},
  pages = {195--204},
  address = {Hong Kong},
  month = Dec
}

@ARTICLE{Wu-Xia:mtj:95,
  author = {Dekai Wu and Xuanyin Xia},
  title = {Large-scale automatic extraction of an {E}nglish-{C}hinese lexicon},
  journal = {Machine Translation},
  year = {1995},
  volume = {9},
  pages = {285--313},
  number = {3--4}
}

@ARTICLE{WuXi95,
  author = {Dekai Wu and Xuanyin Xia},
  title = {Large-scale automatic extraction of an {E}nglish-{C}hinese lexicon},
  journal = {Machine Translation},
  year = {1995},
  volume = {9},
  pages = {285--313},
  number = {3--4}
}

@INPROCEEDINGS{Wu-Xia:94,
  author = {Dekai Wu and Xuanyin Xia},
  title = {Learning an {E}nglish-{C}hinese lexicon from a parallel corpus},
  booktitle = AMTA,
  year = {1994},
  pages = {206--213},
  address = {Columbia, Maryland},
  month = Oct
}

@INPROCEEDINGS{Wu94b,
  author = {Dekai Wu and Xuanyin Xia},
  title = {Learning an {E}nglish-{C}hinese lexicon from a parallel corpus},
  booktitle = AMTA,
  year = {1994},
  pages = {206--213}
}

@INPROCEEDINGS{WuXi94,
  author = {Dekai Wu and Xuanyin Xia},
  title = {Learning an {E}nglish-{C}hinese lexicon from a parallel corpus},
  booktitle = AMTA,
  year = {1994},
  pages = {206--213}
}

@INPROCEEDINGS{WuWa07,
  author = {Wu, Hua and Wang, Haifeng},
  title = {Pivot Language Approach for Phrase-Based Statistical Machine Translation},
  booktitle = ACL,
  year = {2007},
  pages = {856--863},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1108}
}

@INPROCEEDINGS{WuCh07,
  author = {Wu, Jian-Cheng and Chang, Jason S.},
  title = {Learning to Find {E}nglish to {C}hinese Transliterations on the Web},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {996--1004},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1106}
}

@INPROCEEDINGS{WYYS07,
  author = {M. Wu and K. Yu and S. Yu and B. Sch\"{o}lkopf},
  title = {Local learning projections},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {1039--1046},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{Wu93,
  author = {Ming-Wen Wu and Keh-Yih Su},
  title = {Corpus-based compound extraction with mutual information and relative
	frequency count},
  booktitle = {ROCLING},
  year = {1993},
  pages = {207-216}
}

@INPROCEEDINGS{WuSu93,
  author = {Ming-Wen Wu and Keh-Yih Su},
  title = {Corpus-based compound extraction with mutual information and relative
	frequency count},
  booktitle = {ROCLING},
  year = {1993},
  pages = {207-216}
}

@INPROCEEDINGS{WZHK07,
  author = {Wu, Youzheng and Zhang, Ruiqiang and Hu, Xinhui and Kashioka, Hideki},
  title = {Learning Unsupervised {SVM} Classifier for Answer Selection in Web
	Question Answering},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {33--41},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1004}
}

@INPROCEEDINGS{WuYaLe07,
  author = {Wu, Yu-Chieh and Yang, Jie-Chi and Lee, Yue-Shi},
  title = {Multilingual Deterministic Dependency Parsing Framework using Modified
	Finite {N}ewton Method Support Vector Machines},
  booktitle = {CoNLL Shared Task Session of EMNLP-CoNLL},
  year = {2007},
  pages = {1175--1181},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1131}
}

@INPROCEEDINGS{WUP94,
  author = {Zhibiao Wu and Martha Palmer},
  title = {Verb semantics and lexicon selection},
  booktitle = ACL,
  year = {1994},
  pages = {133--138}
}

@INPROCEEDINGS{WuPalmer94,
  author = {Z. Wu and M. Palmer},
  title = {Verb Semantics and Lexical Selection},
  booktitle = ACL,
  year = {1994},
  pages = {133-138}
}

@MISC{Wuthrich92,
  author = {B. Wuthrich},
  title = {Probabilistic Knowledge Bases},
  year = {1992},
  text = {Wuthrich, B. (1992). Probabilistic Knowledge Bases, submitted to the
	Journal of Logic Programming.},
  url = {citeseer.nj.nec.com/wuthrich92probabilistic.html}
}

@ARTICLE{Wyner72,
  author = {Wyner, A. D.},
  title = {An upper bound on the entropy series},
  journal = {Information and Control},
  year = {1972},
  volume = {20},
  pages = {176--181}
}

@MISC{Wuethrich99,
  author = {Beat Wüthrich},
  title = {On the Learning of Rule Uncertainties and their Integration into
	Probabilistic Knowledge Bases},
  year = {1999},
  url = {citeseer.nj.nec.com/56302.html}
}

@ARTICLE{XiangWoCe97,
  author = {Y. Xiang and S. K. M. Wong and N. Cercone},
  title = {A <{I}>Microscopic</{I}> Study of Minimum Entropy Search in Learning
	Decomposable Markov Networks},
  journal = {Machine Learning},
  year = {1997},
  volume = {26},
  pages = {65--92},
  publisher = {Kluwer Academic Publishers, Boston}
}

@MISC{Xpress-MP,
  author = {Xpress-MP},
  title = {{Dash Optimization. Xpress-MP. http://www.dashoptimization.com/products.html}}
}

@MISC{XPRESSMP,
  author = {Xpress-MP},
  title = {Dash Optimization. Xpress-MP. http://www.dashoptimization.com/products.html},
  year = {2002}
}

@INPROCEEDINGS{XuUsLi07,
  author = {Xu, Feiyu and Uszkoreit, Hans and Li, Hong},
  title = {A Seed-driven Bottom-up Machine Learning Framework for Extracting
	Relations of Various Complexity},
  booktitle = ACL,
  year = {2007},
  pages = {584--591},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1074}
}

@INPROCEEDINGS{XuFe07,
  author = {Y. Xu and A. Fern},
  title = {On learning linear ranking functions for beam search},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {1047--1054},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{XuanMu07,
  author = {X. Xuan and K. Murphy},
  title = {Modeling changing dependency structure in multivariate time series},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {1055--1062},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{XuePa04,
  author = {Xue, N. and Palmer, M.},
  title = {Calibrating Features for Semantic Role Labeling },
  booktitle = EMNLP,
  year = {2004},
  pages = {88--94},
  address = {Barcelona, Spain}
}

@INPROCEEDINGS{XueDuCa07,
  author = {Y. Xue and D. Dunson and L. Carin},
  title = {The matrix stick-breaking process for flexible multi-task learning},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {1063--1070},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{Yairi07,
  author = {T. Yairi},
  title = {Map building without localization by dimensionality reduction techniques},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {1071--1078},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{YamadaMa03,
  author = {H. Yamada and Y. Matsumoto},
  title = {Statistical Dependency Analysis with Support Vector Machines},
  booktitle = IWPT,
  year = {2003},
  timestamp = {2007.01.26}
}

@INPROCEEDINGS{Yamamoto98,
  author = {A. Yamamoto},
  title = {Logical Aspects of Several Bottom-Up Fittings},
  booktitle = ALT,
  year = {1998},
  volume = {1501},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {158--168},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Yamamoto93,
  author = {A. Yamamoto},
  title = {Generalized unification as background knowledge in learning logic
	programs},
  booktitle = {International Workshop on Analogical and Inductive Inference and
	International Workshop on Algorithmic Learning Theory},
  year = {1993},
  volume = {744},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {111--122},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{YamamotoSu07,
  author = {Yamamoto, Hirofumi and Sumita, Eiichiro},
  title = {Bilingual Cluster Based Models for Statistical Machine Translation},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {514--523},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1054}
}

@ARTICLE{Yamanishi99,
  author = {K. Yamanishi},
  title = {Distributed cooperative {B}ayesian learning strategies},
  journal = {Inform. Comput.},
  year = {1999},
  volume = {150},
  pages = {25--56},
  number = {1},
  note = {First appeared in COLT'97}
}

@INPROCEEDINGS{Yamanishi99a,
  author = {Kenji Yamanishi},
  title = {Extended Stochastic Complexity and Minimax Relative Loss Analysis},
  booktitle = ALT,
  year = {1999},
  volume = {1720},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {26--38},
  publisher = {Springer-Verlag}
}

@ARTICLE{Yamanishi98,
  author = {Kenji Yamanishi},
  title = {A Decision-Theoretic Extension of Stochcastic Complexity and Its
	Applications to Learning},
  journal = {IEEE Transactions on Information Theory},
  year = {1998},
  volume = {44},
  pages = {1424--1439},
  number = {4}
}

@INPROCEEDINGS{Yamanishi98a,
  author = {Kenji Yamanishi},
  title = {Minimax relative loss analysis for sequential prediction algorithms
	using parametric hypotheses},
  booktitle = COLT,
  year = {1998},
  pages = {32--43},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{Yamanishi97,
  author = {Kenji Yamanishi},
  title = {On-Line Maximum Likelihood Prediction with Respect to General Loss
	Functions},
  journal = {J. Comput. Syst. Sci.},
  year = {1997},
  volume = {55},
  pages = {105--118},
  number = {1},
  note = {First appeared in EuroCOLT '95}
}

@INPROCEEDINGS{Yamanishi96,
  author = {Kenji Yamanishi},
  title = {A randomized approximation of the {MDL} for stochastic models with
	hidden variables},
  booktitle = COLT,
  year = {1996},
  pages = {99--109},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{Yamanishi95a,
  author = {Kenji Yamanishi},
  title = {Probably Almost Discriminative Learning},
  journal = {Machine Learning},
  year = {1995},
  volume = {18},
  pages = {23--50},
  number = {1},
  annote = {Earlier version in COLT 1992},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{Yamanishi95b,
  author = {Kenji Yamanishi},
  title = {Randomized approximate aggregating strategies and their applications
	to prediction and discrimination},
  booktitle = COLT,
  year = {1995},
  pages = {83--90},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{Yamanishi94,
  author = {Kenji Yamanishi},
  title = {Generalized stochastic complexity and its applications to learning},
  booktitle = CISS,
  year = {1994},
  volume = {2},
  pages = {763--768}
}

@INPROCEEDINGS{Yamanishi94a,
  author = {K. Yamanishi},
  title = {Learning Non-parametric Smooth Rules by Stochastic Rules with Finite
	Partitioning},
  booktitle = EuroCOLT,
  year = {1994},
  volume = {New Series Number 53},
  series = {The Institute of Mathematics and its Applications Conference Series},
  pages = {217--227},
  address = {Oxford},
  publisher = {Oxford University Press},
  isbn = {0 19 853492 2}
}

@INPROCEEDINGS{Yamanishi94b,
  author = {K. Yamanishi},
  title = {The minimum {\it L}-complexity algorithm and its applications to
	learning non-parametric rules},
  booktitle = COLT,
  year = {1994},
  pages = {173--182},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{Yamanishi93,
  author = {K. Yamanishi},
  title = {On polynomial-time probably almost discriminative learnability},
  booktitle = COLT,
  year = {1993},
  pages = {94--100},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{Yamanishi92,
  author = {Kenji Yamanishi},
  title = {A Learning Criterion for Stochastic Rules},
  journal = {Machine Learning},
  year = {1992},
  volume = {9},
  pages = {165--203},
  annote = {Special Issue on the Proceedings of the 3nd Workshop on Computational
	Learning Theory, to appear},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{Yamanishi92a,
  author = {K. Yamanishi},
  title = {Learning non-parametric densities by finite-dimensional parametric
	hypotheses},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1992},
  pages = {175--186},
  publisher = {IOS Press}
}

@ARTICLE{Yamanishi91a,
  author = {K. Yamanishi},
  title = {A Loss-Bound Model for On-line Stochastic Prediction Strategies},
  journal = {Proc. 5th Annu. Workshop on Comput. Learning Theory},
  year = {1991},
  pages = {290--302}
}

@INPROCEEDINGS{YKWSM07,
  author = {K. Yamazaki and M. Kawanabe and S. Watanabe and M. Sugiyama and K.
	M\"{u}ller},
  title = {Asymptotic {Bayesian} generalization error when training and test
	distributions are different},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {1079--1086},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{YamazakiPaMe95,
  author = {Takefumi Yamazaki and Michael J. Pazzani and Christopher Merz},
  title = {Learning hierarchies from ambiguous natural language data},
  booktitle = ICML,
  year = {1995},
  pages = {575--583},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{YangSu07,
  author = {Yang, Xiaofeng and Su, Jian},
  title = {Coreference Resolution Using Semantic Relatedness Information from
	Automatically Discovered Patterns},
  booktitle = ACL,
  year = {2007},
  pages = {528--535},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1067}
}

@INPROCEEDINGS{YangPe97,
  author = {Yiming Yang and Jan O. Pedersen},
  title = {A comparative study on feature selection in text categorization},
  booktitle = ICML,
  year = {1997},
  pages = {412--420},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{YannakakisLe91,
  author = {M. Yannakakis and D. Lee},
  title = {Testing finite state machines},
  booktitle = {Symposium on Theory of},
  year = {1991},
  pages = {476--485},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{Yao82,
  author = {Andrew C. Yao},
  title = {Theory and Applications of Trapdoor Functions},
  booktitle = FOCS,
  year = {1982},
  pages = {80--91}
}

@INPROCEEDINGS{YaoYa85,
  author = {A. C. Yao and F. F. Yao},
  title = {A general approach to {$D$}-dimensional geometric queries},
  booktitle = STOC,
  year = {1985},
  pages = {163--168}
}

@INCOLLECTION{YapCh97,
  author = {C. K. Yap and E.-C. Chang},
  title = {Issues in the metrology of geometric tolerancing},
  booktitle = {Robotics Motion and Manipulation},
  publisher = {A. K. Peters},
  year = {1997},
  editor = {J.-P. Laumond and M. H. Overmars},
  pages = {393--400}
}

@INPROCEEDINGS{Yarowsky95,
  author = {D. Yarowsky},
  title = {Unsupervised word sense disambiguation rivaling supervied methods},
  booktitle = ACL,
  year = {1995},
  comment = {Not fully supervised}
}

@INPROCEEDINGS{Yarowsky94,
  author = {D. Yarowsky},
  title = {Decision lists for lexical ambiguity resolution: application to accent
	restoration in {Spanish} and {French}},
  booktitle = ACL,
  year = {1994},
  pages = {88--95}
}

@INPROCEEDINGS{Yarowsky93,
  author = {D. Yarowsky},
  title = {One sense per collocation},
  booktitle = {ARPA Workshop on Human Language Technology},
  year = {1993}
}

@INPROCEEDINGS{Yarowsky92,
  author = {D. Yarowsky},
  title = {Word sense disambiguation using statistical models of {Roget's} categories
	trained on large corpora},
  booktitle = COLING,
  year = {1992},
  pages = {454--460}
}

@INPROCEEDINGS{Ye07,
  author = {J. Ye},
  title = {Least squares linear discriminant analysis},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {1087--1094},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{YeChJi07,
  author = {J. Ye and J. Chen and S. Ji},
  title = {Discriminant kernel and regularization parameter learning via semidefinite
	programming},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {1095--1102},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{YeBa07,
  author = {Ye, P. and Baldwin, T.},
  title = {MELB-YB: Preposition Sense Disambiguation Using Rich Semantic Features},
  booktitle = {SemEval-2007},
  year = {2007},
  pages = {241--244},
  organization = {Association for Computational Linguistics}
}

@ARTICLE{YedidiaFrWe05,
  author = {J. S. Yedidia and W. T. Freeman and Y. Weiss},
  title = {Constructing free-energy approximations and generalized belief propagation
	algorithms},
  journal = {IEEE Transactions on Information Theory},
  year = {2005},
  volume = {51},
  pages = {2282-2312},
  number = {7}
}

@INPROCEEDINGS{Yin95,
  author = {Yiqun L. Yin},
  title = {Reducing the number of queries in self-directed learning},
  booktitle = COLT,
  year = {1995},
  pages = {128--135},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{YoganandaMuGo07,
  author = {A. P. Yogananda and M. Murty and L. Gopal},
  title = {A fast linear separability test by projection of positive points
	on subspaces},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {713--720},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INCOLLECTION{Yokimori94,
  author = {Takashi Yokimori},
  title = {Learning non-deterministic finite automata from queries and counterexamples},
  booktitle = {Machine Intelligence},
  publisher = {Oxford Univ. Press},
  year = {1994},
  editor = {K. Furukawa and D. Michie and S. Muggleton},
  volume = {13},
  pages = {169--189}
}

@INPROCEEDINGS{Yokomori93,
  author = {T. Yokomori},
  title = {On learning systolic languages},
  booktitle = {International Workshop on Algorithmic Learning Theory},
  year = {1993},
  volume = {743},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {41--52},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{Yokomori93a,
  author = {T. Yokomori},
  title = {Learning two-tape automata from queries and counterexamples},
  booktitle = COLT,
  year = {1993},
  pages = {228--235},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{Yokomori91,
  author = {T. Yokomori},
  title = {Polynomial-time learning of very simple grammars from posistive data},
  booktitle = {Annual Workshop on Computational Learning},
  year = {1991},
  pages = {213--227},
  address = {San Mateo, CA},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{YoonKiSp07,
  author = {Yoon, Su-Youn and Kim, Kyoung-Young and Sproat, Richard},
  title = {Multilingual Transliteration Using Feature based Phonetic Method},
  booktitle = ACL,
  year = {2007},
  pages = {112--119},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1015}
}

@INPROCEEDINGS{YoshidaMoIn93,
  author = {K. Yoshida and H. Motoda and N. Indurkhya},
  title = {Unifying learning methods by colored digraphs},
  booktitle = {International Workshop on Analogical and Inductive Inference and
	International Workshop on Algorithmic Learning Theory},
  year = {1993},
  volume = {744},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {342--355},
  publisher = {Springer-Verlag}
}

@ARTICLE{Young-LaiTo00,
  author = {Matthew Young-Lai and Frank WM. Tompa},
  title = {Stochastic Grammatical Inference of Text Database Structure},
  journal = {Machine Learning},
  year = {2000},
  volume = {40},
  pages = {111--137},
  number = {2},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{YuJo09,
  author = {C. Yu and T. Joachims},
  title = {Learning Structural SVMs with Latent Variables},
  booktitle = ICML,
  year = {2009}
}

@INPROCEEDINGS{YWLHL07,
  author = {Yu, Liang-Chih and Wu, Chung-Hsien and Lin, Chin-Yew and Hovy, Eduard
	and Lin, Chia-Ling},
  title = {Topic Analysis for Psychiatric Document Retrieval},
  booktitle = ACL,
  year = {2007},
  pages = {1024--1031},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1129}
}

@INPROCEEDINGS{YuTrYu07,
  author = {S. Yu and V. Tresp and K. Yu},
  title = {Robust multi-task learning with $t$-processes},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {1103--1110},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{YFGS07,
  author = {S. Yuan and C. Fisher and Y. Gertner and J. Snedeker},
  title = {Participants are more than physical bodies: 21-Month-Olds assign
	relational meaning to novel transitive verbs},
  booktitle = {Biennial Meeting of the Society for Research in Child Development},
  year = {2007},
  address = {Boston, MA}
}

@ARTICLE{YuilleRa03,
  author = {Yuille, A. L. and Rangarajan, A.},
  title = {The concave-convex procedure},
  journal = {Neural Computation},
  year = {2003},
  volume = {15},
  number = {4},
  address = {Cambridge, MA, USA},
  publisher = {MIT Press}
}

@INPROCEEDINGS{Yung03,
  author = {Kwong H. Yung},
  title = {Using Feedback to Improve Masquerade Detection},
  booktitle = {ACNS},
  year = {2003},
  pages = {48-62},
  bibsource = {DBLP, http://dblp.uni-trier.de},
  ee = {http://springerlink.metapress.com/openurl.asp?genre=article{\&}issn=0302-9743{\&}volume=2846{\&}spage=48}
}

@PHDTHESIS{Yuret98,
  author = {D. Yuret},
  title = {Discovery of Linguistic Relations Using Lexical Attraction},
  school = {EECS Department, MIT},
  year = {1998},
  month = {May}
}

@PHDTHESIS{Yuret:PhD98,
  author = {D. Yuret},
  title = {Discovery of Linguistic Relations Using Lexical Attraction},
  school = {MIT},
  year = {1998}
}

@INBOOK{ZadorPe97,
  chapter = {13},
  pages = {211--225},
  title = {The discriminative power of a dynamical model neuron},
  publisher = {MIT Press},
  year = {1997},
  author = {Anthony M. Zador and Barak A. Pearlmutter},
  volume = {IV: Making Learning Systems Practical},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@INPROCEEDINGS{ZadorPe96,
  author = {Anthony M. Zador and Barak A. Pearlmutter},
  title = {{VC} dimension of an integrate-and-fire neuron model},
  booktitle = COLT,
  year = {1996},
  pages = {10--18},
  publisher = {ACM Press, New York, NY}
}

@INPROCEEDINGS{ZaenenKaCr05,
  author = {Annie Zaenen and Lauri Karttunen and Richard Crouch},
  title = {Local Textual Inference: can it be defined or circumscribed?},
  booktitle = {ACL Workshop on Empirical Modeling of Semantic Equivalence and Entailment},
  year = {2005},
  pages = {31-36}
}

@INPROCEEDINGS{ZanzottoPePa06,
  author = {F. Zanzotto and M. Pennacchiotti and M. Pazienza},
  title = {Discovering asymmetric entailment relations between verbs using selectional
	preferences},
  booktitle = ACL,
  year = {2006},
  pages = {849--856},
  address = {Morristown, NJ, USA},
  publisher = {Association for Computational Linguistics},
  doi = {http://dx.doi.org/10.3115/1220175.1220282},
  location = {Sydney, Australia}
}

@INPROCEEDINGS{ZanzottoMo06,
  author = {Zanzotto, F. M. and Moschitti, A.},
  title = {Automatic Learning of Textual Entailments with Cross-Pair Similarities},
  booktitle = ACL,
  year = {2006},
  month = {July}
}

@INPROCEEDINGS{ZavrelDa97,
  author = {J. Zavrel and W. Daelemans},
  title = {Memory-Based Learning: Using Similarity for Smoothing},
  booktitle = ACL,
  year = {1997}
}

@INPROCEEDINGS{ZavrelDaVe97,
  author = {J. Zavrel and W. Daelemans and J. Veenstra},
  title = {Resolving PP attachment ambiguities with memory based learning},
  booktitle = {CONLL},
  year = {1997},
  address = {Madrid, Spain},
  month = jul
}

@ARTICLE{ZelenkoAoRi03,
  author = {D. Zelenko and C. Aone and A. Richardella},
  title = {Kernel methods for relation extraction},
  journal = {Journal of Machine Learning Research},
  year = {2003}
}

@ARTICLE{ZelenkoAoRi03a,
  author = {Dmitry Zelenko and Chinatsu Aone and Anthony Richardella},
  title = {Kernel methods for relation extraction},
  journal = {Journal of Machine Learning Research},
  year = {2003},
  volume = {3},
  pages = {1083--1106},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@INPROCEEDINGS{ZelleMo96,
  author = {J. M. Zelle and R. J. Mooney},
  title = {Learning to Parse Database queries using inductive logic proramming},
  booktitle = AAAI,
  year = {1996},
  pages = {1050--1055}
}

@INPROCEEDINGS{ZelleMoKo94,
  author = {John M. Zelle and Raymond J. Mooney and Joshua B. Konvisser},
  title = {Combining top-down and bottom-up techniques in inductive logic programming},
  booktitle = ICML,
  year = {1994},
  pages = {343--351},
  publisher = {Morgan Kaufmann}
}

@BOOK{Zellig51,
  title = {Methods in Structural Linguistics},
  publisher = {University of Chicago Press},
  year = {1951},
  author = {H. Zellig},
  comment = {Reprinted by Phoenix books in 1960 under the title Structural Linguistics}
}

@INPROCEEDINGS{ZensHaNe07,
  author = {Zens, Richard and Hasan, Sasa and Ney, Hermann},
  title = {A Systematic Comparison of Training Criteria for Statistical Machine
	Translation},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {524--532},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1055}
}

@INPROCEEDINGS{Zernik89,
  author = {Uri Zernik},
  title = {Lexicon acquisition: Learning from corpus by capitalizing on lexical
	categories},
  booktitle = IJCAI,
  year = {1989}
}

@INPROCEEDINGS{Zernik90,
  author = {U. Zernik and P. Jacobs},
  title = {Tagging for Learning: Collecting Thematic Relations from Corpus},
  booktitle = COLING,
  year = {1990},
  volume = {1},
  pages = {34--39}
}

@INPROCEEDINGS{ZernikJa90,
  author = {U. Zernik and P. Jacobs},
  title = {Tagging for Learning: Collecting Thematic Relations from Corpus},
  booktitle = COLING,
  year = {1990},
  volume = {1},
  pages = {34--39}
}

@INPROCEEDINGS{ZettlemoyerCo09,
  author = {Zettlemoyer, L. and Collins, M.},
  title = {Learning Context-Dependent Mappings from Sentences to Logical Form},
  booktitle = ACL,
  year = {2009},
  pages = {976--984},
  address = {Suntec, Singapore},
  month = {August},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P09/P09-1110}
}

@INPROCEEDINGS{ZettlemoyerCo07,
  author = {Zettlemoyer, L. and Collins, M.},
  title = {Online Learning of Relaxed {CCG} Grammars for Parsing to Logical
	Form},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {678--687},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1071}
}

@INPROCEEDINGS{ZettlemoyerCo05,
  author = {Zettlemoyer, L. and Collins, M.},
  title = {Learning to Map Sentences to Logical Form: Structured Classification
	with Probabilistic Categorial Grammars},
  booktitle = UAI,
  year = {2005}
}

@ARTICLE{Zeugmann98,
  author = {T. Zeugmann},
  title = {Lange and {W}iehagen's Pattern Language Learning Algorithm: An Average-Case
	Analysis with respect to its Total Learning Time},
  journal = {Annals of Mathematics and Artificial Intelligence},
  year = {1998},
  volume = {23},
  pages = {117--145},
  note = {Special issue for AII '94 and ALT '94, first appeared as RIFIS-TR-CS-111,
	1995}
}

@ARTICLE{Zeugmann97,
  author = {T. Zeugmann},
  title = {Foreword},
  journal = {Theoret. Comput. Sci.},
  year = {1997},
  volume = {185},
  pages = {1--1},
  number = {1},
  note = {Special issue for ALT '95}
}

@INPROCEEDINGS{Zeugmann94,
  author = {T. Zeugmann},
  title = {Average-Case Analysis of Pattern Language Learning Algorithms},
  booktitle = {International Workshop on Analogical and Inductive Inference},
  year = {1994},
  volume = {872},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {8--9},
  publisher = {Springer--Verlag}
}

@INPROCEEDINGS{Zeugmann90,
  author = {T. Zeugmann},
  title = {Inductive Inference of Optimal Programs: {A} Survey and Open Problems},
  booktitle = {Nonmonotonic and Inductive Logic},
  year = {1990},
  pages = {208--222},
  publisher = {Springer Verlag},
  note = {Lecture Notes in Computer Science 543}
}

@ARTICLE{Zeugmann88,
  author = {T. Zeugmann},
  title = {On the Power of Recursive Optimizers},
  journal = {Theoret. Comput. Sci.},
  year = {1988},
  volume = {62},
  pages = {289--310}
}

@INPROCEEDINGS{Zeugmann86,
  author = {T. Zeugmann},
  title = {On {B}arzdin's Conjecture},
  booktitle = {International Workshop on Analogical and Inductive Inference},
  year = {1986},
  volume = {265},
  series = {Lecture Notes in Computer Science},
  pages = {220--227},
  publisher = {Springer--Verlag}
}

@ARTICLE{Zeugmann84,
  author = {T. Zeugmann},
  title = {On the Nonboundability of total effective operators},
  journal = {Zeitschr. f. math. Logik und Grundlagen d. Math. Bd.},
  year = {1984},
  volume = {30},
  pages = {169--172}
}

@ARTICLE{Zeugmann83,
  author = {T. Zeugmann},
  title = {A-posteriori Characterizations in Inductive Inference of Recursive
	Functions},
  journal = {Elektronische Informationsverarbeitung und Kybernetik},
  year = {1983},
  volume = {19},
  pages = {559--594}
}

@ARTICLE{Zeugmann83a,
  author = {T. Zeugmann},
  title = {On the Synthesis of Fastest Programs in Inductive Inference},
  journal = {Elektronische Informationsverarbeitung und Kybernetik},
  year = {1983},
  volume = {19},
  pages = {625--642}
}

@PHDTHESIS{Zeugmann83b,
  author = {T. Zeugmann},
  title = {{Z}ur algorithmischen {S}ynthese von schnellen {P}rogrammen},
  school = {Humboldt-Universit{\"a}t zu Berlin, Sektion Mathematik},
  year = {1983}
}

@INCOLLECTION{ZeugmannLa95,
  author = {T. Zeugmann and S. Lange},
  title = {A Guided Tour Across the Boundaries of Learning Recursive Languages},
  booktitle = {Algorithmic Learning for Knowledge-Based Systems},
  publisher = {Springer--Verlag},
  year = {1995},
  volume = {961},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {190--258},
  comment = {An earlier version appeared as GOSLER-Report 25/94, FB Mathematik
	und Informatik, TH Lepzig, 1994.}
}

@ARTICLE{ZeugmannLaKa95,
  author = {T. Zeugmann and S. Lange and S. Kapur},
  title = {Characterizations of monotonic and dual monotonic language learning},
  journal = {Inform. Comput.},
  year = {1995},
  volume = {120},
  pages = {155--173},
  number = {2},
  comment = {A preliminary version appeared as Technical Report IRCS 92 - 24, Institute
	for Research in Cognitive Science, Univ. Pennsylvania, Philadelphia,
	1992.}
}

@INPROCEEDINGS{ZLLZ07,
  author = {Zhang, Dongdong and Li, Mu and Li, Chi-Ho and Zhou, Ming},
  title = {Phrase Reordering Model Integrating Syntactic Knowledge for {SMT}},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {533--540},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1056}
}

@INPROCEEDINGS{ZMHI97,
  author = {H. Zhang and D. Manocha and T. Hudson and K. E. Hoff III},
  title = {Visibility Culling using Hierarchical Occlusion Maps},
  booktitle = {SIGGRAPH},
  year = {1997},
  series = {Annual Conference Series},
  pages = {77--88},
  organization = {ACM SIGGRAPH},
  publisher = {ACM Press}
}

@ARTICLE{ZhangMi95,
  author = {Jianping Zhang and Ryszard S. Michalski},
  title = {An Integration of Rule Induction and Exemplar-Based Learning for
	Graded Concepts},
  journal = {Machine Learning},
  year = {1995},
  volume = {21},
  pages = {235--267},
  number = {3},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{ZhangYa07,
  author = {J. Zhang and R. Yan},
  title = {On the value of pairwise constraints in classification and consistency},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {1111--1118},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{ZhangCh07,
  author = {K. Zhang and L. Chan},
  title = {Nonlinear independent component analysis with minimal nonlinear distortion},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {1127--1134},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{ZhangTsKw07,
  author = {K. Zhang and I. Tsang and J. Kwok},
  title = {Maximum margin clustering made practical},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {1119--1126},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{ZCATZLL07,
  author = {Zhang, Min and Che, Wanxiang and Aw, Aiti and Tan, Chew Lim and Zhou,
	Guodong and Liu, Ting and Li, Sheng},
  title = {A Grammar-driven Convolution Tree Kernel for Semantic Role Classification},
  booktitle = ACL,
  year = {2007},
  pages = {200--207},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1026}
}

@INPROCEEDINGS{ZZSZ06,
  author = {Min Zhang and Jie Zhang and Jian Su and GuoDong Zhou},
  title = {A Composite Kernel to Extract Relations between Entities with Both
	Flat and Structured Features},
  booktitle = {Proceedings of COLING-ACL-06},
  year = {2006},
  pages = {825--832},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@ARTICLE{ZhangPo96,
  author = {N. L. Zhang and D. Poole},
  title = {Exploiting Causal Independence in Bayesian Network Inference},
  journal = JAIR,
  year = {1996},
  volume = {5},
  pages = {301-328}
}

@ARTICLE{ZhangPo96a,
  author = {Nevin Lianwen Zhang and David Poole},
  title = {Exploiting Causal Independence in Bayesian Network Inference},
  journal = {J. Artif. Intell. Res. (JAIR)},
  year = {1996},
  volume = {5},
  pages = {301-328},
  bibsource = {DBLP, http://dblp.uni-trier.de},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@INPROCEEDINGS{ZhangPo94,
  author = {Zhang, N. L. and Poole, D.},
  title = {A simple approach to {Bayesian} network computations},
  booktitle = {Biennial Canadian Artificial Intelligence Conference},
  year = {1994}
}

@INPROCEEDINGS{Zhang04,
  author = {Tong Zhang},
  title = {Solving large scale linear prediction problems using stochastic gradient
	descent algorithms},
  booktitle = ICML,
  year = {2004},
  pages = {116},
  address = {New York, NY, USA},
  publisher = {ACM},
  doi = {http://doi.acm.org/10.1145/1015330.1015332},
  isbn = {1-58113-828-5},
  location = {Banff, Alberta, Canada}
}

@INPROCEEDINGS{Zhang02,
  author = {T. Zhang},
  title = {Statistical Behavior and Consistency of Support Vector Machines,
	Boosting, and Beyond},
  booktitle = ICML,
  year = {2002},
  pages = {690--700},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{Zhang02a,
  author = {Tong Zhang},
  title = {Covering number bounds of certain regularized linear function classes},
  journal = {J. Mach. Learn. Res.},
  year = {2002},
  volume = {2},
  pages = {527--550},
  address = {Cambridge, MA, USA},
  issn = {1533-7928},
  publisher = {MIT Press}
}

@INPROCEEDINGS{Zhang00,
  author = {T. Zhang},
  title = {Large Margin Winnow Methods for Text Categorization},
  booktitle = {KDD workshop on Text Categorization},
  year = {2000}
}

@INPROCEEDINGS{Zhang99,
  author = {Tong Zhang},
  title = {Theoretical analysis of a class of randomized regularization methods},
  booktitle = COLT,
  year = {1999},
  pages = {156--163},
  publisher = {ACM Press, New York, NY}
}

@ARTICLE{ZhangDaJo02,
  author = {T. Zhang and F. Damerau and D. Johnson},
  title = {Text chunking based on a generalization of Winnow},
  journal = {J. of Machine Learning Research},
  year = {2002},
  volume = {2},
  pages = {615--637}
}

@INPROCEEDINGS{ZhangJo03,
  author = {Tong Zhang and David Johnson},
  title = {A Robust Risk Minimization based Named Entity Recognition System},
  booktitle = CoNLL,
  year = {2003},
  editor = {Walter Daelemans and Miles Osborne},
  pages = {204--207},
  publisher = {Edmonton, Canada}
}

@INPROCEEDINGS{Zhang99a,
  author = {Wei Zhang},
  title = {A region-based learning approach to discovering temporal structures
	in data},
  booktitle = ICML,
  year = {1999},
  pages = {484--492},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{ZXSGL07,
  author = {W. Zhang and X. Xue and Z. Sun and Y. Guo and H. Lu},
  title = {Optimal dimensionality of metric space for classification},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {1135--1142},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{ZhangAbVi07,
  author = {X. Zhang and D. Aberdeen and S. Vishwanathan},
  title = {Conditional random fields for multi-agent reinforcement learning},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {1143--1150},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{ZhangNu97,
  author = {Xiaolong Zhang and Masayuki Numao},
  title = {Learning and revising theories in noisy domains},
  booktitle = ALT,
  year = {1997},
  volume = {1316},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {339--351},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{ZhangCl07,
  author = {Zhang, Yue and Clark, Stephen},
  title = {Chinese Segmentation with a Word-Based Perceptron Algorithm},
  booktitle = ACL,
  year = {2007},
  pages = {840--847},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1106}
}

@INPROCEEDINGS{Zhang04a,
  author = {Zhang, Z.},
  title = {Weakly-Supervised Relation Classification for Information Extraction},
  booktitle = CIKM,
  year = {2004}
}

@INPROCEEDINGS{Zhang04b,
  author = {Zhang, Zhu },
  title = {Weakly-Supervised Relation Classification for Information Extraction},
  booktitle = {CIKM},
  year = {2004},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@INPROCEEDINGS{ZhaoNg07,
  author = {Zhao, Shanheng and Ng, Hwee Tou},
  title = {Identification and Resolution of {C}hinese Zero Pronouns: A Machine
	Learning Approach},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {541--550},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1057}
}

@INBOOK{ZhaoAt94,
  chapter = {22},
  pages = {379--400},
  title = {Projection pursuit learning: some theoretical issues},
  publisher = {MIT Press},
  year = {1994},
  author = {Ying Zhao and Christopher G. Atkeson},
  volume = {II: Intersections Between Theory and Experiment},
  booktitle = {Computational Learning Theory and Natural Learning Systems}
}

@INPROCEEDINGS{ZhaoLi07,
  author = {Z. Zhao and H. Liu},
  title = {Spectral feature selection for supervised and unsupervised learning},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {1151--1158},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@ARTICLE{Zheng00,
  author = {Zijian Zheng},
  title = {Constructing {X}-of-{N} Attributes for Decision Tree Learning},
  journal = {Machine Learning},
  year = {2000},
  volume = {40},
  pages = {35--75},
  number = {1},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{ZhengWeTi99,
  author = {Zijian Zheng and Geoffrey I. Webb and Kai Ming Ting},
  title = {Lazy {B}ayesian rules: a lazy semi-naive {B}ayesian learning technique
	competitive to boosting decision trees},
  booktitle = ICML,
  year = {1999},
  pages = {493--502},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@INPROCEEDINGS{ZhongOh93,
  author = {N. Zhong and S. Ohsuga},
  title = {A decomposition based induction model for discovering concept clusters
	from databases},
  booktitle = {International Workshop on Analogical and Inductive Inference and
	International Workshop on Algorithmic Learning Theory},
  year = {1993},
  volume = {744},
  series = {Lecture Notes in Artificial Intelligence},
  pages = {384--397},
  publisher = {Springer-Verlag}
}

@INPROCEEDINGS{ZhouBu07,
  author = {D. Zhou and C. Burges},
  title = {Spectral clustering with multiple views},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {1159--1166},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{ZSZZ05,
  author = {Guodong Zhou and Jian Su and Jie Zhang and Min Zhang},
  title = {Exploring Various Knowledge in Relation Extraction},
  booktitle = {Proceedings of ACL-05},
  year = {2005},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@INPROCEEDINGS{ZZJZ07,
  author = {Zhou, GuoDong and Zhang, Min and Ji, DongHong and Zhu, QiaoMing},
  title = {Tree Kernel-Based Relation Extraction with Context-Sensitive Structured
	Parse Tree Information},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {728--736},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1076}
}

@INPROCEEDINGS{ZZJZ07a,
  author = {GuoDong Zhou and Min Zhang and DongHong Ji and QiaoMing Zhu},
  title = {Tree Kernel-Based Relation Extraction with Context-Sensitive Structured
	Parse Tree Information},
  booktitle = {Proceedings of EMNLP-CoNLL-07},
  year = {2007},
  pages = {728--736},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@ARTICLE{ZZJZ08,
  author = {Guodong Zhou and Min Zhang and Dong-Hong Ji and Qiaoming Zhu},
  title = {Hierarchical learning strategy in semantic relation extraction},
  journal = {Information Processing \& Management},
  year = {2008},
  volume = {44},
  pages = {1008-1021},
  number = {3},
  owner = {dxquang},
  timestamp = {2010.12.12}
}

@ARTICLE{Zhou90,
  author = {Hayong Harry Zhou},
  title = {{CSM}: {A} Computational Model of Cumulative Learning},
  journal = {Machine Learning},
  year = {1990},
  volume = {5},
  pages = {383--406},
  publisher = {Kluwer Academic Publishers, Boston}
}

@INPROCEEDINGS{Zhou95,
  author = {Joe Zhou and Pete Dapkus},
  title = {Automatic suggestion of significant terms for a predefined topic},
  booktitle = {Third the Workshop on Very Large Corpora},
  year = {1995},
  pages = {131--147}
}

@INPROCEEDINGS{ZhouDa95,
  author = {Joe Zhou and Pete Dapkus},
  title = {Automatic suggestion of significant terms for a predefined topic},
  booktitle = {Third the Workshop on Very Large Corpora},
  year = {1995},
  pages = {131--147}
}

@INPROCEEDINGS{ZhouBr99,
  author = {Yuanhui Zhou and Carla Brodley},
  title = {A hybrid lazy-eager approach to reducing the computation and memory
	requirements of local parametric learning algorithms},
  booktitle = ICML,
  year = {1999},
  pages = {503--512},
  publisher = {Morgan Kaufmann, San Francisco, CA}
}

@ARTICLE{ZhouSu02,
  author = {Y.~Zhou and S.~Suri},
  title = {Algorithms for a Minimum Volume Enclosing Simplex in Three Dimensions},
  journal = SICOMP,
  year = {2002},
  volume = {31},
  pages = {1339--1357},
  number = {5},
  url = {http://epubs.siam.org/sam-bin/dbq/article/36399}
}

@INPROCEEDINGS{ZhouXu07,
  author = {Z. Zhou and J. Xu},
  title = {On the relation between multi-instance learning and semi-supervised
	learning},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {1167--1174},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@INPROCEEDINGS{ZTLNZ07,
  author = {Zhu, Conghui and Tang, Jie and Li, Hang and Ng, Hwee Tou and Zhao,
	Tiejun},
  title = {A Unified Tagging Approach to Text Normalization},
  booktitle = ACL,
  year = {2007},
  pages = {688--695},
  address = {Prague, Czech Republic},
  month = {June},
  publisher = {Association for Computational Linguistics},
  url = {http://www.aclweb.org/anthology/P/P07/P07-1087}
}

@INPROCEEDINGS{ZhuHo07,
  author = {Zhu, Jingbo and Hovy, Eduard},
  title = {Active Learning for Word Sense Disambiguation with Methods for Addressing
	the Class Imbalance Problem},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {783--790},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1082}
}

@INPROCEEDINGS{ZNZW07,
  author = {J. Zhu and Z. Nie and B. Zhang and J. Wen},
  title = {Dynamic hierarchical {Markov} random fields and their application
	to web data extraction},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {1175--1182},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@ARTICLE{ZhuravlevKo85,
  author = {Y. Zhuravlev and Y. Kogan},
  title = {Realization of boolean functions with a small number of zeros by
	disjunctive normal forms, and related problems},
  journal = {Soviet Math. Doklady},
  year = {1985},
  volume = {32},
  pages = {771--775}
}

@INPROCEEDINGS{ZienBrSc07,
  author = {A. Zien and U. Brefeld and T. Scheffer},
  title = {Transductive support vector machines for structured variables},
  booktitle = ICML,
  year = {2007}
}

@INPROCEEDINGS{ZienOn07,
  author = {A. Zien and C. Ong},
  title = {Multiclass multiple kernel learning},
  booktitle = ICML,
  year = {2007},
  editor = {Zoubin Ghahramani},
  pages = {1191--1198},
  publisher = {Omnipress},
  location = {Corvallis, OR}
}

@BOOK{Zimmerman91,
  title = {Fuzzy Set Theory and Its Applications},
  publisher = {Kluwer},
  year = {1991},
  author = {H. J. Zimmerman}
}

@ARTICLE{Zito-Wolf91,
  author = {Roland J. Zito-Wolf},
  title = {Book Review},
  journal = {Machine Learning},
  year = {1991},
  volume = {6},
  pages = {197--204},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Zito-Wolf91a,
  author = {Roland J. Zito-Wolf},
  title = {Learning Search Control Knowledge: An Explanation-Based Approach},
  journal = {Machine Learning},
  year = {1991},
  volume = {6},
  pages = {197--204},
  publisher = {Kluwer Academic Publishers, Boston}
}

@ARTICLE{Zloof77,
  author = {M. Zloof},
  title = {Query-by-Example: a data base language},
  journal = {IBM Syst. J.},
  year = {1977},
  volume = {16},
  pages = {324--343}
}

@INPROCEEDINGS{ZomorodianEd00,
  author = {A. Zomorodian and H. Edelsbrunner},
  title = {Fast software for box intersections},
  booktitle = {SOCG},
  year = {2000},
  pages = {129--138},
  annote = {{448}}
}

@INPROCEEDINGS{ZuckerGa96,
  author = {Jean-Daniel Zucker and Jean-Gabriel Ganascia},
  title = {Representation changes for efficient learning in structural domains},
  booktitle = ICML,
  year = {1996},
  pages = {543--551},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{ZuckerGa94,
  author = {Jean-Daniel Zucker and Jean-Gabriel Ganascia},
  title = {Selective reformulation of examples in concept learning},
  booktitle = ICML,
  year = {1994},
  pages = {352--360},
  publisher = {Morgan Kaufmann}
}

@INPROCEEDINGS{Zuidema07,
  author = {Zuidema, Willem},
  title = {Parsimonious Data-Oriented Parsing},
  booktitle = EMNLP-CoNLL,
  year = {2007},
  pages = {551--560},
  url = {http://www.aclweb.org/anthology/D/D07/D07-1058}
}

@INPROCEEDINGS{ZBBD97,
  author = {Bla{\v z} Zupan and Marko Bohanec and Ivan Bratko and Janez Dem{\v
	s}ar},
  title = {Machine learning by function decomposition},
  booktitle = ICML,
  year = {1997},
  pages = {421--429},
  publisher = {Morgan Kaufmann}
}

@ARTICLE{ZytkowSi86,
  author = {Jan M. Zytkow and Herbert A. Simon},
  title = {A Theory of Historical Discovery: The Construction of Componential
	Models},
  journal = {Machine Learning},
  year = {1986},
  volume = {1},
  pages = {107--136},
  publisher = {Kluwer Academic Publishers, Boston}
}

@BOOK{AbelloPaRe01,
  title = {Handbook of Massive Data Sets},
  publisher = {Kluwer Academic Publishers},
  year = {2001},
  editor = {J. Abello and P. M. Pardalos and M. G.C. Resende},
  note = {to appear}
}

@BOOK{AndersonRo88,
  title = {Neurocomputing: Foundations of Research},
  publisher = {MIT Press},
  year = {1988},
  editor = {Anderson, James A. and Rosenfeld, Edward}
}

@BOOK{BrachmanLe85,
  title = {Readings in Knowledge Representation},
  publisher = {Morgan Kaufmann},
  year = {1985},
  editor = {Brachman, R. and H. Levesque}
}

@BOOK{Carbonell90,
  title = {Machine Learning: Paradigms and Methods},
  publisher = {MIT Press},
  year = {1990},
  editor = {Jaime Carbonell}
}

@INCOLLECTION{CardieMo99,
  booktitle = {Special Issue on Machine Learning and Natural Language},
  year = {1999},
  editor = {C. Cardie and R. Mooney},
  volume = {34},
  journal = {Machine Learning}
}

@INBOOK{CohenFe68,
  chapter = {XIV: {\em Learning and Inductive Inference}},
  pages = {324--511},
  title = {The Handbook of Artificial Intelligence},
  publisher = {William Kaufman, Inc.},
  year = {1968},
  editor = {Cohen, Paul R. and Edward A. Feigenbaum},
  volume = {3},
  address = {Los Altos, California}
}

@PROCEEDINGS{DaganGlMa06,
  title = {The PASCAL Recognising Textual Entailment Challenge.},
  year = {2006},
  editor = {I. Dagan and O. Glickman and B. Magnini},
  volume = {3944},
  publisher = {Springer-Verlag, Berlin},
  booktitle = {Lecture Notes in Computer Science}
}

@BOOK{Enderton72,
  title = {A mathematical intoroduction to logic},
  publisher = {Academic Press},
  year = {1972},
  editor = {Enderton, H. B.},
  comment = {QA9.E54}
}

@PROCEEDINGS{FischerSi99,
  title = {Computational Learning Theory, 4th European Conference, Euro{COLT}
	'99, Nordkirchen, Germany, March 29-31, 1999, Proceedings},
  year = {1999},
  editor = {Paul Fischer and Hans-Ulrich Simon},
  volume = {1572},
  series = {Lecture Notes in Artificial Intelligence},
  publisher = {Springer-Verlag, Berlin},
  month = mar
}

@BOOK{Flexner83,
  title = {{R}andom {H}ouse Unabridged Dictionary},
  publisher = {Random House},
  year = {1983},
  editor = {S. B. Flexner},
  address = {New York},
  note = {Second edition}
}

@BOOK{FranklinMiTh96a,
  title = {Recent Advances in Robot Learning},
  publisher = {Kluwer Academic Publishers},
  year = {1996},
  editor = {J. Franklin and T. Mitchell and S. Thrun},
  number = {368},
  series = {Kluwer International Series in Engineering and Computer Science}
}

@BOOK{Gardner87,
  title = {Second Scientific American Book of Mathematical Puzzles and Diversions},
  publisher = {Univ of Chicago Pr},
  year = {1987},
  editor = {M. Gardner},
  note = {ISBN 0226282538}
}

@BOOK{Garside87,
  title = {The Computational Analysis of English -- A Corpus Based Approach},
  publisher = {Longman},
  year = {1987},
  editor = {Roger Garside and Geoffrey Leech and Geoffrey Sampson}
}

@BOOK{GarsideLeSa87,
  title = {The Computational Analysis of English -- A Corpus Based Approach},
  publisher = {Longman},
  year = {1987},
  editor = {Roger Garside and Geoffrey Leech and Geoffrey Sampson}
}

@BOOK{GoodmanO'97,
  title = {Handbook of Discrete and Computational Geometry},
  publisher = {CRC Press LLC},
  year = {1997},
  editor = {J. E. Goodman and J. O'Rourke},
  comments = {52 chapters, xiv + 991 pages; publication: 6 July 1997},
  location = {Boca Raton, FL}
}

@BOOK{Grishman86c,
  title = {Analyzing Language in Restricted Domains: Sublanguage Description
	and Processing},
  publisher = {Lawrence Erlbaum Associates},
  year = {1986},
  editor = {R. Grishman and R. Kittredge}
}

@BOOK{MayrPrSt98,
  title = {Lectures on Proof Verification and Approximation Algorithms},
  publisher = {Springer-Verlag},
  year = {1998},
  editor = {E. W. Mayr and H. J. Promel and A. Steger},
  volume = {1367},
  url = {http://link.springer.de/link/service/series/0558/tocs/t1367.htm}
}

@BOOK{McClellandRu88,
  title = {Explorations in Parallel Distributed Processing: {A} Handbook of
	Models, Programs, and Exercises},
  publisher = {MIT Press},
  year = {1988},
  editor = {J. L. McClelland and D. E. Rumelhart},
  address = {Cambridge, Massachusetts},
  comment = {Contains example of back-prop never converging on 1:1:1 network}
}

@BOOK{McFarland87,
  title = {The Oxford Companion to Animal Behavior},
  publisher = {Oxford University Press},
  year = {1987},
  editor = {David {McFarland}}
}

@BOOK{MichalskiCaMi86,
  title = {Machine Learning: An Artificial Intelligence Approach 2},
  publisher = {Morgan Kaufmann},
  year = {1986},
  editor = {R. S. Michalski and J. G. Carbonell and T. M. Mitchell},
  volume = {II},
  address = {Los Altos, California}
}

@BOOK{Nirenburg87,
  title = {Machine Translation},
  publisher = {Cambridge University Press},
  year = {1987},
  editor = {Nirenburg, S.}
}

@INCOLLECTION{MUC5,
  booktitle = MUC,
  publisher = {Morgan Kaufmann Publishers},
  year = {1993},
  editor = {Sundheim, B.},
  address = {San Mateo CA}
}

@INCOLLECTION{MUC4,
  booktitle = MUC,
  publisher = {Morgan Kaufmann Publishers},
  year = {1992},
  editor = {Sundheim, B.},
  address = {San Mateo CA}
}

@INCOLLECTION{MUC3,
  booktitle = MUC,
  publisher = {Morgan Kaufmann Publishers},
  year = {1991},
  editor = {Sundheim, B.},
  address = {San Mateo CA}
}

@BOOK{Zernik91,
  title = {Lexical Acquisition: Exploiting On-Line Resources to Build a Lexicon},
  publisher = {Lawrence Erlbaum Associates},
  year = {1991},
  editor = {U. Zernik},
  address = {Hillsdale, NJ}
}

@MISC{LevinP,
  year = {1998},
  note = {Private communication},
  autor = {Beth Levin}
}

@MISC{Justeson89,
  year = {1989},
  note = {Private communication},
  autor = {John Justeson and Slava Katz}
}