%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% PROJECTS %%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
@comment{FLKR = {Foundations: Learning, Knowledge Representations, Reasoning}}
@comment{ML = {Machine Learning}}
@comment{KR = {Knowledge Representation and Inference}}
@comment{LnI = {Learning and Inference}}
@comment{NLP = {Natural Language Processing}}
@comment{IIA = {Intelligent Information Access}}
%%
%% FLKR
%% |
%% DPL MCR LCC LT LP KR
%%
%% LnI
%% |
%% SI ILP SM
%%
%% IIA
%% |
%% IE LV MIRROR NE QA KINDLE
%%
%% NLP
%% |
%% LNLP CSD SP
@comment{CSD = {Context Sensitive Disambiguation}}
@comment{DPL = {Discriminative and Probabilistic Learning}}
@comment{LNLP = {Learning in NLP}}
@comment{IE = {Information Extraction}}
@comment{ILP = {Integer Linear Programming Inference}}
@comment{KR = {Relational Knowledge Representations and Kernels}}
@comment{LBP = {Learning Based Programming}}
@comment{LCC = {Learning Coherent Concepts}}
@comment{LINL = {Learning and Inference in Natural Language}}
@comment{LV = {Learning for Visual Recognition}}
@comment{LP = {Learning Protocols}}
@comment{LT = {Learning Theory}}
@comment{KINDLE = {Knowledge Representation and Inference for Natural Language using Feature Description Logic}}
@comment{MCR = {Multiclass Classification and Ranking}}
@comment{MIRROR = {Mirroring Entities: Name Identification and Tracing}}
@comment{NE = {Named Entity Recognition}}
@comment{NLP = {Natural Language Processing}}
@comment{QA = {Question Answering Systems}}
@comment{SI = {Sequential Inference}}
@comment{SM = {Structural Mapping}}
@comment{SP = {Semantic Parsing}}
@comment{PHRASENET = {PhraseNet}}
%% NEW PROJECTS (2008)
@comment{USS = {Unsupervised and Semi-supervised Learning}}
@comment{DC = {Dataless Classification}}
@comment{AL = {Active and Interactive Learning}}
@comment{RANK = {Learning to Rank}}
@comment{ADAPT = {Adaptation}}
@comment{PL = {Pipeline Models}}
@comment{MC = {Multiclass Classification}}
@comment{PASTML = {Past Projects}}
@comment{FOPI = {First-order Probabilistic Inference}}
@comment{KRNLP = {Knowledge Representation for Natural Language}}
@comment{CCM = {Constrained Conditional Models}}
@comment{LBP = {Learning Based Programming}}
@comment{SRL = {Semantic Parsing (Semantic Role Labeling)}}
@comment{TE = {Semantic Entailment and Question Answering}}
@comment{COREF = {Cofereference Within and Across Documents}}
@comment{DP = {Dependency Parsing}}
@comment{COMP = {Natural Language Comprehension in Context}}
@comment{PSYCHO = {Psycholinguistics}}
@comment{TL = {Transliteration}}
@comment{LS = {Lexical Semantics}}
@comment{PASTNLP = {Past Projects}}
@comment{IE = {Information Extraction}}
@comment{NER = {Named Entities and Relations}}
@comment{SEARCH = {NLP Based Search}}
@comment{TRUST = {Trustworthiness}}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% PACKAGES %%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
@comment{SNOW = {SNoW}}
@comment{FEX = {FEX}}
@comment{POS = {POS Tagger}}
@comment{NE = {NE Tagger}}
@comment{SP = {Shallow Parser}}
@comment{SRL = {Semantic Role labeling}}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% JOURNALS %%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
@string{AI = {Artificial Intelligence}}
@string{CACM = {Communications of the ACM}}
@string{CSL = {Computer Speech and Language}}
@string{CL = {Computational Linguistics}}
@string{InfCtrl = {Information and Control}}
@string{IT = {IEEE Transactions on information theory}}
@string{JACM = {Journal of the ACM}}
@string{JAIR = {Journal of AI Research}}
@string{JMLR = {Journal of Machine Learning Research}}
@string{ML = {Machine Learning}}
@string{NLE = {Journal of Natural Language Engineering}}
@string{MM = {IEEE Transactions on Multimedia}}
@string{PAMI = {IEEE Transactions on Pattern Analysis and Machine Intelligence}}
@string{SIJAD = {SIAM Journal of Algebraic and Discrete Methods}}
@string{SIJC = {SIAM Journal of Computing}}
@string{TASSP = {IEEE Transactions on Acoustics, speech, and Signal Processing}}
@string{TASSP = {IEEE Transactions on Acoustics, speech, and Signal Processing}}
@string{TCS = {Theoretical Computer Science}}
@string{DCG = {Discrete and Computational Geometry}}
@string{CGTA = {Computational Geometry: Theory and Applications}}
@string{JALG = {Journal of Algorithms}}
@string{MLJ = {Machine Learning Journal}}
@string{IJCGA = {The International Journal of Computational Geometry and Applications }}
@string{jnle = {Journal for Natural Language Engineering"}}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% CONFERENCES %%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
@string{AAAI= {Proceedings of the National Conference on Artificial Intelligence (AAAI)}}
@string{ANLP = {Proceedings of ACL Conference on Applied Natural Language Processing}}
@string{ARPA = {Proceedings of the ARPA Workshop on Human Language Technology}}
@string{ACCV = {Proceedings of the Asian Conference on Computer Vision (ACCV)}}
@string{AISTAT = {Proceedings of the International Workshop on Artificial Intelligence and Statistics}}
@string{ALT = {Proceedings of the International Workshop on Algorithmic Learning Theory (ALT)}}
@string{COLING = {Proceedings the International Conference on Computational Linguistics (COLING)}}
@string{ACL = {Proceedings of the Annual Meeting of the Association for Computational Linguistics (ACL)}}
@string{EACL = {Proceedings of the European Chapter of the ACL (EACL)}}
@string{COLT = {Proceedings of the Annual ACM Workshop on Computational Learning Theory (COLT)}}
@string{CoNLL = {Proceedings of the Annual Conference on Computational Natural Language Learning (CoNLL)}}
@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{ECML = {Proceedings of the European Conference on Machine Learning (ECML)}}
@string{FOCS = {IEEE Symp. of Foundation of Computer Science}}
@string{ECCV = {Proceedings of the European Conference on Computer Vision (ECCV)}}
@string{IAAI= {Proceedings of the National Conference on Innovative Applications of Artificial Intelligence (IAAI)}}
@string{ICML = {Proceedings of the International Conference on Machine Learning (ICML)}}
@string{ICASSP = {Proceedings of ICASSP}}
@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{ILP = {Proceedings of the International Conference Inductive Logic Programming}}
@string{IPW = {Proceedings of the International Parsing Workshop}}
@string{IWPT = {Proceedings of the International Workshop of Parsing Technology}}
@string{IT = {IEEE Transactions on Information Theory}}
@string{ISMB = {The International Conference on Intelligent Systems for Molecular Biology}}
@string{LREC = {Proceedings of the International Conference on Language Resources and Evaluation}}
@string{KR = {Proceedings of the International Conference on the Principles of Knowledge Representation and Reasoning}}
@string{NAACL = {Proceedings of the Annual Meeting of the North American Association of Computational Linguistics (NAACL)}}
@string{NIPS = {The Conference on Advances in Neural Information Processing Systems (NIPS)}}
@string{SIGIR = {Proceedings of International Conference on Research and Development in Information Retrieval, SIGIR}}
@string{SIGDAT = {Proceedings of the Conference on Empirical Methods for Natural Language Processing (EMNLP)}}
@string{EMNLP = {Proceedings of the Conference on Empirical Methods for Natural Language Processing (EMNLP)}}
@string{STOC = {ACM Symp. of the Theory of Computing}}
@string{TMI = {Proceedings of the International Conference on Theoretical and Methodological Issues in Machine Translation}}
@string{UWOED = {Proceedings of the Annual Conference of the UW Center for the New OED and Text Research}}
@string{JACM = {Journal of the ACM}}
@string{WWW = {The International World Wide Web Conference}}
@string{HLT-EMNLP = {Proceedings of Human Language Technology Conference
and Conference on Empirical Methods in Natural
Language Processing}}
@string{UAI = {Proceedings of Uncertainty in Artificial Intelligence (UAI)}}
@string{CIKM = {Proceedings of ACM Conference on Information and Knowledge Management (CIKM)}}
@string{KDD = {Proceedings of International Conference on Knowledge Discovery and Data Mining (KDD)}}
@string{ICDM = {IEEE International Conference on Data Mining(ICDM)}}
@string{SODA = {ACM SIAM Symposium on Discrete Algorithms(SODA)}}
@string{SOCG = {Annual Symposium on Computational Geometry}}
@string{WADS = {Algorithms and Data Structures Symposium}}
@string{SWAT = {Scandinavian Workshop on Algorithm Theory}}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% PUBLISHERS %%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
@string{Cambridge = {Cambridge University Press}}
@string{Benjamin = {Benjamin/Cummings Publishing Company, Inc.}}
@string{MIT = {MIT Press}}
%
@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}
}
@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{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 = {Algorithmic Learning Theory: ALT '97},
year = 1997,
volume = 1316,
series = {Lecture Notes in Artificial Intelligence},
pages = {244--259},
publisher = {Springer-Verlag}
}
@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{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}}
}
@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 = {Algorithmic Learning Theory: ALT '97},
year = 1997,
volume = 1316,
series = {Lecture Notes in Artificial Intelligence},
pages = {2--17},
publisher = {Springer-Verlag}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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{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}
}
@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}
}
@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 = {Proc. of the 34rd Annual Symposium on Foundations of
Computer Science},
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
}
@INPROCEEDINGS{ABCS92,
author = {M. Anthony and G. Brightwell and D. Cohen and
J. Shawe-Taylor},
title = {On exact specification by examples},
booktitle = {Proc. 5th Annu. Workshop on Comput. Learning Theory},
year = 1992,
pages = {311--318},
publisher = {ACM Press, New York, NY}
}
@INPROCEEDINGS{ABFRV88,
author = {D. Angluin and L. Birnbaum and J. Feldman and
R. Rivest and L. Valiant},
title = {Summary of the panel discussion},
booktitle = {Proc. 1st Annu. Workshop on Comput. Learning Theory},
year = 1988,
pages = {398--401},
address = {San Mateo, CA},
publisher = {Morgan Kaufmann}
}
@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}
}
@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{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}
}
@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{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 = {Proc. of the 36th Annual Symposium on Foundations of
Computer Science},
year = 1995,
pages = {322--331},
publisher = {IEEE Computer Society Press, Los Alamitos, CA}
}
@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}
}
@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}
}
@INPROCEEDINGS{ADFK97,
author = {Andris Ambainis and Richard Desper and Martin Farach
and Sampath Kannan},
title = {Nearly tight bounds on the learnability of
evolution},
booktitle = {Proc. 38th Annu. IEEE Symposium on Foundations of
Computer Science},
year = 1997,
pages = {524--533},
publisher = {IEEE Computer Society Press, Los Alamitos, CA}
}
@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}}
}
@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 = {Proceedings of the CoNLL Shared Task Session of
EMNLP-CoNLL 2007},
year = 2007,
pages = {1112--1118},
url = {http://www.aclweb.org/anthology/D/D07/D07-1119}
}
@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}
}
@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{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{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 = {Computational Learning Theory: EuroColt '93},
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{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 = {Proc. 5th Annu. Workshop on Comput. Learning Theory},
year = 1992,
pages = {353--362},
publisher = {ACM Press, New York, NY}
}
@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 = {Proc. 9th International Conference on Algorithmic
Learning Theory - ALT '98},
year = 1998,
volume = 1501,
series = {Lecture Notes in Artificial Intelligence},
pages = {46--60},
publisher = {Springer-Verlag}
}
@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{AGBS98,
author = {Cosimo Anglano and Attilio Giordana and Giuseppe Lo
Bello and Lorenza Saitta},
title = {An experimental evaluation of coevolutive concept
learning},
booktitle = {Proc. 15th International Conf. on Machine Learning},
year = 1998,
pages = {19--27},
publisher = {Morgan Kaufmann, San Francisco, CA}
}
@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{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}
}
@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 = {Proc. International Joint Conference on Artificial
Intelligence},
year = 1993
}
@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 = {Proc. Workshop on Algorithm Engineering},
year = 1999,
pages = {139--153},
html = {http://www.cs.duke.edu/ sariel/papers/99/zone.html},
nickname = {WAE '99}
}
@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}
}
@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}
}
@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{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}
}
@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 = {Proceedings of the International Conference on Fifth
Generation Computer Systems. Volume 2},
year = 1992,
pages = {618--625},
address = {Burke, VA, USA},
publisher = {IOS Press},
isbn = {90-5199-099-5}
}
@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 = {Proc. 9th Annu. Conf. on Comput. Learning Theory},
year = 1996,
pages = {333--343},
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{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 = {Proc. 11th International Conference on Machine
Learning},
year = 1994,
pages = {12--18},
publisher = {Morgan Kaufmann}
}
@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}
}
@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}
}
@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
}
@INPROCEEDINGS{ALRS92,
author = {S. Ar and R. J. Lipton and R. Rubinfeld and
M. Sudan},
title = {Reconstructing algebraic functions from mixed data},
booktitle = {Proc. of the 33rd Symposium on the Foundations of
Comp. Sci.},
year = 1992,
pages = {503--512},
publisher = {IEEE Computer Society Press, Los Alamitos, CA}
}
@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{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,
year = 1996,
pages = {441--450}
}
@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{ASMS93,
author = {Setsuo Arikawa and Takeshi Shinohara and Satoru
Miyano and Ayumi Shinohara},
title = {More About Learning Elementary Formal Systems},
booktitle = {Proc. 2nd 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{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/}
}
@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 = {Proc. 9th International Conference on Algorithmic
Learning Theory - ALT '98},
year = 1998,
volume = 1501,
series = {Lecture Notes in Artificial Intelligence},
pages = {247--261},
publisher = {Springer-Verlag}
}
@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 99},
year = 1999,
pages = {61--72}
}
@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{Abe89,
author = {Naoki Abe},
title = {Polynomial Learnability of Semilinear Sets (Extended
Abstract)},
booktitle = {Second Workshop on Computational Learning Theory},
year = 1989,
address = {Santa Cruz, Cal.\ }
}
@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{Abe92,
author = {N. Abe},
title = {Preservation of predictability under polynomially
sparse variations and its applications},
booktitle = {Proc. 2nd Int. Workshop on Algorithmic Learning
Theory},
year = 1992,
pages = {163--174},
publisher = {IOS Press}
}
@INPROCEEDINGS{Abe93,
author = {N. Abe},
title = {On the sample complexity of various learning
strategies in the probabilistic {PAC} learning
paradigms},
booktitle = {Proc. 2nd Internat. Workshop on Nonmonotonic and
Inductive Logic},
year = 1993,
volume = 659,
series = {Lecture Notes in Artificial Intelligence},
pages = {89--106},
publisher = {Springer--Verlag}
}
@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{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{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}
}
@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{AbeMa98,
author = {Naoki Abe and Hiroshi Mamitsuka},
title = {Query learning strategies using boosting and
bagging},
booktitle = {Proc. 15th International Conf. on Machine Learning},
year = 1998,
pages = {1--9},
publisher = {Morgan Kaufmann, San Francisco, CA}
}
@INPROCEEDINGS{AbeNa99,
author = {Naoki Abe and Atsuyoshi Nakamura},
title = {Leaning to optimally schedule internet banner
advertisements},
booktitle = {Proc. 16th International Conf. on Machine Learning},
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 = {Proc. 6th Annu. Conf. on Comput. Learning Theory},
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 = {Proc. 4th Annu. Workshop on Comput. Learning Theory},
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 = {Third Workshop on Computational Learning Theory},
year = 1990,
pages = {52--66},
publisher = {Morgan Kaufmann},
comment = {Hidden Markov Model}
}
@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}
}
@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}
}
@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{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; }
}
@INPROCEEDINGS{Abney02,
author = {S. P. Abney},
title = {Bootstrapping},
booktitle = ACL,
year = 2002,
pages = {360--367}
}
@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}
}
@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}
}
@InCollection{Abney96a,
author = "S. P. Abney",
title = "Statistical Methods and Linguistics",
publisher = "MIT Press",
year = 1996,
booktitle = "The Balancing Act: Combining Symbolic and
Statistical Approaches to Language ",
editor = " J. Klavans and P. Resnik ",
}
@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{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}
}
@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{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{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{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
}
@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}
}
@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}
}
@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}
}
@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}
}
@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
}
@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{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}
}
@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{AgarwalBhSe99,
author = {P. K. Agarwal and B. Bhattacharya and S. Sen},
title = {Output-sensitive algorithms for uniform partitions
of points},
booktitle = {ISAAC},
year = 1999
}
@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}
}
@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}
}
@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}
}
@UNPUBLISHED{AgarwalHa00,
author = {P. K. Agarwal and S. {Har-Peled}},
title = {Approximating shortest-path of terrains},
note = {manuscript},
year = 2000
}
@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}
}
@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}
}
@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
}
@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
}
@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/}
}
@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{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{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}
}
@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{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}
}
@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
}
@INPROCEEDINGS{AgarwalPr00,
author = {P. K. Agarwal and C. M. Procopiuc},
title = {Approximation Algorithms for Projective Clustering},
booktitle = SODA,
year = 2000,
pages = {538--547}
}
@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{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}
}
@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}
}
@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{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{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}
}
@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{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{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}
}
@misc{AgirreAnMaHo01,
author = "E. Agirre and O. Ansa and D. Martinez and E. Hovy",
title = "Enriching WordNet concepts with topic signatures",
booktitle = "Proceedings of the NAACL worshop on WordNet and
Other Lexical Resources: Applications, Extensions
and Customizations",
address = "Pittsburg",
year = 2001,
}
@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",
year = 1991,
journal = "Machine Learning",
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}
}
@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 = {Proceedings SODA 91},
year = 1991,
month = {Jan},
organization = {ACM},
note = {To appear},
comment = {Learning with respect to the uniform distribution,
probabilistic decision lists and mu-decision trees}
}
@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}
}
@article(Aissen99,
author = "J. Aissen",
year = 1999,
title = "Markedness and Subject Choice in Optimality Theory",
journal = "Natural Language and Linguistic Theory",
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}
}
@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{AizensteinPi92,
author = {Aizenstein, H. and L. Pitt},
title = {Exact Learning of Read-$k$ Disjoint {DNF} and
Not-So-Disjoint {DNF}},
booktitle = {Proceedings of COLT '92},
year = 1992,
pages = {71--76},
address = {Pittsburgh, Pennsylvania},
publisher = {Morgan Kaufmann}
}
@UNPUBLISHED{AizensteinPi93,
author = {Aizenstein, H. and L. Pitt},
title = {{DNF} cannot be learned by greedily collecting prime
implicants},
note = {Unpublished},
year = 1993
}
@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}
}
@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 = {Proc. 3th Int. 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},
year = 2005,
booktitle = {Proceedings of RTE 2005}
}
@INPROCEEDINGS{AkkusG96,
author = {Aynur Akku{\,s} and H. Altay G{\"u}venir},
title = {{K} nearest neighbor classification on feature
projections},
booktitle = {Proc. 13th International Conference on Machine
Learning},
year = 1996,
pages = {12--19},
publisher = {Morgan Kaufmann}
}
@INPROCEEDINGS{AkutsuTa93,
author = {T. Akutsu and A. Takasu},
title = {On {PAC} learnability of functional dependencies},
booktitle = {Proc. 3th Int. 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 = {Proc. of the 31st Symposium on the Foundations of
Comp. Sci.},
year = 1990,
pages = {392--396},
publisher = {IEEE Computer Society Press, Los Alamitos, CA}
}
@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 = {20th Annual Symposium on Foundation of Computer
Science},
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 = {Proc. 15th International Conf. on Machine Learning},
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 = {Proceedings of the 2007 Joint Conference of
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 = {Proc. IEEE Internat. Conf. Robot. Autom.},
year = 1990
}
@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}
}
@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}
}
@book(Allen87,
author = "James Allen",
title = "Natural Language Understanding",
publisher = Benjamin,
year = 1987
)
@book{Allen94,
author = {Allen, J.},
title = {Natural Language Understanding},
publisher = {The Benjamin/Cummings Publishing Company},
year = 1994,
}
@BOOK{Allen95,
title = {Natural Language Understanding},
publisher = Benjamin,
year = 1995,
author = {James Allen},
edition = {second}
}
@INPROCEEDINGS{Allenberg99,
author = {Chamy Allenberg},
title = {Individual sequence prediction - upper bounds and
application for complexity},
booktitle = {Proc. 12th Annu. Conf. on Comput. Learning Theory},
year = 1999,
pages = {233--242},
publisher = {ACM Press, New York, NY}
}
@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; }
}
@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; }
}
@INPROCEEDINGS{AllweinScSi00,
author = {E. L. Allwein and R. E. Schapire and Y. Singer},
title = {Reducing multiclass to binary: a unifying approach
for margin classifiers},
booktitle = {Proceedings of the 17th International Workshop on
Machine Learning},
year = 2000,
pages = {9--16}
}
@INPROCEEDINGS{AlmuallimAkKa95,
author = {Hussein Almuallim and Yasuhiro Akiba and Shigeo
Kaneda},
title = {On handling tree-structured attributes in decision
tree learning},
booktitle = {Proc. 12th International Conference on Machine
Learning},
year = 1995,
pages = {12--20},
publisher = {Morgan Kaufmann}
}
@ARTICLE{Alon85,
author = {N. Alon},
title = {{Hypergraphs with high chromatic numbers}},
journal = {Graphs and Combinatorics},
year = 1985,
volume = 1,
pages = {387--389}
}
@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{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}
}
@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}
}
@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 = {Proc. 1988 Neural Information Processing Conference},
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{Amari91,
author = {S. Amari},
title = {Mathematical Theory of Neural Learning},
journal = {New Generation Computing},
year = 1991,
volume = 8,
pages = {281--294},
number = 4
}
@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{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
}
@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{Ambainis95,
author = {Andris Ambainis},
title = {Application of {K}olmogorov complexity to inductive
inference with limited memory},
booktitle = {Proc. 6th Int. 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 = {Computational Learning Theory: EuroColt '95},
year = 1995,
pages = {99--111},
publisher = {Springer-Verlag}
}
@INPROCEEDINGS{Ambainis96,
author = {Andris Ambainis},
title = {Probabilistic and team {PFIN}-type learning: general
properties},
booktitle = {Proc. 9th Annu. Conf. on Comput. Learning Theory},
year = 1996,
pages = {157--168},
publisher = {ACM Press, New York, NY}
}
@INPROCEEDINGS{AmbainisFr96,
author = {Andris Ambainis and R{\=u}si{\c n}s Freivalds},
title = {transformations that preserve learnability},
booktitle = {Algorithmic Learning Theory: ALT '96},
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 = {Proc.~13th Annual Symposium on Theoretical Aspects
of Computer Science: STACS'96},
year = 1996,
volume = 1046,
series = {Lecture Notes in Computer Science},
pages = {243--253},
publisher = {Springer-Verlag}
}
@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}
}
@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 = {Proc. 5th Int. 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{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 = {Computational Learning Theory: EuroColt '95},
year = 1995,
pages = {313--321},
publisher = {Springer-Verlag}
}
@INPROCEEDINGS{AmothCuTa98,
author = {Thomas R. Amoth and Paul Cull and Prasad Tadepalli},
title = {Exact learning of tree patterns from queries and
counterexamples},
booktitle = {Proc. 11th Annu. Conf. on Comput. Learning Theory},
year = 1998,
pages = {175--186},
publisher = {ACM Press, New York, NY}
}
@INPROCEEDINGS{AmothCuTa99,
author = {Thomas R. Amoth and Paul Cull and Prasad Tadepalli},
title = {Exact learning of unordered tree patterns from
queries},
booktitle = {Proc. 12th Annu. Conf. on Comput. Learning Theory},
year = 1999,
pages = {323--332},
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 = {Proceedings AAAI-88},
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 = {Proceeding of the Fifth 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 = {Proceedings of the 1993 workshop on Knowledge
Discovery in Databases},
year = 1993
}
@INPROCEEDINGS{Anderson99,
author = {John R. Anderson},
title = {{ACT-R} and learning},
booktitle = {Proc. 16th International Conf. on Machine Learning},
year = 1999,
pages = 522,
publisher = {Morgan Kaufmann, San Francisco, CA}
}
@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 = {Proceedings of the Eighth ACM SIGKDD International
Conference on Knowledge Discovery and Data Mining
(KDD-2002)},
year = 2002,
keywords = {Web Log, Web Usage Mining, User Modeling, Markov
Models, Adaptive Web Sites},
location = {Edmonton, Alberta, Canada}
}
@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}
}
@BOOK{AndersonRo88,
title = {Neurocomputing: Foundations of Research},
publisher = {MIT Press},
year = 1988,
editor = {Anderson, James A. and Rosenfeld, Edward}
}
@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.},
volume = 6,
year = 2005,
issn = {1533-7928},
pages = {1817--1853},
publisher = {MIT Press},
address = {Cambridge, MA, USA},
}
@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}
}
@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?},
year = 2005,
booktitle = {Proceedings of RTE 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}
}
@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
}
@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
}
@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{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{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}
}
@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.}
}
@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{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 = {Proc. 1st Annu. Workshop on Comput. Learning Theory},
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
}
@INPROCEEDINGS{Angluin89,
author = {D. Angluin},
title = {Equivalence queries and approximate fingerprints},
booktitle = {Proc. 2nd Annu. Workshop on Comput. Learning Theory},
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
}
@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{Angluin92,
author = {D. Angluin},
title = {Computational learning theory: survey and selected
bibliography},
booktitle = {Proc. 24th Annu. ACM Sympos. Theory Comput.},
year = 1992,
pages = {351--369},
publisher = {ACM Press, New York, NY}
}
@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{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 = {Proc. 10th Annu. Conf. on Comput. Learning Theory},
year = 1997,
pages = {298--308},
publisher = {ACM Press, New York, NY}
}
@INPROCEEDINGS{AngluinFrPi90,
author = {Angluin, D. and Michael Frazier and Leonard Pitt},
title = {Learning Conjunctions of {H}orn Clauses},
booktitle = {Proceedings of IEEE FOCS Conference},
year = 1990,
pages = {186--192},
address = {St. Louis, Missouri},
month = Oct,
publisher = {IEEE}
}
@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}
}
@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; }
}
@INPROCEEDINGS{AngluinKh91,
author = {Angluin, D. and M. Kharitonov},
title = {When Won't Membership Queries Help?},
booktitle = {Proceedings of the Twenty-Third Annual ACM Symposium
on Theory of Computing},
year = 1991,
pages = {444--454},
address = {New Orleans, Louisiana},
month = May
}
@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{AngluinKr94,
author = {D. Angluin and M. Kri{\c k}is},
title = {Learning with malicious membership queries and
exceptions},
booktitle = {Proc. 7th Annu. ACM Conf. on Comput. Learning
Theory},
year = 1994,
pages = {57--66},
publisher = {ACM Press, New York, NY}
}
@INPROCEEDINGS{AngluinKr97,
author = {Dana Angluin and M{\=a}rti{\c n}{\v s} Krikis},
title = {Teachers, Learners and Black Boxes},
booktitle = {Proc. 10th Annu. Conf. on Comput. Learning Theory},
year = 1997,
pages = {285--297},
publisher = {ACM Press, New York, NY}
}
@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{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}
}
@INPROCEEDINGS{AngluinSl91,
author = {Angluin, D. and D. K. Slonim},
title = {Learning Monotone {DNF} with an Incomplete
Membership Oracle},
booktitle = {Proceedings of COLT '91},
year = 1991,
pages = {139--146},
publisher = {Morgan Kaufmann},
note = {(To appear in {\em Machine Learning}.)},
tag = {TOC-display}
}
@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}
}
@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].}
}
@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{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{AnoulovaP94,
author = {S. Anoulova and S. P{\"o}lt},
title = {Using {K}ullback-{L}eibler Divergence in Learning
Theory},
booktitle = {Computational Learning Theory: EuroColt '93},
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 = {Computational Learning Theory: EuroColt '95},
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 = {Proc. 3rd Annu. Workshop on Comput. Learning Theory},
year = 1990,
pages = {246--257},
address = {San Mateo, CA},
publisher = {Morgan Kaufmann}
}
@INPROCEEDINGS{AnthonyHo93,
author = {M. Anthony and S. Holden},
title = {On the power of polynomial discriminators and radial
basis function networks},
booktitle = {Proc. 6th Annu. Workshop on Comput. Learning Theory},
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 = {Proc. 11th Annu. Conf. on Comput. Learning Theory},
year = 1998,
pages = {218--229},
publisher = {ACM Press, New York, NY}
}
@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{AnthonySh94,
author = {M. Anthony and J. Shawe-Taylor},
title = {Valid Generalisation of Functions from Close
Approximations on a Sample},
booktitle = {Computational Learning Theory: EuroColt '93},
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}
}
@INPROCEEDINGS{Antos99,
author = {Andr{\'a}s Antos},
title = {Lower Bounds on the Rate of Convergence of
Nonparametric Pattern Recognition},
booktitle = {Proc. 4th European Conference on Computational
Learning Theory},
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}
}
@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{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}
}
@INPROCEEDINGS{Aps94,
author = {K. Aps{\= i}tis},
title = {Derived sets and inductive inference},
booktitle = {Proc. 5th Int. 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{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 = {Proc. 8th Annu. Conf. on Comput. Learning Theory},
year = 1995,
pages = {170--177},
publisher = {ACM Press, New York, NY}
}
@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 = {Proc. 10th Annu. Conf. on Comput. Learning Theory},
year = 1997,
pages = {90--95},
publisher = {ACM Press, New York, NY}
}
@INPROCEEDINGS{ApsitisFrSm94,
author = {K. Apsitis and R. Freivalds and C. Smith},
title = {Choosing a learning team: a topological approach},
booktitle = {Proc. of Twenty-sixth ACM Symposium on Theory of
Computing},
year = 1994,
page = {283-289}
}
@inproceedings{Apte-et-al94,
author = "C. Apte and F. Damerau and S. Weiss",
year = 1994,
title = "Towards language independent automated learning of
text categorization models",
booktitle = {Proceedings of ACM-SIGIR Conference on Information
Retrieval}
}
@INPROCEEDINGS{ApteDaWe94,
author = {C. Apte and F. Damerau and S. Weiss},
title = {Towards language independent automated learning of
text categorization models},
booktitle = {Proceedings of ACM-SIGIR Conference on Information
Retrieval},
year = 1994
}
@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{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{ArgamonDaKr98,
author = {S. Argamon and I. Dagan and Y. Krymolowski},
title = {A memory-based approach to learning shallow natural
language patterns},
booktitle = {COLING-ACL 98, The 17th International Conference on
Computational Linguistics},
year = 1998
}
@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{ArgyriouEvPo,
author = {Andreas Argyriou and Theodoros Evgeniou and
Massimiliano Pontil},
title = {Convex Multi-task feature learning},
booktitle = {Machine Learning (to appear)},
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}
}
@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{ArikawaShYa89,
author = {S. Arikawa and T. Shinohara and A. Yamamoto},
title = {Elementary formal system as a unifying framework for
language learning},
booktitle = {Proc. 2nd Annu. Workshop on Comput. Learning Theory},
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 = {Proc. 2nd Int. 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 = {Proc. 4th Int. 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 = {Proceedings of the 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
}
@INPROCEEDINGS{ArimuraIsSh92,
author = {H. Arimura and H. Ishizaka and T. Shinohara},
title = {Polynomial time inference of a subclass of
context-free transformations},
booktitle = {Proc. 5th Annu. Workshop on Comput. Learning Theory},
year = 1992,
pages = {136--143},
publisher = {ACM Press, New York, NY}
}
@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{ArimuraShOt92,
author = {H. Arimura and T. Shinohara and S. Otsuki},
title = {Polynomial time inference of unions of tree pattern
languages},
booktitle = {Proc. 2nd Int. Workshop on Algorithmic Learning
Theory},
year = 1992,
pages = {105--114},
publisher = {IOS Press}
}
@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 = {Proc. 2nd Internat. Workshop on Nonmonotonic and
Inductive Logic},
year = 1993,
volume = 659,
series = {Lecture Notes in Artificial Intelligence},
pages = {118--131},
publisher = {Springer--Verlag}
}
@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 = {Proceedings of IFIP 74},
year = 1974,
pages = {580--583},
publisher = {North Holland, Amsterdam}
}
@INPROCEEDINGS{ArnoldJa94,
author = {O. Arnold and K. P. Jantke},
title = {Therapy plan generation as program synthesis},
booktitle = {Proc. 5th Int. Workshop on Algorithmic Learning
Theory},
year = 1994,
pages = {40--55},
publisher = {Springer-Verlag}
}
@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{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{ArvindVi96,
author = {V. Arvind and N. V. Vinodchandran},
title = {The complexity of exactly learning algebraic
concepts},
booktitle = {Algorithmic Learning Theory: ALT '96},
year = 1996,
volume = 1160,
series = {Lecture Notes in Artificial Intelligence},
pages = {100--112},
publisher = {Springer-Verlag}
}
@INPROCEEDINGS{ArvindVi97,
author = {V. Arvind and N. V. Vinodchandran},
title = {Exact learning via teaching assistants},
booktitle = {Algorithmic Learning Theory: ALT '97},
year = 1997,
volume = 1316,
series = {Lecture Notes in Artificial Intelligence},
pages = {291--306},
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{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 = {Proc. 11th International Conference on Machine
Learning},
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 = {Proc. 14th International Conference on Machine
Learning},
year = 1997,
pages = {3--11},
publisher = {Morgan Kaufmann}
}
@INPROCEEDINGS{Aslam00,
author = {Javed A. Aslam},
title = {Improving Algorithms for Boosting},
booktitle = {Proc. 13th Annu. Conference on Comput. Learning
Theory},
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{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 = {Proceedings of the 34th Annual Symposium on
Foundations of Computer Science},
year = 1993,
pages = {282--291},
month = Nov
}
@INPROCEEDINGS{AslamDe95,
author = {J. A. Aslam and S. E. Decatur},
title = {Specification and simulation of statistical query
algorithms for efficiency and noise tolerance},
booktitle = {Proc. 8th Annu. Conf. on Comput. Learning Theory},
year = 1995,
pages = {437--446},
publisher = {ACM Press, New York, NY}
}
@INPROCEEDINGS{AslamDh91,
author = {Aslam, Javed A. and Aditi Dhagat},
title = {Searching in the Presence of Linearly Bounded
Errors},
booktitle = {Proceedings of the Twenty-Third Annual {ACM}
Symposium onTheory of Computing},
year = 1991,
pages = {486--493},
month = May
}
@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{AslamRi90,
author = {Aslam, Javed A. and Ronald L. Rivest},
title = {Inferring Graphs from Walks},
booktitle = {Proceedings of the Third Annual Workshop on
ComputationalLearning Theory},
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 = {23rd Annual Symposium on Foundations of Computer
Science},
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.}
}
@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 = {Proc. 14th International Conference on Machine
Learning},
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
}
@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 = {Proc. 13th Annu. Conference on Comput. Learning
Theory},
year = 2000,
pages = {118--125},
publisher = {Morgan Kaufmann, San Francisco}
}
@INPROCEEDINGS{Auer93,
author = {P. Auer},
title = {On-line learning of rectangles in noisy
environments},
booktitle = {Proc. 6th Annu. Conf. on Comput. Learning Theory},
year = 1993,
pages = {253--261},
publisher = {ACM Press, New York, NY}
}
@INPROCEEDINGS{Auer97,
author = {Peter Auer},
title = {On learning from multi-instance examples: Empirical
evaluation of a theoretical approach},
booktitle = {Proc. 14th International Conference on Machine
Learning},
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}
}
@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{AuerGe00,
author = {Peter Auer and Claudio Gentile},
title = {Adaptive and Self-Confident On-Line Learning
Algorithms},
booktitle = {Proc. 13th Annu. Conference on Comput. Learning
Theory},
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 = {Proc. 12th International Conference on Machine
Learning},
year = 1995,
pages = {21--29},
publisher = {Morgan Kaufmann}
}
@INPROCEEDINGS{AuerLo94,
author = {P. Auer and P. Long},
title = {Simulating Access to hidden information while
learning},
booktitle = {Proc. of Twenty-sixth ACM Symposium on Theory of
Computing},
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}
}
@INPROCEEDINGS{AuerWa95,
author = {Peter Auer and Manfred Warmuth},
title = {Tracking the best disjunction},
booktitle = {Proc. of the 36th Annual Symposium on Foundations of
Computer Science},
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}
}
@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}
}
@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{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}
}
@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{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 = {Proc. 11th Annu. Conf. on Comput. Learning Theory},
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}
}
@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}
}
@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 = {Proc. 4th Int. Workshop on Algorithmic Learning
Theory},
year = 1993,
volume = 744,
series = {Lecture Notes in Artificial Intelligence},
pages = {59--72},
publisher = {Springer-Verlag}
}
@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}
}
@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
}
@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}
}
@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{BBMN02,
author = {L. van der Beek and G. Bouma and R. Malouf and
G. van Noord},
title = {The Alpino Dependency Treebank},
booktitle = {Computational Linguistics in the Netherlands (CLIN)},
year = 2002,
timestamp = {2007.01.26}
}
@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 = {Computational Learning Theory: EuroColt '97},
year = 1997,
pages = {150--161},
publisher = {Springer-Verlag}
}
@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
}
@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
}
@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 = {Proc. 8th Annu. Conf. on Comput. Learning Theory},
year = 1995,
pages = {198--205},
publisher = {ACM Press, New York, NY}
}
@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{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}
}
@INPROCEEDINGS{BCGS95,
author = {Avrim Blum and Prasad Chalasani and Sally A. Goldman
and Donna K. Slonim},
title = {Learning with unreliable boundary queries},
booktitle = {Proc. 8th Annu. Conf. on Comput. Learning Theory},
year = 1995,
pages = {98--107},
publisher = {ACM Press, New York, NY}
}
@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 = {Proc. 10th International Conference on Algorithmic
Learning Theory - ALT '99},
year = 1999,
volume = 1720,
series = {Lecture Notes in Artificial Intelligence},
pages = {77--92},
publisher = {Springer-Verlag}
}
@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
}
@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}
}
@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 = {Proc. 7th Annu. ACM Conf. on Comput. Learning
Theory},
year = 1994,
pages = {130--139},
publisher = {ACM Press, New York, NY}
}
@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{BCMP92,
author = {A. Bertoni and P. Campadelli and A. Morpurgo and
S. Panizza},
title = {Polynomial uniform convergence and polynomial-sample
learnability},
booktitle = {Proc. 5th Annu. Workshop on Comput. Learning Theory},
year = 1992,
pages = {265--271},
publisher = {ACM Press, New York, NY}
}
@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{BDGS07,
title = {Semantic Inference at the Lexical-Syntactic Level},
author = {Bar-Haim, R. and Dagan, I. and Greental, I. and
Shnarch, E.},
booktitle = {Proceedings Of The National Conference On Artificial
Intelligence},
volume = 22,
number = 1,
pages = 871,
year = 2007,
}
@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 = {Proc. 3th Int. Workshop on Algorithmic Learning
Theory},
year = 1993,
volume = 743,
series = {Lecture Notes in Artificial Intelligence},
pages = {53--62},
publisher = {Springer-Verlag}
}
@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 = {Proc. 7th Annu. ACM Conf. on Comput. Learning
Theory},
year = 1994,
pages = {208--217},
publisher = {ACM Press, New York, NY}
}
@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{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}
}
@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 = {Proceedings of the Eighteenth Annual ACM Symposium
on Theory of Computing},
year = 1986,
pages = {273--282},
address = {Berkeley, California},
month = May,
comment = {Shows equivalence between finite VC dimension and
learnability of geometric concepts.}
}
@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.}
}
@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; }
}
@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 = {Proc. of Twenty-sixth ACM Symposium on Theory of
Computing},
year = 1994
}
@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 = {Proc. 16th International Conf. on Machine Learning},
year = 1999,
pages = {67--76},
publisher = {Morgan Kaufmann, San Francisco, CA}
}
@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}
}
@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.}
}
@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{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{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}
}
@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{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}
}
@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 = {Proc. 28th Annu. ACM Symposium on the Theory of
Computing},
year = 1996,
pages = {151--160},
publisher = {ACM Press, New York, NY}
}
@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}
}
@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}
}
@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 = {Proc. of First Int. Conf. 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}
}
@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}
}
@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{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{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{BJVU98,
author = {A. Br{\= a}zma and I. Jonassen and J. Vilo and
E. Ukkonen},
title = {Pattern discovery in biosequences},
booktitle = {Proc. 4th International Colloquium on Grammatical
Inference - ICGI '98},
year = 1998,
volume = 1433,
series = {Lecture Notes in Artificial Intelligence},
pages = {257--270},
publisher = {Springer-Verlag}
}
@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}
}
@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{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}
}
@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 Int.\ Conf.\ on Manag.\ of Data},
year = 1990,
pages = {322--331}
}
@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}
}
@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}
}
@INPROCEEDINGS{BLGK07,
author = {Bouchard, Alexandre and Liang, Percy and Griffiths,
Thomas and Klein, Dan},
title = {A Probabilistic Approach to Diachronic Phonology},
booktitle = {Proceedings of the 2007 Joint Conference of
EMNLP-CoNLL},
year = 2007,
pages = {887--896},
url = {http://www.aclweb.org/anthology/D/D07/D07-1093}
}
@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}
}
@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{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{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
}
@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{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}
}
@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}
}
@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 = {Proceedings of the 2007 Joint Conference of
EMNLP-CoNLL},
year = 2007,
pages = {858--867},
url = {http://www.aclweb.org/anthology/D/D07/D07-1090}
}
@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 = {Proc. 13th International Conference on Machine
Learning},
year = 1996,
pages = {20--27},
publisher = {Morgan Kaufmann}
}
@inproceedings{BVD99,
author = {S. Buchholz and J. Veenstra and W. Daelemans},
title = {Cascaded Grammatical Relation Assignment},
booktitle = {EMNLP-VLC'99, the Joint SIGDAT Conference on
Empirical Methods in Natural Language Processing and
Very Large Corpora},
month = Jun,
year = 1999
}
@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{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 = {Proc. 8th Annu. Conf. on Comput. Learning Theory},
year = 1995,
pages = {265--272},
publisher = {ACM Press, New York, NY}
}
@inCollection(BWYLLs),
author = "R. Baillargeon and D. Wu and S. Yuan and J. Li and
Y. Luo",
year = "(in press)",
title = "Young infants expectations about self-propelled
objects",
editor = "B. Hood and L. Santos",
booktitle = "The origins of object knowledge",
address = "Oxford",
publisher = "Oxford University Press"
)
@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}
}
@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}
}
@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 = {Proceedings of the 22nd Annual German Conference on
Artificial Intelligence, {KI-98}},
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}
}
@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; }
}
@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; }
}
@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 92 Proceedings},
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 = {Proc. 4th European Conference on Computational
Learning Theory},
year = 1999,
volume = 1572,
series = {Lecture Notes in Artificial Intelligence},
pages = {34--49},
publisher = {Springer-Verlag}
}
@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/}
}
@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 = {Proc. 5th Int. 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{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 = {Proc. 12th International Conference on Machine
Learning},
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{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 = {Computational Learning Theory: EuroColt '95},
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 = {Proc. 13th Annu. Conference on Comput. Learning
Theory},
year = 2000,
pages = {248--254},
publisher = {Morgan Kaufmann, San Francisco}
}
@INPROCEEDINGS{BaligaCa94,
author = {G. Baliga and J. Case},
title = {Learning with higher order additional information},
booktitle = {Proc. 5th Int. Workshop on Algorithmic Learning
Theory},
year = 1994,
pages = {64--75},
publisher = {Springer-Verlag}
}
@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}
}
@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}
}
@INPROCEEDINGS{BaligaCaJa96,
author = {Ganesh R. Baliga and John Case and Sanjay Jain},
title = {Synthesizing enumeration techniques for language
learning},
booktitle = {Proc. 9th Annu. Conf. on Comput. Learning Theory},
year = 1996,
pages = {169--180},
publisher = {ACM Press, New York, NY}
}
@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
}
@INPROCEEDINGS{BaligaJaSh92,
author = {G. Baliga and S. Jain and A. Sharma},
title = {Learning from Multiple Sources of Inaccurate Data},
booktitle = {Analogical and Inductive Inference, International
Workshop AII'92, Dagstuhl Castle, Germany,
proceedings},
year = 1992,
pages = {108--128},
publisher = {Springer Verlag},
note = {In Lecture Notes in AI 642. Was Univ of Del
TR-91-14}
}
@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{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 = {Proc. 12th International Conference on Machine
Learning},
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 = {Proc. 14th International Conference on Machine
Learning},
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{BanerjeePe02,
author = {S. Banerjee and T. Pedersen},
title = {An Adapted Lesk Algorithm for Word Sense
Disambiguation using WordNet},
booktitle = {Proceedings of the Third International Conference on
Intelligent Text Processing and Computational
Linguistics},
year = 2002,
month = {Februray 17 - Februray 23},
address = {Mexico City, USA},
pages = {136--145}
}
@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{Banerji88,
author = {R. B. Banerji},
title = {Learning theories in a subset of a polyadic logic},
booktitle = {Proc. 1st Annu. Workshop on Comput. Learning Theory},
year = 1988,
pages = {267--278},
address = {San Mateo, CA},
publisher = {Morgan Kaufmann}
}
@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}
}
@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}
}
@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{BankoEt08,
author = {Banko, Michele and Etzioni, Oren},
title = {The Tradeoffs Between Open and Traditional Relation
Extraction},
booktitle = {Proceedings of ACL-08: HLT},
month = {June},
year = 2008,
address = {Columbus, Ohio},
publisher = {Association for Computational Linguistics},
pages = {28--36},
url = {http://www.aclweb.org/anthology/P/P08/P08-1004}
}
@INPROCEEDINGS{Bar-EliBerFiYa92,
author = {E. Bar-Eli, P. Berman, A. Fiat and P. Yan},
title = {On-line Navigation in a Room},
booktitle = {Symposium on Discrete Algorithms},
year = 1992,
pages = {237--249}
}
@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 = {Proceedings of the ACL-PASCAL Workshop on Textual
Entailment and Paraphrasing},
month = {June},
year = 2007,
address = {Prague},
publisher = {Association for Computational Linguistics},
pages = {131--136},
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 = {Proceedings of the ACL Workshop on Empirical
Modeling of Semantic Equivalence and Entailment},
month = {June},
year = 2005,
address = {Ann Arbor, Michigan},
publisher = {Association for Computational Linguistics},
pages = {55--60},
url = {http://www.aclweb.org/anthology/W/W05/W05-1210}
}
@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}
}
@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{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{BarkerEtAl07,
title = {{Learning by Reading: A Prototype System,
Performance Baseline and Lessons Learned}},
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},
booktitle = {Proceedings of the Twenty-Second National Conference
on Artificial Intelligence (AAAI 2007)},
volume = 22,
pages = 280,
year = 2007,
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,
volume = 167,
number = {1-2},
pages = {13--30},
year = 2005,
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{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{Barron97,
author = {Andrew R. Barron},
title = {Information theory in probability, statistics,
learning, and neural nets},
booktitle = {Proc. 10th Annu. Conf. on Comput. Learning Theory},
year = 1997,
pages = 1,
publisher = {ACM Press, New York, NY}
}
@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 = {Proc. International Symposium on Information Theory},
year = 1993,
month = jan
}
@INPROCEEDINGS{BarsilayMc01,
AUTHOR = "R. Barzilay and K. R. McKeown",
TITLE = "Extracting Paraphrases from a Parallel Corpus",
BOOKTITLE = "Proceeding of the 10th Conference of the European
Chapter of ACL",
YEAR = 2001,
}
@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{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{Bartlett92,
author = {P. L. Bartlett},
title = {Learning with a slowly changing distribution},
booktitle = {Proc. 5th Annu. Workshop on Comput. Learning Theory},
year = 1992,
pages = {243--252},
publisher = {ACM Press, New York, NY}
}
@INPROCEEDINGS{Bartlett93,
author = {P. Bartlett},
title = {Lower bounds on the {V}apnik-{C}hervonenkis
dimension of multi-layer threshold networks},
booktitle = {Proc. 6th Annu. Conf. on Comput. Learning Theory},
year = 1993,
pages = {144--150},
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 = {Proc. 13th Annu. Conference on Comput. Learning
Theory},
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 = {Proc. 4th European Conference on Computational
Learning Theory},
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 = {Proc. 9th Annu. Conf. on Comput. Learning Theory},
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 = {Proc. 13th Annu. Conference on Comput. Learning
Theory},
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 = {Proc. 7th Annu. ACM Conf. on Comput. Learning
Theory},
year = 1994,
pages = {318--327},
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 = {Computational Learning Theory: EuroColt '97},
year = 1997,
pages = {210--222},
publisher = {Springer-Verlag}
}
@INPROCEEDINGS{BartlettLo95,
author = {Peter L. Bartlett and Philip M. Long},
title = {More theorems about scale-sensitive dimensions and
learning},
booktitle = {Proc. 8th Annu. Conf. on Comput. Learning Theory},
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 = {Proc. 7th Annu. ACM Conf. on Comput. Learning
Theory},
year = 1994,
pages = {299--310},
publisher = {ACM Press, New York, NY}
}
@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{BartlettWi91,
author = {P. L. Bartlett and R. C. Williamson},
title = {Investigating the distribution assumptions in the
{PAC} learning model},
booktitle = {Proc. 4th Annu. Workshop on Comput. Learning Theory},
year = 1991,
pages = {24--32},
address = {San Mateo, CA},
publisher = {Morgan Kaufmann}
}
@INPROCEEDINGS{BarveLo96,
author = {Rakesh D. Barve and Philip M. Long},
title = {On the complexity of learning from drifting
distributions},
booktitle = {Proc. 9th Annu. Conf. on Comput. Learning Theory},
year = 1996,
pages = {122--130},
publisher = {ACM Press, New York, NY}
}
@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 = {Proc. 13th Annual Symposium on Theoretical Aspects
of Computer Science: STACS '96},
year = 1996,
volume = 1046,
series = {Lecture Notes in Computer Science},
pages = {207--218},
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 = {Computational Learning Theory: EuroColt '97},
year = 1997,
pages = {272--285},
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 = {Algorithmic Learning Theory: ALT '96},
year = 1996,
volume = 1160,
series = {Lecture Notes in Artificial Intelligence},
pages = {156--168},
publisher = {Springer-Verlag}
}
@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{Barzdin71,
author = {J. M. Barzdin},
title = {Prognostication of automata and functions},
journal = {Information Processing},
year = 1971,
volume = 1,
pages = {81--84}
}
@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}
}
@INPROCEEDINGS{Barzdin77,
author = {J. M. Barzdin},
title = {Inductive Inference of Automata, Functions and
Programs},
booktitle = {Amer. Math. Soc. Transl.},
year = 1977,
pages = {107--122},
annote = {Was also in Int. Math. Congress in 1974}
}
@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)}
}
@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}
}
@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 = {Proc. 2nd Conf. Mathematical Foundations of Computer
Science},
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 = {Proc. 2nd Internat. 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 = {Proc. 5th Int. Workshop on Algorithmic Learning
Theory},
year = 1994,
pages = 1,
publisher = {Springer-Verlag}
}
@INPROCEEDINGS{BarzilayLa05,
author = {Regina Barzilay and Mirella Lapata},
title = {Modeling local coherence: an entity-based approach},
booktitle = ACL,
year = 2005,
}
@INPROCEEDINGS{BarzilayLa06,
author = {R. Barzilay and M. Lapata},
title = {{Aggregation via Set Partitioning for Natural
Language Generation}},
booktitle = {Proc. of HLT/NAACL},
year = 2006,
month = {June}
}
@INPROCEEDINGS{BarzilayLe04,
author = {Regina Barzilay and Lillian Lee},
title = {Catching the drift: probabilistic content models,
with applications to generation and summarization},
booktitle = {HLT-NAACL 2004: Proceedings of the Main Conference},
pages = {113-120},
year = 2004,
}
@INPROCEEDINGS{BarzilayPPEval,
author = {David Kauchak and Regina Barzilay},
title = {Paraphrasing for automatic evaluation},
booktitle = {Proceedings of HLT-NAACL},
year = 2006,
pages = {455--462}
}
@inproceedings{BarzilyLa06,
author = {Regina Barzilay and Mirella Lapata},
title = {Aggregation via set partitioning for natural
language generation},
booktitle = NAACL,
year = 2006,
pages = {359--366},
location = {New York, New York},
publisher = {ACL},
}
@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/}
}
@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/}
}
@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{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}
}
@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}
}
@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{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{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 = {Proc. 3rd Annu. Workshop on Comput. Learning Theory},
year = 1990,
pages = {258--272},
address = {San Mateo, CA},
publisher = {Morgan Kaufmann}
}
@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
}
@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}
}
@INPROCEEDINGS{Baum96,
author = {Baum, E.},
title = {Toward a model of Mind as a Laissez-Faire Economy of
Idiots},
booktitle = ML,
year = 1996
}
@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}
}
@INPROCEEDINGS{BaumBoGa95,
author = {Eric B. Baum and Dan Boneh and Charles Garrett},
title = {On genetic algorithms},
booktitle = {Proc. 8th Annu. Conf. on Comput. Learning Theory},
year = 1995,
pages = {230--239},
publisher = {ACM Press, New York, NY}
}
@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.}
}
@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{BaumHa89a,
author = {Baum, E. B. and D. Haussler},
title = {What Size Net Gives Valid Generalization?},
booktitle = {Advances in Neural Information Processing Systems I},
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}
}
@INPROCEEDINGS{BaumWi88,
author = {E. Baum and F. Wilczek},
title = {Supervised Learning of Probability Distributions by
Neural Networks},
booktitle = {Neural Information Processing Systems},
year = 1988,
editor = {D. Z. Anderson},
pages = {52--61},
address = {New York},
publisher = {American Insitute of Physics}
}
@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",
editor = "Perkins and Howard",
publisher = "Kluwer Academic Press",
address = "New York",
pages = "169-177",
year = 1997
}
@INPROCEEDINGS{Baxter95,
author = {Jonathan Baxter},
title = {Learning internal representations},
booktitle = {Proc. 8th Annu. Conf. on Comput. Learning Theory},
year = 1995,
pages = {311--320},
publisher = {ACM Press, New York, NY}
}
@INPROCEEDINGS{Baxter96,
author = {Jonathan Baxter},
title = {A {B}ayesian/information theoretic model of bias
learning},
booktitle = {Proc. 9th Annu. Conf. on Comput. Learning Theory},
year = 1996,
pages = {77--88},
publisher = {ACM Press, New York, NY}
}
@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 = {Proc. 14th International Conference on Machine
Learning},
year = 1997,
pages = {39--47},
publisher = {Morgan Kaufmann}
}
@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 = {Computational Learning Theory: EuroColt '97},
year = 1997,
pages = {251--259},
publisher = {Springer-Verlag}
}
@INPROCEEDINGS{BaxterOl96,
author = {Rohan A. Baxter and Jonathan J. Oliver},
title = {The kindest cut: minimum message length
segmentation},
booktitle = {Algorithmic Learning Theory: ALT '96},
year = 1996,
volume = 1160,
series = {Lecture Notes in Artificial Intelligence},
pages = {83--90},
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 = {Proc. 15th International Conf. on Machine Learning},
year = 1998,
pages = {28--36},
publisher = {Morgan Kaufmann, San Francisco, CA}
}
@INPROCEEDINGS{Bay98,
author = {Stephen D. Bay},
title = {Combining nearest neighbor classifiers through
multiple feature subsets},
booktitle = {Proc. 15th International Conf. on Machine Learning},
year = 1998,
pages = {37--45},
publisher = {Morgan Kaufmann, San Francisco, CA}
}
@ARTICLE{BayraktarSaAk98,
author = "M. Bayraktar and B. Say and V. Akman",
year = 1998,
title = {An Analysis of English Punctuation: The Special Case
of Comma},
journal = {International Journal of Corpus Linguistics},
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
}
@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}
}
@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 = {Proc. 11th Annu. Conf. on Comput. Learning Theory},
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{Bellare92,
author = {M. Bellare},
title = {A technique for upper bounding the spectral norm
with applications to learning},
booktitle = {Proc. 5th Annu. Workshop on Comput. Learning Theory},
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-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 = {Proc. 2nd Annu. Workshop on Comput. Learning Theory},
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 = {Proceedings of COLT '89},
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 = {Proc. 5th Annu. Workshop on Comput. Learning Theory},
year = 1992,
pages = {333--340},
publisher = {ACM Press, New York, NY}
}
@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-DavidDi94,
author = {S. Ben-David and E. Dichterman},
title = {Learnability with restricted focus of attention
guarantees noise-tolerance},
booktitle = {Proc. 5th Int. Workshop on Algorithmic Learning
Theory},
year = 1994,
pages = {248--259},
publisher = {Springer-Verlag}
}
@INPROCEEDINGS{Ben-DavidEiKu95,
author = {Shai Ben-David and Nadav Eiron and Eyal Kushilevitz},
title = {On self-directed learning},
booktitle = {Proc. 8th Annu. Conf. on Comput. Learning Theory},
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 = {Proc. 13th Annu. Conference on Comput. Learning
Theory},
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 = {Proc. 13th Annu. Conference on Comput. Learning
Theory},
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 = {Proc. 8th Annu. Conf. on Comput. Learning Theory},
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 = {Proc. 3rd Annu. Workshop on Comput. Learning Theory},
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 = {Proc. 6th Annu. Conf. on Comput. Learning Theory},
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}
}
@INPROCEEDINGS{Ben-DavidLi93,
author = {S. Ben-David and M. Lindenbaum},
title = {Localization vs. identification of semi-algebraic
sets},
booktitle = {Proc. 6th Annu. Conf. on Comput. Learning Theory},
year = 1993,
pages = {327--336},
publisher = {ACM Press, New York, NY}
}
@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}
}
@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{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
}
@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 = {Proc. of the 35rd Annual Symposium on Foundations of
Computer Science},
year = 1994,
pages = {75--85},
publisher = {IEEE Computer Society Press, Los Alamitos, CA}
}
@UNPUBLISHED{Benedek88,
author = {Benedek, Gyora M.},
title = {Ph.D. dissertation, in preparation},
note = {(To appear.)},
year = 1988
}
@INPROCEEDINGS{BenedekIt88,
author = {G. M. Benedek and A. Itai},
title = {Learnability by fixed distributions},
booktitle = {Proc. 1st Annu. Workshop on Comput. Learning Theory},
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{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}
}
@INPROCEEDINGS{BenedekIt92,
author = {G. M. Benedek and A. Itai},
title = {Dominating distributions and learnability},
booktitle = {Proc. 5th Annu. Workshop on Comput. Learning Theory},
year = 1992,
pages = {253--264},
publisher = {ACM Press, New York, NY}
}
@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{Benson95,
author = {Scott Benson},
title = {Inductive learning of reactive action models},
booktitle = {Proc. 12th International Conference on Machine
Learning},
year = 1995,
pages = {47--54},
publisher = {Morgan Kaufmann}
}
@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{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 = {Computational Learning Theory: EuroColt '95},
year = 1995,
pages = {298--312},
publisher = {Springer-Verlag}
}
@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}
}
@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}
}
@BOOK{BergadanoGu96,
title = {Inductive Logic Programming},
publisher = {MIT Press},
year = 1996,
author = {F. Bergadano and D. Gunetti}
}
@INPROCEEDINGS{BergadanoSa89,
author = {F. Bergadano and L. Saitta},
title = {On the error probabilty of boolean concept
descriptions},
booktitle = {Proc. of the 1989 European Working Session on
Learning},
year = 1989,
pages = {25--35}
}
@INPROCEEDINGS{BergadanoVa95,
author = {F. Bergadano and S. Varricchio},
title = {Learning behaviors of automata from shortest
counterexamples},
booktitle = {Computational Learning Theory: EuroColt '95},
year = 1995,
pages = {380--391},
publisher = {Springer-Verlag}
}
@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
}
@BOOK{Berge89,
title = {Hypergraphs},
publisher = {North Holland},
year = 1989,
author = {C. Berge},
address = {Amsterdam}
}
@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;}
}
@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{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}
}
@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}
}
@INPROCEEDINGS{BergerPr98,
author = {A. Berger and H. Printz},
title = {Recognition performance of a large-scale
dependency-grammar language model},
booktitle = {Int'l Conference on Spoken Language Processing
(ICSLP'98)},
year = 1998,
address = {Sydney, Australia}
}
@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 = {Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci.},
year = 1989,
pages = {54--59},
publisher = {IEEE Computer Society Press, Los Alamitos, CA}
}
@INPROCEEDINGS{Berggren93,
author = {U. Berggren},
title = {Linear time deterministic learning of $k$-term
{DNF}},
booktitle = {Proc. 6th Annu. Conf. on Comput. Learning Theory},
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 = {Proceedings of the 2007 Joint Conference of
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 = {Proc. 28th Annu. IEEE Sympos. Found. Comput. Sci.},
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 = {Proc. 5th Annu. Workshop on Comput. Learning Theory},
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}
}
@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, Vol. II},
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{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}
}
@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}
}
@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 = {Proceedings of the 2007 Joint Conference of
EMNLP-CoNLL},
year = 2007,
pages = {161--170},
url = {http://www.aclweb.org/anthology/D/D07/D07-1017}
}
@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}
}
@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{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 = {Proc. 5th Int. 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 = {Proceedings of the CoNLL Shared Task Session of
EMNLP-CoNLL 2007},
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 = {Proceedings of the 21sth National Conference on
Artificial Intelligence (AAAI)},
year = 2006
}
@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{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{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 77},
year = 1977,
pages = {41--45},
publisher = {North-Holland, Amsterdam}
}
@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,
volume = 11,
number = "2--3",
year = 1985
)
@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 = {Proc. 15th International Conf. on Machine Learning},
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{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 = {Computational Learning Theory: EuroColt '97},
year = 1997,
pages = {198--209},
publisher = {Springer-Verlag}
}
@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(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(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,
pages = "31--37",
year = 1993
)
@INPROCEEDINGS{BlackmoreMi95,
author = {Justine Blackmore and Risto Miikkulainen},
title = {Visualizing high-dimensional structure with the
incremental grid-growing neural network},
booktitle = {Proc. 12th International Conference on Machine
Learning},
year = 1995,
pages = {55--63},
publisher = {Morgan Kaufmann}
}
@INPROCEEDINGS{BlanzieriKa96,
author = {E. Blanzieri and P. Katenkamp},
title = {Learning radial basis function networks on-line},
booktitle = {Proc. 13th International Conference on Machine
Learning},
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 = {Proc. 16th International Conf. on Machine Learning},
year = 1999,
pages = {22--31},
publisher = {Morgan Kaufmann, San Francisco, CA}
}
@INPROCEEDINGS{BleiMo01,
author = {D. Blei and P. Moreno},
title = {Topic segmentation with an aspect hidden Markov
model},
booktitle = {Proc. of the 24th annual international ACM SIGIR
conference},
year = 2001
}
@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 = {Proc. 15th International Conf. on Machine Learning},
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,
number = 7,
pages = {422--426}
}
@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; }
}
@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{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
}
@INPROCEEDINGS{Blum90,
author = {Blum, A.},
title = {Learning Boolean Functions in an Infinite Attribute
Space},
booktitle = {Proceedings of the Twenty-Second Annual ACM
Symposium on Theory of Computing},
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 = {Proceedings of COLT '90},
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 = {Proceedings of the Thirty-First Annual Symposium
onFoundations of Computer Science},
year = 1990,
volume = {I},
pages = {211-218},
publisher = {IEEE},
tag = {TOC-display}
}
@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{Blum95,
author = {A. Blum},
title = {Empirical support for {W}innow and weighted-majority
based algorithms: results on a calendar scheduling
domain},
booktitle = {Proc. 12th International Conference on Machine
Learning},
year = 1995,
pages = {64--72},
publisher = {Morgan Kaufmann}
}
@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{Blum97a,
author = {Manuel Blum},
title = {Program Error Detection/Correction: {T}urning {PAC}
Learning into {PERFECT} Learning},
booktitle = {Algorithmic Learning Theory: ALT '97},
year = 1997,
volume = 1316,
series = {Lecture Notes in Artificial Intelligence},
pages = {1--1},
publisher = {Springer-Verlag}
}
@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].}
}
@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{BlumCh92,
author = {A. Blum and P. Chalasani},
title = {Learning switching concepts},
booktitle = {Proc. 5th Annu. Workshop on Comput. Learning Theory},
year = 1992,
pages = {231--242},
publisher = {ACM Press, New York, NY}
}
@INPROCEEDINGS{BlumCh93,
author = {A. Blum and P. Chalasani},
title = {An on-line algorithm for improving performance in
navigation.},
booktitle = {Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci.},
year = 1993,
pages = {2--11},
publisher = {IEEE Computer Society Press, Los Alamitos, CA}
}
@INPROCEEDINGS{BlumChJa93,
author = {A. Blum and P. Chalasani and J. Jackson},
title = {On learning embedded symmetric concepts},
booktitle = {Proc. 6th Annu. Workshop on Comput. Learning Theory},
year = 1993,
pages = {337--346},
publisher = {ACM Press, New York, NY}
}
@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{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}
}
@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}
}
@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}
}
@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}
}
@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 = {Proc. 12th Annu. Conf. on Comput. Learning Theory},
year = 1999,
pages = {203--208},
publisher = {ACM Press, New York, NY}
}
@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 = {Proceedings of Twenty-Third ACM Symposium on Theory
ofComputing},
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 = {Advances in Neural Information Processing Systems I},
publisher = {Morgan Kaufmann},
year = 1989,
editor = {Daid S. Touretzky},
pages = {494--501},
tag = {TOC-display}
}
@INPROCEEDINGS{BlumRu92,
author = {Blum, A. and S. Rudich},
title = {Fast Learning of $k$-term {DNF} Formulas with
Queries},
booktitle = {Proceedings of Twenty-Fourth ACM Symposium on Theory
ofComputing},
year = 1992,
pages = {382--389},
publisher = {ACM}
}
@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{BlumSi90,
author = {Blum, A. and M. Singh},
title = {Learning Functions of $k$ Terms},
booktitle = {Proceedings of COLT '90},
year = 1990,
pages = {144--153},
publisher = {Morgan Kaufmann},
tag = {TOC-display}
}
@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{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}
}
@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}
}
@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
}
@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 = {Proceedings of the 2007 Joint Conference of
EMNLP-CoNLL},
year = 2007,
pages = {171--180},
url = {http://www.aclweb.org/anthology/D/D07/D07-1018}
}
@INPROCEEDINGS{BollackerGh98,
author = {Kurt D. Bollacker and Joydeep Ghosh},
title = {A supra-classifier architecture for scalable
knowledge reuse},
booktitle = {Proc. 15th International Conf. on Machine Learning},
year = 1998,
pages = {64--72},
publisher = {Morgan Kaufmann, San Francisco, CA}
}
@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; }
}
@BOOK{Bollobas98,
title = {Modern Graph Theory},
publisher = {Springer-Verlag},
year = 1998,
author = {B. Bollobas}
}
@INPROCEEDINGS{Boneh95,
author = {Dan Boneh},
title = {Learning using group representations},
booktitle = {Proc. 8th Annu. Conf. on Comput. Learning Theory},
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 = {Proc. 6th Annu. Conf. on Comput. Learning Theory},
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 = {Proc. 15th International Conf. on Machine Learning},
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 = {Proc. 16th International Conf. on Machine Learning},
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}
}
@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}
}
@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 = {Algorithmic Learning Theory: ALT '97},
year = 1997,
volume = 1316,
series = {Lecture Notes in Artificial Intelligence},
pages = {161--175},
publisher = {Springer-Verlag}
}
@INPROCEEDINGS{BosMa05,
author = {Johan Bos and Katja Markert},
title = {When logical inference helps determining textual
entailment (and when it doesn't)},
booktitle = {Proceedings of the Second 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 = {Proc. 16th International Conf. on Machine Learning},
year = 1999,
pages = {39--48},
publisher = {Morgan Kaufmann, San Francisco, CA}
}
@INPROCEEDINGS{BoserGuVa92,
author = {B. E. Boser and I. M. Guyon and V. N. Vapnik},
title = {A training algorithm for optimal margin classifiers},
booktitle = {Proc. 5th Annu. Workshop on Comput. Learning Theory},
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 = {Proc. 13th International Conference on Machine
Learning},
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 = ICML,
year = 1997,
pages = {46-56},
}
@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}
}
@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 = {Proc. 1st Annu. Workshop on Comput. Learning Theory},
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 = {Proc. 13th International Conference on Machine
Learning},
year = 1996,
pages = {54--62},
publisher = {Morgan Kaufmann}
}
@INPROCEEDINGS{Boyan99,
author = {Justin A. Boyan},
title = {Least-squares temporal difference learning},
booktitle = {Proc. 16th International Conf. on Machine Learning},
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 = {Proc. 13th International Conference on Machine
Learning},
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 = {Proceedings of the 2007 Joint Conference of
EMNLP-CoNLL},
year = 2007,
pages = {1024--1033},
url = {http://www.aclweb.org/anthology/D/D07/D07-1109}
}
@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{Brachman85,
author = {Brachman, R.},
title = {I lied about the trees},
journal = {The AI Magazine},
year = 1985,
volume = 6
}
@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
}
@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 84 Proceedings},
year = 1984,
pages = {34--37}
}
@BOOK{BrachmanLe85,
title = {Readings in Knowledge Representation},
publisher = {Morgan Kaufmann},
year = 1985,
editor = {Brachman, R. and H. Levesque}
}
@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
}
@INPROCEEDINGS{BradleyFa98,
author = {Paul S. Bradley and Usama M. Fayyad},
title = {Refining initial points for {K}-{M}eans clustering},
booktitle = {Proc. 15th International Conf. on Machine Learning},
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 = {Proc. 15th International Conf. on Machine Learning},
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{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 = {Euro. Conf. Comp. Vision (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 = {Proceedings of the 2007 Joint Conference of
EMNLP-CoNLL},
year = 2007,
pages = {906--914},
url = {http://www.aclweb.org/anthology/D/D07/D07-1095}
}
@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 = {Proc. 2nd Int. Workshop on Algorithmic Learning
Theory},
year = 1992,
pages = {5--34},
publisher = {IOS Press}
}
@INPROCEEDINGS{Brazma93,
author = {A. Br{\=a}zma},
title = {Efficient identification of regular expressions from
representative examples},
booktitle = {Proc. 6th Annu. Conf. on Comput. Learning Theory},
year = 1993,
pages = {236--242},
publisher = {ACM Press, New York, NY}
}
@INPROCEEDINGS{Brazma94,
author = {A. Br{\= a}zma},
title = {Efficient algorithm for learning simple regular
expressions from noisy examples},
booktitle = {Proc. 5th Int. Workshop on Algorithmic Learning
Theory},
year = 1994,
pages = {260--271},
publisher = {Springer-Verlag}
}
@INPROCEEDINGS{Brazma95,
author = {Alvis Br{\=a}zma},
title = {Learning of regular expressions by pattern matching},
booktitle = {Computational Learning Theory: EuroColt '95},
year = 1995,
pages = {392--403},
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{BrazmaCe94,
author = {A. Br{\= a}zma and {\v C}er{\= a}ns},
title = {Efficient learning of regular expressions from good
examples},
booktitle = {Proc. 5th Int. Workshop on Algorithmic Learning
Theory},
year = 1994,
pages = {76--90},
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}
}
@ARTICLE{Breese91,
author = {John S. Breese},
title = {Construction of belief and decision networks},
journal = {Computational Intelligence},
year = 1991,
volume = 8,
pages = {624-647}
}
@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}
}
@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}
}
@INPROCEEDINGS{Bremler-BarrAfHa99,
author = {A. {Bremler-Barr} and Y. Afek and S. {Har-Peled}},
title = {Routing with a Clue},
booktitle = {Ann. Conf. on Data Comm. (SIGCOMM)},
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
}
@INPROCEEDINGS{Brent91,
author = {Michael R. Brent},
title = {Automatic acquisition of subcategorization frames
from untagged text},
booktitle = ACL,
year = 1991
}
@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}
}
@book(Bresnan82,
author = "J. Bresnan",
year = 1982,
title = "The mental representation of grammatical relations",
publisher = "MIT Press",
address = "Cambridge MA"
)
@UNPUBLISHED{Brieden02,
author = {A.~Brieden},
title = {On geometric optimization problems likely not
contained in APX},
note = {to appear},
year = 2002
}
@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; }
}
@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",
month = "June",
year = 1990
)
@INPROCEEDINGS{Brill92,
author = {Eric Brill},
title = {A simple rule-based part of speech tagger},
booktitle = DARPA,
year = 1992
}
@INPROCEEDINGS{Brill93,
author = {Eric Brill},
title = {Automatic grammar induction and parsing free text: A
transformation-based approach},
booktitle = ACL,
year = 1993
}
@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
}
@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
}
@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,
pages = "25--60",
volume = 19,
number = 1,
year = 1993
)
@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{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 = {Compress. Complex. Sequences (SEQUENCES'97)},
year = 1997,
pages = {21--29}
}
@INPROCEEDINGS{BrodieDe99,
author = {Mark Brodie and Gerald DeJong},
title = {Learning to ride a bicycle using iterated phantom
induction},
booktitle = {Proc. 16th International Conf. on Machine Learning},
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 = {Proc. 12th International Conference on Machine
Learning},
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}
}
@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}
}
@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 = {Proc. 4th Annu. Workshop on Comput. Learning Theory},
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}
}
@book(Brown73,
author = "R. Brown",
title = "A First Language",
publisher = "Harvard University Press",
address = "Cambridge, MA",
year = 1973
)
@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
)
@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,
volume = 16,
number = 2,
pages = "79--85",
year = 1990
)
@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,
pages = "264--270",
year = 1991
)
@inproceedings(Brown91b,
author = "P. Brown and J. Lai and R. Mercer",
title = "Aligning sentences in parallel corpora",
booktitle = ACL,
year = 1991
)
@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,
volume = 18,
number = 4,
pages = "467--479",
year = 1992
)
@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,
pages = "83--100",
year = 1992
)
@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,
volume = 19,
number = 2,
pages = "263--311",
year = 1993
)
@inproceedings(Brown93b,
author = "Peter Brown and Stephen Della Pietra and Vincent
Della Pietra and Robert Mercer",
title = "But dictionaries are data too",
booktitle = ARPA,
pages = "202--205",
year = 1993
)
@INPROCEEDINGS{BrownLaMe91,
author = {P. Brown and J. Lai and R. Mercer},
title = {Aligning sentences in parallel corpora},
booktitle = ACL,
year = 1991
}
@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},
volume = 18,
number = 4,
year = 1992,
pages = {467--479}
}
@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,
number = 4,
pages = {467-479}
}
@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 = "Proceedings of ACL-1991",
YEAR = 1991,
}
@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 = {31st Annual Symposium on Foundations of Computer
Science},
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 = {Proc. 12th International Conference on Machine
Learning},
year = 1995,
pages = {81--89},
publisher = {Morgan Kaufmann}
}
@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{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;}
}
@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 = {Proc. 8th Annu. Conf. on Comput. Learning Theory},
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 = {Proc. 8th Annu. Conf. on Comput. Learning Theory},
year = 1995,
pages = {447--453},
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}
}
@INPROCEEDINGS{BshoutyBs94,
author = {D. Bshouty and N. H. Bshouty},
title = {On learning arithmetic read-once formulas with
exponentiation},
booktitle = {Proc. 7th Annu. ACM Conf. on Comput. Learning
Theory},
year = 1994,
pages = {311--317},
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 = {Proc. of the 35rd Annual Symposium on Foundations of
Computer Science},
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 = {Proc. of the 33rd Symposium on the Foundations of
Comp. Sci.},
year = 1992,
pages = {513--522},
publisher = {IEEE Computer Society Press, Los Alamitos, CA}
}
@INPROCEEDINGS{BshoutyEiKu99,
author = {Nader H. Bshouty and Nadav Eiron and Eyal
Kushilevitz},
title = {{PAC} Learning with Nasty Noise},
booktitle = {Proc. 10th International Conference on Algorithmic
Learning Theory - ALT '99},
year = 1999,
volume = 1720,
series = {Lecture Notes in Artificial Intelligence},
pages = {206--218},
publisher = {Springer-Verlag}
}
@INPROCEEDINGS{BshoutyGoMa95,
author = {Nader H. Bshouty and Sally A. Goldman and David
H. Mathias},
title = {Noise-tolerant parallel learning of geometric
concepts},
booktitle = {Proc. 8th Annu. Conf. on Comput. Learning Theory},
year = 1995,
pages = {345--352},
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 = {Proc. 24th Annu. ACM Sympos. Theory Comput.},
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 = {Proc. 5th Annu. Workshop on Comput. Learning Theory},
year = 1992,
pages = {1--15},
publisher = {ACM Press, New York, NY}
}
@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{BshoutyHe96,
author = {Nader H. Bshouty and Lisa Hellerstein},
title = {Attribute-efficient learning in query and
mistake-bound models},
booktitle = {Proc. 9th Annu. Conf. on Comput. Learning Theory},
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 = {Proc. 12th Annu. Conf. on Comput. Learning Theory},
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 = {Proc. 12th Annu. Conf. on Comput. Learning Theory},
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 = {Proc. of the 36th Annual Symposium on Foundations of
Computer Science},
year = 1995,
pages = {304--311},
publisher = {IEEE Computer Society Press, Los Alamitos, CA}
}
@INPROCEEDINGS{BshoutyTa95,
author = {Nader Bshouty and Christino Tamon},
title = {On the {F}ourier spectrum of monotone functions},
booktitle = {Proc. 27th Annual ACM Symposium on Theory of
Computing},
year = 1995,
pages = {219--228},
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 = {Proc. 8th Annu. Conf. on Comput. Learning Theory},
year = 1995,
pages = {190--197},
publisher = {ACM Press, New York, NY}
}
@INPROCEEDINGS{BshoutyTaWi96,
author = {Nader H. Bshouty and Christino Tamon and David
K. Wilson},
title = {On learning width two branching programs},
booktitle = {Proc. 9th Annu. Conf. on Comput. Learning Theory},
year = 1996,
pages = {224--227},
publisher = {ACM Press, New York, NY}
}
@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{BshoutyWi99,
author = {Nader H. Bshouty and David K. Wilson},
title = {On learning in the presence of unspecified attribute
values},
booktitle = {Proc. 12th Annu. Conf. on Comput. Learning Theory},
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'99, the Joint SIGDAT Conference on
Empirical Methods in Natural Language Processing and
Very Large Corpora},
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 = {Proc. 17th Annu. Internat. ACM-SIGIR conference on
Research and Development in Information Retrieval},
year = 1994,
pages = {292--301},
publisher = {Springer-Verlag}
}
@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",
address = "Pittsburgh PA",
month = "June",
year = 2001,
pages = "29--34",
}
@inproceedings{BudanitskyHirst01,
author = "A. Budanitsky and G. Hirst",
title = "Semantic Distance in WordNet: An Experimenal,
Application-oriented Evaluation of Five Measures",
booktitle = "Proceedings of the NAACL 2001 Workshop on WordNet
and Other Lexical Resources",
year = 2001,
}
@ARTICLE{BudanitskyHirst06,
AUTHOR = "A. Budanitsky and G. Hirst",
TITLE = "Evaluating Wordnet-based Measures of Lexical
Semantic Relatedness",
JOURNAL = "Computational Linguistics",
YEAR = 2006,
volume = 32,
number = 1,
pages = "13-47",
}
@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 = {Proc. 4th Annu. Workshop on Comput. Learning Theory},
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 = {Proc. 5th Annu. Workshop on Comput. Learning Theory},
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 = {Proc. 4th Annu. Workshop on Comput. Learning Theory},
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{BuningLe96,
author = {Hans Kleine B{\"u}ning and Theodor Lettmann},
title = {Learning a representation for optimizable formulas},
booktitle = {Algorithmic Learning Theory: ALT '96},
year = 1996,
volume = 1160,
series = {Lecture Notes in Artificial Intelligence},
pages = {51--58},
publisher = {Springer-Verlag}
}
@INPROCEEDINGS{Buntine89,
author = {W. Buntine},
title = {A Critique of the {V}aliant Model},
booktitle = {Proc. of the 11th International Joint Conference on
Artificial Intelligence},
year = 1989,
pages = {837--842}
}
@PHDTHESIS{Buntine90,
author = {W. L. Buntine},
title = {A Theory of Learning Classification Rules},
school = {University of Technology, Sydney},
year = 1990
}
@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}
}
@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}
}
@INPROCEEDINGS{Burago94,
author = {A. Burago},
title = {Learning structurally reversible context-free
grammars from queries and counterexamples in
polynomial time},
booktitle = {Proc. 7th Annu. ACM Conf. on Comput. Learning
Theory},
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},
year = 2005,
booktitle = {Proceedings of RTE 2005}
}
@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{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}
}
@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}
}
@INPROCEEDINGS{Burges96,
author = {Chris J. C. Burges},
title = {Simplified support vector decision rules},
booktitle = {Proc. 13th International Conference on Machine
Learning},
year = 1996,
pages = {71--77},
publisher = {Morgan Kaufmann}
}
@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{Bylander93,
author = {T. Bylander},
title = {Polynomial learnability of linear threshold
approximations},
booktitle = {Proc. 6th Annu. Conf. on Comput. Learning Theory},
year = 1993,
pages = {297--302},
publisher = {ACM Press, New York, NY}
}
@INPROCEEDINGS{Bylander94,
author = {T. Bylander},
title = {Learning linear threshold functions in the presence
of classification noise},
booktitle = {Proc. 7th Annu. ACM Conf. on Comput. Learning
Theory},
year = 1994,
pages = {340--347},
publisher = {ACM Press, New York, NY}
}
@INPROCEEDINGS{Bylander97,
author = {Tom Bylander},
title = {The Binary Exponentiated Gradient Algorithm for
Learning Linear Functions},
booktitle = {Proc. 10th Annu. Conf. on Comput. Learning Theory},
year = 1997,
pages = {184--192},
publisher = {ACM Press, New York, NY}
}
@INPROCEEDINGS{Bylander97a,
author = {Tom Bylander},
title = {Learning Probabilistically Consistent Linear
Threshold Functions},
booktitle = {Proc. 10th Annu. Conf. on Comput. Learning Theory},
year = 1997,
pages = {62--71},
publisher = {ACM Press, New York, NY}
}
@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 = {Proceedings of ANLP-NAACL Workshop on Reading
Comprehension Tests as Evaluation for Computer-Based
Lanugage Understanding Systems},
year = 2000,
pages = {1--5},
address = {Seattle, WA}
}
@article(CBCFFSW95,
author = "M. C. Caselli and E. Bates and P. Casadio and
J. Fenson and L. Fenson and L. Sanderl and J. Weir",
year = 1995,
title = "A cross-linguistic study of early lexical
development",
journal = "Cognitive Development",
volume = 10,
pages = "159-199"
)
@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 = {Computational Learning Theory: Eurocolt '93},
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}
}
@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
}
@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{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 = {Proc. 5th Annu. Workshop on Comput. Learning Theory},
year = 1992,
pages = {180--192},
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 = {Proc. of the Pacific Asia Conference on Formal and
Computational Linguistics},
year = 1993
}
@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 = {Proc. 10th International Conference on Algorithmic
Learning Theory - ALT '99},
year = 1999,
volume = 1720,
series = {Lecture Notes in Artificial Intelligence},
pages = {219--230},
publisher = {Springer-Verlag}
}
@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{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{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{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{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{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{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}
}
@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 = {Computational Learning Theory: EuroColt '97},
year = 1997,
pages = {119--133},
publisher = {Springer-Verlag}
}
@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
}
@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}
}
@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{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 = {Proc. 31st Annu. ACM Symposium on Theory of Comput.},
year = 1999,
pages = {1--10},
publisher = {ACM Press, New York, NY}
}
@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{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{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}
}
@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{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}
}
@INPROCEEDINGS{CKSS97,
author = {John Case and Efim B. Kinber and Arun Sharma and
Frank Stephan},
title = {On the Classification of Computable Languages},
booktitle = {Proc.~14th Annual Symposium on Theoretical Aspects
of Computer Science: STACS'97},
year = 1997,
volume = 1200,
series = {Lecture Notes in Computer Science},
pages = {225--236},
publisher = {Springer-Verlag}
}
@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{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
}
@misc{ CMLOTYT00,
author = "N. Collier and H. Mima and S. Lee and T. Ohta and
Y. Tateisi and A. Yakushiji and J. Tsujii",
booktitle = "The GENIA Project: Knowledge Acquisition from
Biology Texts",
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,
url = "citeseer.ist.psu.edu/collier00genia.html"
}
@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 = {Proc. 16th International Conf. on Machine Learning},
year = 1999,
pages = {77--86},
publisher = {Morgan Kaufmann, San Francisco, CA}
}
@INPROCEEDINGS{CMTV00,
author = {A. Corral and Y. Manolopoulos and Y. Theodoridis and
M. Vassilakopoulos},
title = {Closest Pair Queries in Spatial Databases},
booktitle = {ACM SIGMOD Int.\ Conf.\ on Manag.\ of Data},
year = 2000,
pages = {189--200}
}
@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 = {Proc. 9th International Conference on Algorithmic
Learning Theory - ALT '98},
year = 1998,
volume = 1501,
series = {Lecture Notes in Artificial Intelligence},
pages = {31--45},
publisher = {Springer-Verlag}
}
@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{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}
}
@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{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}
}
@INPROCEEDINGS{CaiLeTe07,
author = {Cai, Junfu and Lee, Wee Sun and Teh, Yee Whye},
title = {Improving Word Sense Disambiguation Using Topic
Features},
booktitle = {Proceedings of the 2007 Joint Conference of
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{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{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{Cameron97,
author = {S. Cameron},
title = {Enhancing gjk: Computing minimum and penetration
distance between convex polyhedra},
booktitle = {Proc. Int. Conf. Robot. Auto.},
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 = {Proceedings of the 2007 Joint Conference of
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 = {Proceedings of the CoNLL Shared Task Session of
EMNLP-CoNLL 2007},
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{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{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{CarbonaraSl96,
author = {Leonardo Carbonara and Derek Sleeman},
title = {Improving the efficiency of knowledge base
refinement},
booktitle = {Proc. 13th International Conference on Machine
Learning},
year = 1996,
pages = {78--86},
publisher = {Morgan Kaufmann}
}
@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(Carbonell88,
author = "Carbonell, J. G. and Brown, R. D.",
title = "Anaphora resolution: A multi strategy approach",
booktitle = Coling,
year = 1988
)
@BOOK{Carbonell90,
title = {Machine Learning: Paradigms and Methods},
publisher = {MIT Press},
year = 1990,
editor = {Jaime Carbonell}
}
@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}
}
@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 = {Proc. of the Fourth International Workshop on
Machine Learning},
year = 1987,
pages = {256--266},
month = jun,
publisher = {Morgan Kaufmann}
}
@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}
}
@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}
}
@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}
}
@INPROCEEDINGS{CardieHo97,
author = {Claire Cardie and Nicholas Howe},
title = {Improving minority class prediction using
case-specific feature weights},
booktitle = {Proc. 14th International Conference on Machine
Learning},
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 = {Proc. 16th International Conf. on Machine Learning},
year = 1999,
pages = {87--96},
publisher = {Morgan Kaufmann, San Francisco, CA}
}
@incollection{CardieMo99,
editor = {C. Cardie and R. Mooney},
journal = {Machine Learning},
volume = 34,
year = 1999,
booktitle = {Special Issue on Machine Learning and Natural
Language.},
}
@INPROCEEDINGS{CardiePi98,
author = {Cardie, C. and D. Pierce},
title = {Error-Driven Pruning of {T}reebanks grammars for
Base Noun Phrase Identification},
booktitle = {Proceedings of ACL-98},
year = 1998,
pages = {218--224}
}
@inCollection(Carlson98,
author = "G. Carlson",
year = 1998,
title = "Thematic roles and the individuation of events",
editor = "S. D. Rothstein",
booktitle = "Events and Grammar",
pages = "35-51",
address = "Dordrecht",
publisher = "Kluwer"
)
@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 = {Proceedings of the 2007 Joint Conference of
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 = {Proc. 2nd International Colloquium on Grammatical
Inference - ICGI '94},
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 = {Proc. 4th International Colloquium on Grammatical
Inference - ICGI '98},
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 = {Proceedings of the CoNLL Shared Task Session of
EMNLP-CoNLL 2007},
year = 2007,
pages = {957--961},
url = {http://www.aclweb.org/anthology/D/D07/D07-1101}
}
@INPROCEEDINGS{CarrerasM04,
author = {X. Carreras and L. M\`{a}rquez},
title = {Introduction to the {CoNLL}-2004 Shared Tasks:
Semantic Role Labeling},
booktitle = {Proceedings of CoNLL-2004},
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 = {Proceedings of The 2003 Conference on Advances in
Neural Information Processing Systems (NIPS-2003)},
year = 2004,
publisher = {MIT Press}
}
@INPROCEEDINGS{CarrerasM05,
author = {X. Carreras and L. M\`{a}rquez},
title = {Introduction to the {CoNLL}-2005 Shared Task:
Semantic Role Labeling},
booktitle = {Proceedings of the Ninth Conference on Computational
Natural Language Learning (CoNLL-2005)},
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{Caruana96,
author = {Rich Caruana},
title = {Algorithms and applications for multitask learning},
booktitle = {Proc. 13th International Conference on Machine
Learning},
year = 1996,
pages = {87--95},
publisher = {Morgan Kaufmann}
}
@ARTICLE{Caruana97,
author = {Rich Caruana},
title = {Multitask learning},
journal = {Machine Learning},
year = 1997,
volume = 28,
pages = {41--75},
publisher = {Kluwer Academic Publishers, Boston}
}
@INPROCEEDINGS{CaruanaFr94,
author = {Rich Caruana and Dayne Freitag},
title = {Greedy attribute selection},
booktitle = {Proc. 11th International Conference on Machine
Learning},
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{Case74,
author = {J. Case},
title = {Periodicity in generations of automata},
journal = {Math. Syst. Theory},
year = 1974,
volume = 8,
pages = {15--32}
}
@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}
}
@INCOLLECTION{Case86,
author = {J. Case},
title = {Learning Machines},
booktitle = {Language Learning and Concept Acquisition},
publisher = {Ablex Publishing Company},
year = 1986
}
@INPROCEEDINGS{Case88,
author = {J. Case},
title = {The power of vacillation},
booktitle = {Proc. 1st Annu. Workshop on Comput. Learning Theory},
year = 1988,
pages = {196--205},
address = {San Mateo, CA},
publisher = {Morgan Kaufmann}
}
@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}
}
@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
}
@UNPUBLISHED{CaseCh86,
author = {J. Case and H. Chi},
title = {Machine Learning of Nearly Minimal Size Grammars},
note = {Unpublished Manuscript},
year = 1986
}
@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 = {Proc.~16th Annual Symposium on Theoretical Aspects
of Computer Science - STACS '99},
year = 1999,
volume = 1563,
series = {Lecture Notes in Computer Science},
pages = {424--433},
publisher = {Springer-Verlag}
}
@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 = {Proc. 9th International Conference on Algorithmic
Learning Theory - ALT '98},
year = 1998,
volume = 1501,
series = {Lecture Notes in Artificial Intelligence},
pages = {205--219},
publisher = {Springer-Verlag}
}
@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}
}
@INPROCEEDINGS{CaseJaSh90,
author = {J. Case and S. Jain and A. Sharma},
title = {Anomalous Learning Helps Succinctness},
booktitle = {Proc. of the First Workshop on Algorithmic Learning
Theory, Tokyo, Japan},
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{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}
}
@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{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 = {Proc. 6th Int. Workshop on Algorithmic Learning
Theory},
year = 1995,
pages = {153--168},
publisher = {Springer-Verlag}
}
@INPROCEEDINGS{CaseJaSh97,
author = {John Case and Sanjay Jain and Arun Sharma},
title = {Synthesizing noise-tolerant language learners},
booktitle = {Algorithmic Learning Theory: ALT '97},
year = 1997,
volume = 1316,
series = {Lecture Notes in Artificial Intelligence},
pages = {228--243},
publisher = {Springer-Verlag}
}
@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 = {Computational Learning Theory: EuroColt '97},
year = 1997,
pages = {286--300},
publisher = {Springer-Verlag}
}
@INPROCEEDINGS{CaseLy82,
author = {J. Case and C. Lynes},
title = {Inductive inference and language identification},
booktitle = {Proc. ICALP 82},
year = 1982,
pages = {107--115},
publisher = {Springer Verlag}
}
@INPROCEEDINGS{CaseLy82a,
author = {J. Case and C. Lynes},
title = {Machine Inductive Inference and Language
Identification},
booktitle = {Proc. of the 9th International Colloquium on
Automata, Languages and Programming},
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 = {Proc. of the Fourth Workshop on Algorithmic Learning
Theory, Tokyo, Japan},
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
}
@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{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{Castellanos98,
author = {Antonio Castellanos},
title = {Approximate learning of random subsequential
transducers},
booktitle = {Proc. 4th International Colloquium on Grammatical
Inference - ICGI '98},
year = 1998,
volume = 1433,
series = {Lecture Notes in Artificial Intelligence},
pages = {67--78},
publisher = {Springer-Verlag}
}
@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 = {Proc. 6th Int. 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 = {Computational Learning Theory: EuroColt '97},
year = 1997,
pages = {162--170},
publisher = {Springer-Verlag}
}
@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}
}
@INPROCEEDINGS{CenzerMo95,
author = {Douglas A. Cenzer and William R. Moser},
title = {Inductive inference of functions on the rationals},
booktitle = {Proc. 8th Annu. Conf. on Comput. Learning Theory},
year = 1995,
pages = {178--181},
publisher = {ACM Press, New York, NY}
}
@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{Cesa-Bianchi90,
author = {N. Cesa-Bianchi},
title = {Learning the Distribution in the Extended {PAC}
Model},
booktitle = {Proc. of the First International Workshop on
Algorithmic Learning Theory},
year = 1990,
pages = {236--246},
organization = {Japanese Society for Artificial Intelligence}
}
@INPROCEEDINGS{Cesa-Bianchi97,
author = {Nicol{\`o} Cesa-Bianchi},
title = {Analysis of two gradient-based algorithms for
on-line regression},
booktitle = {Proc. 10th Annu. Conf. on Comput. Learning Theory},
year = 1997,
pages = {163--170},
publisher = {ACM Press, New York, NY}
}
@INPROCEEDINGS{Cesa-BianchiFi98,
author = {Nicol{\`o} Cesa-Bianchi and Paul Fischer},
title = {Finite-time regret bounds for the multiarmed bandit
problem},
booktitle = {Proc. 15th International Conf. on Machine Learning},
year = 1998,
pages = {100--108},
publisher = {Morgan Kaufmann, San Francisco, CA}
}
@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 = {Proc. 6th Annu. Conf. on Comput. Learning Theory},
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-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 = {Proc. 11th Annu. Conf. on Comput. Learning Theory},
year = 1998,
pages = {1--11},
publisher = {ACM Press, New York, NY}
}
@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 = {Proc. 12th Annu. Conf. on Comput. Learning Theory},
year = 1999,
pages = {12--18},
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{Chan00,
author = {T.M.~Chan},
title = {Approximating the Diameter, width, smallest
enclosing cylinder and minimum-width annulus},
booktitle = SOCG,
year = 2000,
pages = {300--309}
}
@INPROCEEDINGS{Chan00b,
author = {T. M. Chan},
title = {On levels in arrangements of curves},
booktitle = FOCS,
year = 2000,
pages = {??},
nickname = {FOCS 2000}
}
@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}
}
@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{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; }
}
@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}
}
@ARTICLE{Chan98,
author = {T. M. Chan},
title = {Approximate nearest neighbor queries revisited},
journal = DCG,
year = 1998,
volume = 20,
pages = {359--373}
}
@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
}
@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}
}
@INPROCEEDINGS{ChanSt95,
author = {Philip K. Chan and Salvatore J. Stolfo},
title = {A comparative evaluation of voting and meta-learning
on partitioned data},
booktitle = {Proc. 12th International Conference on Machine
Learning},
year = 1995,
pages = {90--98},
publisher = {Morgan Kaufmann}
}
@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{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; }
}
@INPROCEEDINGS{ChangGa93,
author = {Richard Chang and William I. Gasarch},
title = {On bounded queries and approximation},
booktitle = {Proc. of the 34rd Annual Symposium on Foundations of
Computer Science},
year = 1993,
pages = {547--556},
publisher = {IEEE Computer Society Press, Los Alamitos, CA}
}
@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{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}
}
@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",
year = 1978,
title = "Comprehension strategies in two- and
three-year-olds: Animate agents or probable events?",
journal = "Journal of Speech and Hearing Research",
volume = 21,
pages = "746-761"
)
@article{Charnes53,
author = {Charnes, A.},
copyright = {Copyright 1953 National Academy of Sciences},
journal = {Proceedings of the National Academy of Sciences of
the United States of America},
keywords = {Mathematics},
month = {July},
number = 7,
pages = {639--641},
publisher = {National Academy of Sciences},
title = {Constrained Games and Linear Programming},
volume = 39,
year = 1953,
}
@INPROCEEDINGS{Charniak00,
author = {E. Charniak},
title = {A Maximum-Entropy-Inspired Parser},
booktitle = {Proceedings of NAACL 2000},
year = 2000
}
@INPROCEEDINGS{Charniak01,
author = {E. Charniak},
title = {Immediate-Head Parsing for Language Models},
booktitle = {Proceedings of the 39th Annual Meeting of the
Association of Computational Linguistics (ACL-2001)},
year = 2001,
pages = {116--123},
address = {Toulouse, France}
}
@BOOK{Charniak93,
title = {Statistical Language Learning},
publisher = {MIT Press},
year = 1993,
author = {Charniak, E.}
}
@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
}
@INPROCEEDINGS{CharniakGo88,
author = {Charniak, E. and R. P. Goldman},
title = {A Logic for semantic interpretation},
booktitle = {Proceedings of ACL-88},
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,
address = {Ann Arbor, Michigan},
publisher = {ACL},
pages = {173--180},
}
@INPROCEEDINGS{ChaviraDaYa04,
author = {Chavira, M. and Darwiche, A. and Yaeger, M.},
title = {Compiling Relational {Bayesian} Networks for Exact
Inference},
booktitle = {Proceedings of the Second 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{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{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; }
}
@INPROCEEDINGS{Chazelle91,
author = {B. Chazelle},
title = {An optimal convex hull algorithm and new results on
cuttings},
booktitle = FOCS,
year = 1991,
pages = {29--38}
}
@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; }
}
@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{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{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{Cheeseman83,
author = {Cheeseman, Peter C.},
title = {A Method of Computing Generalized Bayesian
Probability Values for Expert Systems},
booktitle = {Proceedings Eighth International Conference on
Artificial Intelligence (Karlruhe, West Germany)},
year = 1983,
pages = {198--202},
month = Aug,
comment = {Describes iterative graph-oriented method for
computing a maximum-entropy distribution subject to
constraints.}
}
@INPROCEEDINGS{Cheeseman84,
author = {P. C. Cheeseman},
title = {Learning of Expert Systems from Data},
booktitle = {Proc. of the 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{Cheeseman85,
author = {Cheeseman, Peter C.},
title = {In Defense of Probability},
booktitle = {Proceedings of the Ninth International Joint
Conference on Artificial Intelligence},
year = 1985,
pages = {1002--1009},
comment = {Argues in favor of subjective Bayesianism by
refuting some common misconceptions.}
}
@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{CheesemanSeKeTaFrSt88,
author = {Cheeseman, Peter C. and Matthew Self andJim Kelly
and Will Taylor and Don Freeman andJohn Stutz},
title = {Bayesian Classification},
booktitle = {AAAI 88 Proceedings},
year = 1988,
pages = {607--611}
}
@INPROCEEDINGS{ChelbaJe98,
author = {C. Chelba and F. Jelinek },
title = {Exploiting Syntactic Structure for Language
Modeling},
booktitle = {COLING-ACL'98},
year = 1998
}
@article{Chen75,
title = {Effects of biogenic amines and TRH on release of
prolactin and TSH in the rat},
author = {Chen, HJ},
journal = {Endocrinology},
volume = 96,
number = 1,
pages = {10--14},
year = 1975,
publisher = {Endocrine Soc}
}
@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}
}
@INPROCEEDINGS{Chen93,
author = {Stanley Chen},
title = {Aligning sentences in bilingual corpora using
lexical information},
booktitle = ACL,
year = 1993
}
@INPROCEEDINGS{Chen93a,
author = {Z. Chen},
title = {Learning unions of two rectangles in the plane with
equivalence queries},
booktitle = {Proc. 6th Annu. Conf. on Comput. Learning Theory},
year = 1993,
pages = {243--252},
publisher = {ACM Press, New York, NY}
}
@INPROCEEDINGS{Chen94,
author = {Z. Chen},
title = {A note on learning {DNF} formulas using equivalence
and incomplete membership queries},
booktitle = {Proc. 5th Int. Workshop on Algorithmic Learning
Theory},
year = 1994,
pages = {272--281},
publisher = {Springer-Verlag}
}
@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
}
@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 = "Proceedings of the Thirty-Fourth Annual Meeting of
the Association for Computational Linguistics",
publisher = "Morgan Kaufmann Publishers",
address = "San Francisco",
editor = "Arivind Joshi and Martha Palmer",
pages = "310--318",
year = 1996,
}
@INPROCEEDINGS{ChenHa90,
author = {J. Chen and Y. Han},
title = {Shortest paths on a polyhedron},
booktitle = SOCG,
year = 1990,
pages = {360--369},
annote = 60
}
@INPROCEEDINGS{ChenHa91,
author = {J. Chen and Y. Han},
title = {Storing shortest paths for a polyhedron},
booktitle = {Advances in Computing and Information --- ICCI '91
International Conference Proceedings},
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{ChenHo94,
author = {Z. Chen and S. Homer},
title = {On learning counting fuctions with queries},
booktitle = {Proc. 7th Annu. ACM Conf. on Comput. Learning
Theory},
year = 1994,
pages = {218--227},
publisher = {ACM Press, New York, NY}
}
@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{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{ChenLiZh07,
author = {Chen, Qing and Li, Mu and Zhou, Ming},
title = {Improving Query Spelling Correction Using Web Search
Results},
booktitle = {Proceedings of the 2007 Joint Conference of
EMNLP-CoNLL},
year = 2007,
pages = {181--189},
url = {http://www.aclweb.org/anthology/D/D07/D07-1019}
}
@INPROCEEDINGS{ChenMa07,
author = {Chen, Ying and Martin, James},
title = {Towards Robust Unsupervised Personal Name
Disambiguation},
booktitle = {Proceedings of the 2007 Joint Conference of
EMNLP-CoNLL},
year = 2007,
pages = {190--198},
url = {http://www.aclweb.org/anthology/D/D07/D07-1020}
}
@INPROCEEDINGS{ChenMa92,
author = {Z. Chen and W. Maass},
title = {On-line learning of rectangles},
booktitle = {Proc. 5th Annu. Workshop on Comput. Learning Theory},
year = 1992,
pages = {16--28},
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}
}
@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{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}
}
@INPROCEEDINGS{ChenRo99,
author = {S. F. Chen and R. Rosenfeld},
title = {Efficient Sampling and Feature Selection in Whole
Sentence Maximum Entropy Language Models},
booktitle = {ICASSP-99},
year = 1999,
address = {Phoenix, Arizona}
}
@INPROCEEDINGS{ChenSnBa07,
author = {Chen, Erdong and Snyder, Benjamin and Barzilay,
Regina},
title = {Incremental Text Structuring with Online
Hierarchical Ranking},
booktitle = {Proceedings of the 2007 Joint Conference of
EMNLP-CoNLL},
year = 2007,
pages = {83--91},
url = {http://www.aclweb.org/anthology/D/D07/D07-1009}
}
@INPROCEEDINGS{ChenZhIs07,
author = {Chen, Wenliang and Zhang, Yujie and Isahara,
Hitoshi},
title = {A Two-Stage Parser for Multilingual Dependency
Parsing},
booktitle = {Proceedings of the CoNLL Shared Task Session of
EMNLP-CoNLL 2007},
year = 2007,
pages = {1129--1133},
url = {http://www.aclweb.org/anthology/D/D07/D07-1122}
}
@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}
}
@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 = {Proc. 1st Annu. Workshop on Comput. Learning Theory},
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''}
}
@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 = {Proc. 10th International Conference on Algorithmic
Learning Theory - ALT '99},
year = 1999,
volume = 1720,
series = {Lecture Notes in Artificial Intelligence},
pages = {231--240},
publisher = {Springer-Verlag}
}
@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 = {Proceedings of the 2007 Joint Conference of
EMNLP-CoNLL},
year = 2007,
pages = {810--818},
url = {http://www.aclweb.org/anthology/D/D07/D07-1085}
}
@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,
author = "G. Chierchia and S. McConnell-Ginet",
year = 2001,
title = "Meaning and grammar: An introduction to semantics",
publisher = "MIT Press"
}
@INPROCEEDINGS{ChieuNg03,
author = {Chieu, Hai Leong and Ng, Hwee Tou},
title = {Named Entity Recognition with a Maximum Entropy
Approach},
booktitle = {Proceedings of CoNLL-2003},
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 = {Proceedings of the 2007 Joint Conference of
EMNLP-CoNLL},
year = 2007,
pages = {561--570},
url = {http://www.aclweb.org/anthology/D/D07/D07-1059}
}
@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,
pages = "299--304",
year = 1985
)
@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 = {Proc. 4th International Colloquium on Grammatical
Inference - ICGI '98},
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}
}
@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 = {Proceedings of COMPLEX, Conference on Computational
Lexicography and Text Research},
year = 1994,
pages = {23--32}
}
@INPROCEEDINGS{Chung94,
author = {T. H. Chung},
title = {Approximate methods for sequential decision making
using expert advice},
booktitle = {Proc. 7th Annu. ACM Conf. on Comput. Learning
Theory},
year = 1994,
pages = {183--189},
publisher = {ACM Press, New York, NY}
}
@INPROCEEDINGS{Church88,
author = {Church, Kenneth W.},
title = {A stochastic parts program and noun phrase parser
for unrestricted text},
booktitle = ANLP,
year = 1988
}
@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
)
@article(Church90,
author = "Church, Kenneth W. and Hanks, Patrick",
title = "Word association norms, mutual information, and
Lexicography",
journal = CL,
volume = 16,
number = 1,
pages = "22--29",
year = 1990
)
@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",
editor = "U. Zernik",
year = 1991,
publisher = "Lawrence Erlbaum Associates",
address = "Hillsdale, NJ"
)
@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
}
@article(Church93a,
author = "Kenneth W. Church and Robert L. Mercer",
title = "Introduction to the special issue in computational
linguistics using large corpora",
journal = CL,
volume = 19,
number = 1,
pages = "1--24",
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 = "Proc. of the 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 = "Proceedings of Third the Workshop on Very Large
Corpora",
pages = "121--130",
year = 1995
)
@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}
}
@INPROCEEDINGS{ChurchGa95,
author = {K. Church and W. Gale},
title = {Inverse document frequency (IDF): a measure of
deviations from {Poisson}},
booktitle = {Proceedings of Third the Workshop on Very Large
Corpora},
year = 1995,
pages = {121--130}
}
@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
}
@INPROCEEDINGS{ChurchHaGa07,
author = {Church, Kenneth and Hart, Ted and Gao, Jianfeng},
title = {Compressing Trigram Language Models With {Golomb}
Coding},
booktitle = {Proceedings of the 2007 Joint Conference of
EMNLP-CoNLL},
year = 2007,
pages = {199--207},
url = {http://www.aclweb.org/anthology/D/D07/D07-1021}
}
@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{Chzelle91,
author = {B. Chzelle},
title = {Triangulating a simple polygon in linear time},
journal = DCG,
year = 1991,
volume = 6,
pages = {485--524}
}
@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{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 = {Proc. 12th International Conference on Machine
Learning},
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{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}
}
@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 = {Proceedings of the ACL-PASCAL Workshop on Textual
Entailment and Paraphrasing},
month = {June},
year = 2007,
address = {Prague},
publisher = {Association for Computational Linguistics},
pages = {54--59},
url = {http://www.aclweb.org/anthology/W/W07/W07-1409}
}
@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
}
@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}
}
@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}
}
@InProceedings{ClarkeLa06,
author = {Clarke, James and Lapata, Mirella},
title = {Constraint-Based Sentence Compression: An Integer
Programming Approach},
booktitle = ACL,
month = {July},
year = 2006,
address = {Sydney, Australia},
publisher = {ACL},
pages = {144--151},
}
@INPROCEEDINGS{ClarkeLa07,
author = {Clarke, James and Lapata, Mirella},
title = {Modelling Compression with Discourse Constraints},
booktitle = {Proceedings of the 2007 Joint Conference of
EMNLP-CoNLL},
year = 2007,
pages = {1--11},
url = {http://www.aclweb.org/anthology/D/D07/D07-1001}
}
@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}
}
@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{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{Clarkson94,
author = {K. L. Clarkson},
title = {An Algorithm for Approximate Closest-Point Queries},
booktitle = SOCG,
year = 1994,
pages = {160--164}
}
@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}
}
@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",
volume = "38(1)",
pages = {43--56},
year = 1995
}
@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 = {Proc. 12th International Conference on Machine
Learning},
year = 1995,
pages = {108--114},
publisher = {Morgan Kaufmann}
}
@InProceedings{CoNLL00,
author = "Kim-Sang, E. F. T. and S. Buchholz",
title = "Introduction to the {CoNLL}-2000 Shared Task:
Chunking",
pages = "127--132",
booktitle = "Proceedings of CoNLL-2000 and LLL-2000",
year = 2000,
}
@INPROCEEDINGS{CoccaroJu98,
author = {Noah Coccaro and Daniel Jurafsky},
title = {Towards better integration os semantic predictors in
statistical language modeling},
booktitle = {ICSLP-98},
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; }
}
@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
}
@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{Cohen93,
author = {William Cohen},
title = {Cryptographic Limitations on Learning One-Clause
Logic Programs},
booktitle = {Proc. of the Tenth 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 = {Proc. of the Tenth National Conference on Artificial
Intelligence},
year = 1993,
address = {Washington, D.C.}
}
@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{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}
}
@INPROCEEDINGS{Cohen95,
author = {William W. Cohen},
title = {Fast effective rule induction},
booktitle = {Proc. 12th International Conference on Machine
Learning},
year = 1995,
pages = {115--123},
publisher = {Morgan Kaufmann}
}
@INPROCEEDINGS{Cohen95a,
author = {William W. Cohen},
title = {Text categorization and relational learning},
booktitle = {Proc. 12th International Conference on Machine
Learning},
year = 1995,
pages = {124--132},
publisher = {Morgan Kaufmann}
}
@ARTICLE{Cohen95b,
author = {Cohen, W.},
title = {{PAC}-learning recursive logic programs: Efficient
algorithms},
journal = JAIR,
year = 1995,
volume = 2,
pages = {501--539}
}
@INPROCEEDINGS{Cohen96,
author = {William W. Cohen},
title = {The dual {DFA} learning problem: hardness results
for programming by demonstration and learning
first-order representations},
booktitle = {Proc. 9th Annu. Conf. on Comput. Learning Theory},
year = 1996,
pages = {29--40},
publisher = {ACM Press, New York, NY}
}
@INPROCEEDINGS{Cohen97,
author = {Edith Cohen},
title = {Learning noisy perceptrons by a perceptron in
polynomial time},
booktitle = {Proc. 38th Annu. IEEE Symposium on Foundations of
Computer Science},
year = 1997,
pages = {514--523},
publisher = {IEEE Computer Society Press, Los Alamitos, 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{Cohen99,
author = {William W. Cohen},
title = {What can we learn from the web?},
booktitle = {Proc. 16th International Conf. on Machine Learning},
year = 1999,
pages = {515--521},
publisher = {Morgan Kaufmann, San Francisco, CA}
}
@INPROCEEDINGS{CohenDe97,
author = {William W. Cohen and Prem Devanbu},
title = {A comparative study of inductive logic programming
methods for software fault prediction},
booktitle = {Proc. 14th International Conference on Machine
Learning},
year = 1997,
pages = {66--74},
publisher = {Morgan Kaufmann}
}
@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}
}
@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{CohenHi92,
author = {W. W. Cohen and H. Hirsh},
title = {Learnability of description logics},
booktitle = {Proc. 5th Annu. Workshop on Comput. Learning Theory},
year = 1992,
pages = {116--127},
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: Proceedings of the Fourth International
Conference (KR94)},
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{CohenHi95,
author = {William W. Cohen and Haym Hirsh},
title = {Corrigendum for: {L}earnability of description
logics},
booktitle = {Proc. 8th Annu. Conf. on Comput. Learning Theory},
year = 1995,
pages = 463,
publisher = {ACM Press, New York, NY}
}
@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}
}
@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 = {Proc. of the 10th ACM SIGKDD International
Conference on Knowledge Discovery and Data Mining},
year = 2004
}
@INPROCEEDINGS{CohenSi96,
author = {W. W. Cohen and Y. Singer},
title = {Context-sensitive learning methods for text
categorization},
booktitle = {Proc. of the 19th Annual Int. ACM Conference on
Research and Development in Information Retrieval},
year = 1996,
page = {307--315}
}
@INPROCEEDINGS{CohenSm07,
author = {Cohen, Shay B. and Smith, Noah A.},
title = {Joint Morphological and Syntactic Disambiguation},
booktitle = {Proceedings of the 2007 Joint Conference of
EMNLP-CoNLL},
year = 2007,
pages = {208--217},
url = {http://www.aclweb.org/anthology/D/D07/D07-1022}
}
@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 = {Proceedings of the 2007 Joint Conference of
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}
}
@INPROCEEDINGS{Collins00,
author = {M. Collins},
title = {Discriminative Reranking for Natural Language
Parsing},
booktitle = {Proc. 17th International Conf. on Machine Learning},
year = 2000,
pages = {175--182},
publisher = {Morgan Kaufmann, San Francisco, CA}
}
@INPROCEEDINGS{Collins02,
author = {M. Collins},
title = {Discriminative Training Methods for Hidden {Markov}
Models: Theory and Experiments with Perceptron
Algorithms},
booktitle = SIGDAT,
year = 2002
}
@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{Collins96,
author = {M. Collins},
title = {A New Statistical Parser Based on Bigram Lexical
Dependencies},
booktitle = {Proceedings of the 34th Annual Meeting of the
Association for Computational Linguistics},
year = 1996,
pages = {184-191}
}
@INPROCEEDINGS{Collins97,
author = {M. Collins},
title = {Three Generative, Lexicalised Models for Statistical
Parsing},
booktitle = {Proceedings of the 35th Annual Meeting of the
Association for Computational Linguistics},
year = 1997
}
@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{CollinsBr95,
author = {M. Collins and J Brooks},
title = {Prepositional Phrase Attachment through a Backed-Off
Model},
booktitle = {Proceedings of 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 = {Proceedings of ACL 2002},
year = 2002
}
@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 = {Proc. 13th Annu. Conference on Comput. Learning
Theory},
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
}
@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}
}
@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.}
}
@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{CookHo02,
author = {J. Gonzalez and L.B. Holder and D.J. Cook},
title = {Graph-Based Relational Concept Learning},
booktitle = {Proceedings of the International Machine Learning
Conference},
year = 2002
}
@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}
}
@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{Cooper62,
author = {P. Cooper},
title = {The hypersphere in pattern recognition},
journal = {Information and Control},
year = 1962,
volume = 5,
pages = {324--346}
}
@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}
}
@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}
}
@article(Corrigan88,
author = "R. Corrigan",
year = 1988,
title = "Children's identification of actors and patients in
prototypical and nonprototypical sentence types",
journal = "Cognitive Development",
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{CosteNi98,
author = {F. Coste and J. Nicolas},
title = {How considering incompatible state mergins may
reduce the {DFA} induction search tree},
booktitle = {Proc. 4th International Colloquium on Grammatical
Inference - ICGI '98},
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}
}
@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
}
@INPROCEEDINGS{Cover65a,
author = {T. Cover},
title = {Behavior of sequential predictors of binary
sequences},
booktitle = {Proc. of the 4th 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}
}
@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{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
}
@ARTICLE{Cover91,
author = {T. M. Cover},
title = {Universal Portfolios},
journal = {Mathematical Finance},
year = 1991,
volume = 1,
pages = {1--29},
number = 1
}
@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.}
}
@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
}
@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}
}
@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 = {Proc. 13th Annu. Conference on Comput. Learning
Theory},
year = 2000,
pages = {35--46},
publisher = {Morgan Kaufmann, San Francisco}
}
@INPROCEEDINGS{CravenSh94,
author = {Mark W. Craven and Jude W. Shavlik},
title = {Using sampling and queries to extract rules from
trained neural networks},
booktitle = {Proc. 11th International Conference on Machine
Learning},
year = 1994,
pages = {37--45},
publisher = {Morgan Kaufmann}
}
@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}
}
@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}
}
@INPROCEEDINGS{CrawHu95,
author = {Susan Craw and Paul Hutton},
title = {Protein folding: symbolic refinement competes with
neural networks},
booktitle = {Proc. 12th International Conference on Machine
Learning},
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 71},
publisher = {North-Holland Publishing Co.},
year = 1972,
pages = {524--529}
}
@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}
}
@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
}
@BOOK{CristianiniSh00,
title = {An Introduction to Support Vector Machines},
publisher = {Cambridge Press},
year = 2000,
author = {N. Cristianini and J. Shawe-Taylor}
}
@article{CristianiniShLo02,
title = {Latent Semantic Kernels},
author = {Cristianini, N. and Shawe-Taylor, J. and Lodhi, H.},
journal = {Journal of Intelligent Information Systems},
volume = 18,
number = 2,
pages = {127--152},
year = 2002,
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 = {Proc. 15th International Conf. on Machine Learning},
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,
author = "A. Cruse",
title = "Meaning in Language: An Introduction to Semantics
and Pragmatics",
publisher = "Oxford University Press",
year = 2004
)
@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 = {Proc. 4th International Colloquium on Grammatical
Inference - ICGI '98},
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 = {Silviu Cucerzan},
title = {Large-Scale Named Entity Disambiguation Based on
{Wikipedia} Data},
booktitle = {Proceedings of EMNLP},
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 = {Proc. 4th Int. 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}
}
@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,
}
@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{Cussens95,
author = {James Cussens},
title = {A {B}ayesian analysis of algorithms for learning
finite functions},
booktitle = {Proc. 12th International Conference on Machine
Learning},
year = 1995,
pages = {142--149},
publisher = {Morgan Kaufmann}
}
@INPROCEEDINGS{Cussens97,
author = {Cussens, J.},
title = {Part-of-Speech Tagging Using Progol},
booktitle = {International Workshop on Inductive Logic
Programming},
year = 1997,
pages = {93--108},
address = {Prague, Czech Republic},
publisher = {Springer},
note = {LNAI 1297}
}
@INPROCEEDINGS{Cussens98,
author = {James Cussens},
title = {Using Prior Probabilities and Density Estimation for
Relational Classification},
booktitle = {Inductive Logic Programming: Proceedings of the 8th
International Conference (ILP-98)},
year = 1998,
editor = {David Page},
volume = {1446 of LNAI},
pages = {106-115},
publisher = {Springer-Verlag}
}
@INPROCEEDINGS{Cussens99,
author = {James Cussens},
title = {Loglinear models for first-order probabilistic
reasoning},
booktitle = {Proceedings of the 15th Annual Conference on
Uncertainty in {AI} ({UAI}'99)},
year = 1999,
editor = {Kathryn Blackmond Laskey and Henri Prade},
pages = {126--133},
publisher = {Morgan Kaufmann},
url = {citeseer.nj.nec.com/cussens99loglinear.html}
}
@inproceedings{Cutting-et-al93,
author = "C. Cutting and D. Karger and J. Pedersen",
year = 1993,
title = "Constant interaction-time Scatter/Gather browsing of
very large document collections",
booktitle = {Proceedings of ACM-SIGIR Conference on Information
Retrieval}
}
@INPROCEEDINGS{CuttingKaPe93,
author = {C. Cutting and D. Karger and J. Pedersen},
title = {Constant interaction-time Scatter/Gather browsing of
very large document collections},
booktitle = {Proceedings of ACM-SIGIR Conference on Information
Retrieval},
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{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}
}
@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
}
@BOOK{DARPA95,
title = {Proceedings of the 6th Message Understanding
Conference},
publisher = {Morgan Kaufman},
year = 1995,
author = {DARPA}
}
@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 = {Proceedings of the CoNLL Shared Task Session of
EMNLP-CoNLL 2007},
year = 2007,
pages = {1051--1055},
url = {http://www.aclweb.org/anthology/D/D07/D07-1112}
}
@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 = {Proc. 11th International Conference on Machine
Learning},
year = 1994,
pages = {53--61},
publisher = {Morgan Kaufmann}
}
@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{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 = {Proc. 6th Annu. Conf. on Comput. Learning Theory},
year = 1993,
pages = {303--309},
publisher = {ACM Press, New York, NY}
}
@inproceedings{DDMSV04,
author = {Nilesh Dalvi and Pedro Domingos and Mausam and Sumit
Sanghai and Deepak Verma},
title = {Adversarial classification},
booktitle = KDD,
year = 2004,
isbn = {1-58113-888-1},
pages = {99--108},
location = {Seattle, WA, USA},
doi = {http://doi.acm.org/10.1145/1014052.1014066},
publisher = {ACM},
address = {New York, NY, USA},
}
@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{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}
}
@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}
}
@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
}
@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 = {Proceedings of the 2007 Joint Conference of
EMNLP-CoNLL},
year = 2007,
pages = {755--763},
url = {http://www.aclweb.org/anthology/D/D07/D07-1079}
}
@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{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}
}
@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}
}
@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,
month = Apr,
volume = {PAMI-19},
number = 4,
pages = {1--13},
}
@INPROCEEDINGS{DPVW91,
author = {R. Daley and L. Pitt and M. Velauthapillia and
T. Will},
title = {Relations between probabilistic and team one-shot
learners},
booktitle = {Proc. 4th Annu. Workshop on Comput. Learning Theory},
year = 1991,
pages = {228--239},
address = {San Mateo, CA},
publisher = {Morgan Kaufmann}
}
@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}
}
@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}
}
@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}
}
@inproceedings{Dagan-et-al91,
author = "I. Dagan and A. Itai and U. Schwall",
year = 1991,
title = "Two languages are more informative than one",
booktitle = {Proceedings of the Annual Meeting of the Association
for Computational Linguistics (ACL)}
}
@inproceedings{Dagan-et-al93,
author = "I. Dagan and S. Marcus and S. Markovitch",
year = 1993,
title = "Contextual word similarity and estimation from
sparse data",
booktitle = {Proceedings of the Annual Meeting of the Association
for Computational Linguistics (ACL)}
}
@inproceedings(Dagan90,
author = "Ido Dagan and Alon Itai",
title = "Automatic Acquisition of Constraints for the
Resolution of Anaphora References and Syntactic
Ambiguities",
booktitle = Coling,
volume = 3,
pages = "330--332",
year = 1990
)
@inproceedings(Dagan91,
author = "Ido Dagan and Alon Itai and Ulrike Schwall",
title = "Two languages are more informative than one",
booktitle = ACL,
pages = "130--137",
year = 1991
)
@incollection(Dagan91b,
author = "Ido Dagan and Alon Itai",
title = "A Statistical Filter for Resolving Pronoun
References",
booktitle = "Artificial Intelligence and Computer Vision",
editor = "Y. A. Feldman and A. Bruckstein",
publisher = "Elsevier Science Publishers B.V.",
pages = "125--135",
year = 1991,
note = "(The Proc. of the 7th Israeli Sym. on Artificial
Intelligence and Computer Vision, 1990)"
)
@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(Dagan93,
author = "Ido Dagan and Shaul Marcus and Shaul Markovitch",
title = "Contextual word similarity and estimation from
sparse data",
booktitle = ACL,
pages = "164--171",
year = 1993
)
@inproceedings(Dagan93a,
author = "Ido Dagan and Kenneth Church and William Gale",
title = "Robust bilingual word alignment for machine aided
translation",
booktitle = "Proceedings of the Workshop on Very Large Corpora:
Academic and Industrial Perspectives",
pages = "1--8",
place = "Columbus, Ohio",
year = 1993
)
@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
}
@inproceedings(Dagan94b,
author = "Ido Dagan and Kenneth Church",
title = "{\it Termight}: Identifying and translating
technical terminology",
booktitle = ANLP,
pages = "34--40",
year = 1994
)
@inproceedings(Dagan94c,
author = "I. Dagan and F. Pereira and L. Lee",
title = "Similarity-based estimation of word cooccurrence
probabilities",
booktitle = ACL,
pages = "272--278",
year = 1994
)
@article(Dagan95,
author = "Ido Dagan and Shaul Marcus and Shaul Markovitch",
title = "Contextual word similarity and estimation from
sparse data",
journal = CSL,
volume = 9,
pages = "123-152",
year = 1995
)
@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{DaganCh94,
author = {Ido Dagan and Kenneth Church},
title = {{\it Termight}: Identifying and translating
technical terminology},
booktitle = ANLP,
year = 1994,
pages = {34--40}
}
@INPROCEEDINGS{DaganChGa93,
author = {Ido Dagan and Kenneth Church and William Gale},
title = {Robust bilingual word alignment for machine aided
translation},
booktitle = {Proceedings of the 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-95} Workshop On New Approaches to Learning
for Natural Language Processing},
year = 1995,
month = {August}
}
@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{DaganGl05,
AUTHOR = {I. Dagan and O. Glickman},
TITLE = {A Probabilistic Setting and Lexical Cooccurrence
Model for Textual Entailment},
booktitle = {ACL-05 Workshop on Empirical Modeling of Semantic
Equivalence and Entailment},
YEAR = 2005,
address = {Ann Arbor, MI}
}
@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 = {Proceedings of PASCAL first Workshop on Recognising
Textual Entailment},
month = {April},
year = 2005,
pages = {1--8},
url =
{http://www.cs.biu.ac.il/~glikmao/rte05/rte05_proceedings.pdf}
}
@PROCEEDINGS{DaganGlMa06,
title = "The PASCAL Recognising Textual Entailment
Challenge.",
year = 2006,
editor = "I. Dagan and O. Glickman and B. Magnini",
booktitle = "Lecture Notes in Computer Science",
volume = 3944,
publisher = "Springer-Verlag, Berlin",
}
@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}
}
@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{DaganIt94,
author = "Dagan, I. and A. Itai",
title = "Word Sense Disambiguation Using a Second Language
Monolingual Corpus",
journal = CL,
volume = 20,
number = 4,
pages = "563--596",
year = 1994
}
@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}
}
@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}
}
@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{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}
}
@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
}
@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
}
@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}
}
@INCOLLECTION{Dahlgren88,
author = {K. Dahlgren},
title = {Using common sense knowledge to disambiguate word
senses},
booktitle = {Natural Language Understanding and Logic
Programming, II},
publisher = {North-Holland},
year = 1988,
editor = {Veronice Dahl and Patrick Saint-Dizier},
pages = {255--275}
}
@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{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",
pages = "515--521",
booktitle = Coling,
year = 1994
}
@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},
}
@ARTICLE{Daley77,
author = {R. Daley},
title = {On the inference of optimal descriptions},
journal = {Theoret. Comput. Sci.},
year = 1977,
volume = 4,
pages = {301--319}
}
@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}
}
@INPROCEEDINGS{Daley86,
author = {R. P. Daley},
title = {Inductive Inference Hierarchies: Probabilistic vs
Pluralistic},
booktitle = {Proc. Int. Spring School on Mathematical Methods of
Specification and Synthesis of Software Systems '85},
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 = {Proc. 1st International Workshop on Analogical and
Inductive Inference},
year = 1986,
volume = 265,
series = {Lecture Notes in Computer Science},
pages = {1--18},
publisher = {Springer-Verlag}
}
@INPROCEEDINGS{Daley88,
author = {R. Daley},
title = {Transformation of probabilistic learning strategies
into deterministic learning strategies},
booktitle = {Proc. 1st Annu. Workshop on Comput. Learning Theory},
year = 1988,
pages = {220--226},
address = {San Mateo, CA},
publisher = {Morgan Kaufmann}
}
@INPROCEEDINGS{Daley93,
author = {Robert Daley},
title = {Multi-Agent Learning: Theoretical and Empirical
Studies},
booktitle = {Proc. 2nd Internat. Workshop on Nonmonotonic and
Inductive Logic},
year = 1993,
volume = 659,
series = {Lecture Notes in Artificial Intelligence},
pages = {175--183},
publisher = {Springer--Verlag}
}
@INPROCEEDINGS{DaleyKa93,
author = {R. Daley and B. Kalyanasundaram},
title = {Capabilities of probabilistic learners with bounded
mind changes},
booktitle = {Proc. 6th Annu. Conf. on Comput. Learning Theory},
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 = {Proc. 4th Int. Workshop on Algorithmic Learning
Theory},
year = 1993,
volume = 744,
series = {Lecture Notes in Artificial Intelligence},
pages = {173--186},
publisher = {Springer-Verlag}
}
@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{DaleyKa97,
author = {Robert Daley and Bala Kalyanasundaram},
title = {{FIN}ite Learning Capabilities and Their Limits},
booktitle = {Proc. 10th Annu. Conf. on Comput. Learning Theory},
year = 1997,
pages = {81--89},
publisher = {ACM Press, New York, NY}
}
@INPROCEEDINGS{DaleyKaVe93,
author = {R. Daley and B. Kalyanasundaram and
M. Velauthapillai},
title = {Capabilities of fallible {FIN}ite learning},
booktitle = {Proc. 6th Annu. Conf. on Comput. Learning Theory},
year = 1993,
pages = {199--208},
publisher = {ACM Press, New York, NY}
}
@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}
}
@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{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}
}
@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 = {Proc. 10th International Conference on Algorithmic
Learning Theory - ALT '99},
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 = {Proc. 4th European Conference on Computational
Learning Theory},
year = 1999,
volume = 1572,
series = {Lecture Notes in Artificial Intelligence},
pages = {63--78},
publisher = {Springer-Verlag}
}
@INPROCEEDINGS{Damaschke98,
author = {P. Damaschke},
title = {Computational Aspects of Parallel
Attribute-Efficient Learning},
booktitle = {Proc. 9th International Conference on Algorithmic
Learning Theory - ALT '98},
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}
}
@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
}
@BOOK{Darwin59,
title = {The Origin of Species},
publisher = {John Murray},
year = 1859,
author = {Charles R. Darwin},
address = {London}
}
@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 = {Proc. 7th Annu. ACM Conf. on Comput. Learning
Theory},
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 = {Proceedings of the 2007 Joint Conference of
EMNLP-CoNLL},
year = 2007,
pages = {218--227},
url = {http://www.aclweb.org/anthology/D/D07/D07-1023}
}
@INPROCEEDINGS{DattaKi95,
author = {Piew Datta and Dennis Kibler},
title = {Learning prototypical concept descriptions},
booktitle = {Proc. 12th International Conference on Machine
Learning},
year = 1995,
pages = {158--166},
publisher = {Morgan Kaufmann}
}
@INPROCEEDINGS{DattaKi97,
author = {Piew Datta and Dennis Kibler},
title = {Learning symbolic prototypes},
booktitle = {Proc. 14th International Conference on Machine
Learning},
year = 1997,
pages = {75--82},
publisher = {Morgan Kaufmann}
}
@INPROCEEDINGS{DaumMa05,
author = {Hal Daum\'{e} 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{Daume07,
author = {Daum\'{e}, 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}, 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}
}
@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}
}
@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}
}
@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 = {Proc. 10th International Conference on Algorithmic
Learning Theory - ALT '99},
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{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; }
}
@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{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}
}
@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}
}
@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}
}
@INPROCEEDINGS{DeJong81,
author = {DeJong, G.},
title = {Generalization based on explanations},
booktitle = IJCAI,
year = 1981,
pages = {67--70}
}
@INPROCEEDINGS{DeJong95,
author = {Gerald De{J}ong},
title = {A case study of explanation-based control},
booktitle = {Proc. 12th International Conference on Machine
Learning},
year = 1995,
pages = {167--175},
publisher = {Morgan Kaufmann}
}
@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}
}
@ARTICLE{DeRaedt97,
author = {De Raedt, L.},
title = {Logical Settings for Concept Learning},
journal = AI,
year = 1997,
volume = 95,
pages = {187--201},
number = 1
}
@ARTICLE{DeRose88,
author = {DeRose, S.J.},
title = {Grammatical category disambiguation by statistical
optimization},
journal = CL,
year = 1988,
volume = 14,
pages = {31--39},
number = 1
}
@BOOK{DeSaintExupery43,
title = {The Little Prince},
publisher = {Harcourt, Brace, \& World},
year = 1943,
author = {Saint-Exup\`ery, Antoine de}
}
@INPROCEEDINGS{DeSantisMaWe88,
author = {A. DeSantis and G. Markowsky and M. N. Wegman},
title = {Learning probabilistic prediction functions},
booktitle = {Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci.},
year = 1988,
pages = {110--119},
publisher = {IEEE Computer Society Press, Los Alamitos, CA},
annote = {Also in COLT88}
}
@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; }
}
@INPROCEEDINGS{DebiliSaZr94,
author = {Fathi Debili and Ely\`es Sammouda and Adnane Zribi},
title = {Using Syntactic Dependencies for Word Alignment},
booktitle = {Proc. 4th Conf. 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{Decatur93,
author = {Decatur, S. E.},
title = {Statistical Queries and Faulty {PAC} Oracles},
booktitle = {Proceedings of the Sixth Annual {ACM} Workshop on
ComputationalLearning Theory},
year = 1993,
pages = {262--268},
publisher = {{ACM} Press}
}
@INPROCEEDINGS{Decatur97,
author = {Scott Decatur},
title = {{PAC} learning with constant-partition
classification noise and applications to decision
tree induction},
booktitle = {Proc. 14th International Conference on Machine
Learning},
year = 1997,
pages = {83--91},
publisher = {Morgan Kaufmann}
}
@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}
}
@TECHREPORT{Dechter90,
author = {R. Dechter},
title = {On the Design of Networks with Hidden Variables},
institution = {Technion, Haifa},
year = 1990,
month = jul
}
@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{DechterMa04,
author = {R. Dechter and R. Mateescu},
title = {{Mixtures of deterministic-probabilistic networks
and their AND/OR search space}},
booktitle = {{Proceedings of 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}
}
@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}
}
@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.},
year = 2002,
booktitle = {Proc. of ICTAI},
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{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}
}
@INPROCEEDINGS{DengKaPa91,
author = {X. Deng and T. Kameda and C. Papadimitriou},
title = {How to learn in an unknown environment},
booktitle = {Proc. of the 32nd Symposium on the Foundations of
Comp. Sci.},
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 = {Proceedings of the 31st Symposium on Foundations of
Computer Science},
year = 1990,
volume = {I},
pages = {355--361}
}
@INPROCEEDINGS{Denis98,
author = {F. Denis},
title = {{PAC} Learning from Positive Statistical Queries},
booktitle = {Proc. 9th International Conference on Algorithmic
Learning Theory - ALT '98},
year = 1998,
volume = 1501,
series = {Lecture Notes in Artificial Intelligence},
pages = {112--126},
publisher = {Springer-Verlag}
}
@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{DenisBa07,
author = {P. Denis and J. Baldridge},
title = {Joint Determination of Anaphoricity and Coreference
Resolution using Integer Programming},
booktitle = NAACL,
year = 2007
}
@INPROCEEDINGS{DenisD'Gi96,
author = {F. Denis and C. D'Halluin and R. Gilleron},
title = {{PAC} learning with simple examples},
booktitle = {Proc.~13th Annual Symposium on Theoretical Aspects
of Computer Science: STACS'96},
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 = {Algorithmic Learning Theory: ALT '97},
year = 1997,
volume = 1316,
series = {Lecture Notes in Artificial Intelligence},
pages = {132--145},
publisher = {Springer-Verlag}
}
@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.}
}
@INPROCEEDINGS{Dershowitz94,
author = {N. Dershowitz},
title = {From specifications to programs: induction in the
service of synthesis},
booktitle = {Proc. 5th Int. 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{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{DevaneyRa97,
author = {Mark Devaney and Ashwin Ram},
title = {Efficient feature selection in conceptual
clustering},
booktitle = {Proc. 14th International Conference on Machine
Learning},
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}
}
@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{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}
}
@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
}
@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}
}
@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{DhagatHe94,
author = {Aditi Dhagat and Lisa Hellerstein},
title = {{PAC} learning with irrelevant attributes},
booktitle = {Proc. of the 35rd Annual Symposium on Foundations of
Computer Science},
year = 1994,
pages = {64--74},
publisher = {IEEE Computer Society Press, Los Alamitos, CA}
}
@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}
}
@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}
}
@INPROCEEDINGS{Dietterich84,
author = {T. G. Dietterich},
title = {Learning About Systems That Contain State Variables},
booktitle = {Proc. of the National Conference on Artificial
Intelligence},
year = 1984,
pages = {96--100},
month = aug
}
@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}
}
@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{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{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 = {Proc. 15th International Conf. on Machine Learning},
year = 1998,
pages = {118--126},
publisher = {Morgan Kaufmann, San Francisco, CA}
}
@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{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{DietterichKeMa96,
author = {Tom Dietterich and Michael Kearns and Yishay
Mansour},
title = {Applying the weak learning framework to understand
and improve {C}4.5},
booktitle = {Proc. 13th International Conference on Machine
Learning},
year = 1996,
pages = {96--104},
publisher = {Morgan Kaufmann}
}
@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 = {Proc. 6th International Joint Conference on
Artificial Intelligence},
year = 1979,
pages = {223--231},
publisher = IJCAI
}
@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}
}
@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}
}
@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
}
@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 = {Proc. 8th Annu. Conf. on Comput. Learning Theory},
year = 1995,
pages = {329--336},
publisher = {ACM Press, New York, NY}
}
@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}
}
@INPROCEEDINGS{DobkinKi90,
author = {D. P. Dobkin and D. G. Kirkpatrick},
title = {Determining the separation of preprocessed polyhedra
-- a unified approach},
booktitle = {Proc. 17th Internat. Colloq. Automata
Lang. Program.},
year = 1990,
volume = 443,
series = {Lecture Notes in Computer Science},
pages = {400--413},
publisher = {Springer-Verlag}
}
@ARTICLE{DocClusDS,
author = {Mark P. Sinka and David W. Corne},
title = {A large benchmark dataset for web document
clustering},
editor = {Abraham, A. and Ruiz-del-Solar, J. and Koeppen, M.},
journal = {Soft Computing Systems: Design, Management and
Applications, Frontiers in Artificial Intelligence
and Applications},
volume = 87,
year = 2002,
pages = {881--890}
}
@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
}
@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; }
}
@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; }
}
@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 = {Proc. 10th International Conference on Algorithmic
Learning Theory - ALT '99},
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 = {Proc. 1st 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 = {Computational Learning Theory: EuroColt '95},
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 = {Proc. 6th Int. 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 = {Algorithmic Learning Theory: ALT '97},
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 = {Proc. 13th Annu. Conference on Comput. Learning
Theory},
year = 2000,
pages = {180--189},
publisher = {Morgan Kaufmann, San Francisco}
}
@INPROCEEDINGS{Domingos97,
author = {Pedro Domingos},
title = {Knowledge acquisition from examples via multiple
models},
booktitle = {Proc. 14th International Conference on Machine
Learning},
year = 1997,
pages = {98--106},
publisher = {Morgan Kaufmann}
}
@INPROCEEDINGS{Domingos98,
author = {Pedro Domingos},
title = {A process-oriented heuristic for model selection},
booktitle = {Proc. 15th International Conf. on Machine Learning},
year = 1998,
pages = {127--135},
publisher = {Morgan Kaufmann, San Francisco, CA}
}
@INPROCEEDINGS{DomingosPa96,
author = {Pedro Domingos and Michael Pazzani},
title = {Beyond independence: conditions for the optimality
of the simple {B}ayesian classifier},
booktitle = {Proc. 13th International Conference on Machine
Learning},
year = 1996,
pages = {105--112},
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{DonohoRe95,
author = {Stephen K. Donoho and Larry A. Rendell},
title = {Lessons from theory revision applied to constructive
induction},
booktitle = {Proc. 12th International Conference on Machine
Learning},
year = 1995,
pages = {185--193},
publisher = {Morgan Kaufmann}
}
@INPROCEEDINGS{DonohoRe96,
author = {Steve Donoho and Larry Rendell},
title = {Constructive induction using fragmentary knowledge},
booktitle = {Proc. 13th International Conference on Machine
Learning},
year = 1996,
pages = {113--121},
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 = {Proc. 12th International Conference on Machine
Learning},
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 = {Algorithmic Learning Theory: ALT '96},
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{DowneyEvFe93,
author = {R. Downey and P. Evans and M. Fellows},
title = {Parameterized learning complexity},
booktitle = {Proc. 6th Annu. Conf. on Comput. Learning Theory},
year = 1993,
pages = {51--57},
publisher = {ACM Press, New York, NY}
}
@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}
}
@article(Dowty91,
author = "D. Dowty",
year = 1991,
title = "Thematic Proto-Roles and Argument Selection",
journal = "Language",
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}
}
@TECHREPORT{Doyle88a,
author = {J. Doyle},
title = {On Rationality and Learning},
institution = {Carnegie Mellon University},
year = 1988
}
@ARTICLE{Doyle89,
author = {Doyle, J.},
title = {Constructive belief and rational representation},
journal = {Computational Intelligence},
year = 1989,
volume = 5,
number = 1
}
@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 = {Proc. 12th International Conference on Machine
Learning},
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 = {In Proceedings of the 5th 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}
}
@TECHREPORT{Drescher80,
author = {Drescher, Gary L.},
title = {Suggestions for Genetic {A.I.}},
institution = {MIT Artificial Intelligence Laboratory},
year = 1980,
number = 198,
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{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
}
@INPROCEEDINGS{Drescher87,
author = {Gary L. Drescher},
title = {A Mechanism for Early {Piagetian} Learning},
booktitle = {Proceedings of AAAI-87: Sixth National Conference on
Artificial Intelligence},
year = 1987,
pages = {290--294},
address = {Seattle, Washington},
month = Jul
}
@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{Drucker97,
author = {Harris Drucker},
title = {Improving regressors using boosting techniques},
booktitle = {Proc. 14th International Conference on Machine
Learning},
year = 1997,
pages = {107--115},
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 = {Neural Information Processing Systems 5},
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}
}
@techreport{DuMouchel99,
author = "W. DuMouchel",
title = "Computer Intrusion Detection Based on Bayes Factors
for Comparing Command Transition Probabilities",
year = 1999,
number = "TR91",
institution = "National Institute of Statistical Sciences (NISS)",
}
@INPROCEEDINGS{DuanZhXu07,
author = {Duan, Xiangyu and Zhao, Jun and Xu, Bo},
title = {Probabilistic Parsing Action Models for
Multi-Lingual Dependency Parsing},
booktitle = {Proceedings of the CoNLL Shared Task Session of
EMNLP-CoNLL 2007},
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}
}
@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}
}
@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.}
}
@INPROCEEDINGS{Duff95,
author = {Michael O. Duff},
title = {{Q}-learning for bandit problems},
booktitle = {Proc. 12th International Conference on Machine
Learning},
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 = {Proc. 13th Annu. Conference on Comput. Learning
Theory},
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 = {Proc. 4th European Conference on Computational
Learning Theory},
year = 1999,
volume = 1572,
series = {Lecture Notes in Artificial Intelligence},
pages = {18--33},
publisher = {Springer-Verlag}
}
@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 = {Proc. 2nd International Colloquium on Grammatical
Inference - ICGI '94},
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 = {Proc. 4th International Colloquium on Grammatical
Inference - ICGI '98},
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{DuzeroskiMuRu92,
author = {S. D\u{z}eroski and S. Muggleton and S. Russell},
title = {{PAC}-learnability of determinate logic programs},
booktitle = {Proc. 5th Annu. Workshop on Comput. Learning Theory},
year = 1992,
pages = {128--135},
publisher = {ACM Press, New York, NY}
}
@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 = {Proc. 15th International Conf. on Machine Learning},
year = 1998,
pages = {136--143},
publisher = {Morgan Kaufmann, San Francisco, CA}
}
@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 = {International Workshop on Inductive Logic
Programming},
year = 1997,
pages = {141--148},
address = {Prague, Czech Republic},
publisher = {Springer},
note = {LNAI 1297}
}
@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
}
@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{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{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}
}
@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{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.}
}
@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}
}
@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 = {Algorithmic Learning Theory: ALT '97},
year = 1997,
volume = 1316,
series = {Lecture Notes in Artificial Intelligence},
pages = {260--276},
publisher = {Springer-Verlag}
}
@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}
}
@BOOK{Edelman87,
title = {Neural Darwinism -- The Theory of Neuronal Group
Selection},
publisher = {Basic Books},
year = 1987,
author = {Gerald M. Edelman}
}
@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
}
@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}
}
@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{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{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{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
}
@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{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}
}
@INPROCEEDINGS{EhrenfeuchtHa88,
author = {Ehrenfeucht, Andrzej and David Haussler},
title = {Learning Decision Trees from Random Examples},
booktitle = {Proceedings of the 1988 Workshop on Computational
Learning Theory},
year = 1988,
pages = {182--194},
address = {Cambridge, MA},
month = Aug
}
@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
}
@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}
}
@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{EisenbergRi90,
author = {Eisenberg, Bonnie and Ronald Rivest},
title = {On the Sample Complexity of {PAC}-Learning Using
Random and Chosen Examples},
booktitle = {Proceedings of COLT '90},
year = 1990,
pages = {154--162},
publisher = {Morgan Kaufmann},
tag = {TOC-display}
}
@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 Int. Joint Conf. 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 = {Proc. 11th International Conference on Machine
Learning},
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 = {Proc. 13th International Conference on Machine
Learning},
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 = {Proc. 4th International Colloquium on Grammatical
Inference - ICGI '98},
year = 1998,
volume = 1433,
series = {Lecture Notes in Artificial Intelligence},
pages = {223--231},
publisher = {Springer-Verlag}
}
@BOOK{Enderton72,
title = {A mathematical intoroduction to logic},
publisher = {Academic Press},
year = 1972,
editor = {Enderton, H. B.},
comment = {QA9.E54}
}
@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{EngelsonKo95,
author = {Sean P. Engelson and Moshe Koppel},
title = {Distilling reliable information from unreliable
theories},
booktitle = {Proc. 12th International Conference on Machine
Learning},
year = 1995,
pages = {218--225},
publisher = {Morgan Kaufmann}
}
@INPROCEEDINGS{EngelsonKo96,
author = {Sean P. Engelson and Moshe Koppel},
title = {Identifying the information contained in a flawed
theory},
booktitle = {Proc. 13th International Conference on Machine
Learning},
year = 1996,
pages = {131--138},
publisher = {Morgan Kaufmann}
}
@INPROCEEDINGS{Eppstein03,
author = {D. Eppstein},
title = {Dynamic generators of topologically embedded graphs},
booktitle = SODA,
year = 2003,
pages = {599--608}
}
@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; }
}
@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}
}
@INPROCEEDINGS{Eppstein97,
author = {D. Eppstein},
title = {Faster construction of planar two-centers},
booktitle = SODA,
year = 1997
}
@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}
}
@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}
}
@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 = {Proc. 8th Annu. Conf. on Comput. Learning Theory},
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 = {Proc. 10th Annu. Conf. on Comput. Learning Theory},
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}
}
@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{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{EricksonHa02,
author = {J. Erickson and S. {Har-Peled}},
title = {Optimally Cutting a Surface into a Disk},
booktitle = SOCG,
year = 2002,
pages = {244--253}
}
@ARTICLE{EricksonHa03,
author = {J. Erickson and S. {Har-Peled}},
title = {Optimally Cutting a Surface into a Disk},
journal = DCG,
year = 2003,
note = {To appear}
}
@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 = {Proceedings of the 2007 Joint Conference of
EMNLP-CoNLL},
year = 2007,
pages = {228--237},
url = {http://www.aclweb.org/anthology/D/D07/D07-1024}
}
@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 = {Proceedings of {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}
}
@BOOK{Etherington88,
title = {Reasoning With Incomplete Information},
publisher = {Morgan Kaufmann},
year = 1988,
author = {Etherington, D. W.}
}
@INPROCEEDINGS{EtheringtonBoBrKa89,
author = {Etherington, D. and A. Borgida and R. Brachman and
H. Kautz},
title = {Vivid Knowledge and Tractable Reasoning:
PerliminaryReport},
booktitle = {Proceedings of IJCAI 89},
year = 1989
}
@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{EvansRaVa93,
author = {W. Evans and S. Rajagopalan and U. Vazirani},
title = {Choosing a reliable hypothesis},
booktitle = {Proc. 6th Annu. Conf. on Comput. Learning Theory},
year = 1993,
pages = {269--276},
publisher = {ACM Press, New York, NY}
}
@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 = {Proc. 10th International Conference on Algorithmic
Learning Theory - ALT '99},
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 = {Proc. 13th International Conference on Machine
Learning},
year = 1996,
pages = {139--147},
publisher = {Morgan Kaufmann}
}
@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}}
}
@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 = {Proc. 5th Int. Workshop on Algorithmic Learning
Theory},
year = 1994,
pages = {100--105},
publisher = {Springer-Verlag}
}
@INPROCEEDINGS{FGMP94,
author = {M. Frazier and S. Goldman and N. Mishra and L. Pitt},
title = {Learning from a consistently ignorant teacher},
booktitle = {Proc. 7th Annu. ACM Conf. on Comput. Learning
Theory},
year = 1994,
pages = {328--339},
publisher = {ACM Press, New York, NY}
}
@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{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.},
year = 2005,
booktitle = {Proceedings of RTE 2005}
}
@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",
year = 1994,
journal = "Lingua",
volume = 92,
pages = "333-375"
)
@INPROCEEDINGS{FISS98,
author = {Yoav Freund and Raj Iyer and Robert E. Schapire and
Yoram Singer},
title = {An efficient boosting algorithm for combining
preferences},
booktitle = {Proc. 15th International Conf. on Machine Learning},
year = 1998,
pages = {170--178},
publisher = {Morgan Kaufmann, San Francisco, CA}
}
@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{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 = {Proc. of the 36th Annual Symposium on Foundations of
Computer Science},
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 = {Proc. 25th Annu. ACM Sympos. Theory Comput.},
year = 1993,
pages = {315--324},
publisher = {ACM Press, New York, NY}
}
@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}
}
@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}
}
@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 = {Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci.},
year = 1989,
pages = {274--279},
publisher = {IEEE Computer Society Press, Los Alamitos, CA}
}
@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 = {Proceedings of the 2007 Joint Conference of
EMNLP-CoNLL},
year = 2007,
pages = {658--666},
url = {http://www.aclweb.org/anthology/D/D07/D07-1069}
}
@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}
}
@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 = {Proc. 16th International Conf. on Machine Learning},
year = 1999,
pages = {97--105},
publisher = {Morgan Kaufmann, San Francisco, CA}
}
@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
}
@ARTICLE{Fagin82,
author = {Fagin, R.},
title = {{H}orn Clauses and Database Dependencies},
journal = JACM,
year = 1982,
volume = 29,
pages = {952--985},
number = 4
}
@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{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{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{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 = {Advances in Neural Information Processing Systems 2},
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 = {Proc. 6th Int. 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}
}
@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 = {Proc. 6th Annu. Conf. on Comput. Learning Theory},
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}
}
@INPROCEEDINGS{Feder98,
author = {Meir Feder},
title = {Learning to communicate via unknown channel},
booktitle = {Proc. 11th Annu. Conf. on Comput. Learning Theory},
year = 1998,
pages = 79,
publisher = {ACM Press, New York, NY}
}
@INPROCEEDINGS{FederGr88,
author = {T. Feder and D. H. Greene},
title = {Optimal algorithms for approximate clustering},
booktitle = STOC,
year = 1988,
pages = {434--444}
}
@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}
}
@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 = {Proc. 9th Annu. Conf. on Comput. Learning Theory},
year = 1996,
pages = {255--265},
publisher = {ACM Press, New York, NY}
}
@TECHREPORT{Feldman67,
author = {J. A. Feldman},
title = {First thoughts on grammatical inference},
institution = {Stanford University Artificial Intelligence Memo 55},
year = 1967
}
@ARTICLE{Feldman72,
author = {J. Feldman},
title = {Some Decidability results on Grammatical Inference
and Complexity},
journal = {Inform. Control},
year = 1972,
volume = 20,
pages = {244--262}
}
@techreport{Feldman94,
author = "R. Feldman",
year = 1994,
title = "Knowledge Discovery in Textual Databases",
institution = {Bar-Ilan University},
address = {Ramat-Gan, Israel}
}
@InProceedings{Feldman95a,
author = "Ronen Feldman and Ido Dagan",
title = "{KDT} -- Knowledge Discovery in Texts",
booktitle = "Proceedings of the First International Conference on
Knowledge Discovery (KDD-95)",
place = "Montreal",
month = "August",
year = 1995
}
@INPROCEEDINGS{Feldman95b,
author = {Ronen Feldman and Ido Dagan},
title = {Knowledge Discovery in Textual Databases},
booktitle = {Proceedings of the ECML-95 Workshop in Knowledge
Discovery},
year = 1995,
month = {May},
place = {Crete}
}
@unpublished{Feldman95c,
author = "Ronen Feldman and Ido Dagan and Willi Klosgen",
title = "Efficient algorithms for mining associations in
texts",
note = "In preparation",
}
@INPROCEEDINGS{Feldman98,
author = {Jerome A. Feldman},
title = {Real language learning},
booktitle = {Proc. 4th International Colloquium on Grammatical
Inference - ICGI '98},
year = 1998,
volume = 1433,
series = {Lecture Notes in Artificial Intelligence},
pages = {114--125},
publisher = {Springer-Verlag}
}
@INPROCEEDINGS{FeldmanDa95,
author = {Ronen Feldman and Ido Dagan},
title = {{KDT} -- Knowledge Discovery in Texts},
booktitle = {Proceedings of the First International Conference on
Knowledge Discovery (KDD-95)},
year = 1995,
month = {August},
place = {Montreal}
}
@UNPUBLISHED{FeldmanDaKl,
author = {Ronen Feldman and Ido Dagan and Willi Klosgen},
title = {Efficient algorithms for mining associations in
texts},
note = {In preparation}
}
@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}
}
@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},
author = {Fellbaum, C. and NetLibrary, I.},
year = 1998,
publisher = {MIT Press USA}
}
@BOOK{Feller68,
title = {An Introduction to Probability Theory and Its
Applications},
publisher = {John Wiley and Sons, Inc.},
year = 1968,
author = {William Feller},
volume = 1
}
@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}
}
@INPROCEEDINGS{FengBuHo07,
author = {Feng, Donghui and Burns, Gully and Hovy, Eduard},
title = {Extracting Data Records from Unstructured Biomedical
Full Text},
booktitle = {Proceedings of the 2007 Joint Conference of
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",
year = 1993,
title = "Common themes and cultural variations in Japanese
and American mothers' speech to infants",
journal = "Child Development",
volume = 64,
pages = "637-656"
)
@article(Ferreira03,
author = "F. Ferreira",
title = "The misinterpretation of noncanonical sentences",
year = 2003,
journal = "Cognitive Psychology",
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 = {Proc. 5th Int. 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
}
@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; }
}
@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 = {Proceedings of the 32nd Symposium on Foundations of
Computer Science},
year = 1991,
pages = {288-297},
publisher = {IEEE}
}
@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 = {Proc. 7th Annu. ACM Conf. on Comput. Learning
Theory},
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 = {Proc. 10th Annu. Conf. on Comput. Learning Theory},
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 = {Proceedings of the 2007 Joint Conference of
EMNLP-CoNLL},
year = 2007,
pages = {620--629},
url = {http://www.aclweb.org/anthology/D/D07/D07-1065}
}
@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 = "Proceedings of the 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 = {Proceedings of the 4th 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{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}
}
@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,
number = 1,
pages = "116-131",
}
@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 = {Proc. 16th International Conf. on Machine Learning},
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 = {Proc. 4th International Colloquium on Grammatical
Inference - ICGI '98},
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",
BOOKTITLE = "Studies in Linguistic analysis",
PUBLISHER = "Blackwell",
COMMENT = {Reprinted in Selected Papers of J. R. Firth, edited
by F. Palmer. Longman, 1968},
PAGES = {1--32},
YEAR = 1957
}
@INPROCEEDINGS{Fischer94,
author = {P. Fischer},
title = {Learning Unions of Convex Polygons},
booktitle = {Computational Learning Theory: EuroColt '93},
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{Fischer95,
author = {Paul Fischer},
title = {More or less efficient agnostic learning of convex
polygons},
booktitle = {Proc. 8th Annu. Conf. on Comput. Learning Theory},
year = 1995,
pages = {337--344},
publisher = {ACM Press, New York, NY}
}
@INPROCEEDINGS{FischerPSi91,
author = {P. Fischer and S. P{\"o}lt and H. U. Simon},
title = {Probably almost {B}ayes decisions},
booktitle = {Proc. 4th Annu. Workshop on Comput. Learning Theory},
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
}
@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
}
@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 = {Proc. 9th International Conference on Algorithmic
Learning Theory - ALT '98},
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",
year = 2002,
journal = "Developmental Science",
volume = 5,
pages = "56-65"
)
@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(Fisher96,
author = "C. Fisher",
title = "Structural limits on verb mapping: The role of
analogy in children's interpretation of sentences",
year = 1996,
journal = "Cognitive Psychology",
volume = 31,
pages = "41-81"
)
@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 = {Proceedings of ILP99},
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 = {Proc. 5th Annu. Workshop on Comput. Learning Theory},
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
}
@BOOK{Flexner83,
title = {{R}andom {H}ouse Unabridged Dictionary},
publisher = {Random House},
year = 1983,
editor = {S. B. Flexner},
address = {New York},
note = {Second edition}
}
@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 = {In Proceedings of ACL'99},
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 = {Proc. 2nd Annu. Workshop on Comput. Learning Theory},
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 = {Proc. 12th International Conference on Machine
Learning},
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 = {Proc. 4th European Conference on Computational
Learning Theory},
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 = {Proc. 13th Annu. Conference on Comput. Learning
Theory},
year = 2000,
pages = {90--99},
publisher = {Morgan Kaufmann, San Francisco}
}
@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}
}
@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}
}
@BOOK{Foster82,
title = {GEO-METRICS {II}: {The} application of geometric
tolerancing techniques},
publisher = {Addison-Wesley},
year = 1982,
author = {L. W. Foster}
}
@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}
}
@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}
}
@book(Francis82,
author = "W. Francis and H. Kucera",
title = "Frequency Analysis of English Usage",
publisher = "Houghton Mifflin Company",
place = "Boston, MA",
year = 1982
)
@BOOK{FrancisKu82,
title = {Frequency Analysis of English Usage},
publisher = {Houghton Mifflin Company},
year = 1982,
author = {W. Francis and H. Kucera},
place = {Boston, MA}
}
@INPROCEEDINGS{FrankWi98,
author = {Eibe Frank and Ian H. Witten},
title = {Generating accurate rule sets without global
optimization},
booktitle = {Proc. 15th International Conf. on Machine Learning},
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 = {Proc. 15th International Conf. on Machine Learning},
year = 1998,
pages = {152--160},
publisher = {Morgan Kaufmann, San Francisco, CA}
}
@INPROCEEDINGS{FrankWi99,
author = {Eibe Frank and Ian H. Witten},
title = {Making better use of global discretization},
booktitle = {Proc. 16th International Conf. on Machine Learning},
year = 1999,
pages = {115--123},
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}
}
@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}
}
@INPROCEEDINGS{FraserMa07,
author = {Fraser, Alexander and Marcu, Daniel},
title = {Getting the Structure Right for Word Alignment:
{LEAF}},
booktitle = {Proceedings of the 2007 Joint Conference of
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",
year = 1991,
title = "Knowledge Discovery in Databases: An Overview",
booktitle = {Knowledge Discovery in Databases},
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",
editor = "G. Piatetsky-Shapiro and W. J. Frawley",
publisher = MIT,
pages = "1--27",
year = 1991
)
@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}
}
@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{FrazierPa93,
author = {M. Frazier and C. D. Page},
title = {Learnability of Recursive, Non-determinate Theories:
Some Basic Results and Techniques},
booktitle = {Third International Workshop on Inductive Logic
Programming},
year = 1993
}
@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}
}
@INPROCEEDINGS{FrazierPi94,
author = {M. Frazier and L. Pitt},
title = {Some New Directions in Computational Learning
Theory},
booktitle = {Computational Learning Theory: EuroColt '93},
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 = {Computational Learning Theory},
year = 1994,
pages = {23-34}
}
@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}
}
@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
}
@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{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; }
}
@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 = {Proc. 15th International Conf. on Machine Learning},
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 = {Proceedings of the 2007 Joint Conference of
EMNLP-CoNLL},
year = 2007,
pages = {238--247},
url = {http://www.aclweb.org/anthology/D/D07/D07-1025}
}
@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{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}
}
@INPROCEEDINGS{Freivalds75,
author = {R. V. Freivalds},
title = {Functions computable in the Limit by Probabilistic
Machines},
booktitle = {Proc. 3rd Symposium on Mathematical Foundations of
Computer Science, June 17-22, 1974},
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 = {Proc. 4th Symposium on Mathematical Foundations of
Computer Science, September 1--5, 1975},
year = 1975,
volume = 32,
series = {Lecture Notes in Computer Science},
pages = {219--225},
publisher = {Springer-Verlag}
}
@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}
}
@INPROCEEDINGS{Freivalds79a,
author = {R. V. Freivalds},
title = {Finite identification of general recursive functions
by probabilistic strategies},
booktitle = {Fundamentals of Computations Theory, FCT' 79,
Proc. of the Conference on Algebraic, Arithmetic,
and Categorial Methods in Computation Theory},
year = 1979,
pages = {138--145},
address = {Berlin},
publisher = {Akademie-Verlag}
}
@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}
}
@INPROCEEDINGS{Freivalds90,
author = {R. Freivalds},
title = {Inductive inference of minimal programs},
booktitle = {Proc. 3rd Annu. Workshop on Comput. Learning Theory},
year = 1990,
pages = {3--20},
address = {San Mateo, CA},
publisher = {Morgan Kaufmann}
}
@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}
}
@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 = {Computational Learning Theory: EuroColt '95},
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 = {Proc. 7th Annu. ACM Conf. on Comput. Learning
Theory},
year = 1994,
pages = {190--197},
publisher = {ACM Press, New York, NY}
}
@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}
}
@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{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}
}
@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{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}
}
@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{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}
}
@INPROCEEDINGS{FreivaldsKiWi89,
author = {R. Freivalds and E. B. Kinber and R. Wiehagen},
title = {Inductive Inference From Good Examples},
booktitle = {Proc. of the Second International Workshop on
Analogical and Inductive Inference},
year = 1989,
pages = {1--17}
}
@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
}
@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}
}
@INPROCEEDINGS{FreivaldsSm92,
author = {Rusins Freivalds and Carl Smith},
title = {Memory Limited Inductive Inference Machines},
booktitle = {Proc. 3rd Scandinavian Workshop on Algorithm Theory,
SWAT '92},
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 = {Proc. 4th Int. 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}
}
@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{FreivaldsZe96,
author = {R. Freivalds and T. Zeugmann},
title = {Co--Learning of Recursive Languages from Positive
Data},
booktitle = {Proc.~Perspectives of System Informatics,'' Second
International Andrei Ershov Memorial Conference,
Akademgorodok, Novosibirsk, Russia, June 1996},
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{Freund90,
author = {Yoav Freund},
title = {Boosting a Weak Learning Algorithm by Majority},
booktitle = {Proceedings of the Third Annual Workshop on
ComputationalLearning Theory},
year = 1990,
pages = {202--216},
publisher = {Morgan Kaufmann}
}
@INPROCEEDINGS{Freund92,
author = {Yoav Freund},
title = {An Improved Boosting Algorithm and Its Implications
onLearning Complexity},
booktitle = {Proceedings of the Fifth Annual {ACM} Workshop on
ComputationalLearning Theory},
year = 1992,
pages = {391--398},
publisher = {{ACM} Press}
}
@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}
}
@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{Freund96,
author = {Yoav Freund},
title = {Predicting a binary sequence almost as well as the
optimal biased coin},
booktitle = {Proc. 9th Annu. Conf. on Comput. Learning Theory},
year = 1996,
pages = {89--98},
publisher = {ACM Press, New York, NY}
}
@INPROCEEDINGS{Freund98,
author = {Yoav Freund},
title = {Self bounding learning algorithms},
booktitle = {Proc. 11th Annu. Conf. on Comput. Learning Theory},
year = 1998,
pages = {247--258},
publisher = {ACM Press, New York, NY}
}
@INPROCEEDINGS{Freund99,
author = {Yoav Freund},
title = {An adaptive version of the boost by majority
algorithm},
booktitle = {Proc. 12th Annu. Conf. on Comput. Learning Theory},
year = 1999,
pages = {102--113},
publisher = {ACM Press, New York, NY}
}
@INPROCEEDINGS{FreundHa92,
author = {Y. Freund and D. Haussler},
title = {Unsupervised Learning of Distributions on Binary
Vectors Using Two layer Networks},
booktitle = {Proc. Advances In Neural Information Processing
Systems 5 (NIPS '92)},
year = 1992,
pages = {912--919}
}
@INPROCEEDINGS{FreundMa97,
author = {Yoav Freund and Yishay Mansour},
title = {Learning under persistent drift},
booktitle = {Computational Learning Theory: EuroColt '97},
year = 1997,
pages = {109--118},
publisher = {Springer-Verlag}
}
@INPROCEEDINGS{FreundMa99,
author = {Yoav Freund and Yishay Mansour},
title = {Estimating a mixture of two product distributions},
booktitle = {Proc. 12th Annu. Conf. on Comput. Learning Theory},
year = 1999,
pages = {53--62},
publisher = {ACM Press, New York, NY}
}
@INPROCEEDINGS{FreundMa99a,
author = {Yoav Freund and Llew Mason},
title = {The alternating decision tree learning algorithm,},
booktitle = {Proc. 16th International Conf. on Machine Learning},
year = 1999,
pages = {124--133},
publisher = {Morgan Kaufmann, San Francisco, CA}
}
@INPROCEEDINGS{FreundOp00,
author = {Yoav Freund and Manfred Opper},
title = {Continuous Drifting Games},
booktitle = {Proc. 13th Annu. Conference on Comput. Learning
Theory},
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 = {Proc. 8th Annu. Conf. on Comput. Learning Theory},
year = 1995,
pages = {41--50},
publisher = {ACM Press, New York, NY}
}
@INPROCEEDINGS{FreundSc96,
author = {Yoav Freund and Robert E. Schapire},
title = {Experiments with a new Boosting algorithm},
booktitle = {Proc. 13th International Conference on Machine
Learning},
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 = {Proc. 9th Annu. Conf. on Comput. Learning Theory},
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}
}
@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}
}
@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
}
@INPROCEEDINGS{Friedman97a,
author = {Nir Friedman},
title = {Learning belief networks in the presence of missing
values and hidden variables},
booktitle = {Proc. 14th International Conference on Machine
Learning},
year = 1997,
pages = {125--133},
publisher = {Morgan Kaufmann}
}
@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
}
@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{FriedmanGo96,
author = {N. Friedman and M. Goldszmidt },
title = {Builiding Classifiers using Bayesian Networks},
booktitle = {Proc. 13th National Conf. on Artificial
Intelligence},
year = 1996
}
@INPROCEEDINGS{FriedmanGo96a,
author = {Nir Friedman and Moises Goldszmidt},
title = {Discretizing continuous attributes while learning
{B}ayesian neworks},
booktitle = {Proc. 13th International Conference on Machine
Learning},
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 = {Proc. 15th International Conf. on Machine Learning},
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{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}
}
@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 = {Proc. 15th International Conf. on Machine Learning},
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}
}
@BOOK{Fu74,
title = {Syntactic Methods in Pattern Recognition},
publisher = {Academic Press, N. Y.},
year = 1974,
author = {K. S. Fu}
}
@BOOK{Fu77,
title = {Syntactic Pattern Recognition, Applications},
publisher = {Springer-Verlag, N.Y.},
year = 1977,
author = {K. S. Fu}
}
@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.}
}
@INPROCEEDINGS{Fuchs95,
author = {Matthias Fuchs},
title = {Learning proof heuristics by adapting parameters},
booktitle = {Proc. 12th International Conference on Machine
Learning},
year = 1995,
pages = {235--243},
publisher = {Morgan Kaufmann}
}
@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 = {Proc. 2nd Int. 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 = {Proc. 10th International Conference on Algorithmic
Learning Theory - ALT '99},
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}
}
@PHDTHESIS{Fulk85,
author = {M. Fulk},
title = {A Study of Inductive Inference machines},
school = {SUNY at Buffalo},
year = 1985
}
@ARTICLE{Fulk86,
author = {M. Fulk},
title = {The disjunctive Learning Problem},
journal = {20th Asilomar Conference on Signals, Systems and
Computers},
year = 1986,
pages = {343--345}
}
@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
}
@UNPUBLISHED{Fulk89,
author = {M. Fulk},
title = {Regressiveness},
note = {unpublished},
year = 1989
}
@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 = {Proc. of the 31st Symposium on the Foundations of
Comp. Sci.},
year = 1990,
pages = {405--410},
publisher = {IEEE Computer Society Press, Los Alamitos, CA}
}
@INPROCEEDINGS{FulkJa89,
author = {M. A. Fulk and S. Jain},
title = {Learning in the Presence of Inaccurate Information},
booktitle = {Proc. of the Second Annual Workshop on
Comput. Learning Theory, Santa Cruz, California},
year = 1989,
pages = {175--188},
month = aug,
publisher = {Morgan Kaufmann, Inc.},
annote = {Also University of Rochester TR 279 from 1989}
}
@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}
}
@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 = {Proc. 12th International Conference on Machine
Learning},
year = 1995,
pages = {244--251},
publisher = {Morgan Kaufmann}
}
@inproceedings{Fung-Wu:tmi:95,
author = {Pascale Fung and Dekai Wu},
title = {Coerced Markov Models for Cross-Lingual Lexical Tag
Relations},
booktitle = {TMI-95, Proceedings of the Sixth International
Conference on Theoretical and Methodological Issues
in Machine Translation},
month = Jul,
year = 1995,
address = {Leuven, Belgium},
volume = 1,
pages = {240--255}
}
@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 = "Proceedings of AMTA-94: Association of Machine
Translation in the Americas",
pages = "81--88",
year = 1994
)
@inproceedings(Fung94b,
author = "Pascale Fung and Ken Church",
title = "K-vec: a new approach for aligning parallel texts",
booktitle = "Coling",
year = 1994
)
@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 = {Proc. of the Third 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 = "Proc. of the Third Annual Workshop on Very Large
Corpora",
pages = "173--183",
year = 1995
)
@INPROCEEDINGS{Fung96,
author = {Pascale Fung},
title = {Domain Word Translation by Space-Frequency Analysis
of Context Length Histograms},
booktitle = {Proc. of ICASSP: International Conference on
Acoustics, Signal and Speech Processing},
year = 1996,
volume = {I},
pages = {184--187}
}
@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
)
@INPROCEEDINGS{FungCh94,
author = {Pascale Fung and Ken Church},
title = {K-vec: a new approach for aligning parallel texts},
booktitle = {Coling},
year = 1994
}
@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 = {Proceedings of AMTA-94: Association of Machine
Translation in the Americas},
year = 1994,
pages = {81--88}
}
@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{FungWu95,
author = {Pascale Fung and Dekai Wu},
title = {Coerced Markov Models for Cross-Lingual Lexical Tag
Relations},
booktitle = {TMI-95, Proceedings of the Sixth International
Conference on Theoretical and Methodological Issues
in Machine Translation},
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{FurnkranzWi94,
author = {Johannes F{\"u}rnkranz and Gerhard Widmer},
title = {Incremental reduced error pruning},
booktitle = {Proc. 11th International Conference on Machine
Learning},
year = 1994,
pages = {70--77},
publisher = {Morgan Kaufmann}
}
@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{FurstJaSm91,
author = {Merrick Furst and Jeffrey Jackson and Sean Smith},
title = {Improved Learning of {$AC^0$} Functions},
booktitle = {Proceedings of the Fourth Annual Workshop
onComputational Learning Theory},
year = 1991,
pages = {317--325},
address = {Santa Cruz, California},
month = Aug
}
@INPROCEEDINGS{Furukawa92,
author = {K. Furukawa},
title = {Preliminary study on program synthesis based on
induction and verification},
booktitle = {Proc. 2nd Int. 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 = {Proc. 2nd Int. Workshop on Algorithmic Learning
Theory},
year = 1992,
pages = {207--212},
publisher = {IOS Press}
}
@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 = {Proc. 15th International Conf. on Machine Learning},
year = 1998,
pages = {197--205},
publisher = {Morgan Kaufmann, San Francisco, CA}
}
@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{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{GBSW99,
author = {Ying Guo and Peter L. Bartlett and John Shawe-Taylor
and Robert C. Williamson},
title = {Covering numbers for support vector machines},
booktitle = {Proc. 12th Annu. Conf. on Comput. Learning Theory},
year = 1999,
pages = {267--277},
publisher = {ACM Press, New York, NY}
}
@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{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 = {Proceedings of TAC 2008. To appear},
year = 2009
}
@INPROCEEDINGS{GFKT01,
author = {Lise Getoor and Nir Friedman and Daphne Koller and
Benjamin Taskar},
title = {Learning Probabilistic Models of Relational
Structure},
booktitle = {Proc. 18th International Conf. on Machine Learning},
year = 2001,
pages = {170--177},
publisher = {Morgan Kaufmann, San Francisco, CA},
url = {citeseer.ist.psu.edu/article/getoor01learning.html}
}
@article(GGGL99,
author = "J. Gillette and H. Gleitman and L. R. Gleitman and
A. Lederer",
title = "Human simulations of vocabulary learning",
year = 1999,
journal = "Cognition",
volume = 73,
pages = "135-176"
)
@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}
}
@article(GGMO96,
author = "L. R. Gleitman and H. Gleitman and C. Miller and
R. Ostrin",
year = 1996,
title = "Similar, and similar predicates",
journal = "Cognition",
volume = 58,
pages = "321-376"
)
@inproceedings{GGOFBM04,
title = {Support Vector Machines Applied to the
Classification of Semantic Relations in Nominalized
Noun Phrases},
author = {Girju, R. and Giuglea, A.M. and Olteanu, M. and
Fortu, O. and Bolohan, O. and Moldovan, D.},
booktitle = {the Proceedings of the HLT/NAACL Workshop on
Computational Lexical Semantics},
year = 2004
}
@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{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 = {Proc. of Second Int. Conf. on Intelligent Systems
for Molecular Biology},
year = 1994,
pages = {138--146},
address = {Menlo Park, CA},
month = aug,
publisher = {AAAI/MIT Press}
}
@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{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{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{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{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}
}
@INPROCEEDINGS{GPPS06,
title = {A {S}calable {A}lgorithm for {H}igh-{Q}uality
{C}lustering of {W}eb {S}nippets},
author = {Filippo Geraci and Marco Pellegrini and Paolo Pisati
and Fabrizio Sebestiani},
booktitle = {SAC},
year = 2006,
pages = {1058--1062}
}
@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}
}
@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}
}
@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{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{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 = {Proc. 13th Annu. Conference on Comput. Learning
Theory},
year = 2000,
pages = {236--247},
publisher = {Morgan Kaufmann, San Francisco}
}
@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{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{GabrilovichMa05,
author = {Evgeniy Gabrilovich and Shaul Markovitch},
title = {Feature Generation for Text Categorization Using
World Knowledge},
booktitle = IJCAI,
year = 2005,
pages = {1048--1053}
}
@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{GabrilovichMa07,
author = {Evgeniy Gabrilovich and Shaul Markovitch},
title = {Computing Semantic Relatedness using Wikipedia-based
Explicit Semantic Analysis},
booktitle = IJCAI,
year = 2007,
pages = {1606--1611}
}
@inproceedings{GabrilovichMarkovitch07,
author = "E. Gabrilovich and S. Markovitch",
title = "Computing Semantic Relatedness Using Wikipeida-based
Explicit Semantic Analysis",
booktitle = IJCAI,
year = 2007,
}
@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 = {Proceedings of the 12th International Conference on
Inductive Logic Programming},
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}
}
@inproceedings(Gale91,
author = "William Gale and Kenneth Church",
title = "Identifying word correspondence in parallel text",
booktitle = DARPA,
year = 1991
)
@article{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(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 = "Proc. of the Seventh Annual Conference of the UW
Center for the New OED and Text Research, Using
Corpora",
pages = "40--62",
year = 1991
)
@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",
pages = "54--60",
year = 1992
)
@inproceedings(Gale92c,
author = "W. Gale and K. Church and D. Yarowsky",
title = "Using bilingual materials to develop word sense
disambiguation methods",
booktitle = TMI,
pages = "101--112",
year = 1992
)
@article(Gale93,
author = "William Gale and Kenneth Church",
title = "A program for aligning sentences in bilingual
corpora",
journal = CL,
volume = 19,
number = 1,
pages = "75--102",
year = 1993
)
@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 = {Proc. of the 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{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
}
@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,
number = "5-6",
pages = "415-439",
}
@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{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(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",
volume = 26,
pages = "415--439",
year = 1993
)
@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{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;}
}
@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;}
}
@INPROCEEDINGS{Galperin96,
author = {Igal Galperin},
title = {Analysis of greedy expert hiring and an application
to memory-based learning},
booktitle = {Proc. 9th Annu. Conf. on Comput. Learning Theory},
year = 1996,
pages = {217--223},
publisher = {ACM Press, New York, NY}
}
@INPROCEEDINGS{GalperinRi93,
author = {Galperin, Igal and Ronald L. Rivest},
title = {Scapegoat Trees},
booktitle = {Proceedings of SODA '93},
year = 1993,
pages = {to appear},
month = Jan
}
@INPROCEEDINGS{Gama97,
author = {Jo{\~a}o Gama},
title = {Probabilistic linear tree},
booktitle = {Proc. 14th International Conference on Machine
Learning},
year = 1997,
pages = {134--142},
publisher = {Morgan Kaufmann}
}
@INPROCEEDINGS{Gama98,
author = {Jo{\~a}o Gama},
title = {Local cascade generalization},
booktitle = {Proc. 15th International Conf. on Machine Learning},
year = 1998,
pages = {206--214},
publisher = {Morgan Kaufmann, San Francisco, CA}
}
@INPROCEEDINGS{Gama99,
author = {Jo{\~a}o Gama},
title = {Discriminant trees},
booktitle = {Proc. 16th International Conf. on Machine Learning},
year = 1999,
pages = {134--142},
publisher = {Morgan Kaufmann, San Francisco, CA}
}
@INPROCEEDINGS{Gamarnik98,
author = {David Gamarnik},
title = {Efficient learning of monotone concepts via
quadratic optimization},
booktitle = {Proc. 11th Annu. Conf. on Comput. Learning Theory},
year = 1998,
pages = {134--143},
publisher = {ACM Press, New York, NY}
}
@INPROCEEDINGS{Gamarnik99,
author = {David Gamarnik},
title = {Extension of the {PAC} framework to finite and
countable {M}arkov chains},
booktitle = {Proc. 12th Annu. Conf. on Comput. Learning Theory},
year = 1999,
pages = {308--317},
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 = {Proc. 12th International Conference on Machine
Learning},
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 = {Algorithmic Learning Theory: ALT '96},
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 = {Proc. 16th International Conf. on Machine Learning},
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 = {Proc. 4th Int. Workshop on Algorithmic Learning
Theory},
year = 1993,
volume = 744,
series = {Lecture Notes in Artificial Intelligence},
pages = {398--409},
publisher = {Springer-Verlag}
}
@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 = {Proc. 11th International Joint Conference on
Artificial Intellige nce},
year = 1989,
pages = {843--848},
publisher = {Morgan Kaufmann}
}
@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{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 = {Proc. 15th International Conf. on Machine Learning},
year = 1998,
pages = {215--223},
publisher = {Morgan Kaufmann, San Francisco, CA}
}
@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}
}
@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,
editor = "Roger Garside and Geoffrey Leech and Geoffrey
Sampson",
title = "The Computational Analysis of English -- A Corpus
Based Approach",
publisher = "Longman",
year = 1987
)
@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}
}
@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}
}
@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}
}
@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{GasarchHi95,
author = {William Gasarch and Geoffrey R. Hird},
title = {Reductions for learning via queries},
booktitle = {Proc. 8th Annu. Conf. on Comput. Learning Theory},
year = 1995,
pages = {152--161},
publisher = {ACM Press, New York, NY}
}
@INPROCEEDINGS{GasarchLe97,
author = {William I. Gasarch and Andrew C. Y. Lee},
title = {Inferring Answers to Queries},
booktitle = {Proc. 10th Annu. Conf. on Comput. Learning Theory},
year = 1997,
pages = {275--284},
publisher = {ACM Press, New York, NY}
}
@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}
}
@INPROCEEDINGS{GasarchPlVe94,
author = {W. I. Gasarch and M. G. Pleszkoch and
M. Velauthapillai},
title = {Classification using information},
booktitle = {Proc. 5th Int. Workshop on Algorithmic Learning
Theory},
year = 1994,
pages = {290--300},
publisher = {Springer-Verlag}
}
@INPROCEEDINGS{GasarchSm86,
author = {W. I. Gasarch and C. H. Smith},
title = {On the Inference of Sequences of Functions},
booktitle = {Proc. 1st 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 = {Proceedings of the 2007 Joint Conference of
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 = {Proceedings of ALLC/ACH Conference},
year = 1992
}
@INPROCEEDINGS{Gavald`a94,
author = {R. Gavald{\`a}},
title = {On the Power of Equivalence Queries},
booktitle = {Computational Learning Theory: EuroColt '93},
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 = {Proc. 6th Int. 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}
}
@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 = {European Conference on Artificial Intelligence},
year = 1996,
pages = {428-432}
}
@INPROCEEDINGS{GeibelWy96a,
author = {Peter Geibel and Fritz Wysotzki},
title = {Learning relational concepts with decision trees},
booktitle = {Proc. 13th International Conference on Machine
Learning},
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}
}
@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.}
}
@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{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 = {Proc. 11th Annu. Conf. on Comput. Learning Theory},
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 = {Proc. 12th Annu. Conf. on Comput. Learning Theory},
year = 1999,
pages = {1--11},
publisher = {ACM Press, New York, NY}
}
@incollection(GentnerBo01,
author = "D. Gentner and L. Boroditsky",
year = 2001,
title = "Individuation, relativity and early word learning",
editor = "M. Bowerman and S. C. Levinson",
booktitle = "Language acquisition and conceptual development",
pages = "215-256",
address = "New York",
publisher = "Cambridge University Press"
)
@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.}
}
@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.}
}
@INCOLLECTION{GeorgeffWa84,
author = {M. P. Georgeff and C. S. Wallace},
title = {A General Selection Criterion for Inductive
Inference},
booktitle = {ECAI 84: Advances in Artificial Intelligence},
publisher = {Elsevier Science},
year = 1984,
pages = {473--482}
}
@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;}
}
@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.",
year = 2006,
booktitle = "31st Annual Boston University Conference on Language
Development"
)
@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",
year = 2006,
journal = "Psychological Science",
volume = 17,
pages = "684-691"
)
@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}
}
@INPROCEEDINGS{GervasioDe94,
author = {Melinda T. Gervasio and Gerald F. De{J}ong},
title = {An incremental learning approach for completable
planning},
booktitle = {Proc. 11th International Conference on Machine
Learning},
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 = {Proc. 16th International Conf. on Machine Learning},
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}
}
@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 = {Proc. Canadian Inform. Process. Soc. Congress},
year = 1987
}
@InProceedings{GiampiccoloBeDaDo07,
author = {Giampiccolo, D. and Magnini, B. and Dagan, I. and
Dolan, B.},
title = {The Third PASCAL Recognizing Textual Entailment
Challenge},
booktitle = {Proceedings of the ACL-PASCAL Workshop on Textual
Entailment and Paraphrasing},
month = {June},
year = 2007,
address = {Prague},
pages = {1--9},
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 = {Proceedings of the ACL-PASCAL Workshop on Textual
Entailment and Paraphrasing},
month = {June},
year = 2007,
address = {Prague},
publisher = {Association for Computational Linguistics},
pages = {1--9},
url = {http://www.aclweb.org/anthology/W/W07/W07-1401}
}
@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",
}
@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{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 = {Proceedings of the Third Annual Conference on
Architectural Support for Programming Languages and
Operating Systems (ASPLOS III)},
year = 1989,
note = {(To appear)}
}
@INPROCEEDINGS{Gil94,
author = {Yolanda Gil},
title = {Learning by experimentation: incremental refinement
of incomplete planning domains},
booktitle = {Proc. 11th International Conference on Machine
Learning},
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 = {Proc. Int. Conf. Robot. Auto.},
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,
number = 3,
pages = "245-288",
month = "September",
}
@INPROCEEDINGS{GildeaJu02a,
author = {D. Gildea and D. Jurafsky},
title = {Automatic labeling of semantic roles},
booktitle = {Computational Linguistics 28(3)},
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}
}
@UNPUBLISHED{GillmanSi91,
author = {Gillman, D. and M. Sipser},
title = {Colored Markov Chains},
note = {Unpublished Manuscript},
year = 1992
}
@INPROCEEDINGS{GillmanSi94,
author = {D. Gillman and M. Sipser},
title = {Inference and minimization of hidden {M}arkov
chains},
booktitle = {Proc. 7th Annu. ACM Conf. on Comput. Learning
Theory},
year = 1994,
pages = {147--158},
publisher = {ACM Press, New York, NY}
}
@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 = {Proc. 16th International Conf. on Machine Learning},
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 = {Proc. 11th International Conference on Machine
Learning},
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 = {Proc. 2nd International Colloquium on Grammatical
Inference - ICGI '94},
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}
}
@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 = {Proceedings of the 2007 Joint Conference of
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",
year = 1990,
journal = "Language Acquisition",
volume = 1,
pages = "3-55"
)
@inproceedings{GlickmanDaKo05,
author = {O. Glickman and I. Dagan and M. Koppel},
title = {A Probabilistic Classification Approach for Lexical
Textual Entailment},
year = 2005,
booktitle = {Proceedings of AAAI 2005}
}
@INPROCEEDINGS{GlobigLa94,
author = {C. Globig and S. Lange},
title = {On Case-Based Representability and Learnability of
Languages},
booktitle = {Proc. 4th Internat. Workshop on Analogical and
Inductive Inference},
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 = {Proc. 13th International Conference on Machine
Learning},
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,
pages = "205--211",
year = 1988
)
@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{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
}
@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{Gold71,
author = {E. M. Gold},
title = {Universal Goal Seekers},
journal = {Inform. Control},
year = 1971,
volume = 18,
pages = {395--403}
}
@ARTICLE{Gold72,
author = {Gold, E. Mark},
title = {System Identification via State Characterization},
journal = {Automatica},
year = 1972,
volume = 8,
pages = {621--636}
}
@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.}
}
@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}
}
@BOOK{Goldberg89,
title = {Genetic Algorithms in Search, Optimization, and
Machine Learning},
publisher = {Addison-Wesley},
year = 1989,
author = {D. E. Goldberg}
}
@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}
}
@INPROCEEDINGS{Goldberg99,
author = {Paul W. Goldberg},
title = {Learning fixed-dimension linear thresholds from
fragmented data},
booktitle = {Proc. 12th Annu. Conf. on Comput. Learning Theory},
year = 1999,
pages = {88--99},
publisher = {ACM Press, New York, NY}
}
@INPROCEEDINGS{GoldbergCh01,
author = {K.~Goldberg and B.~Chen},
title = {Collaborative control of robot motion: Robustness to
error},
booktitle = {Int. Conf. Intell. Robots Sys.},
year = 2001,
url =
{http://www.ieor.berkeley.edu/~goldberg/pubs/robust-iros01.pdf}
}
@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{GoldbergGo94,
author = {P. W. Goldberg and S. A. Goldman},
title = {Learning one-dimensional geometric patterns under
one-sided random misclassification noise},
booktitle = {Proc. 7th Annu. ACM Conf. on Comput. Learning
Theory},
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 = {Proc. 7th Annu. ACM Conf. on Comput. Learning
Theory},
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}
}
@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 = {Proc. 9th Annu. Conf. on Comput. Learning Theory},
year = 1996,
pages = {2--9},
publisher = {ACM Press, New York, NY}
}
@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}
}
@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{GoldbergKw00,
author = {Paul Goldberg and Stephen Kwek},
title = {The Precision of Query Points as a Resource for
Learning Convex Polytopes with Membership Queries},
booktitle = {Proc. 13th Annu. Conference on Comput. Learning
Theory},
year = 2000,
pages = {225--235},
publisher = {Morgan Kaufmann, San Francisco}
}
@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; }
}
@INPROCEEDINGS{Golding95,
author = {A. R. Golding},
title = {A {B}ayesian hybrid method for context-sensitive
spelling correction},
booktitle = {Proceedings of the 3rd workshop on very large
corpora, ACL-95},
year = 1995,
comment = {good description of other techniques for
context-sensitive spell ing}
}
@InProceedings{GoldingSc96,
Author = "A. R. Golding and Y. Schabes",
BookTitle = "Proc. 34th Annual Meeting of the Association for
Computational Linguistics",
Title = "Combining trigram-based and feature-based methods
for context-sensitive spelling correction",
Year = 1996,
address = "Santa Cruz, CA"
}
@MASTERSTHESIS{Goldman87,
author = {Sally A. Goldman},
title = {Efficient Methods for Calculating Maximum Entropy
Distributions},
school = {MIT EECS Department},
year = 1987,
month = May
}
@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
}
@INPROCEEDINGS{GoldmanKe91,
author = {Goldman, Sally A. and Kearns, Michael J.},
title = {On the Complexity of teaching},
booktitle = {Proceedings of COLT '91},
year = 1991,
pages = {303--314},
publisher = {Morgan Kaufmann}
}
@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{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 = {Proceedings of the 31st Symposium on Foundations of
Computer Science},
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 = {Proc. 3rd Annu. Workshop on Comput. Learning Theory},
year = 1990,
pages = {217--231},
address = {San Mateo, CA},
publisher = {Morgan Kaufmann},
note = {To appear, {\em Information and Computation}}
}
@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{GoldmanKw99,
author = {Sally A. Goldman and Stephen S. Kwek},
title = {On Learning Unions of Pattern Languages and Tree
Patterns},
booktitle = {Proc. 10th International Conference on Algorithmic
Learning Theory - ALT '99},
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 = {Proc. 10th Annu. Conf. on Comput. Learning Theory},
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 = {Proc. 10th Annu. Conf. on Comput. Learning Theory},
year = 1997,
pages = {231--242},
publisher = {ACM Press, New York, NY}
}
@INPROCEEDINGS{GoldmanMa92,
author = {S. A. Goldman and H. D. Mathias},
title = {Learning k-term {DNF} formulas with an incomplete
membership oracle},
booktitle = {Proc. 5th Annu. Workshop on Comput. Learning Theory},
year = 1992,
pages = {77--84},
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}
}
@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 = {Uncertainty in Artificial Intelligence},
publisher = {Elsevier Science B.V. North-Holland},
year = 1988,
volume = 2,
pages = {133--148}
}
@INPROCEEDINGS{GoldmanRiSc89,
author = {Goldman, Sally and Ronald L. Rivest and Robert
E. Schapire},
title = {Learning Binary Relations and Total Orders},
booktitle = {Proceeding of the 30th IEEE Symposium on the
Foundations of Computer Science},
year = 1989,
pages = {46--51},
address = {Research Triangle Park, NC},
month = Oct,
publisher = {IEEE Computer Society Press},
tag = {TOC-display}
}
@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}
}
@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
}
@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{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
}
@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{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}
}
@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; }
}
@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
}
@INPROCEEDINGS{GoldreichRuSu95,
author = {Oded Goldreich and Ronitt Rubinfeld and Madhu Sudan},
title = {Learning polynomials with queries: the highly noisy
case},
booktitle = {Proc. of the 36th Annual Symposium on Foundations of
Computer Science},
year = 1995,
pages = {294--303},
publisher = {IEEE Computer Society Press, Los Alamitos, CA}
}
@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}
}
@INPROCEEDINGS{Golea95,
author = {Mostefa Golea},
title = {Average case analysis of a learning algorithm for
{$\mu$-DNF} expressions},
booktitle = {Computational Learning Theory: EuroColt '95},
year = 1995,
pages = {342--356},
publisher = {Springer-Verlag}
}
@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{GoleaMa93,
author = {M. Golea and M. Marchand},
title = {Average case analysis of the clipped {H}ebb rule for
nonoverlapping perceptron networks},
booktitle = {Proc. 6th Annu. Conf. on Comput. Learning Theory},
year = 1993,
pages = {151--157},
publisher = {ACM Press, New York, NY}
}
@INPROCEEDINGS{GoleaMa94,
author = {M. Golea and M. Marchand},
title = {On Learning Simple Deterministic and Probabilistic
Neural Concepts},
booktitle = {Computational Learning Theory: EuroColt '93},
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}
}
@BOOK{GolesMa90,
title = {Neural and automata networks},
publisher = {Kluwer academic publishers},
year = 1990,
author = {Goles, E. and Martinez, S.},
comment = {QA267.5.c45g65, Cabot}
}
@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}
}
@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{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{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}
}
@ARTICLE{Good59,
author = {Good, I. J.},
title = {Kinds of Probability},
journal = {Science},
year = 1959,
volume = 129,
pages = {443--447},
number = 3347,
month = Feb
}
@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.}
}
@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.}
}
@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}
}
@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}
}
@INPROCEEDINGS{Gordon95,
author = {Geoffrey J. Gordon},
title = {Stable function approximation in dynamic
programming},
booktitle = {Proc. 12th International Conference on Machine
Learning},
year = 1995,
pages = {261--268},
publisher = {Morgan Kaufmann}
}
@INPROCEEDINGS{Gordon98,
author = {Diana F. Gordon},
title = {Well-behaved {B}orgs, {B}olos, and {B}erserkers},
booktitle = {Proc. 15th International Conf. on Machine Learning},
year = 1998,
pages = {224--232},
publisher = {Morgan Kaufmann, San Francisco, CA}
}
@INPROCEEDINGS{Gordon99,
author = {Geoffrey J. Gordon},
title = {Regret bounds for prediction problems},
booktitle = {Proc. 12th Annu. Conf. on Comput. Learning Theory},
year = 1999,
pages = {29--40},
publisher = {ACM Press, New York, NY}
}
@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}
}
@INPROCEEDINGS{GordonSe96,
author = {Geoffrey J. Gordon and Alberto Maria Segre},
title = {Nonparametric statistical methods for experimental
evaluations of speedup learning},
booktitle = {Proc. 13th International Conference on Machine
Learning},
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.}
}
@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}
}
@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 = {Proc. 1st International Workshop on Analogical and
Inductive Inference},
year = 1986,
volume = 265,
series = {Lecture Notes in Computer Science},
pages = {55--60},
publisher = {Springer-Verlag}
}
@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{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}
}
@INPROCEEDINGS{GrafSaTs89,
author = {H. P. Graf and S. Satyanarayana and Y. Tsividis},
title = {A Reconfigurable Analog ({VLSI} Neural Network Chip},
booktitle = {Proc. 1989 Neural Information Processing Conference},
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{GreenPeDoRe01,
AUTHOR = "R. Green and L. Pearl and B. J. Dorr and P. Resnik",
TITLE = "Lexical Resource Integration Across the
Syntax-Semantics Interface",
BOOKTITLE = "Proceedings of WordNet and Other Lexical Resources
Workshop, NAACL",
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}
}
@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}
}
@INPROCEEDINGS{GreeneYa86,
author = {D. H. Greene and F. F. Yao},
title = {Finite-resolution computational geometry},
booktitle = FOCS,
year = 1986,
pages = {143--152}
}
@BOOK{Greengard88,
title = {The rapid evaluation of potential fields in particle
systems},
publisher = {MIT Press},
year = 1988,
author = {L. Greengard},
address = {Cambridge}
}
@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}
}
@INPROCEEDINGS{Grefenstette93,
author = {J. Grefenstette},
title = {Genetic algorithms and machine learning},
booktitle = {Proc. 6th Annu. Conf. on Comput. Learning Theory},
year = 1993,
pages = {3--4},
publisher = {ACM Press, New York, NY}
}
@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{GrefenstetteTe95,
author = {G. Grefenstette and S. Teufel},
title = {Corpus-based method for automatic identification of
support verbs for nominalizations},
booktitle = {In EACL-95},
year = 1995,
pages = {27--31}
}
@INPROCEEDINGS{Greffenstette93,
author = {G. Greffenstette},
title = {Evaluation techniques for automatic semantic
extraction: comparing semantic and window based
approaches},
booktitle = {ACL'93 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
}
@INPROCEEDINGS{Greiner92,
author = {Russell Greiner},
title = {Probabilistic Hill-Climbing: Theory and
Applications},
booktitle = {Proc. of the Ninth Canadian Conference on Artificial
Intelligence},
year = 1992,
pages = {60--67},
address = {Vancouver},
month = jun,
publisher = {Morgan Kaufmann},
note = {(Awarded ``AIJ Best Paper Prize'')}
}
@INPROCEEDINGS{Greiner95,
author = {Russell Greiner},
title = {The challenge of revising an impure theory},
booktitle = {Proc. 12th International Conference on Machine
Learning},
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}
}
@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{GreinerGrKo96,
author = {Russell Greiner and Adam J. Grove and Alexander
Kogan},
title = {Exploiting the omission of irrelevant data},
booktitle = {Proc. 13th International Conference on Machine
Learning},
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 = {Proc. AAAI-92},
year = 1992,
address = {San Jose}
}
@INPROCEEDINGS{GreinerOr91,
author = {Russell Greiner and Pekka Orponen},
title = {Probably Approximately Optimal Derivation
Strategies},
booktitle = {Proc. of the Second 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
}
@INPROCEEDINGS{GreinerSc92,
author = {Russell Greiner and Dale Schuurmans},
title = {Learning useful {H}orn approximations},
booktitle = {Proc. of the Third International Joint Conference on
Knowledge Representation},
year = 1992,
address = {Cambridge, MA},
month = oct
}
@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{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}
}
@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{Grieser96,
author = {Gunter Grieser},
title = {Reflecting inductive inference machines and its
improvement by therapy},
booktitle = {Algorithmic Learning Theory: ALT '96},
year = 1996,
volume = 1160,
series = {Lecture Notes in Artificial Intelligence},
pages = {325--336},
publisher = {Springer-Verlag}
}
@INPROCEEDINGS{GrieserJaLa98,
author = {Gunter Grieser and Klaus P. Jantke and Steffen
Lange},
title = {Characterizing Sufficient Expertise for Learning
System Validation},
booktitle = {Proc. 11th International Florida Artificial
Intelligence Research Symposium Conference - FLAIRS
'98},
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 = {Proc. 9th International Conference on Algorithmic
Learning Theory - ALT '98},
year = 1998,
volume = 1501,
series = {Lecture Notes in Artificial Intelligence},
pages = {409--423},
publisher = {Springer-Verlag}
}
@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}
}
@BOOK{Grishman86,
title = {Computational Linguistics -- An Introduction},
publisher = Cambridge,
year = 1986,
author = {Ralph Grishman}
}
@BOOK{Grishman86c,
title = {Analyzing Language in Restricted Domains:
Sublanguage Description and Processing},
publisher = {Lawrence Erlbaum Associates},
year = 1986,
editor = {R. Grishman and R. Kittredge}
}
@INCOLLECTION{Grishman95,
author = {R. Grishman},
title = {The {NYU} system for {MUC-6} or where's syntax?},
booktitle = {Proceedings of the Sixth Message Understanding
Conference},
publisher = {Morgan Kaufmann Publishers},
year = 1995,
editor = {Sundheim, B.}
}
@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{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}
}
@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{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}
}
@INPROCEEDINGS{GrolimundGa96,
author = {Stephan Grolimund and Jean-Gabriel Ganascia},
title = {Speeding-up nearest neighbour memories: the template
tree case memory organisation},
booktitle = {Proc. 13th International Conference on Machine
Learning},
year = 1996,
pages = {225--233},
publisher = {Morgan Kaufmann}
}
@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{GroveHaKo92a,
author = {Grove, Adam and Joseph Y. Halpern and Daphne Koller},
title = {Asymptotic conditional probabilities for first-order
logic},
booktitle = {24th STOC},
year = 1992
}
@INPROCEEDINGS{GroveHaKo92b,
author = {Grove, Adam and Joseph Y. Halpern and Daphne Koller},
title = {Random Worlds and Maximum Entropy},
booktitle = {7th IEEE Symposium on Logic in Compute Science},
year = 1992
}
@INPROCEEDINGS{GroveLiSc97,
author = {Adam J. Grove and Nick Littlestone and Dale
Schuurmans},
title = {General Convergence Results for Linear Discriminant
Updates},
booktitle = {Proc. 10th Annu. Conf. on Comput. Learning Theory},
year = 1997,
pages = {171--183},
publisher = {ACM Press, New York, NY}
}
@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}
}
@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
}
@INPROCEEDINGS{Grunwald99,
author = {Peter Gr{\"u}nwald},
title = {Viewing all models as `probabilistic'},
booktitle = {Proc. 12th Annu. Conf. on Comput. Learning Theory},
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{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}
}
@INPROCEEDINGS{GuijarroLaRa97,
author = {David Guijarro and Victor Lavin and Vijay Raghavan},
title = {Learning monotone term decision lists},
booktitle = {Computational Learning Theory: EuroColt '97},
year = 1997,
pages = {16--26},
publisher = {Springer-Verlag}
}
@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
}
@article{GunettiPi05,
author = {D. Gunetti and C. Picardi},
title = {Keystroke Analysis of Free Text.},
journal = {ACM Transactions on Information and System Security},
year = 2005
}
@INPROCEEDINGS{GuoWaGe07,
author = {Guo, Yuqing and Wang, Haifeng and van Genabith,
Josef},
title = {Recovering Non-Local Dependencies for {C}hinese},
booktitle = {Proceedings of the 2007 Joint Conference of
EMNLP-CoNLL},
year = 2007,
pages = {257--266},
url = {http://www.aclweb.org/anthology/D/D07/D07-1027}
}
@article(Gupta92,
author = "V. Gupta and M. Lennig and P. Mermelstein",
title = "A language model for very large-vocabulary speech
recognition",
journal = CSL,
volume = 6,
pages = "331--344",
year = 1992
)
@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}
}
@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{GuptaKo04,
author = {R. Gupta and M. Kochenderfer},
title = {Common Sense Data Acquisition for Indoor Mobile
Robots},
booktitle = AAAI,
year = 2004
}
@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 = {Proc. 12th Annu. Conf. on Comput. Learning Theory},
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 = {Computational Learning Theory: EuroColt '97},
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 = {Algorithmic Learning Theory: ALT '97},
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 = {Proc. ACM SIGMOD Conf. Principles Database Systems},
year = 1984,
pages = {47--57},
annote = {{564}}
}
@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{GyorgiTi90,
author = {G{'e}za {Gy\"orgi} and Naftali Tishby},
title = {Statistical Theory of Learning a Rule},
booktitle = {Proc. of the STATPHYS-17 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; }
}
@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{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{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 = {Proceedings of the 2007 Joint Conference of
EMNLP-CoNLL},
year = 2007,
pages = {267--276},
url = {http://www.aclweb.org/anthology/D/D07/D07-1028}
}
@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,
isbn = {978-1-60558-205-4},
location = {Helsinki, Finland},
doi = {http://doi.acm.org/10.1145/1390156.1390208},
publisher = {ACM},
address = {New York, NY, USA},
}
@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{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{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}
}
@INPROCEEDINGS{HGHLR01,
author = {E. Hovy and L. Gerber and U. Hermjakob and C. Lin
and D. Ravichandran},
title = {Toward Semantics-Based Answer Pinpointing},
booktitle = {Proceedings of the DARPA Human Language Technology
conference (HLT). San Diego, CA},
year = 2001
}
@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{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 = {Proceedings of the 2007 Joint Conference of
EMNLP-CoNLL},
year = 2007,
pages = {1084--1092},
url = {http://www.aclweb.org/anthology/D/D07/D07-1116}
}
@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
}
@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{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/}
}
@INPROCEEDINGS{HKST94,
author = {D. Haussler and M. Kearns and H. S. Seung and
N. Tishby},
title = {Rigorous learning curve bounds from statistical
mechanics},
booktitle = {Proc. 7th Annu. ACM Conf. on Comput. Learning
Theory},
year = 1994,
pages = {76--87}
}
@inproceedings{HL00,
author = "L. Hirschman and M. Light and E. Breck and
J. Burger",
title = "Deep Read: A Reading Comprehension System",
booktitle = {Proceedings of the 37th Annual Meeting of the
Association for Computational Linguistics},
year = 1999
}
@INPROCEEDINGS{HLBB99,
author = {L. Hirschman and M. Light and E. Breck and
J. Burger},
title = {Deep Read: A Reading Comprehension System},
booktitle = {Proceedings of the 37th Annual Meeting of the
Association for Computational Linguistics},
year = 1999
}
@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 = {Proceedings of the 9th Text Retrieval Conference,
NIST},
year = 2001
}
@INPROCEEDINGS{HMST98,
author = {Yosuke Hayashi and Satoshi Matsumoto and Ayumi
Shinohara and Masayuki Takeda},
title = {Uniform Characterizations of polynomial-query
learnabilities},
booktitle = {Proc. 1st International Conference on Discovery
Science},
year = 1998,
volume = 1532,
series = {Lecture Notes in Artificial Intelligence},
pages = {84--92},
publisher = {Springer-Verlag}
}
@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 = {Proceedings of the CoNLL Shared Task Session of
EMNLP-CoNLL 2007},
year = 2007,
pages = {933--939},
url = {http://www.aclweb.org/anthology/D/D07/D07-1097}
}
@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{HPRW95,
author = {Lisa Hellerstein and Krishnan Pillaipakkamnatt and
Vijay Raghavan and Dawn Wilkins},
title = {How many queries are needed to learn?},
booktitle = {Proc. 27th Annual ACM Symposium on Theory of
Computing},
year = 1995,
pages = {190--199},
publisher = {ACM Press, New York, NY}
}
@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}
}
@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}
}
@inproceedings{HSME88,
AUTHOR = {J. R. Hobbs and M. Stickel and P. Martin and
D. Edwards},
TITLE = {Interpretation as Abduction},
YEAR = 1988,
BOOKTITLE = "Proceedings of the 26th Annual Meeting of the
Association for Computational Linguistics (ACL)",
PAGES = {95-103},
KEYWORDS = {n-l-p, ling}
}
@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}
}
@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 = {Proc. 13th International Conference on Machine
Learning},
year = 1996,
pages = {243--251},
publisher = {Morgan Kaufmann}
}
@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}
}
@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}
}
@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{Haddawy94,
author = {P. Haddawy},
title = {Generating {Bayesian} Networks From Probability
Logic Knowledge Bases},
booktitle = {Uncertainty In Artificial Intelligence 10 (UAI94)},
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{HaghighiKl06,
author = {A. Haghighi and D. Klein},
title = { Prototype-driven Learning for Sequence Models},
booktitle = {Proc. of HTL-NAACL},
year = 2006
}
@INPROCEEDINGS{HaghighiKl06a,
author = {A. Haghighi and D. Klein},
title = {Prototype-Driven Grammar Induction},
booktitle = ACL,
year = 2006
}
@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{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}
}
@inproceedings{HaghighiNgMa05,
author = {A. Haghighi and A. Ng and C. Manning},
title = {Robust Textual Inference via Graph Matching},
year = 2005,
booktitle = {Proceedings of HLT 2005}
}
@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
}
@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}
}
@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}
}
@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}
}
@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}
}
@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 = {Proceedings of the CoNLL Shared Task Session of
EMNLP-CoNLL 2007},
year = 2007,
pages = {962--966},
url = {http://www.aclweb.org/anthology/D/D07/D07-1102}
}
@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{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; }
}
@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; }
}
@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{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{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{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; }
}
@UNPUBLISHED{Hancock89,
author = {T. Hancock},
title = {Identifying decision trees with equivalence queries},
note = {Manuscript, Harvard University},
year = 1989
}
@INPROCEEDINGS{Hancock90,
author = {T. R. Hancock},
title = {Identifying $\mu$-formula decision trees with
queries},
booktitle = {Proc. 3rd Annu. Workshop on Comput. Learning Theory},
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.}
}
@INPROCEEDINGS{Hancock91,
author = {Hancock, T.},
title = {Learning {$2\mu$} {DNF} Formulas and$k\mu$ Decision
Trees},
booktitle = {Proceedings of the Fourth Annual Workshop
onComputational Learning Theory},
year = 1991,
pages = {199--209},
address = {Santa Cruz, California},
month = Aug,
publisher = {Morgan Kaufmann}
}
@INPROCEEDINGS{Hancock93,
author = {T. Hancock},
title = {Learning $k \mu$ decision trees on the uniform
distribution},
booktitle = {Proc. 6th Annu. Conf. on Comput. Learning Theory},
year = 1993,
pages = {352--360},
publisher = {ACM Press, New York, NY}
}
@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{HancockHe91,
author = {T. Hancock and L. Hellerstein},
title = {Learning read-once formulas over fields and extended
bases},
booktitle = {Proc. 4th Annu. Workshop on Comput. Learning Theory},
year = 1991,
pages = {326--336},
publisher = {Morgan Kaufmann, San Mateo, CA}
}
@INPROCEEDINGS{HancockMa91,
author = {Hancock, T. and Y. Mansour},
title = {Learning Monotone {$k\mu$} {DNF} Formulas on
ProductDistributions},
booktitle = {Proceedings of the Fourth Annual Workshop
onComputational Learning Theory},
year = 1991,
pages = {179--183},
address = {Santa Cruz, California},
month = Aug
}
@INPROCEEDINGS{HanksMc86,
author = {Hanks, S. and McDermott, D.},
title = {Temporal reasoning and default logics},
booktitle = {AAAI 86 Proceedings},
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}
}
@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
}
@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}
}
@UNPUBLISHED{Har-Peled03,
author = {S. {Har-Peled}},
title = {On Core-sets and Slabs},
note = {menuscript},
year = 2003
}
@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{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}
}
@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
}
@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-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}
}
@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}
}
@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}
}
@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-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{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 = "Proceedings of the 9th Text Retrieval Conference,
NIST",
year = 2001
}
@InProceedings{HarabagiuHickl06,
author = {Harabagiu, Sanda and Hickl, Andrew},
title = {Methods for Using Textual Entailment in Open-Domain
Question Answering},
booktitle = {Proceedings of the 21st International Conference on
Computational Linguistics and 44th Annual Meeting of
the Association for Computational Linguistics},
month = {July},
year = 2006,
address = {Sydney, Australia},
publisher = {Association for Computational Linguistics},
pages = {905--912},
url = {http://www.aclweb.org/anthology/P06-1114},
doi = {10.3115/1220175.1220289}
}
@InProceedings{HarabagiuMiMo99,
author = "S. M. Harabagiu and G. A. Miller and D. I. Moldovan",
title = "WordNet2 - A Morphologically and Semantically
Enhanced Resources",
booktitle = "Proceedings of ACL-SIGLEX99: Standardizing Lexical
Resources",
address = "Maryland",
year = 1999,
pages = "1--8",
}
@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 = {Proceedings of Text REtrieval Conference (TREC-9)},
year = 2000
}
@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{Haraguchi92,
author = {M. Haraguchi},
title = {A form of analogy as an abductive inference},
booktitle = {Proc. 2nd Int. 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 = {Proc. 1st 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{Hardy49,
title = {Divergent Series},
publisher = {Oxford at the Clarendon Press},
year = 1949,
author = {G. H. Hardy}
}
@INPROCEEDINGS{Hardy75,
author = {S. Hardy},
title = {Synthesis of {LISP} programs from examples},
booktitle = IJCAI,
year = 1975,
pages = {268--273},
organization = {IJCAI}
}
@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}
}
@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{Harman86,
title = {Change in View:principles of reasoning},
publisher = {MIT Press},
year = 1986,
author = {Harman, G.},
address = {Cambridge, MA.}
}
@MISC{Harman94,
author = {Donna Harman},
title = {Overview of the Third {T}ext {RE}trieval
{C}onference ({TREC}-3)},
year = 1994
}
@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 = {Proc. 16th International Conf. on Machine Learning},
year = 1999,
pages = {171--180},
publisher = {Morgan Kaufmann, San Francisco, CA}
}
@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
}
@BOOK{Harris68,
title = {Mathematical structures of language},
publisher = {Wiley},
year = 1968,
author = {Zellig S. Harris}
}
@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; }
}
@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.}
}
@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.}
}
@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,
title = {{Lucene in Action}},
author = {Hatcher, E. and Gospodnetic, O.},
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}
}
@INPROCEEDINGS{Haussler86,
author = {Haussler, D.},
title = {Quantifying the inductive bias in concept learning},
booktitle = {Proceedings AAAI-86},
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.}
}
@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 = {Proc. of the 4th International Workshop on Machine
Learning},
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
}
@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}
}
@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 = {Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci.},
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
}
@INPROCEEDINGS{Haussler90,
author = {D. Haussler},
title = {Probably Approximately Correct Learning},
booktitle = {Proc. of the 8th National Conference on Artificial
Intelligence},
year = 1990,
pages = {1101--1108},
publisher = {Morgan Kaufmann}
}
@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
}
@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}
}
@INPROCEEDINGS{Haussler97,
author = {David Haussler},
title = {A brief look at some machine learning problems in
genomics},
booktitle = {Proc. 10th Annu. Conf. on Comput. Learning Theory},
year = 1997,
pages = {109--113},
publisher = {ACM Press, New York, NY}
}
@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}
}
@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
}
@INPROCEEDINGS{HausslerKeLiWa88,
author = {Haussler, D. and M. Kearns and N. Littlestone and
M. K. Warmuth},
title = {Equivalence of Models for Polynomial Learnability},
booktitle = {Proceedings of the 1988 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{HausslerKiWa95,
author = {David Haussler and Jyrki Kivinen and Manfred
K. Warmuth},
title = {Tight worst-case loss bounds for predicting with
expert advice},
booktitle = {Computational Learning Theory: EuroColt '95},
year = 1995,
pages = {69--83},
publisher = {Springer-Verlag},
note = {Early version in U. of CA, Santa Cruz, TR
UCSC-CRL-94-36}
}
@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{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}
}
@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}
}
@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
}
@INPROCEEDINGS{HausslerOp95,
author = {David Haussler and Manfred Opper},
title = {General bounds on the mutual information between a
parameter and $n$ conditionally independent
observations},
booktitle = {Proc. 8th Annu. Conf. on Comput. Learning Theory},
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 = {Proc. Workshop on the Theory of Neural Networks: The
Statistical Mechanics Perspective},
year = 1995,
publisher = {World Scientific}
}
@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{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}
}
@misc{Hayes-weinstein90,
author = "P. Hayes and S. Weinstein",
year = 1990,
title = "Construe-TIS: A system for content-based indexing of
a database of news stories"
}
@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}
}
@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
}
@BOOK{Haykin91,
title = {Adaptive Filter Theory},
publisher = {Prentice-Hall},
year = 1991,
author = {S. Haykin},
address = {Englewood Cliffs, NJ},
note = {Second edition.}
}
@BOOK{Haykin94,
title = {Neural Networks: a Comprehensive Foundation},
publisher = {Macmillan},
year = 1994,
author = {S. Haykin},
address = {New York, NY}
}
@INPROCEEDINGS{HeadKoYo98,
author = {T. Head and S. Kobayashi and T. Yokomori},
title = {Locality, Reversibility, and Beyond: {L}earning
Languages from Positive Data},
booktitle = {Proc. 9th International Conference on Algorithmic
Learning Theory - ALT '98},
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,
address = {Morristown, NJ, USA},
author = {Hearst, M. A. },
booktitle = {Proceedings of the 14th conference on Computational
linguistics},
doi = {http://dx.doi.org/10.3115/992133.992154},
keywords = {corpus, hyponym, statistical-nlp, text-mining},
pages = {539--545},
publisher = {Association for Computational Linguistics},
title = {Automatic acquisition of hyponyms from large text
corpora},
url = {http://dx.doi.org/10.3115/992133.992154},
year = 1992
}
@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",
editor = " B. Boguraev and J. Pustejovsky",
year = 1998,
booktitle = "Corpus Processing for Lexical Acquisition",
publisher = "MIT Press",
}
@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 = {Uncertainty in Artificial Intelligence},
publisher = {Kluwer Science Publishers},
year = 1986,
editor = {Kanal, L. N. and Lemmer, J.F.},
pages = {167--196}
}
@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{HegedHIn97,
author = {Tibor Heged{\H u}s and Piotr Indyk},
title = {On learning disjunctions of zero-one threshold
functions with queries},
booktitle = {Algorithmic Learning Theory: ALT '97},
year = 1997,
volume = 1316,
series = {Lecture Notes in Artificial Intelligence},
pages = {446--460},
publisher = {Springer-Verlag}
}
@INPROCEEDINGS{HegedHus93,
author = {T. Heged\H{u}s},
title = {Can complexity theory benefit from learning theory?
(Extended Abstract)},
booktitle = {Proc. of the European Conference on Machine
Learning},
year = 1993,
volume = {LNCS 667 (subseries Lecture Notes in AI)},
pages = {354--359},
address = {Berlin},
publisher = {Springer Verlag}
}
@INPROCEEDINGS{Hegedus94,
author = {T. Heged{\"u}s},
title = {Geometrical concept learning and convex polytopes},
booktitle = {Proc. 7th Annu. ACM Conf. on Comput. Learning
Theory},
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 = {Computational Learning Theory: EuroColt '93},
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{Hegedus95,
author = {Tibor Heged{\"u}s},
title = {Generalized teaching dimensions and the query
complexity of learning},
booktitle = {Proc. 8th Annu. Conf. on Comput. Learning Theory},
year = 1995,
pages = {108--117},
publisher = {ACM Press, New York, NY}
}
@INPROCEEDINGS{Heger94,
author = {Matthias Heger},
title = {Consideration of risk in reinforcement learning},
booktitle = {Proc. 11th International Conference on Machine
Learning},
year = 1994,
pages = {105--111},
publisher = {Morgan Kaufmann}
}
@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{Hekanaho95,
author = {Jukka Hekanaho},
title = {Symbiosis in multimodal concept learning},
booktitle = {Proc. 12th International Conference on Machine
Learning},
year = 1995,
pages = {278--285},
publisher = {Morgan Kaufmann}
}
@INPROCEEDINGS{Hekanaho96,
author = {Jukka Hekanaho},
title = {Background knowledge in {GA}-based concept learning},
booktitle = {Proc. 13th International Conference on Machine
Learning},
year = 1996,
pages = {234--242},
publisher = {Morgan Kaufmann}
}
@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}
}
@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}
}
@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
}
@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
}
@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}
}
@INPROCEEDINGS{HellersteinKa89,
author = {L. Hellerstein and M. Karpinski},
title = {Learning read-once formulas using membership
queries},
booktitle = {Proc. of the Second 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}
}
@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
}
@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}
}
@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{HelmboldKiWa96,
author = {D. P. Helmbold and J. Kivinen and M. K. Warmuth},
title = {Worst-Case Loss Bounds for Sigmoided Linear Neurons},
booktitle = {Proc. 1996 Neural Information Processing Conference},
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.}
}
@INPROCEEDINGS{HelmboldKwPi97,
author = {David Helmbold and Stephen Kwek and Leonard Pitt},
title = {Learning when to trust which experts},
booktitle = {Computational Learning Theory: EuroColt '97},
year = 1997,
pages = {134--149},
publisher = {Springer-Verlag}
}
@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{HelmboldLo91,
author = {Helmbold, David P. and Philip M. Long},
title = {Tracking Drifting Concepts Using Random Examples},
booktitle = {Proceedings of the Fourth Annual Workshop on
ComputationalLearning Theory},
year = 1991,
pages = {13--23},
address = {Santa Cruz, California},
publisher = {Morgan Kaufmann}
}
@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{HelmboldPa97,
author = {David Helmbold and Sandra Panizza},
title = {Some Label Efficient Learning Results},
booktitle = {Proc. 10th Annu. Conf. on Comput. Learning Theory},
year = 1997,
pages = {218--230},
publisher = {ACM Press, New York, NY}
}
@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 = {Proc. 4th European Conference on Computational
Learning Theory},
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}
}
@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{HelmboldSlWa89,
author = {Helmbold, David and Robert Sloan and Manfred
K. Warmuth},
title = {Learning Nested Differences of Intersection-Closed
Concept Classes},
booktitle = {Proceedings of the Second Annual Workshop on
Computational Learning Theory},
year = 1989,
pages = {41--56},
address = {Santa Cruz, CA},
month = Jul
}
@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}
}
@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{HelmboldWa92,
author = {D. P. Helmbold and M. K. Warmuth},
title = {Some weak learning results},
booktitle = {Proc. 5th Annu. Workshop on Comput. Learning Theory},
year = 1992,
pages = {399--412},
publisher = {ACM Press, New York, NY}
}
@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
}
@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 = {Proceedings of the seventh conference (1991) on
Uncertainty in Artificial Intelligence},
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 = {Adv. Neur. Info. Proc. Sys.},
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 = {Proc. 13th Annu. Conference on Comput. Learning
Theory},
year = 2000,
pages = {304--308},
publisher = {Morgan Kaufmann, San Francisco}
}
@INPROCEEDINGS{HerbsterWa95,
author = {M. Herbster and M. Warmuth},
title = {Tracking the best expert},
booktitle = {Proc. 12th International Conference on Machine
Learning},
year = 1995,
pages = {286--294},
publisher = {Morgan Kaufmann}
}
@INPROCEEDINGS{HerbsterWa98,
author = {Mark Herbster and Manfred K. Warmuth},
title = {Tracking the best regressor},
booktitle = {Proc. 11th Annu. Conf. on Comput. Learning Theory},
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-2001 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 = {Proceedings of ACL-08: HLT},
month = {June},
year = 2008,
address = {Columbus, Ohio},
pages = {389--397},
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 = {Proc. 10th International Conference on Algorithmic
Learning Theory - ALT '99},
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{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}
}
@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{HershbergerSu99,
author = {J. Hershberger and S. Suri},
title = {Kinetic Connectivity of Rectangles},
booktitle = SOCG,
year = 1999,
pages = {237-246}
}
@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 = {Proc. 15th International Conf. on Machine Learning},
year = 1998,
pages = {233--241},
publisher = {Morgan Kaufmann, San Francisco, CA}
}
@INPROCEEDINGS{Hickl,
author = {Jeremy Bensley and Andrew Hickl},
title = {Application of {LCC}'s {GROUNDHOG} {S}ystem for
{RTE}-4},
booktitle = {Proceedings of TAC 2008. To appear},
year = 2009
}
@InProceedings{HicklBensley07,
author = {Hickl, Andrew and Bensley, Jeremy},
title = {A Discourse Commitment-Based Framework for
Recognizing Textual Entailment},
booktitle = {Proceedings of the ACL-PASCAL Workshop on Textual
Entailment and Paraphrasing},
month = {June},
year = 2007,
address = {Prague},
publisher = {Association for Computational Linguistics},
pages = {171--176},
url = {http://www.aclweb.org/anthology/W/W07/W07-1428}
}
@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{Higuera98,
author = {Colin de la Higuera},
title = {Learning stochastic finite automata from experts},
booktitle = {Proc. 4th International Colloquium on Grammatical
Inference - ICGI '98},
year = 1998,
volume = 1433,
series = {Lecture Notes in Artificial Intelligence},
pages = {79--89},
publisher = {Springer-Verlag}
}
@INPROCEEDINGS{Hindle83,
author = {Hindle, D.},
title = {Deterministic parsing of syntactic non-fluencies},
booktitle = ACL,
year = 1983
}
@INPROCEEDINGS{Hindle89,
author = {Hindle, D.},
title = {Acquiring disambiguation rules from text},
booktitle = ACL,
year = 1989
}
@INPROCEEDINGS{Hindle90,
author = {Hindle, D.},
title = {Noun Classification from Predicate-Argument
Structures},
booktitle = ACL,
year = 1990,
pages = {268--275}
}
@inproceedings(Hindle91,
author = "D. Hindle and M. Rooth",
title = "Structural Ambiguity and Lexical Relations",
booktitle = ACL,
pages = "229--236",
year = 1991
)
@article(Hindle93,
author = "Donald Hindle and Mats Rooth",
title = "Structural Ambiguity and Lexical Relations",
journal = CL,
pages = "103--120",
volume = 19,
number = 1,
year = 1993
)
@INPROCEEDINGS{HindleRo91,
author = {D. Hindle and M. Rooth},
title = {Structural Ambiguity and Lexical Relations},
booktitle = ACL,
year = 1991,
pages = {229--236}
}
@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{Hinton86,
author = {G. E. Hinton},
title = {Learning Distributed Representations of Concepts},
booktitle = {Proc.\ 8th Annual Conf.\ of the Cognitive Science
Society},
year = 1986,
pages = {1--12},
address = {Hillsdale},
publisher = {Erlbaum}
}
@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{HintonCa93,
author = {G. Hinton and D. van Camp},
title = {Keeping neural networks simple by minimizing the
description length of the weights},
booktitle = {Proc. 6th Annu. Conf. on Comput. Learning Theory},
year = 1993,
pages = {5--13},
publisher = {ACM Press, New York, NY}
}
@INCOLLECTION{HintonSe86,
author = {Hinton, G. E. and T. J. Sejnowski},
title = {Learning and re-learning in {B}otzmann Machines},
booktitle = {Parallel Distributed Processing (Volume I:
Foundations)},
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{Hirata94,
author = {K. Hirata},
title = {Rule-generating abduction for recursive {P}rolog},
booktitle = {Proc. 5th Int. Workshop on Algorithmic Learning
Theory},
year = 1994,
pages = {121--136},
publisher = {Springer-Verlag}
}
@INPROCEEDINGS{Hirata99,
author = {Kouichi Hirata},
title = {Flattening and Implication},
booktitle = {Proc. 10th International Conference on Algorithmic
Learning Theory - ALT '99},
year = 1999,
volume = 1720,
series = {Lecture Notes in Artificial Intelligence},
pages = {157--168},
publisher = {Springer-Verlag}
}
@INPROCEEDINGS{HirowatariAr97,
author = {Eiju Hirowatari and Setsuo Arikawa},
title = {Inferability of recursive real-valued functions},
booktitle = {Algorithmic Learning Theory: ALT '97},
year = 1997,
volume = 1316,
series = {Lecture Notes in Artificial Intelligence},
pages = {18--31},
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 = {Proc. 9th International Conference on Algorithmic
Learning Theory - ALT '98},
year = 1998,
volume = 1501,
series = {Lecture Notes in Artificial Intelligence},
pages = {262--275},
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{Hirsh-noordewier94,
author = "H. Hirsh and M. Noordewier",
year = 1994,
title = "Using Background Knowledge to Improve Learning of
DNA Sequences",
booktitle = {Proceedings of the Tenth IEEE Conference on
Artificial Intelligence for Applications}
}
@INPROCEEDINGS{Hirsh92,
author = {Haym Hirsh},
title = {Polynomial time learning with version spaces},
booktitle = {Proc. of AAAI-92},
year = 1992
}
@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}
}
@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{HirshNo94,
author = {H. Hirsh and M. Noordewier},
title = {Using Background Knowledge to Improve Learning of
DNA Sequences},
booktitle = {Proceedings of the Tenth IEEE Conference on
Artificial Intelligence for Applications},
year = 1994
}
@BOOK{Hirst87,
title = {Semantic interpretation and the Disambiguation of
Ambiguity},
publisher = {Cambridge University Press},
year = 1987,
author = {Hirst, G.}
}
@ARTICLE{Hirst88,
author = {Graeme Hirst},
title = {Semantic interpretation and ambiguity},
journal = AI,
year = 1988,
volume = 34,
pages = {131--177}
}
@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",
editor = "C. Fellbaum",
year = 1998,
pages = "305--332",
publisher = "MIT Press"
)
@ARTICLE{Hobbs78,
author = {Hobbs, J. R.},
title = {Resolving pronoun references},
journal = {Lingua},
year = 1978,
volume = 44,
pages = {311--338}
}
@inproceedings(Hobbs90,
author = "Jerry Hobbs and John Bear",
title = "Two principles of parse preference",
booktitle = Coling,
year = 1990
)
@INPROCEEDINGS{Hobbs92,
author = {Hobbs, J, R. et al.},
title = {Description of the {FASTUS} system used for {MUC}-4},
booktitle = {Proceedings of Forth Message Understanding
Conference},
year = 1992,
pages = {268-275}
}
@INPROCEEDINGS{Hobbs:88AC,
author = {J. R. Hobbs and M. Stickel and P. Martin and
D. Edwards},
title = {Interpretation as Abduction},
booktitle = {Proc. of the 26th Annual Meeting of the Association
for Computational Linguistics (ACL)},
year = 1988,
pages = {95-103},
keywords = {n-l-p, ling}
}
@INPROCEEDINGS{HobbsBe90,
author = {Jerry Hobbs and John Bear},
title = {Two principles of parse preference},
booktitle = Coling,
year = 1990
}
@techreport{HobbsStMaEd90t,
author = {Hobbs, J, R. and M. Stickel and P. Martin and
D. Edwards},
title = {Interpretation as Abduction},
institution = {SRI International},
year = 1990,
month = Dec,
number = {Technical Note 499},
}
@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},
}
@inproceedings{Hobbsetal92,
author = {Hobbs, J, R. et al.},
title = {Description of the {FASTUS} system used for {MUC}-4},
booktitle = {Proceedings of Forth Message Understanding
Conference},
year = 1992,
pages = {268-275},
}
@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; }
}
@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{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; }
}
@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{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{Hoffgen93,
author = {K. H{\"o}ffgen},
title = {Learning and robust learning of product
distributions},
booktitle = {Proc. 6th Annu. Conf. on Comput. Learning Theory},
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 = {Proc. 5th Annu. Workshop on Comput. Learning Theory},
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
}
@INPROCEEDINGS{Hofmeister99,
author = {Thomas Hofmeister},
title = {An Application of Codes to Attribute-Efficient
Learning},
booktitle = {Proc. 4th European Conference on Computational
Learning Theory},
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}
}
@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 = {Proc. 9th Annu. Conf. on Comput. Learning Theory},
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,
author = "Hornby, A. S. and C. Ruse and J. A. Reif and
Y. Levy",
title = "Oxford Student's Dictionary for Hebrew Speakers",
publisher = "Kernerman Publishing Ltd., Lonnie Kahn \& Co. Ltd.",
year = 1986
)
@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-88},
year = 1988,
publisher = {Morgan Kaufman}
}
@INPROCEEDINGS{HortyThTo87,
author = {Horty, J. and R. Thomason and D. Touretzky},
title = {A skeptical Theory of Inheritance in Nonmonotonic
Semantic Networks},
booktitle = {AAAI-87},
year = 1987,
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{Horv'ath:99,
author = {M{\'a}rta Horv{\'a}th:},
title = {On Error Estimation for the Partitioning
Classification Rule},
booktitle = {Proc. 4th European Conference on Computational
Learning Theory},
year = 1999,
volume = 1572,
series = {Lecture Notes in Artificial Intelligence},
pages = {253--262},
publisher = {Springer-Verlag}
}
@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 = {Proc. 10th Annu. Conf. on Comput. Learning Theory},
year = 1997,
pages = {10--20},
publisher = {ACM Press, New York, NY}
}
@INPROCEEDINGS{HorvitzSuCo89,
author = {Eric Horvitz and Henri Jacques Suermondt and Gregory
F. Cooper},
title = {Bounded Conditioning: Flexible inference for
decisions under scarce resources},
booktitle = {Proceedings of Conference on Uncertainty in
Artificial Intelligence},
year = 1989,
pages = {182-193},
address = {Mountain View, CA},
publisher = {Association for Uncertainty in Artificial
Intelligence}
}
@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(HovyGerber01,
author = "E. Hovy and L. Gerber and U. Hermjakob and C. Lin
and D. Ravichandran",
title = "Toward Semantics-Based Answer Pinpointing",
booktitle = "Proceedings of the DARPA Human Language Technology
conference (HLT). San Diego, CA",
year = 2001
)
@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; }
}
@techreport{HsuChLi06,
author = {C. Hsu and C. Chang and C. Lin},
year = 2006,
title = {A Practical Guide to Support Vector Classification},
institution = {Dept of Computer Science, National Taiwan
University}
}
@INPROCEEDINGS{HsuKn94,
author = {Chun-Nan Hsu and Craig A. Knoblock},
title = {Rule induction for semantic query optimization},
booktitle = {Proc. 11th International Conference on Machine
Learning},
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{HuSaKi99,
author = {Yuh-Jyh Hu and Suzanne Sandmeyer and Dennis Kibler},
title = {Detecting motifs from sequences},
booktitle = {Proc. 16th International Conf. on Machine Learning},
year = 1999,
pages = {181--190},
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 = {Proceedings of the 2007 Joint Conference of
EMNLP-CoNLL},
year = 2007,
pages = {287--295},
url = {http://www.aclweb.org/anthology/D/D07/D07-1030}
}
@INPROCEEDINGS{HuWe98,
author = {Junling Hu and Michael P. Wellman},
title = {Multiagent reinforcement learning: theoretical
framework and an algorithm},
booktitle = {Proc. 15th International Conf. on Machine Learning},
year = 1998,
pages = {242--250},
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{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 = {Proceedings of the 2007 Joint Conference of
EMNLP-CoNLL},
year = 2007,
pages = {1093--1102},
url = {http://www.aclweb.org/anthology/D/D07/D07-1117}
}
@INPROCEEDINGS{HuangPa07,
author = {Huang, Fei and Papineni, Kishore},
title = {Hierarchical System Combination for Machine
Translation},
booktitle = {Proceedings of the 2007 Joint Conference of
EMNLP-CoNLL},
year = 2007,
pages = {277--286},
url = {http://www.aclweb.org/anthology/D/D07/D07-1029}
}
@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 = {Proceedings of EACL-95},
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 = {Proceedings of the 2007 Joint Conference of
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{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 = {Proceedings of TMI-93},
year = 1993,
pages = {201--217},
place = {Kyoto}
}
@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 = {Proceedings of the 9th Text Retrieval Conference,
NIST},
year = 2001
}
@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{ITIO94,
author = {T. Iwatani and S. Tano and A. Inoue and W. Okamoto},
title = {Fuzzy analogy based reasoning and classification of
fuzzy analogies},
booktitle = {Proc. 5th Int. Workshop on Algorithmic Learning
Theory},
year = 1994,
pages = {137--148},
publisher = {Springer-Verlag}
}
@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 = {Proc. 16th International Conf. on Machine Learning},
year = 1999,
pages = {191--199},
publisher = {Morgan Kaufmann, San Francisco, CA}
}
@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 = {Proc. 1st Annu. Workshop on Comput. Learning Theory},
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}
}
@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{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{Indyk01,
author = {P. Indyk},
title = {Algorithmic applications of low-distortion geometric
embeddings},
booktitle = FOCS,
year = 2001,
pages = {10--31},
note = {Tutorial}
}
@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 = {Proc. 40th Annu. IEEE Symposium on Foundations of
Computer Science},
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 = {Proc. of the 1990 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(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 = "Proceedings of TMI-93",
place = "Kyoto",
pages = "201--217",
year = 1993
)
@INPROCEEDINGS{IshigamiTa93,
author = {Y. Ishigami and S. Tani},
title = {The {VC} dimensions of finite automata with $n$
states},
booktitle = {Proc. 4th Int. Workshop on Algorithmic Learning
Theory},
year = 1993,
volume = 744,
series = {Lecture Notes in Artificial Intelligence},
pages = {328--341},
publisher = {Springer-Verlag}
}
@INPROCEEDINGS{IshinoYa94,
author = {A. Ishino and A. Yamamoto},
title = {Learning from examples with typed equational
programming},
booktitle = {Proc. 5th Int. Workshop on Algorithmic Learning
Theory},
year = 1994,
pages = {301--316},
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{Ishizaka89,
author = {H. Ishizaka},
title = {Learning simple deterministic languages},
booktitle = {Proc. 2nd Annu. Workshop on Comput. Learning Theory},
year = 1989,
pages = {162--174},
address = {San Mateo, CA},
publisher = {Morgan Kaufmann}
}
@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{IshizakaArSh93,
author = {H. Ishizaka and H. Arimura and T. Shinohara},
title = {Efficient inductive inference of primitive prologs
from positive data},
booktitle = {Proc. 3th Int. Workshop on Algorithmic Learning
Theory},
year = 1993,
volume = 743,
series = {Lecture Notes in Artificial Intelligence},
pages = {135--146},
publisher = {Springer-Verlag}
}
@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}
}
@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}
}
@INPROCEEDINGS{ItFrZhRa00,
author = {A. Ittycheriah and M. Franz and W. Zhu and
A. Ratnaparkhi},
title = {IBM's Statistical Question Answering System},
booktitle = {Proceedings of Text REtrieval Conference (TREC-9)},
year = 2000
}
@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 = {Proc. 3th Int. 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 = {Proc. 13th International Conference on Machine
Learning},
year = 1996,
pages = {252--258},
publisher = {Morgan Kaufmann}
}
@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 = "Proceedings of the 9th Text Retrieval Conference,
NIST",
year = 2001
)
@inproceedings{Iwayama-tokunaga94,
author = "M. Iwayama and T. Tokunaga",
year = 1994,
title = "A probabilistic model for text categorization based
on a single random variable with multiple values",
booktitle = {Proceedings of the 4th Conference on Applied Natural
Language Processing}
}
@INPROCEEDINGS{IwayamaInMo93,
author = {M. Iwayama and N. Indurkhya and H. Motoda},
title = {A new algorithm for automatic configuration of
hidden {M}arkov models},
booktitle = {Proc. 4th Int. Workshop on Algorithmic Learning
Theory},
year = 1993,
volume = 744,
series = {Lecture Notes in Artificial Intelligence},
pages = {237--250},
publisher = {Springer-Verlag}
}
@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 = {Proceedings of the 4th 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 = {Proc. 9th International Conference on Algorithmic
Learning Theory - ALT '98},
year = 1998,
volume = 1501,
series = {Lecture Notes in Artificial Intelligence},
pages = {276--290},
publisher = {Springer-Verlag}
}
@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}
}
@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}
}
@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{JMFK07,
author = {Johnson, Howard and Martin, Joel and Foster, George
and Kuhn, Roland},
title = {Improving Translation Quality by Discarding Most of
the Phrasetable},
booktitle = {Proceedings of the 2007 Joint Conference of
EMNLP-CoNLL},
year = 2007,
pages = {967--975},
url = {http://www.aclweb.org/anthology/D/D07/D07-1103}
}
@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{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,
isbn = {978-1-60558-193-4},
pages = {381--389},
location = {Las Vegas, Nevada, USA},
doi = {http://doi.acm.org/10.1145/1401890.1401939},
publisher = {ACM},
address = {New York, NY, USA},
}
@INPROCEEDINGS{Jackson00,
author = {Jeffrey Jackson},
title = {On the Efficiency of Noise-Tolerant {PAC} Algorithms
Derived from Statistical Queries},
booktitle = {Proc. 13th Annu. Conference on Comput. Learning
Theory},
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}
}
@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{JacksonTo92,
author = {Jackson, Jeffrey and Tomkins, Andrew},
title = {A Computational Model of Teaching},
booktitle = {Proceedings of COLT '92},
year = 1992,
pages = {319--326},
publisher = {Morgan Kaufmann}
}
@INPROCEEDINGS{Jacobs92,
author = {P. Jacobs},
title = {Joining statistics with {NLP} for text
categorization},
booktitle = {Proceedings of the 3rd 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 = {Proceedings of the 13th Conference on Uncertainty in
Artificial Intelligence},
year = 1997,
editor = {Morgan Kaufmann},
pages = {266--273},
url = {citeseer.nj.nec.com/jaeger97relational.html}
}
@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 = {Workshop on Research Issues on Data Mining and
Knowledge Discovery (DMKD)},
year = 2000,
pages = {1--10}
}
@PHDTHESIS{Jain90,
author = {S. Jain},
title = {Learning in the Presence of Additional Information
and Inaccurate Information},
school = {University of Rochester},
year = 1990
}
@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
}
@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{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{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
}
@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 = {Proc. 13th Annu. Conference on Comput. Learning
Theory},
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 = {Algorithmic Learning Theory: ALT '96},
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 = {Algorithmic Learning Theory: ALT '97},
year = 1997,
volume = 1316,
series = {Lecture Notes in Artificial Intelligence},
pages = {32--47},
publisher = {Springer-Verlag}
}
@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{JainSh90,
author = {S. Jain and A. Sharma},
title = {Finite learning by a {\sl team}},
booktitle = {Proc. 3rd Annu. Workshop on Comput. Learning Theory},
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 = {Proc. of the Third 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 = {Proc. of the 17th International Colloquium on
Automata, Languages and Programming},
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}
}
@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 = {Proc. 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
}
@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 = {Proc. 6th Annu. Conference on Comput. Learning
Theory},
year = 1993,
pages = {192--198},
address = {New York, New York},
publisher = {ACM Press}
}
@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 = {Proc. 7th Annu. ACM Conf. on Comput. Learning
Theory},
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 = {Algorithmic Learning Theory, Proceedings of the 4th
International Workshop on Analogical and Inductive
Inference, AII'94 and 5th International Workshop on
Algorithmic Learning Theory, ALT'94, Reinhardsbrunn
Castle, Germany},
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}
}
@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 = {Proc. of the Second European Conference on
Computational Learning Theory, (EUROCOLT) Barcelona,
Spain},
year = 1995,
month = mar,
publisher = {Springer-Verlag}
}
@INPROCEEDINGS{JainSh96,
author = {Sanjay Jain and Arun Sharma},
title = {Elementary formal systems, intrinsic complexity, and
procrastination},
booktitle = {Proc. 9th Annu. Conf. on Comput. Learning Theory},
year = 1996,
pages = {181--192},
publisher = {ACM Press, New York, NY}
}
@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{JainSh99,
author = {Sanjay Jain and Arun Sharma},
title = {On a generalized notion of mistake bounds},
booktitle = {Proc. 12th Annu. Conf. on Comput. Learning Theory},
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 = {Proc. 4th European Conference on Computational
Learning Theory},
year = 1999,
volume = 1572,
series = {Lecture Notes in Artificial Intelligence},
pages = {198--213},
publisher = {Springer-Verlag}
}
@INPROCEEDINGS{JainShCa89,
author = {S. Jain and A. Sharma and J. Case},
title = {Convergence to nearly minimal size grammars by
vacillating learning machines},
booktitle = {Proc. 2nd Annu. Workshop on Comput. Learning Theory},
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 = {Proc. 11th Annu. Conf. on Comput. Learning Theory},
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 = {Fundamentals of Computations Theory, FCT' 79,
Proc. of the Conference on Algebraic, Arithmetic,
and Categorial Methods in Computation Theory},
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{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}
}
@INPROCEEDINGS{Jantke84,
author = {Jantke, K. P.},
title = {Polynomial-time inference of general pattern
languages},
booktitle = {Proceedings of the Symposium of Theoretical Aspects
of Computer Science; Lecture Notes in Computer
Science},
year = 1984,
volume = 166,
pages = {314-325},
publisher = {Springer}
}
@INPROCEEDINGS{Jantke86,
author = {K. P. Jantke},
title = {An Algebraic Framework for Inductive Program
Synthesis},
booktitle = {Proc. Int. Spring School on Mathematical Methods of
Specification and Synthesis of Software Systems '85},
year = 1986,
volume = 215,
series = {Lecture Notes in Computer Science},
pages = {101--122}
}
@INPROCEEDINGS{Jantke90,
author = {K. P. Jantke},
title = {Monotonic and Nonmonotonic Inductive Inference of
Functions and Patterns},
booktitle = {Nonmonotonic and Inductive Logic, 1st International
Workshop, Karlsruhe, Germany},
year = 1990,
pages = {161--177},
publisher = {Springer Verlag},
note = {Lecture Notes in Computer Science 543}
}
@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{Jantke92,
author = {K. P. Jantke},
title = {Case based learning in inductive inference},
booktitle = {Proc. 5th Annu. Workshop on Comput. Learning Theory},
year = 1992,
pages = {218--223},
publisher = {ACM Press, New York, NY}
}
@INPROCEEDINGS{Jantke95,
author = {Klaus P. Jantke},
title = {Reflecting and self-confident inductive inference
machines},
booktitle = {Proc. 6th Int. Workshop on Algorithmic Learning
Theory},
year = 1995,
pages = {282--297},
publisher = {Springer-Verlag}
}
@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}
}
@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 = {Proc. 13th International Conference on Machine
Learning},
year = 1996,
pages = {258--265},
publisher = {Morgan Kaufmann}
}
@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}
}
@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.}
}
@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",
volume = 28,
pages = "2591--2594",
year = 1985
)
@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}
}
@INPROCEEDINGS{Jelinek91,
author = {Fred Jelinek},
title = {Up From Trigrams!},
booktitle = {Eurospeech},
year = 1991
}
@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,
pages = "651-699",
editor = "Sadaoki Furui and M. Mohan Sondhi"
)
@BOOK{Jelinek98,
title = {Statistical Methods for Speech Recognition},
publisher = {MIT Press},
year = 1998,
author = {F. Jelinek}
}
@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{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}
}
@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{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{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{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.},
year = 2005,
booktitle = {Proceedings of RTE 2005}
}
@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{JiPs91,
author = {C. Ji and D. Psaltis},
title = {The {VC}-dimension vs. the statistical capacity for
two layer networks with binary weights},
booktitle = {Proc. 4th Annu. Workshop on Comput. Learning Theory},
year = 1991,
pages = {250--256},
address = {San Mateo, CA},
publisher = {Morgan Kaufmann}
}
@inproceedings{JiangConrath97,
author = "J. Jiang and D. Conrath",
title = "Semantic Similarity Based on Corpus Statistics and
Lexical Taxonomy",
booktitle = "Proceedings of International conference on Research
in Computational Linguistics",
year = 1997,
pages = "19-33",
}
@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{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 = {Proceeding of NAACL-HLT},
month = {April},
year = 2007,
address = {Rochester, New York},
publisher = {Association for Computational Linguistics},
pages = {113--120},
url = {http://www.aclweb.org/anthology/N/N07/N07-1015}
}
@inproceedings{JijkounRi05,
author = {V. Jijkoun and M. de Rijke},
title = {Recognizing Textual Entailment: Is lexical
symilarity enough?},
year = 2005,
booktitle = {Proceedings of RTE 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 = {Proc. of 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{Joachims97,
author = {Thorsten Joachims},
title = {A probabilistic analysis of the {R}occhio algorithm
with {TFIDF} for text categorization},
booktitle = {Proc. 14th International Conference on Machine
Learning},
year = 1997,
pages = {143--151},
publisher = {Morgan Kaufmann}
}
@INPROCEEDINGS{Joachims99,
author = {T. Joachims},
title = {Transductive inference for text classification using
support vector machines},
booktitle = ICML,
year = 1999,
}
@ARTICLE{Johannes97,
author = {Frnkranz 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 = {Proceedings of the CoNLL Shared Task Session of
EMNLP-CoNLL 2007},
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 = {Proc. 11th International Conference on Machine
Learning},
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}
}
@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}
}
@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}
}
@BOOK{Johnson-LairdWa77,
title = {Thinking - Readings in Cognitive science},
publisher = {Cambridge University Press},
year = 1977,
author = {Johnson-Laird, P. N. and Wason, P. C.}
}
@INPROCEEDINGS{Johnson07,
author = {Johnson, Mark},
title = {Why Doesn't {EM} Find Good {HMM} {POS}-Taggers?},
booktitle = {Proceedings of the 2007 Joint Conference of
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{Johnson84,
author = {Johnson, D.},
title = {The NP-Completeness Colunm:An Ongoing Guide},
journal = {Journal of Algorithms},
year = 1984,
volume = 5,
pages = {284--299}
}
@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}
}
@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.}
}
@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,
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{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}
}
@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{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}
}
@INPROCEEDINGS{JonghKa96,
author = {Dick de Jongh and Makoto Kanazawa},
title = {Angluin's theorem for indexed families of r.e. sets
and applications},
booktitle = {Proc. 9th Annu. Conf. on Comput. Learning Theory},
year = 1996,
pages = {193--204},
publisher = {ACM Press, New York, NY}
}
@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}
}
@INPROCEEDINGS{Jordan94,
author = {M. I. Jordan},
title = {A statistical approach to decision tree modeling},
booktitle = {Proc. 7th Annu. ACM Conf. on Comput. Learning
Theory},
year = 1994,
pages = {13--20},
publisher = {ACM Press, New York, NY},
annote = {Also in Proc. 11th Int.Conf. ML, Learning,1994,
363--370}
}
@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 9},
year = 1979,
pages = {227--250},
publisher = {John Wiley and Sons, N. Y.}
}
@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}
}
@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{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",
volume = 10,
number = 2,
year = 2001,
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.}
}
@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}
}
@INPROCEEDINGS{Judd88,
author = {S. Judd},
title = {Learning in neural networks},
booktitle = {Proc. 1st Annu. Workshop on Comput. Learning Theory},
year = 1988,
pages = {2--8},
address = {San Mateo, CA},
publisher = {Morgan Kaufmann}
}
@BOOK{Judd90,
title = {Neural Network Design and the Complexity of
Learning},
publisher = {MIT Press},
year = 1990,
author = {Judd, J. Stephen}
}
@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}
}
@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{Juill'ePo98,
author = {Hugues Juill{\'e} and Jordan B. Pollack},
title = {A stochastic search approach to grammar induction},
booktitle = {Proc. 4th International Colloquium on Grammatical
Inference - ICGI '98},
year = 1998,
volume = 1433,
series = {Lecture Notes in Artificial Intelligence},
pages = {126--137},
publisher = {Springer-Verlag}
}
@INPROCEEDINGS{JuillePo98,
author = {Hugues Juille and Jordan B. Pollack},
title = {Coevolutionary learning: a case study},
booktitle = {Proc. 15th International Conf. on Machine Learning},
year = 1998,
pages = {251--259},
publisher = {Morgan Kaufmann, San Francisco, CA}
}
@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,
author = "D. Jurafsky and J. Martin",
title = "SPEECH and LANGUAGE PROCESSING: An Introduction to
Natural Language Processing, Speech Recognition, and
Computational Linguistics",
publisher = "Prentice-Hall",
comment = {second edition},
year = 2007
)
@misc(Justeson89,
note = "Private communication",
autor = "John Justeson and Slava Katz",
year = 1989
)
@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"
}
@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,
number = 1,
pages = "9--28"
}
@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}
}
@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{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
}
@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.}
}
@INPROCEEDINGS{KGCC07,
author = {Koo, Terry and Globerson, Amir and Carreras, Xavier
and Collins, Michael},
title = {Structured Prediction Models via the Matrix-Tree
Theorem},
booktitle = {Proceedings of the 2007 Joint Conference of
EMNLP-CoNLL},
year = 2007,
pages = {141--150},
url = {http://www.aclweb.org/anthology/D/D07/D07-1015}
}
@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 = {Proc. 3rd Annu. Workshop on Comput. Learning Theory},
year = 1990,
pages = {327--337},
address = {San Mateo, CA},
publisher = {Morgan Kaufmann}
}
@incollection{KKSA08,
title = {Multi-Task Learning via Conic Programming},
author = {Tsuyoshi Kato and Hisashi Kashima and Masashi
Sugiyama and Kiyoshi Asai},
booktitle = {Advances in Neural Information Processing},
editor = {J.C. Platt and D. Koller and Y. Singer and
S. Roweis},
publisher = {MIT Press},
address = {Cambridge, MA},
pages = {737--744},
year = 2008
}
@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}
}
@INPROCEEDINGS{KLPV87,
author = {M. Kearns and M. Li and L. Pitt and L. Valiant},
title = {On the learnability of {B}oolean formulae},
booktitle = {Proc. 19th Annu. ACM Sympos. Theory Comput.},
year = 1987,
pages = {285--294},
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}
}
@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{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 = {Proc. 5th Annu. Workshop on Comput. Learning Theory},
year = 1992,
pages = {172--179},
publisher = {ACM Press, New York, NY}
}
@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{KPSW99,
author = {Efim Kinber and Christophe Papazian and Carl Smith
and Rolf Wiehagen},
title = {On the intrinsic complexity of learning recursive
functions},
booktitle = {Proc. 12th Annu. Conf. on Comput. Learning Theory},
year = 1999,
pages = {257--266},
publisher = {ACM Press, New York, NY}
}
@INPROCEEDINGS{KSNM03,
author = {D. Klein and J. Smarr and H. Nguyen and C. Manning},
title = {Named Entity Recognition with Character-Level
Models},
booktitle = {Proceedings of CoNLL-2003},
year = 2003,
editor = {Walter Daelemans and Miles Osborne},
pages = {180--183},
publisher = {Edmonton, Canada}
}
@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{KabashimaSh93,
author = {Y. Kabashima and S. Shinomoto},
title = {Acceleration of learning in binary choice problems},
booktitle = {Proc. 6th Annu. Conf. on Comput. Learning Theory},
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 = {Proc. 16th International Conf. on Machine Learning},
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{Kahn04,
author = {Joseph M. Kahn},
title = {A Generative Bayesian Model for Aggregating Experts},
booktitle = {UAI},
year = 2004,
pages = {301-308}
}
@INPROCEEDINGS{KahnKaLi88,
author = {Kahn, J and G. Kalai and N. Linial},
title = {The influence of variables on boolean functions},
booktitle = {Proceedings of the Twenty-Ninth Annual Symposium on
Foundations of Computer Science},
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{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 = {Proceedings of the 2007 Joint Conference of
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 = {Proceedings of the Seventh International Workshop on
Inductive Logic Programming (ILP97)},
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 = {Proc. 3th Int. 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-99},
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 = {Proc. 10th International Conference on Algorithmic
Learning Theory - ALT '99},
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 = {Proc. 12th Annu. Conf. on Comput. Learning Theory},
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 = {Proc. 6th Int. Workshop on Algorithmic Learning
Theory},
year = 1995,
pages = {201--214},
publisher = {Springer-Verlag}
}
@INPROCEEDINGS{KamelFa94,
author = {I. Kamel and C. Faloutsos},
title = {Hilbert {R}-tree: {A}n improved {R}-tree using
fractals},
booktitle = {Proc. 20th VLDB Conference},
year = 1994,
pages = {500--510}
}
@INPROCEEDINGS{Kamimura93,
author = {R. Kamimura},
title = {Competitive learning by entropy minimization},
booktitle = {Proc. 3th Int. Workshop on Algorithmic Learning
Theory},
year = 1993,
volume = 743,
series = {Lecture Notes in Artificial Intelligence},
pages = {111--122},
publisher = {Springer-Verlag}
}
@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}
}
@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,
title = {Learning Semantic Similarity},
author = {Kandola, J. and Shawe-Taylor, J. and Cristianini,
N.},
journal = {NIPS},
pages = {673--680},
year = 2003,
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 = {Proc. 8th Annu. Conf. on Comput. Learning Theory},
year = 1995,
pages = {297--300},
publisher = {ACM Press, New York, NY}
}
@INPROCEEDINGS{Kannan93,
author = {S. Kannan},
title = {On the query complexity of learning},
booktitle = {Proc. 6th Annu. Conf. on Comput. Learning Theory},
year = 1993,
pages = {58--66},
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{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 = {Proc. SODA 93},
year = 1993,
pages = {441--447},
month = jan
}
@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{Kapoor99,
author = {S. Kapoor},
title = {Efficient Computation of Geodesic Shortest Paths},
booktitle = {Proc. 31rd Annu. ACM Sympos. Theory Comput.},
year = 1999,
pages = {770--779}
}
@INPROCEEDINGS{Kapur93,
author = {S. Kapur},
title = {Monotonic language learning},
booktitle = {Proc. 3th Int. 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 = {Proc. 4th Int. Workshop on Algorithmic Learning
Theory},
year = 1993,
volume = 744,
series = {Lecture Notes in Artificial Intelligence},
pages = {197--208},
publisher = {Springer-Verlag}
}
@INPROCEEDINGS{Kapur94,
author = {S. Kapur},
title = {Language learning under various types of constraint
combinations},
booktitle = {Proc. 5th Int. Workshop on Algorithmic Learning
Theory},
year = 1994,
volume = 872,
series = {Lecture Notes in Artificial Intelligence},
pages = {365--378},
publisher = {Springer-Verlag}
}
@INPROCEEDINGS{KapurBi92,
author = {S. Kapur and G. Bilardi},
title = {Language learning from stochastic input},
booktitle = {Proc. 5th Annu. Workshop on Comput. Learning Theory},
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{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}
}
@BOOK{KapurKe92,
title = {Entropy Optimization Principles with Applications},
publisher = {Academic Press, Inc.},
year = 1992,
author = {J. N. Kapur and H. K Kesavan}
}
@INPROCEEDINGS{KapurNA86,
author = {Kapur, D. and P. Narendran},
title = {{NP}-completeness of the set unification and
matching problmes.},
booktitle = {Proc. of the 8th conference on {A}utomated
{D}deduction},
year = 1986,
volume = 230,
pages = {489--495},
publisher = {Springer Verlag}
}
@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
}
@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{KarovEd98,
author = {Y. Karov and S. Edelman},
title = {Similarity-based word sense disambiguation},
year = 1998,
volume = 4,
pages = {41--59},
booktitle = {Computational Linguistics}
}
@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}
}
@INPROCEEDINGS{KarpinskiMa95,
author = {Marek Karpinski and Angus Macintyre},
title = {Bounding {VC}-dimension for neural networks:
progress and prospects},
booktitle = {Computational Learning Theory: EuroColt '95},
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 = {Proc. 27th Annual ACM Symposium on Theory of
Computing},
year = 1995,
pages = {200--208},
publisher = {ACM Press, New York, NY}
}
@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
}
@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{KatrenkoAd05,
author = {Sophia Katrenko and Peter Adriaans},
title = {Using Maximal Embedded Syntactic Subtrees for
Textual Entailment Recognition},
booktitle = {Proceedings of the Second PASCAL Challenges Workshop
on Recognizing Textual Entailment},
year = 2005,
}
@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
}
@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{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
}
@INPROCEEDINGS{KaufmannSt97,
author = {Susanne Kaufmann and Frank Stephan},
title = {Resource Bounded Next Value and Explanatory
Identification: Learning Automata, Patterns and
Polynomials On-Line},
booktitle = {Proc. 10th Annu. Conf. on Comput. Learning Theory},
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 = {Computational Learning Theory: EuroColt '97},
year = 1997,
pages = {316--330},
publisher = {Springer-Verlag}
}
@INPROCEEDINGS{KautzSe91,
author = {Kautz, H. and B. Selman},
title = {A General Framework for Knowledge Compilation},
year = 1991,
journal = {Proceedings of the International Workshop on
Processing Declarative Knowledge, Kaiserlautern,
Germany}
}
@INPROCEEDINGS{KautzSe92,
author = {Kautz, H. and B. Selman},
title = {Forming Concepts for Fast Inference},
booktitle = {Proceedings of AAAI-92},
year = 1992
}
@INPROCEEDINGS{KautzSe92a,
author = {Henry Kautz and Bart Selman},
title = {Speeding inference by acquiring new concepts},
booktitle = {Proc. of AAAI-92},
year = 1992,
address = {San Jose},
month = jul
}
@INPROCEEDINGS{KawaharaKu07,
author = {Kawahara, Daisuke and Kurohashi, Sadao},
title = {Probabilistic Coordination Disambiguation in a
Fully-Lexicalized {J}apanese Parser},
booktitle = {Proceedings of the 2007 Joint Conference of
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,
number = 1,
pages = "121--142"
)
@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 = {Proceedings of the 2007 Joint Conference of
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 = {Proceedings of the 2007 Joint Conference of
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}
}
@UNPUBLISHED{Kearns88,
author = {Michael Kearns},
title = {Thoughts on Hypothesis Boosting},
note = {(Unpublished)},
month = Dec,
year = 1988
}
@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.}
}
@INPROCEEDINGS{Kearns93,
author = {M. Kearns},
title = {Efficient noise-tolerant learning from statistical
queries},
booktitle = {Proc. 25th Annu. ACM Sympos. Theory Comput.},
year = 1993,
pages = {392--401},
publisher = {ACM Press, New York, NY}
}
@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{KearnsLi88,
author = {Kearns, M. and M. Li},
title = {Learning in the Presence of Malicious Errors},
booktitle = {Proceedings of the Twentieth Annual ACM Symposium on
Theory of Computing},
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.}
}
@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{KearnsLiPiVa87,
author = {Kearns, M. and M. Li and L. Pitt and L. G. Valiant},
title = {On the Learnability of Boolean Formulae},
booktitle = {Proceedings of the Nineteenth Annual ACM Symposium
on Theory of Computing},
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 = {Proceedings of the Fourth International Workshop on
Machine Learning},
year = 1987,
pages = {337--352},
address = {University of California, Irvine},
month = Jun
}
@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
}
@INPROCEEDINGS{KearnsMa98,
author = {Michael Kearns and Yishay Mansour},
title = {A fast, bottom-up decision tree pruning algorithm
with near-optimal generalization},
booktitle = {Proc. 15th International Conf. on Machine Learning},
year = 1998,
pages = {269--277},
publisher = {Morgan Kaufmann, San Francisco, CA}
}
@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{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 = {Proceedings of Twenty-sixth ACM Symposium on Theory
of Computing},
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 = {Proceedings of the Second Annual Workshop on
Computational Learning Theory},
year = 1989,
pages = {57--71},
address = {Santa Cruz, California},
month = Jul
}
@INPROCEEDINGS{KearnsRo97,
author = {Michael Kearns and Dana Ron},
title = {Algorithmic stability and sanity-check bounds for
leave-one-out cross-validation},
booktitle = {Proc. 10th Annu. Conf. on Comput. Learning Theory},
year = 1997,
pages = {152--162},
publisher = {ACM Press, New York, NY}
}
@INPROCEEDINGS{KearnsRo98,
author = {Michael Kearns and Dana Ron},
title = {Testing problems with sub-learning sample
complexity},
booktitle = {Proc. 11th Annu. Conf. on Comput. Learning Theory},
year = 1998,
pages = {268--279},
publisher = {ACM Press, New York, NY}
}
@INPROCEEDINGS{KearnsSc90b,
author = {Kearns, M. and R. Schapire},
title = {Efficient Distribution-free Learning of
Probabilistic Concepts},
booktitle = {Proceedings of COLT '90},
year = 1990,
pages = 389,
publisher = {Morgan Kaufmann},
note = {Abstract only},
tag = {TOC-display}
}
@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{KearnsScSe92,
author = {M. J. Kearns and R. E. Schapire and L. M. Sellie},
title = {Toward efficient agnostic learning},
booktitle = {Proc. 5th Annu. Workshop on Comput. Learning Theory},
year = 1992,
pages = {341--352},
publisher = {ACM Press, New York, NY}
}
@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}
}
@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 = {Proc. 13th Annu. Conference on Comput. Learning
Theory},
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 = {Proc. 15th International Conf. on Machine Learning},
year = 1998,
pages = {260--268},
publisher = {Morgan Kaufmann, San Francisco, CA}
}
@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}
}
@INPROCEEDINGS{KearnsVa89,
author = {M. Kearns and L. G. Valiant},
title = {Cryptographic limitations on learning {B}oolean
formulae and finite automata},
booktitle = {Proc. of the 21st Symposium on Theory of Computing},
year = 1989,
pages = {433--444},
publisher = {ACM Press, New York, NY},
comment = {To appear in J. ACM}
}
@UNPUBLISHED{KearnsVa92,
author = {Michael Kearns and Umesh Vazirani},
title = {Topics in Learning Theory},
note = {(Prelinary draft)},
year = 1992
}
@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{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
}
@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}
}
@INPROCEEDINGS{Kelly89,
author = {K. T. Kelly},
title = {Induction from the general to the more general},
booktitle = {Proc. 2nd Annu. Workshop on Comput. Learning Theory},
year = 1989,
pages = {334--348},
address = {San Mateo, CA},
publisher = {Morgan Kaufmann}
}
@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
}
@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 = {Proceedings of the 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 = {Proceedings of ILP 2001},
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{KerstingRa00,
author = {K. Kersting and L. De Raedt},
title = {Bayesian Logic Programs},
booktitle = {Proceedings of the 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{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{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{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 = {Proc. 4th European Conference on Computational
Learning Theory},
year = 1999,
volume = 1572,
series = {Lecture Notes in Artificial Intelligence},
pages = {111--125},
publisher = {Springer-Verlag}
}
@INPROCEEDINGS{Kharitonov92,
author = {M. Kharitonov},
title = {Cryptographic lower bounds on learnability of
{B}oolean functions on the uniform distribution},
booktitle = {Proc. 5th Annu. Workshop on Comput. Learning Theory},
year = 1992,
pages = {29--36},
publisher = {ACM Press, New York, NY}
}
@INPROCEEDINGS{Kharitonov93,
author = {M. Kharitonov},
title = {Cryptographic hardness of distribution-specific
learning},
booktitle = {Proc. 25th Annu. ACM Sympos. Theory Comput.},
year = 1993,
pages = {372--381},
publisher = {ACM Press, New York, NY}
}
@INPROCEEDINGS{Kietz93,
author = {Jorg-Uwe Kietz},
title = {Some computational lower bounds for the
computational complexity of inductive logic
programmming},
booktitle = {1993 European Conference of Machine Learning},
year = 1993,
address = {Vienna, Austria}
}
@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{KietzL94,
author = {J{\"o}rg-Uwe Kietz and Marcus L{\"u}bbe},
title = {An efficient subsumption algorithm for inductive
logic programming},
booktitle = {Proc. 11th International Conference on Machine
Learning},
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 = {Proc. 7th Annu. ACM Conf. on Comput. Learning
Theory},
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 = {Proc. 6th Annu. Conf. on Comput. Learning Theory},
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 = {Computational Learning Theory: EuroColt '95},
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{Kim91,
author = {W. M. Kim},
title = {Learning by smoothing: a morphological approach},
booktitle = {Proc. 4th Annu. Workshop on Comput. Learning Theory},
year = 1991,
pages = {43--57},
address = {San Mateo, CA},
publisher = {Morgan Kaufmann}
}
@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{KimHo07,
author = {Kim, Soo-Min and Hovy, Eduard},
title = {{Crystal}: Analyzing Predictive Opinions on the Web},
booktitle = {Proceedings of the 2007 Joint Conference of
EMNLP-CoNLL},
year = 2007,
pages = {1056--1064},
url = {http://www.aclweb.org/anthology/D/D07/D07-1113}
}
@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{KimRo95,
author = {Jeong Han Kim and James R. Roche},
title = {On the optimal capacity of binary neural networks:
rigorous combinatorial approaches},
booktitle = {Proc. 8th Annu. Conf. on Comput. Learning Theory},
year = 1995,
pages = {240--249},
publisher = {ACM Press, New York, NY}
}
@INPROCEEDINGS{KimberLo92,
author = {Kimber, Don and Philip M. Long},
title = {The learning complexity of smooth functions of a
single variable},
booktitle = {Proceedings of COLT '92},
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 = {Proc. 2nd Int. Workshop on Algorithmic Learning
Theory},
year = 1992,
pages = {47--60},
publisher = {IOS Press}
}
@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 = {Proc. 15th International Conf. on Machine Learning},
year = 1998,
pages = {278--286},
publisher = {Morgan Kaufmann, San Francisco, CA}
}
@INPROCEEDINGS{KimuraKo99,
author = {Hajime Kimura and Shigenobu Kobayashi},
title = {Efficient non-linear control by combining
{Q}-learning with local linear controllers},
booktitle = {Proc. 16th International Conf. on Machine Learning},
year = 1999,
pages = {210--219},
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 = {Proc. 14th International Conference on Machine
Learning},
year = 1997,
pages = {152--160},
publisher = {Morgan Kaufmann}
}
@INPROCEEDINGS{KimuraToSh94,
author = {S. Kimura and A. Togashi and N. Shiratori},
title = {Synthesis algorithm for recursive processes by
{$\mu$}-calculus},
booktitle = {Proc. 5th Int. Workshop on Algorithmic Learning
Theory},
year = 1994,
pages = {379--394},
publisher = {Springer-Verlag}
}
@INPROCEEDINGS{KimuraYaKo95,
author = {Hajime Kimura and Masayuki Yamamura and Shigenobu
Kobayashi},
title = {Reinforcement learning by stochastic hill climbing
on discounted reward},
booktitle = {Proc. 12th International Conference on Machine
Learning},
year = 1995,
pages = {295--303},
publisher = {Morgan Kaufmann}
}
@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}
}
@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{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 = {Proc. of the 1977 International FCT-Conference},
year = 1977,
volume = 56,
series = {Lecture Notes in Computer Science},
pages = {435--440}
}
@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}
}
@INPROCEEDINGS{Kinber88,
author = {E. B. Kinber},
title = {Inductive Syntactical Synthesis of Programs From
Sample Computations},
booktitle = {Proc. 13th Internat. Symposium on Mathematical
Foundations of Computer Science},
year = 1988,
volume = 324,
series = {Lecture Notes in Computer Science},
pages = {73--84}
}
@INPROCEEDINGS{Kinber90,
author = {E. B. Kinber},
title = {Some problems of learning with an oracle},
booktitle = {Proc. 3rd Annu. Workshop on Comput. Learning Theory},
year = 1990,
pages = {178--186},
address = {San Mateo, CA},
publisher = {Morgan Kaufmann}
}
@INPROCEEDINGS{Kinber94,
author = {E. Kinber},
title = {Monotonicity versus efficiency for learning
languages from texts},
booktitle = {Proc. 5th Int. Workshop on Algorithmic Learning
Theory},
year = 1994,
pages = {395--406},
publisher = {Springer-Verlag}
}
@INPROCEEDINGS{KinberSt95,
author = {Efim Kinber and Frank Stephan},
title = {Language learning from texts: mind changes, limited
memory and monotonicity},
booktitle = {Proc. 8th Annu. Conf. on Comput. Learning Theory},
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
}
@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}
}
@INPROCEEDINGS{KinberZe89,
author = {E. B. Kinber and T. Zeugmann},
title = {Monte-Carlo Inference and its Relations to Reliable
Frequency Identification},
booktitle = {Proc. 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 = {Proc. 2nd Internat. Workshop on Analogical and
Inductive Inference},
year = 1989,
volume = 397,
series = {Lecture Notes in Artificial Intelligence},
pages = {148--160},
publisher = {Springer--Verlag}
}
@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}
}
@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 = {Proceedings of LREC-2002},
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 = "Proceedings of the 2002 Human Language Technology
conference (HLT).",
address = {San Diego, CA},
year = 2002,
)
@INPROCEEDINGS{KingsburyPaMa:02,
author = {P. Kingsbury and M. Palmer and M. Marcus},
title = {Adding semantic annotation to the {P}enn treebank},
booktitle = {Proc. of the 2002 Human Language Technology
conference (HLT).},
year = 2002,
address = {San Diego, CA}
}
@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; }
}
@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}
}
@INPROCEEDINGS{Kivinen89,
author = {J. Kivinen},
title = {Reliable and useful learning},
booktitle = {Proc. 2nd Annu. Workshop on Comput. Learning Theory},
year = 1989,
pages = {365--380},
address = {San Mateo, CA},
publisher = {Morgan Kaufmann}
}
@INPROCEEDINGS{KivinenMaUk92,
author = {J. Kivinen and H. Mannila and E. Ukkonen},
title = {Learning heirarchical rule sets},
booktitle = {Proc. 5th Annu. Workshop on Comput. Learning Theory},
year = 1992,
pages = {37--44},
publisher = {ACM Press, New York, NY}
}
@INPROCEEDINGS{KivinenMaUk94,
author = {J. Kivinen and H. Mannila and E. Ukkonen},
title = {Learning Rules with Local Exceptions},
booktitle = {Computational Learning Theory: EuroColt '93},
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{KivinenWa94,
author = {J. Kivinen and M. Warmuth},
title = {Using Experts for Predicting Continuous Outcomes},
booktitle = {Computational Learning Theory: EuroColt '93},
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{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 = {Proc. 8th Annu. Conf. on Comput. Learning Theory},
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 = {Proc. 27th Annual ACM Symposium on Theory of
Computing},
year = 1995,
pages = {209--218},
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{KivinenWa99,
author = {Jyrki Kivinen and Manfred K. Warmuth},
title = {Averaging Expert Predictions},
booktitle = {Proc. 4th European Conference on Computational
Learning Theory},
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 = {Proc. 12th Annu. Conf. on Comput. Learning Theory},
year = 1999,
pages = {134--144},
publisher = {ACM Press, New York, NY}
}
@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 = {Proc. 8th Annu. Conf. on Comput. Learning Theory},
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
}
@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}
}
@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{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{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{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}
}
@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
}
@INPROCEEDINGS{Klosgen93,
author = {W. Klosgen},
title = {Some Implementation Aspects of a Discovery System},
booktitle = {Proceedings of the 1993 workshop on Knowledge
Discovery in Databases},
year = 1993
}
@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},
pages = {599--612},
year = 1998
}
@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{Knuth68,
title = {The Art of Computer Programming: Fundamental
Algorithms},
publisher = {Addison-Wesley},
year = 1968,
author = {Knuth, Donald E.},
volume = 1
}
@BOOK{Knuth73,
title = {The Art of Computer Programming: Sorting and
Searching},
publisher = {Addison-Wesley},
year = 1973,
author = {Knuth, Donald E.},
volume = 3
}
@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}
}
@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 = {Proc. 4th Int. Workshop on Algorithmic Learning
Theory},
year = 1993,
volume = 744,
series = {Lecture Notes in Artificial Intelligence},
pages = {209--222},
publisher = {Springer-Verlag}
}
@INPROCEEDINGS{Ko90,
author = {K. Ko},
title = {On the complexity of learning minimum time-bounded
{T}uring machines},
booktitle = {Proc. 3rd Annu. Workshop on Comput. Learning Theory},
year = 1990,
pages = {82--96},
address = {San Mateo, CA},
publisher = {Morgan Kaufmann}
}
@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; }
}
@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}
}
@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{Kobayashi93,
author = {S. Kobayashi},
title = {Learning strategies using decision lists},
booktitle = {Proc. 4th Int. Workshop on Algorithmic Learning
Theory},
year = 1993,
volume = 744,
series = {Lecture Notes in Artificial Intelligence},
pages = {370--383},
publisher = {Springer-Verlag}
}
@INPROCEEDINGS{KobayashiInMa07,
author = {Kobayashi, Nozomi and Inui, Kentaro and Matsumoto,
Yuji},
title = {Extracting Aspect-Evaluation and Aspect-Of Relations
in Opinion Mining},
booktitle = {Proceedings of the 2007 Joint Conference of
EMNLP-CoNLL},
year = 2007,
pages = {1065--1074},
url = {http://www.aclweb.org/anthology/D/D07/D07-1114}
}
@INPROCEEDINGS{KobayashiYo94,
author = {S. Kobayashi and T. Yokomori},
title = {Learning concatenations of locally testable
languages from positive data},
booktitle = {Proc. 5th Int. Workshop on Algorithmic Learning
Theory},
year = 1994,
volume = 872,
series = {Lecture Notes in Artificial Intelligence},
pages = {407--422},
publisher = {Springer-Verlag}
}
@INPROCEEDINGS{KobayashiYo95,
author = {Satoshi Kobayashi and Takashi Yokomori},
title = {On approximately identifying concept classes in the
limit},
booktitle = {Proc. 6th Int. Workshop on Algorithmic Learning
Theory},
year = 1995,
volume = 997,
series = {Lecture Notes in Artificial Intelligence},
pages = {298--312},
publisher = {Springer-Verlag}
}
@INPROCEEDINGS{KobayashiYo97,
author = {Satoshi Kobayashi and Takashi Yokomori},
title = {Identifiability of subspaces and homomorphic images
of zero-reversible languages},
booktitle = {Algorithmic Learning Theory: ALT '97},
year = 1997,
volume = 1316,
series = {Lecture Notes in Artificial Intelligence},
pages = {48--61},
publisher = {Springer-Verlag}
}
@INPROCEEDINGS{KoblerLi97,
author = {Johannes K{\"o}bler and Wolfgang Lindner},
title = {Oracles in ${\Sigma}^p_2$ are sufficient for exact
learning},
booktitle = {Algorithmic Learning Theory: ALT '97},
year = 1997,
volume = 1316,
series = {Lecture Notes in Artificial Intelligence},
pages = {277--290},
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}
}
@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{Kodratoff95,
author = {Yves Kodratoff},
title = {Technical and scientific issues of {KDD}},
booktitle = {Proc. 6th Int. Workshop on Algorithmic Learning
Theory},
year = 1995,
volume = 997,
series = {Lecture Notes in Artificial Intelligence},
pages = {261--265},
publisher = {Springer-Verlag}
}
@INPROCEEDINGS{KodratoffFa78,
author = {Y. Kodratoff and J. Fargues},
title = {A sane algorithm for the synthesis of {LISP}
functions from example problems},
booktitle = {Proc. of AISB/GI Conference on Artificial
Intelligence},
year = 1978,
pages = {169--175},
organization = {AISB and GI}
}
@INPROCEEDINGS{KoehnHo07,
author = {Koehn, Philipp and Hoang, Hieu},
title = {Factored Translation Models},
booktitle = {Proceedings of the 2007 Joint Conference of
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 = {Proc. 13th International Conference on Machine
Learning},
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 = {Proc. 9th Annu. Conf. on Comput. Learning Theory},
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 = {Proc. 5th Int. Workshop on Algorithmic Learning
Theory},
year = 1994,
volume = 872,
series = {Lecture Notes in Artificial Intelligence},
pages = {149--160},
publisher = {Springer-Verlag}
}
@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}
}
@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 = {Proc. 12th International Conference on Machine
Learning},
year = 1995,
pages = {304--312},
publisher = {Morgan Kaufmann}
}
@INPROCEEDINGS{KohaviKu97,
author = {Ron Kohavi and Clayton Kunz},
title = {Option decision trees with majority votes},
booktitle = {Proc. 14th International Conference on Machine
Learning},
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 = {Proc. 13th International Conference on Machine
Learning},
year = 1996,
pages = {275--283},
publisher = {Morgan Kaufmann}
}
@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 = {Proc. 7th Annu. ACM Conf. on Comput. Learning
Theory},
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 = {Computational Learning Theory: EuroColt '97},
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{Koller99,
author = {D. Koller},
title = {Probabilistic relational models},
booktitle = {Proceedings of 9th International Workshop on
Inductive Logic Programming (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 = {Proc. 15th International Conf. on Machine Learning},
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 = {Proceedings of the 15th National Conference on
Artificial Intelligence (AAAI)},
year = 1998,
pages = {580-587}
}
@INPROCEEDINGS{KollerSa96,
author = {Daphne Koller and Mehran Sahami},
title = {Toward optimal feature selection},
booktitle = {Proc. 13th International Conference on Machine
Learning},
year = 1996,
pages = {284--292},
publisher = {Morgan Kaufmann}
}
@INPROCEEDINGS{KollerSa97,
author = {Daphne Koller and Mehran Sahami},
title = {Hierarchically classifying documents using very few
words},
booktitle = {Proc. 14th International Conference on Machine
Learning},
year = 1997,
pages = {170--178},
publisher = {Morgan Kaufmann}
}
@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}
}
@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 = {29th Annual Symposium on Foundation of Computer
Science},
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 = {Proc. 3th Int. 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 = {Proc. 12th International Conference on Machine
Learning},
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}
}
@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 = {Proc. 11th International Conference on Machine
Learning},
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 = {Computational Learning Theory: EuroColt '95},
year = 1995,
volume = 904,
series = {Lecture Notes in Artificial Intelligence},
pages = {367--379},
publisher = {Springer-Verlag}
}
@INPROCEEDINGS{KoshibaMTa95,
author = {Takeshi Koshiba and Erkki M{\"a}kinen and Yuji
Takada},
title = {Learning strongly deterministic even linear
languages from positive examples},
booktitle = {Proc. 6th Int. Workshop on Algorithmic Learning
Theory},
year = 1995,
volume = 997,
series = {Lecture Notes in Artificial Intelligence},
pages = {41--54},
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{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 = {Proc. 10th Annu. Conf. on Comput. Learning Theory},
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 = {Proc. 2nd Int. 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}
}
@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{Kramer01,
author = {Stefan Kramer},
title = {Demand-Driven Construction of Structural Features in
ILP},
booktitle = {Proceedings of ILP 2001},
year = 2001,
editor = {Celine Rouveirol and Michele Sebag},
volume = {2157 of LNAI},
publisher = {Springer-Verlag}
}
@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{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}
}
@INPROCEEDINGS{KramerDeRa01,
author = {S. Kramer and L. De Raedt},
title = {Feature Construction with Version Spaces for
Biochemical Applications},
booktitle = {Proceedings of the Eighteenth International
Conference on Machine Learning (ICML-2001)},
year = 2001
}
@INPROCEEDINGS{KramerFr00,
author = {S. Kramer and E. Frank},
title = {Bottom-Up propositionalization},
booktitle = {Proceedings of the ILP-2000 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{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 = {Proc. 12th International Conference on Machine
Learning},
year = 1995,
pages = {322--330},
publisher = {Morgan Kaufmann}
}
@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}
}
@INPROCEEDINGS{Kubat96,
author = {Miroslav Kubat},
title = {Second tier for decision trees},
booktitle = {Proc. 13th International Conference on Machine
Learning},
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 = {Proc. 14th International Conference on Machine
Learning},
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 = {Proc. of the 15th International Colloquium on
Automata, Languages, and Programming},
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{KuhPeRi90,
author = {T. Kuh and T. Petsche and R. Rivest},
title = {Learning time varying concepts},
booktitle = {NIPS 3},
year = 1990,
publisher = {Morgan Kaufmann}
}
@INPROCEEDINGS{KuhPeRi91,
author = {A. Kuh and T. Petsche and R. L. Rivest},
title = {Learning Time-Varying Concepts},
booktitle = {Advances in Neural Information Processing Systems 3},
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 4},
year = 1991,
publisher = {Morgan Kaufmann}
}
@INPROCEEDINGS{KuhRi92,
author = {T. P. Anthony Kuh and R. L. Rivest},
title = {Incrementally Learning Time-Varying Half-planes},
booktitle = {Advances in Neural Information Processing Systems 4},
year = 1992,
pages = {920--927},
publisher = {Morgan Kaufmann}
}
@INPROCEEDINGS{Kuhlmann00,
author = {Christian Kuhlmann},
title = {Hardness Results for General Two-Layer Neural
Networks},
booktitle = {Proc. 13th Annu. Conference on Comput. Learning
Theory},
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 = {Proc. 4th European Conference on Computational
Learning Theory},
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}
}
@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{KulkarniZe93,
author = {S. Kulkarni and O. Zeitouni},
title = {On probably correct classification of concepts},
booktitle = {Proc. 6th Annu. Conf. on Comput. Learning Theory},
year = 1993,
pages = {111--116},
publisher = {ACM Press, New York, NY}
}
@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.}
}
@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.}
}
@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, Conference on Intelligent Systems in Molecular
Biology},
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{KumarOcMa07,
author = {Kumar, Shankar and Och, Franz J. and Macherey,
Wolfgang},
title = {Improving Word Alignment with Bridge Languages},
booktitle = {Proceedings of the 2007 Joint Conference of
EMNLP-CoNLL},
year = 2007,
pages = {42--50},
url = {http://www.aclweb.org/anthology/D/D07/D07-1005}
}
@INPROCEEDINGS{KumarSi99,
author = {R. Kumar and D. Sivakumar},
title = {Roundness Estimation via Random Sampling},
booktitle = SODA,
year = 1999,
pages = {603--612}
}
@INPROCEEDINGS{Kummer94,
author = {M. Kummer},
title = {The strength of noninclusions for teams of finite
learners},
booktitle = {Proc. 7th Annu. ACM Conf. on Comput. Learning
Theory},
year = 1994,
pages = {268--277},
publisher = {ACM Press, New York, NY}
}
@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{KummerOt96,
author = {Martin Kummer and Matthias Ott},
title = {Learning branches and learning to win closed games},
booktitle = {Proc. 9th Annu. Conf. on Comput. Learning Theory},
year = 1996,
pages = {280--291},
publisher = {ACM Press, New York, NY}
}
@INPROCEEDINGS{KummerSt94,
author = {M. Kummer and F. Stephan},
title = {Inclusion problems in parallel learning and games},
booktitle = {Proc. 7th Annu. ACM Conf. on Comput. Learning
Theory},
year = 1994,
pages = {287--298},
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}
}
@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{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}
}
@INPROCEEDINGS{Kurita93,
author = {T. Kurita},
title = {Iterative weighted least squares algorithms for
neural networks classifiers},
booktitle = {Proc. 3th Int. 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 = {Proc. 1st Annu. Workshop on Comput. Learning Theory},
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 = {Proc. 2nd Annu. Workshop on Comput. Learning Theory},
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 = {Proc. 9th Annu. Conf. on Comput. Learning Theory},
year = 1996,
pages = {266--269},
publisher = {ACM Press, New York, NY}
}
@INPROCEEDINGS{KushilevitzMa91,
author = {E. Kushilevitz and Y. Mansour},
title = {Learning decision trees using the Fourier sprectrum},
booktitle = {Proc. 23rd Ann. IEEE Symp. on Foundations of
Computer Science},
year = 1991,
pages = {455--464}
}
@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}
}
@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 = {Algorithmic Learning Theory: ALT '97},
year = 1997,
volume = 1316,
series = {Lecture Notes in Artificial Intelligence},
pages = {401--415},
publisher = {Springer-Verlag}
}
@INPROCEEDINGS{Kwek99,
author = {Stephen S. Kwek},
title = {An apprentice learning model},
booktitle = {Proc. 12th Annu. Conf. on Comput. Learning Theory},
year = 1999,
pages = {63--74},
publisher = {ACM Press, New York, NY}
}
@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}
}
@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 = {Proc. 7th Annu. ACM Conf. on Comput. Learning
Theory},
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 = {Proceedings of the 2007 Joint Conference of
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{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{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 = {Proceedings of the 2007 Joint Conference of
EMNLP-CoNLL},
year = 2007,
pages = {334--342},
url = {http://www.aclweb.org/anthology/D/D07/D07-1035}
}
@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}
}
@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{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}
}
@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
}
@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{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
}
@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}
}
@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{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{LPJK07,
author = {Liang, Percy and Petrov, Slav and Jordan, Michael
and Klein, Dan},
title = {The Infinite {PCFG} Using Hierarchical {Dirichlet}
Processes},
booktitle = {Proceedings of the 2007 Joint Conference of
EMNLP-CoNLL},
year = 2007,
pages = {688--697},
url = {http://www.aclweb.org/anthology/D/D07/D07-1072}
}
@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 = {Proceedings of the Seventh International Conference
on Machine Learning and Cybernetics},
year = 2008,
pages = {1581--1585}
}
@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{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{LSCP96,
author = {D. Lewis and R. E. Schapire and J. P. Callan and
R. Papka},
title = {Training algorithms for linear text classifiers},
booktitle = {SIGIR '96: Proc. of the 19th Int. Conference on
Research and Development in Information Retrieval,
1996.},
year = 1996
}
@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,
number = 6,
pages = {391-–407}
}
@ARTICLE{LSK,
author = {Nello Christianini and John Shawe-Taylor and Huma
Lodhi},
title = {Latent {S}emantic {K}ernels},
journal = {Journal of Intelligent Information Systems},
volume = 18,
number = {2--3},
year = 2002,
pages = {127--152}
}
@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{LSWK00,
author = {D. Litman and S. Singh and M. Walker and M. Kearns},
title = {Automatic Optimization of Dialogue Management},
booktitle = COLING,
year = 2000
}
@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{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; }
}
@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{Lafferty99,
author = {John Lafferty},
title = {Additive models, boosting, and inference for
generalized divergences},
booktitle = {Proc. 12th Annu. Conf. on Comput. Learning Theory},
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{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
}
@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
}
@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{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{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{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}
}
@INPROCEEDINGS{Laird86,
author = {P. Laird},
title = {Inductive inference by refinement},
booktitle = {Proc. of AAAI-86},
year = 1986,
pages = {472--476},
organization = {AAAI},
annote = {Earlier version is Yale Comp Sci TR-376 from 1985}
}
@TECHREPORT{Laird88,
author = {P. Laird},
title = {Learning by Making Models},
institution = {NASA-Ames Reasarch Center},
year = 1988,
number = {RIA-88-4-12-0}
}
@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}
}
@INPROCEEDINGS{Laird93,
author = {P. Laird},
title = {Identifying and using patterns in sequential data},
booktitle = {Proc. 4th Int. Workshop on Algorithmic Learning
Theory},
year = 1993,
volume = 744,
series = {Lecture Notes in Artificial Intelligence},
pages = {1--18},
publisher = {Springer-Verlag}
}
@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
}
@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}
}
@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
}
@INPROCEEDINGS{LairdRDu93,
author = {P. Laird and S. R and P. Dunning},
title = {A model of sequence extrapolation},
booktitle = {Proc. 6th Annu. Conf. on Comput. Learning Theory},
year = 1993,
pages = {84--93},
publisher = {ACM Press, New York, NY}
}
@INPROCEEDINGS{LairdRoNe84,
author = {Laird, John and Paul Rosenbloom and Allen Newell},
title = {Towards Chunking as a General Learning Mechanism},
booktitle = {Proceedings AAAI-84},
year = 1984,
pages = {188--192},
month = aug,
orgainzation = {American Association for Artificial Intelligence}
}
@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
}
@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}
}
@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,
number = 2,
pages = {157-169}
}
@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
}
@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
)
@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{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{Lang92,
author = {K. J. Lang},
title = {Random {DFA}'s can be approximately learned from
sparse uniform examples},
booktitle = {Proc. 5th Annu. Workshop on Comput. Learning Theory},
year = 1992,
pages = {45--52},
publisher = {ACM Press, New York, NY}
}
@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 = {Proc. 12th International Conference on Machine
Learning},
year = 1995,
pages = {340--343},
publisher = {Morgan Kaufmann}
}
@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 = {Proc. 4th International Colloquium on Grammatical
Inference - ICGI '98},
year = 1998,
volume = 1433,
series = {Lecture Notes in Artificial Intelligence},
pages = {1--12},
publisher = {Springer-Verlag}
}
@INPROCEEDINGS{Lange90,
author = {S. Lange},
title = {A Note on Polynomial-Time Inference of $k$-Variable
Pattern Language},
booktitle = {Nonmonotonic and Inductive Logic, 1st International
Workshop, Karlsruhe, Germany},
year = 1990,
volume = 543,
series = {Lecture Notes in Artificial Intelligence},
pages = {178--183},
publisher = {Springer Verlag}
}
@INPROCEEDINGS{Lange94,
author = {S. Lange},
title = {The representation of recursive languages and its
impact on the efficiency of learning},
booktitle = {Proc. 7th Annu. ACM Conf. on Comput. Learning
Theory},
year = 1994,
pages = {256--267},
publisher = {ACM Press, New York, NY}
}
@INPROCEEDINGS{LangeGr98,
author = {Steffen Lange and Gunter Grieser},
title = {On Variants of Iterative Learning},
booktitle = {Proc. 1st International Conference on Discovery
Science},
year = 1998,
volume = 1532,
series = {Lecture Notes in Artificial Intelligence},
pages = {72--83},
publisher = {Springer-Verlag}
}
@INPROCEEDINGS{LangeGr99,
author = {Steffen Lange and Gunter Grieser},
title = {On the Strength of Incremental Learning},
booktitle = {Proc. 10th International Conference on Algorithmic
Learning Theory - ALT '99},
year = 1999,
volume = 1720,
series = {Lecture Notes in Artificial Intelligence},
pages = {118--131},
publisher = {Springer-Verlag}
}
@INPROCEEDINGS{LangeNeWi94,
author = {S. Lange and J. Nessel and R. Wiehagen},
title = {Language learning from good examples},
booktitle = {Proc. 5th Int. Workshop on Algorithmic Learning
Theory},
year = 1994,
pages = {423--437},
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{LangeWa94,
author = {S. Lange and P. Watson},
title = {Machine Discovery in the Presence of Incomplete or
Ambiguous Data},
booktitle = {Proc. 5th Internat. 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 = {Proc. 7th Internat. Workshop on Algorithmic Learning
Theory},
year = 1996,
volume = 1160,
series = {Lecture Notes in Artificial Intelligence},
pages = {228--241},
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 = {Proc. 5th Annu. Workshop on Comput. Learning Theory},
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 = {Proc. 3rd Internat. Workshop on Analogical and
Inductive Inference},
year = 1992,
volume = 642,
series = {Lecture Notes in Artificial Intelligence},
pages = {244--259},
publisher = {Springer--Verlag}
}
@INPROCEEDINGS{LangeZe93,
author = {S. Lange and T. Zeugmann},
title = {Language Learning with a Bounded Number of Mind
Changes},
booktitle = {Proc. 10th Annual Symposium on Theoretical Aspects
of Computer Science},
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 = {Proc. 6th Annu. Conf. on Comput. Learning Theory},
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 = {Proc. 2nd Internat. Workshop on Nonmonotonic and
Inductive Logic},
year = 1993,
volume = 659,
series = {Lecture Notes in Artificial Intelligence},
pages = {254--269},
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}
}
@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 = {Proc. 8th Australian Joint Conference on Artificial
Intelligence - AI'95},
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 = {Proc. 2nd European Conference on Computational
Learning Theory, EuroColt '95},
year = 1995,
volume = 904,
series = {Lecture Notes in Artificial Intelligence},
pages = {125--139},
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}
}
@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 = {Proc. 12th Annu. Conf. on Comput. Learning Theory},
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 = {Proc. 13th Annu. Conference on Comput. Learning
Theory},
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 = {Advances in Neural Information Processing Systems},
year = 2002
}
@INPROCEEDINGS{LanglaisPa07,
author = {Langlais, Philippe and Patry, Alexandre},
title = {Translating Unknown Words by Analogical Learning},
booktitle = {Proceedings of the 2007 Joint Conference of
EMNLP-CoNLL},
year = 2007,
pages = {877--886},
url = {http://www.aclweb.org/anthology/D/D07/D07-1092}
}
@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{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{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{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{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{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 = {Proc. 12th International Conference on Machine
Learning},
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}
}
@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{LangleySa99,
author = {Pat Langley and Stephanie Sage},
title = {Tractable average-case analysis of naive {B}ayesian
classifiers},
booktitle = {Proc. 16th International Conf. on Machine Learning},
year = 1999,
pages = {220--228},
publisher = {Morgan Kaufmann, San Francisco, CA}
}
@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}
}
@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
}
@Article{Lapata02,
author = {Maria Lapata},
title = {The Disambiguation of Nominalisations},
journal = {Computational Linguistics},
year = 2002,
volume = 28,
number = 3,
pages = {357--388}
}
@INPROCEEDINGS{LapataBr99,
AUTHOR = "M. Lapata and C. Brew",
TITLE = "Using Subcategorization to Resolve Verb Class
Ambiguity",
BOOKTITLE = EMNLP,
YEAR = 1999,
pages = "266-274",
}
@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}
}
@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,
volume = 16,
pages = "197--212",
year = 1990
)
@misc(Lappin92,
author = "Shlaon Lappin and Herbert Leass",
note = "ms. IBM T.J. Watson Reseaarch Center,
Yorktown-Heights and IBM Germany Scientific Center,
Heidelberg",
year = 1992
)
@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 = {Proceedings of the 19th Annual Conference on
Uncertainty in Artificial Intelligence (UAI-03)},
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; }
}
@TECHREPORT{Laskey05,
author = {K. B. Laskey},
title = {First-Order {Bayesian} Logic},
institution = {George Mason University Department of Systems
Engineering and Operations Research},
year = 2005
}
@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
}
@INPROCEEDINGS{Lathrop96,
author = {Richard H. Lathrop},
title = {On the learnability of the uncomputable},
booktitle = {Proc. 13th International Conference on Machine
Learning},
year = 1996,
pages = {302--309},
publisher = {Morgan Kaufmann}
}
@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}
}
@INPROCEEDINGS{LavracDz91,
author = {Lavrac, N. and Dzeroski, S.},
title = {Learning nonrecursive definitions of relations with
LINUS},
booktitle = {Proceedings of the 5 th European Working Session on
Learning},
year = 1991,
pages = {265-281},
publisher = {Springer}
}
@BOOK{LavracDz94,
title = {Inductive Logic Programming: Techniques and
Applications},
publisher = {Ellis Horwood},
year = 1994,
author = {Lavrac, N. and Dzeroski, D.},
address = {London}
}
@INPROCEEDINGS{LavracDzGr91,
author = {N. Lavrac and S. Dzeroski and M. Grobelnik},
title = {Learning Nonrecursive Definitions of Relations with
{LINUS}},
booktitle = {Proceedings of the European Working Session on
Learning : Machine Learning ({EWSL}-91)},
year = 1991,
volume = 482,
series = {LNAI},
pages = {265--281},
address = {Porto, Portugal},
month = mar,
publisher = {Springer Verlag}
}
@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}
}
@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}
}
@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 = {Algorithmic Learning Theory: ALT '96},
year = 1996,
volume = 1160,
series = {Lecture Notes in Artificial Intelligence},
pages = {127--134},
publisher = {Springer-Verlag}
}
@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}
}
@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
}
@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",
volume = 24,
number = 1,
pages = "147-165",
year = 1998,
url = "citeseer.ist.psu.edu/leacock98using.html"
}
@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",
}
@INPROCEEDINGS{LebanonLa02,
author = {Guy Lebanon and John Lafferty},
title = {Cranking: Combining Rankings Using Conditional
Probability Models on Permutations},
booktitle = ICML,
year = 2002
}
@INPROCEEDINGS{LebanonLa03,
author = {G. Lebanon and J. Lafferty},
title = {Conditional Models on the Ranking Poset.},
booktitle = NIPS,
year = 2003,
volume = 15,
pages = {431-438}
}
@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}
}
@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,
number = 2,
pages = {277--279}
}
@InProceedings{Lee01,
author = {L. Lee},
title = {On the Effectiveness of the Skew Divergence for
Statistical Language Analysis},
booktitle = "Artificial Intelligence and Statistics 2001",
pages = {65--72},
year = 2001
}
@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}
}
@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}
}
@INCOLLECTION{Lee89,
author = {Lee, Kai-Fu},
title = {Automatic Speech Recognition},
booktitle = {1988/1989 Computer Science Research Review},
publisher = {School of Computer Science, {C}arnegie {M}ellon
{U}niversity},
year = 1989,
pages = {7--16}
}
@phdthesis{Lee97,
author = "L. Lee",
title = "Similarity-Based Approaches to Natural Language
Processing",
school = "Computer Science Department, Harvard University",
year = 1997,
month = "Aug",
}
@INPROCEEDINGS{Lee99,
author = {L. Lee},
title = {Measure of Distributional Similarity},
booktitle = ACL,
year = 1999,
pages = {25-32}
}
@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 = {Proc. 7th Annu. ACM Conf. on Comput. Learning
Theory},
year = 1994,
pages = {362--367},
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 = {Proc. 8th Annu. Conf. on Comput. Learning Theory},
year = 1995,
pages = {369--376},
publisher = {ACM Press, New York, NY}
}
@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 = {Proc. 9th Annu. Conf. on Comput. Learning Theory},
year = 1996,
pages = {140--146},
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}
}
@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}
}
@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.}
}
@article(LeeNa05,
author = "J. N. Lee and L. R. Naigles",
title = "The input to verb learning in Mandarin Chinese: A
role for syntactic bootstrapping",
year = 2005,
journal = "Developmental Psychology",
volume = 41,
pages = "529-540"
)
@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 99",
pages = "33-40",
year = 1999
}
@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",
year = 1989,
title = "Animacy constraints on preschool children's
acquisition of syntax",
journal = "Child Development",
volume = 60,
pages = "237-245"
)
@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,
volume = 33,
number = 8,
pages = "30--49",
year = 1990
)
@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{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 = {Proc. 16th International Conf. on Machine Learning},
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{Levesque84,
author = {Levesque, H.},
title = {The logic of implicit and explicit belief.},
booktitle = {Proceedings AAAI-84},
year = 1984
}
@ARTICLE{Levesque86,
author = {Levesque, H.},
title = {Making believers out of computers.},
journal = {Artificial Intelligence},
year = 1986,
volume = 30,
pages = {81-108}
}
@INPROCEEDINGS{Levesque87,
author = {Levesque, H.},
title = {All I know: An abridged report.},
booktitle = {Proceedings AAAI-87},
year = 1987
}
@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}
}
@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}
}
@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
}
@BOOK{Levin93,
title = {English Verb Classes and Alternations: A Preliminary
Investigation},
publisher = {University of Chicago Press},
year = 1993,
author = {B. Levin},
address = {Chicago, IL}
}
@misc(LevinP,
note = "Private communication",
autor = "Beth Levin",
year = 1998
)
@book(LevinRa05,
author = "B. Levin and M. Rappaport-Hovav",
year = 2005,
title = "Argument Realization",
series = "Research Surveys in Linguistics Series",
publisher = "Cambridge University Press",
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 = {Proc. 3rd Annu. Workshop on Comput. Learning Theory},
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}
}
@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{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{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{Lewis,
author = "D. Lewis",
year = 1992,
title = "An evaluation of phrasal and clustered
representations on a text categorization problem",
booktitle = {Proceedings of ACM-SIGIR Conference on Information
Retrieval}
}
@inproceedings{Lewis-catlett94,
author = "D. Lewis and J. Catlett",
year = 1994,
title = "Heterogeneous uncertainty sampling for supervised
learning",
booktitle = {Machine Learning Proceedings of the 11th
International Conference}
}
@inproceedings{Lewis-gale94,
author = "D. Lewis and W. Gale",
year = 1994,
title = "Training text classifiers by uncertainty sampling",
booktitle = "Proceedings of ACM-SIGIR Conference on Information
Retrieval"
}
@INPROCEEDINGS{Lewis92,
author = {D. Lewis},
title = {An evaluation of phrasal and clustered
representations on a text categorization problem},
booktitle = {Proceedings of ACM-SIGIR Conference on Information
Retrieval},
year = 1992
}
@INPROCEEDINGS{Lewis96,
author = {David D. Lewis},
title = {Challenges in machine learning for text
classification},
booktitle = {Proc. 9th Annu. Conf. on Comput. Learning Theory},
year = 1996,
pages = 1,
publisher = {ACM Press, New York, NY}
}
@INPROCEEDINGS{LewisCa94,
author = {D. Lewis and J. Catlett},
title = {Heterogeneous uncertainty sampling for supervised
learning},
booktitle = {Machine Learning Proceedings of the 11th
International Conference},
year = 1994
}
@INPROCEEDINGS{LewisGa94,
author = {D. Lewis and W. Gale},
title = {Training text classifiers by uncertainty sampling},
booktitle = {Proceedings of ACM-SIGIR Conference on Information
Retrieval},
year = 1994
}
@inproceedings{Lewisetal96,
author = "D. Lewis and R. E. Schapire and J. P. Callan and
R. Papka",
year = 1996,
title = "Training algorithms for linear text classifiers",
booktitle = {SIGIR '96: Proc. of the 19th Int. Conference on
Research and Development in Information Retrieval,
1996.},
}
@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{Li90,
author = {M. Li},
title = {Towards a {DNA} sequencing theory (learning a
string)},
booktitle = {Proc. of the 31st Symposium on the Foundations of
Comp. Sci.},
year = 1990,
pages = {125--134},
publisher = {IEEE Computer Society Press, Los Alamitos, CA}
}
@INPROCEEDINGS{LiAb98,
author = {H. Li and N. Abe},
title = {Word clustering and disambiguation based on
co-occurrence data.},
booktitle = {Proceedings of the 17th Internation Conference on
Computational Linguistics},
year = 1998,
pages = {749-755}
}
@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},
volume = 15,
number = 4,
pages = {871-882},
year = 2003,
}
@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{LiSu07,
author = {Li, Jingyang and Sun, Maosong},
title = {Scalable Term Selection for Text Categorization},
booktitle = {Proceedings of the 2007 Joint Conference of
EMNLP-CoNLL},
year = 2007,
pages = {774--782},
url = {http://www.aclweb.org/anthology/D/D07/D07-1081}
}
@INPROCEEDINGS{LiVa88,
author = {M. Li and U. Vazirani},
title = {On the learnability of finite automata},
booktitle = {Proc. 1st Annu. Workshop on Comput. Learning Theory},
year = 1988,
pages = {359--370},
address = {San Mateo, CA},
publisher = {Morgan Kaufmann}
}
@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 = {Proceedings of the Thirtieth Annual Symposium on
Foundations of Computer Science},
year = 1989,
pages = {34--39},
address = {Research Triangle Park, North Carolina},
month = Oct,
tag = {TOC-display}
}
@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}
}
@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}
}
@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}
}
@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{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{LiZhSu04,
author = {Li, H. and Zhang, M. and Su, J.},
title = {A Joint Source-Channel Model for Machine
Transliteration},
booktitle = {Proceedings of ACL},
year = 2004,
month = {July},
address = {Barcelona, Spain},
pages = {159--166},
url = {http://www.aclweb.org/anthology/P04-1021},
}
@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{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",
year = 2003,
journal = "Cognition",
volume = 87,
pages = "151-178"
)
@INPROCEEDINGS{LiereTa97,
author = {L. Reddy and P. Tadepalli},
title = {Active Learning with Committees for Text
Categorization},
booktitle = {The fourteenth National Conference on Artificial
Intelligence},
year = 1997,
pages = {602--608}
}
@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}
}
@InProceedings{Lin+01,
author = {D. Lin and P. Pantel},
title = {Induction of Semantic Classes from Natural Language
Text},
booktitle = {Proceedings of ACM SIGKDD Conference on Knowledge
Discovery and Data Mining},
pages = {317--322},
year = 2001
}
@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{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{Lin99,
author = {Dekang Lin},
title = {Automatic identification of noncompositional
phrases},
booktitle = {In Proc. of the 37th Annual Meeting of the ACL},
year = 1999,
pages = {317--324}
}
@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 = "In Workshop on the Evaluation of Parsing Systems
Granada Spain",
year = 1998,
}
@INPROCEEDINGS{LinPa01,
author = {D. Lin and P. Pantel},
title = {Induction of Semantic Classes from Natural Language
Text},
booktitle = {Proceedings of ACM SIGKDD Conference on Knowledge
Discovery and Data Mining},
year = 2001,
pages = {317--322}
}
@INPROCEEDINGS{LinPa01a,
author = {D. Lin and P. Pantel},
title = {{DIRT}: discovery of inference rules from text},
booktitle = {Proc. of ACM SIGKDD Conference on Knowledge
Discovery and Data Mining 2001},
year = 2001,
pages = {323--328}
}
@inproceedings{LinPantel01,
author = "D. Lin and P. Pantel",
title = "Induction of Semantic Classes from Natural Language
Text",
booktitle = "Proceedings of ACM SIGKDD Conference on Knowledge
Discovery and Data Mining",
year = 2001,
pages = "317-322",
}
@INPROCEEDINGS{LinVi89,
author = {J. Lin and J. S. Vitter},
title = {Complexity issues in learning by neural nets},
booktitle = {Proc. 2nd Annu. Workshop on Comput. Learning Theory},
year = 1989,
pages = {118--133},
address = {San Mateo, CA},
publisher = {Morgan Kaufmann}
}
@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}
}
@INPROCEEDINGS{LinVi92a,
author = {Jyh-Han Lin and Jeffrey Scott Vitter},
title = {$\epsilon$-Approximation with Minimum Packing
Constraint Violation},
booktitle = {Proc.\ $24$th ACM Symposium on Theory of Computing},
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 = {Proceedings of COLT '92},
year = 1992,
pages = {103--115},
month = Jul,
tag = {TOC-display}
}
@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{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{LincolnSk89,
author = {N. Lincoln and J. Skrzypek},
title = {Synergy of clustering multiple backpropagation
networks},
booktitle = {NIPS 2},
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 = {Proc. of the 31st Symposium on the Foundations of
Comp. Sci.},
year = 1989,
pages = {574--579},
publisher = {IEEE Computer Society Press}
}
@INPROCEEDINGS{LinialMaRi88,
author = {Nathan Linial and Yishay Mansour and Ronald
L. Rivest},
title = {Results on Learnability and the
{V}apnik-{C}hervonenkisDimension},
booktitle = {Proceedings of the Twenth-Ninth Annual Symposiumon
Foundations of Computer Science},
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 = {Proceedings of the 1988 Workshop on Computational
Learning Theory},
year = 1988,
pages = {56--68},
publisher = {Morgan-Kaufmann},
tag = {TOC-display}
}
@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}
}
@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 = {Proc. 15th International Conf. on Machine Learning},
year = 1998,
pages = {305--313},
publisher = {Morgan Kaufmann, San Francisco, CA}
}
@inproceedings{Litkowski02,
title = {Digraph analysis of dictionary preposition
definitions},
author = {Litkowski, K.C.},
booktitle = {Proceedings of the ACLSIGLEX Workshop: Word Sense
Disambiguation},
pages = {9--16},
year = 2002
}
@inproceedings{LitkowskiHa05,
title = {The Preposition Project},
author = {Litkowski, K.C. and Hargraves, O.},
booktitle = {Proceedings of the Second ACL-SIGSEM Workshop on the
Linguistic Dimensions of Prepositions and their Use
in Computational Linguistics Formalisms and
Applications},
year = 2005
}
@inproceedings{LitkowskiHa07,
title = {{SemEval-2007 Task 06: Word-Sense Disambiguation of
Prepositions}},
author = {Litkowski, K. and Hargraves, O.},
booktitle = {SemEval-2007: 4th International Workshop on Semantic
Evaluations},
year = 2007
}
@INPROCEEDINGS{Littlestone87,
author = {N. Littlestone},
title = {Learning in a Layered Network with many
Fixed-Function Hidden Nodes},
booktitle = {Proc. of the 1st 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 = {Proceedings of the Twenty-Eighth Annual Symposium on
Foundations of Computer Science},
year = 1987,
pages = {68--77},
month = Oct
}
@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}
}
@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 = {Proc. 2nd Annu. Workshop on Comput. Learning Theory},
year = 1989,
pages = {269--284},
address = {San Mateo, CA},
publisher = {Morgan Kaufmann}
}
@INPROCEEDINGS{Littlestone91,
author = {N. Littlestone},
title = {Redundant noisy attributes, attribute errors, and
linear threshold learning using {W}innow},
booktitle = {Proc. 4th Annu. Workshop on Comput. Learning Theory},
year = 1991,
pages = {147--156},
address = {San Mateo, CA},
publisher = {Morgan Kaufmann}
}
@INPROCEEDINGS{Littlestone92,
author = {N. Littlestone},
title = {Learning simple {B}oolean concepts},
booktitle = {Proc. 2nd Int. Workshop on Algorithmic Learning
Theory},
year = 1992,
pages = {6--14},
publisher = {IOS Press}
}
@INPROCEEDINGS{Littlestone95,
author = {Nick Littlestone},
title = {Comparing several linear-threshold learning
algorithms on tasks involving superfluous
attributes},
booktitle = {Proc. 12th International Conference on Machine
Learning},
year = 1995,
pages = {353--361},
publisher = {Morgan Kaufmann}
}
@INPROCEEDINGS{LittlestoneLW,
author = {Nick Littlestone and Philip M. Long and Manfred
K. Warmuth},
title = {On-line learning of linear functions},
booktitle = {Proceedings of the Twenty-third Annual ACM Symposium
on Theory of Computing},
year = 1991,
pages = {465--475},
address = {New Orleans, Louisiana},
month = May,
publisher = {ACM}
}
@INPROCEEDINGS{LittlestoneLo93,
author = {N. Littlestone and P. Long},
title = {On-line learning with linear loss constraints},
booktitle = {Proc. 6th Annu. Conf. on Comput. Learning Theory},
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}
}
@UNPUBLISHED{LittlestoneWa89,
author = {Manfred Warmuth and Nick Littlestone},
title = {Learning from an adversary},
note = {In preparation},
year = 1989
}
@INPROCEEDINGS{LittlestoneWa89c,
author = {Nick Littlestone and Manfred K. Warmuth},
title = {The Weighted Majority Algorithm},
booktitle = {Proceedings of IEEE FOCS Conference},
year = 1989,
pages = {256--261},
month = Oct,
publisher = {IEEE},
note = {(Extended abstract only.)}
}
@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{Littman94,
author = {Michael L. Littman},
title = {Markov games as a framework for multi-agent
reinforcement learning},
booktitle = {Proc. 11th International Conference on Machine
Learning},
year = 1994,
pages = {157--163},
publisher = {Morgan Kaufmann}
}
@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{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 = {Proc. 15th International Conf. on Machine Learning},
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 = {Proc. 13th International Conference on Machine
Learning},
year = 1996,
pages = {310--318},
publisher = {Morgan Kaufmann}
}
@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{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{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}
}
@INPROCEEDINGS{LiuSa07,
author = {Liu, Yudong and Sarkar, Anoop},
title = {Experimental Evaluation of {LTAG}-Based Features for
Semantic Role Labeling},
booktitle = {Proceedings of the 2007 Joint Conference of
EMNLP-CoNLL},
year = 2007,
pages = {590--599},
url = {http://www.aclweb.org/anthology/D/D07/D07-1062}
}
@INPROCEEDINGS{LiuSe96,
author = {Huan Liu and Rudy Setiono},
title = {A probabilistic approach to feature selection -- a
filter solution},
booktitle = {Proc. 13th International Conference on Machine
Learning},
year = 1996,
pages = {319--327},
publisher = {Morgan Kaufmann}
}
@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}
}
@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}
}
@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 = {Proc. 15th International Conf. on Machine Learning},
year = 1998,
pages = {323--331},
publisher = {Morgan Kaufmann, San Francisco, CA}
}
@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}
}
@PHDTHESIS{Long92,
author = {P. M. Long},
title = {Towards a more comprehensive theory of learning in
computers},
school = {UC Santa Cruz},
year = 1992
}
@INPROCEEDINGS{Long96,
author = {Philip M. Long},
title = {Improved bounds about on-line learning of smooth
functions of a single variable},
booktitle = {Algorithmic Learning Theory: ALT '96},
year = 1996,
volume = 1160,
series = {Lecture Notes in Artificial Intelligence},
pages = {26--36},
publisher = {Springer-Verlag}
}
@INPROCEEDINGS{Long97a,
author = {Philip M. Long},
title = {On-line evaluation and prediction using linear
functions},
booktitle = {Proc. 10th Annu. Conf. on Comput. Learning Theory},
year = 1997,
pages = {21--31},
publisher = {ACM Press, New York, NY}
}
@INPROCEEDINGS{Long98,
author = {Philip M. Long},
title = {On the sample complexity of learning functions with
bounded variation},
booktitle = {Proc. 11th Annu. Conf. on Comput. Learning Theory},
year = 1998,
pages = {126--133},
publisher = {ACM Press, New York, NY}
}
@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}
}
@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 = {Proc. 4th Conf. 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 = {Proc. 5th Conf. 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 = {Proceedings of the 2007 Joint Conference of
EMNLP-CoNLL},
year = 2007,
pages = {801--809},
url = {http://www.aclweb.org/anthology/D/D07/D07-1084}
}
@INPROCEEDINGS{Lopez07,
author = {Lopez, Adam},
title = {Hierarchical Phrase-Based Translation with Suffix
Arrays},
booktitle = {Proceedings of the 2007 Joint Conference of
EMNLP-CoNLL},
year = 2007,
pages = {976--985},
url = {http://www.aclweb.org/anthology/D/D07/D07-1104}
}
@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}
}
@BOOK{Lovasz79,
title = {Combinatorial Problems and Exercises},
publisher = {North-Holland Publishing Company},
year = 1979,
author = {L. Lov\'asz}
}
@inproceedings{LowdMe05,
author = {Daniel Lowd and Christopher Meek},
title = {Adversarial learning},
booktitle = KDD,
year = 2005,
isbn = {1-59593-135-X},
pages = {641--647},
location = {Chicago, Illinois, USA},
doi = {http://doi.acm.org/10.1145/1081870.1081950},
publisher = {ACM},
address = {New York, NY, USA},
}
@INPROCEEDINGS{LuAr96,
author = {Jianguo Lu and Jun Arima},
title = {Inductive logic programming beyond logical
implication},
booktitle = {Algorithmic Learning Theory: ALT '96},
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 = {Proceedings of the 2007 Joint Conference of
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 = {Proc. 12th International Conference on Machine
Learning},
year = 1995,
pages = {371--377},
publisher = {Morgan Kaufmann}
}
@BOOK{Luenberger68,
title = {Optimization by Vector Space Methods},
publisher = {John Wiley and Sons, Inc.},
year = 1968,
author = {D. G. Luenberger}
}
@BOOK{Luenberger84,
title = {Linear and Nonlinear Programming},
publisher = {Addison-Wesley},
year = 1984,
author = {D. G. Luenberger},
address = {Reading, MA}
}
@INPROCEEDINGS{LugosiPi96,
author = {G{\'a}bor Lugosi and M{\'a}rta Pint{\'e}r},
title = {A data dependent skeleton estimate for learning},
booktitle = {Proc. 9th Annu. Conf. on Comput. Learning Theory},
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}
}
@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}
}
@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{MCHM03,
author = {D. Moldovan and C. Clark and S. Harabagiu and
S.~Maiorano},
title = {COGEX: A Logic Prover for Question Answering},
year = 2003,
booktitle = {Proceedings of HLT-NAACL 2003}
}
@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{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}
}
@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 = {Proceedings of the 2007 Joint Conference of
EMNLP-CoNLL},
year = 2007,
pages = {571--580},
url = {http://www.aclweb.org/anthology/D/D07/D07-1060}
}
@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{MIUN93,
author = {Yuji Matsumoto and Hiroyuki Ishimoto and Takehito
Utsuro and Makoto Nagao},
title = {Structural matching of parallel texts},
booktitle = ACL,
year = 1993
}
@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 = {Proceedings of the Automatic Speech Recognition and
Understanding Workshop},
year = 2001,
pages = {389--397}
}
@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{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 = {Proc. 14th International Conference on Machine
Learning},
year = 1997,
pages = {202--210},
publisher = {Morgan Kaufmann}
}
@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 = {Proceedings of the Second PASCAL Challenges Workshop
on Recognizing Textual Entailment},
year = 2005,
}
@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}
}
@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{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}
}
@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 = {Proceedings of the 40th Annual Meeting of ACL},
year = 2002,
pages = {33-40}
}
@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{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{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}
}
@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{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 = {Proc. 15th International Conf. on Machine Learning},
year = 1998,
pages = {386--394},
publisher = {Morgan Kaufmann, San Francisco, CA}
}
@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{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
}
@INPROCEEDINGS{MSSS99,
author = {Andrew Mitchell and Tobias Scheffer and Arun Sharma
and Frank Stephan},
title = {The {VC}-Dimension of Subclasses of Pattern
Languages},
booktitle = {Proc. 10th International Conference on Algorithmic
Learning Theory - ALT '99},
year = 1999,
volume = 1720,
series = {Lecture Notes in Artificial Intelligence},
pages = {93--105},
publisher = {Springer-Verlag}
}
@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
}
@INCOLLECTION{MUC3,
booktitle = {Proceedings of the Third Message Understanding
Conference},
publisher = {Morgan Kaufmann Publishers},
year = 1991,
editor = {Sundheim, B.},
address = {San Mateo CA}
}
@INCOLLECTION{MUC4,
booktitle = {Proceedings of the Fourth Message Understanding
Conference},
publisher = {Morgan Kaufmann Publishers},
year = 1992,
editor = {Sundheim, B.},
address = {San Mateo CA}
}
@INCOLLECTION{MUC5,
booktitle = {Proceedings of the Fifth Message Understanding
Conference},
publisher = {Morgan Kaufmann Publishers},
year = 1993,
editor = {Sundheim, B.},
address = {San Mateo CA}
}
@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{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 = "Proc. of SIGIR",
pages = "198--206",
year = 1989
)
@INPROCEEDINGS{MaarekSm89,
author = {Yoelle Maarek and Frank Smadja},
title = {Full text indexing based on lexical relations --
{An} application: Software libraries},
booktitle = {Proc. of SIGIR},
year = 1989,
pages = {198--206}
}
@INPROCEEDINGS{Maass91,
author = {W. Maass},
title = {On-line learning with an oblivious environment and
the power of randomization},
booktitle = {Proc. 4th Annu. Workshop on Comput. Learning Theory},
year = 1991,
pages = {167--175},
address = {San Mateo, CA},
publisher = {Morgan Kaufmann}
}
@INPROCEEDINGS{Maass94,
author = {W. Maass},
title = {On the Complexity of Learning on Neural Nets},
booktitle = {Computational Learning Theory: EuroColt '93},
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 = {Proc. 7th Annu. ACM Conf. on Comput. Learning
Theory},
year = 1994,
pages = {67--75},
publisher = {ACM Press, New York, NY}
}
@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 = {Algorithmic Learning Theory: ALT '97},
year = 1997,
volume = 1316,
series = {Lecture Notes in Artificial Intelligence},
pages = {364--384},
publisher = {Springer-Verlag}
}
@INPROCEEDINGS{MaassSc97,
author = {Wolfgang Maass and Michael Schmitt},
title = {On the Complexity of Learning for a Spiking Neuron},
booktitle = {Proc. 10th Annu. Conf. on Comput. Learning Theory},
year = 1997,
pages = {54--61},
publisher = {ACM Press, New York, NY}
}
@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{MaassScSo91,
author = {W. Maass and G. Schnitger and E. D. Sontag},
title = {On the computational power of sigmoid versus
{B}oolean threshold circuits},
booktitle = {Proc. of the 32nd Symposium on the Foundations of
Comp. Sci.},
year = 1991,
pages = {767--776},
publisher = {IEEE Computer Society Press, Los Alamitos, CA}
}
@INPROCEEDINGS{MaassTu89,
author = {W. Maass and G. Tur{\'a}n},
title = {On the complexity of learning from counterexamples},
booktitle = {Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci.},
year = 1989,
pages = {262--267},
publisher = {IEEE Computer Society Press, Los Alamitos, CA}
}
@INPROCEEDINGS{MaassTu90,
author = {Wolfgang Maass and Gy\"{o}gy Tur\'{a}n},
title = {On the complexity of learning from counterexamples
and membership queries},
booktitle = {Proceedings of IEEE FOCS Conference},
year = 1990,
pages = {203--210},
month = Oct,
publisher = {IEEE}
}
@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.)}
}
@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}
}
@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}
}
@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}
}
@INPROCEEDINGS{MaassWa95,
author = {Wolfgang Maass and Manfred K. Warmuth},
title = {Efficient learning with virtual threshold gates},
booktitle = {Proc. 12th International Conference on Machine
Learning},
year = 1995,
pages = {378--386},
publisher = {Morgan Kaufmann}
}
@inproceedings{MacCartneyGrMa06,
author = {B. MacCartney and T. Grenager and M. de Marneffe},
title = {Learning to recognize features of valid textual
entailments},
year = 2006,
booktitle = {Proceedings of RTE-NAACL 2006}
}
@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 = {Proceedings of the ACL-PASCAL Workshop on Textual
Entailment and Paraphrasing},
month = {June},
year = 2007,
address = {Prague},
publisher = {Association for Computational Linguistics},
pages = {165--170},
url = {http://www.aclweb.org/anthology/W/W07/W07-1427}
}
@PHDTHESIS{MacKay92,
author = {D. MacKay},
title = {{B}ayesian Methods for Adaptive Models},
school = {California Institute of Technology},
year = 1992
}
@book(MacWhinney00,
author = "B. MacWhinney",
year = 2000,
title = "The CHILDES project: Tools for analyzing talk. Third
Edition",
publisher = "Lawrence Elrbaum Associates",
address = "Mahwah, NJ"
)
@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{MaccartneyMa08,
address = {Manchester, UK},
author = {Maccartney, Bill and Manning, Christopher D. },
booktitle = {Proceedings of the 22nd International Conference on
Computational Linguistics (Coling 2008)},
citeulike-article-id =3273967,
keywords = {coling2008, semantics, trg},
month = {August},
pages = {521--528},
posted-at = {2008-09-16 17:40:57},
priority = 0,
publisher = {Coling 2008 Organizing Committee},
title = {Modeling Semantic Containment and Exclusion in
Natural Language Inference},
url = {http://www.aclweb.org/anthology/C08-1066},
year = 2008
}
@INPROCEEDINGS{MachereyOc07,
author = {Macherey, Wolfgang and Och, Franz J.},
title = {An Empirical Study on Computing Consensus
Translations from Multiple Machine Translation
Systems},
booktitle = {Proceedings of the 2007 Joint Conference of
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 = {Proc. 25th Annu. ACM Sympos. Theory Comput.},
year = 1993,
pages = {325--334},
publisher = {ACM Press, New York, NY}
}
@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}
}
@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{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}
}
@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{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 = {Proceedings of ACL-95},
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}
}
@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 = {Proc. 11th International Conference on Machine
Learning},
year = 1994,
pages = {164--172},
publisher = {Morgan Kaufmann}
}
@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 = {Proc. 13th International Conference on Machine
Learning},
year = 1996,
pages = {328--336},
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
}
@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 = {Proc. 11th International Conference on Machine
Learning},
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 = {Proceedings of the ACL-PASCAL Workshop on Textual
Entailment and Paraphrasing},
month = {June},
year = 2007,
address = {Prague},
publisher = {Association for Computational Linguistics},
pages = {42--47},
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 = {Proc. 4th Annu. Workshop on Comput. Learning Theory},
year = 1991,
pages = {128--136},
address = {San Mateo, CA},
publisher = {Morgan Kaufmann}
}
@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 = {Proc. 3th Int. 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{Mannem07,
author = {Mannem, Prashanth Reddy},
title = {Online Learning for Deterministic Dependency
Parsing},
booktitle = {Proceedings of the CoNLL Shared Task Session of
EMNLP-CoNLL 2007},
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 = {Proc. 13th International Conference on Machine
Learning},
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,
author = {C. Manning and P. Raghavan and H. Sch\"{u}tze},
title = "An Introduction to Information Retrieval",
publisher = "Cambridge",
comment = {draft},
year = 2008
)
@UNPUBLISHED{Mansour90,
author = {Mansour, Yishay},
title = {Learning via Fourier Transform},
note = {(see KushilevitzMa91)},
month = Apr,
year = 1990,
tag = {TOC-display}
}
@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; }
}
@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; }
}
@INPROCEEDINGS{Mansour92a,
author = {Mansour, Yishay92},
title = {An $o(n^{loglogn})$ learning algorithm for DNF under
theuniform distribution},
booktitle = {Proceedings of the Fifth Annual Workshop
onComputational Learning Theory},
year = 1992,
pages = {53--61},
month = Jul
}
@INPROCEEDINGS{Mansour97,
author = {Yishay Mansour},
title = {Pessimistic decision tree pruning based on tree
size},
booktitle = {Proc. 14th International Conference on Machine
Learning},
year = 1997,
pages = {195--201},
publisher = {Morgan Kaufmann}
}
@INPROCEEDINGS{Mansour99,
author = {Yishay Mansour},
title = {Reinforcement learning and mistake bounded
algorithms},
booktitle = {Proc. 12th Annu. Conf. on Comput. Learning Theory},
year = 1999,
pages = {183--192},
publisher = {ACM Press, New York, NY}
}
@INPROCEEDINGS{MansourMc00,
author = {Yishay Mansour and David Mc{A}llester},
title = {Boosting Using Branching Programs},
booktitle = {Proc. 13th Annu. Conference on Comput. Learning
Theory},
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 = {Proc. 13th Annu. Conference on Comput. Learning
Theory},
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 = {Proc. 10th Annu. Conf. on Comput. Learning Theory},
year = 1997,
pages = {201--210},
publisher = {ACM Press, New York, NY}
}
@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}
}
@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",
year = 1993,
title = "Negative evidence in language acquisition",
journal = "Cognition",
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{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 = {Proc. 15th International Conf. on Machine Learning},
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 = {Proc. 14th International Conference on Machine
Learning},
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 = {Proceedings of the CoNLL Shared Task Session of
EMNLP-CoNLL 2007},
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},
month = {June},
year = 2001,
}
@INPROCEEDINGS{MaronRa98,
author = {Oded Maron and Aparna Lakshmi Ratan},
title = {Multiple-instance learning for natural scene
classification},
booktitle = {Proc. 15th International Conf. on Machine Learning},
year = 1998,
pages = {341--349},
publisher = {Morgan Kaufmann, San Francisco, CA}
}
@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}
}
@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
}
@INPROCEEDINGS{Marron88,
author = {A. Marron},
title = {Learning pattern languages from a single initial
example and from queries},
booktitle = {Proc. 1st Annu. Workshop on Comput. Learning Theory},
year = 1988,
pages = {345--358},
address = {San Mateo, CA},
publisher = {Morgan Kaufmann}
}
@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{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}
}
@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",
editor = "R.R.K. Hartman",
publisher = "Academic Press",
year = 1983,
series = "Applied Language Studies Series",
address = "London"
)
@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}
}
@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}
}
@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}
}
@INPROCEEDINGS{MartinOs95,
author = {Eric Martin and Daniel Osherson},
title = {A note on the use of probabilities by mechanical
learners},
booktitle = {Computational Learning Theory: EuroColt '95},
year = 1995,
pages = {261--271},
publisher = {Springer-Verlag}
}
@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{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}
}
@INPROCEEDINGS{MartinVr96,
author = {Lionel Martin and Christel Vrain},
title = {Induction of constraint logic programs},
booktitle = {Algorithmic Learning Theory: ALT '96},
year = 1996,
volume = 1160,
series = {Lecture Notes in Artificial Intelligence},
pages = {169--176},
publisher = {Springer-Verlag}
}
@INPROCEEDINGS{MaruokaTa98,
author = {A. Maruoka and E. Takimoto},
title = {Structured Weight-Based Prediction Algorithms},
booktitle = {Proc. 9th International Conference on Algorithmic
Learning Theory - ALT '98},
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 = {Proc. 11th International Conference on Machine
Learning},
year = 1994,
pages = {181--189},
publisher = {Morgan Kaufmann}
}
@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; }
}
@INPROCEEDINGS{MateescuDeKa02,
author = {Robert Mateescu and Rina Dechter and Kalev Kask},
title = {Tree approximation for belief updating},
booktitle = {Eighteenth national conference on Artificial
intelligence},
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 = {Proc. 8th Annu. Conf. on Comput. Learning Theory},
year = 1995,
pages = {222--229},
publisher = {ACM Press, New York, NY}
}
@ARTICLE{Matouv00,
author = {J.~Matou{\v s}ek},
title = {On approximate geometric $k$-clustering},
journal = DCG,
year = 2000,
volume = 24,
pages = {61--84}
}
@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{Matouv90,
author = {J. Matou{\v s}ek},
title = {Construction of $\epsilon$-nets},
journal = DCG,
year = 1990,
volume = 5,
pages = {427--448}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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{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{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}
}
@BOOK{Matouv99,
title = {Geometric Discrepancy},
publisher = {Springer},
year = 1999,
author = {J. Matou{\v s}ek},
url = {http://kam.mff.cuni.cz/~matousek/dg.html}
}
@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(Matsumoto93,
author = "Yuji Matsumoto and Hiroyuki Ishimoto and Takehito
Utsuro and Makoto Nagao",
title = "Structural matching of parallel texts",
booktitle = ACL,
year = 1993
)
@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 = {Algorithmic Learning Theory: ALT '97},
year = 1997,
volume = 1316,
series = {Lecture Notes in Artificial Intelligence},
pages = {212--227},
publisher = {Springer-Verlag}
}
@INPROCEEDINGS{MatsumotoSh94,
author = {S. Matsumoto and A. Shinohara},
title = {Refutably probably approximately correct learning},
booktitle = {Proc. 5th Int. Workshop on Algorithmic Learning
Theory},
year = 1994,
volume = 872,
series = {Lecture Notes in Artificial Intelligence},
pages = {469--483},
publisher = {Springer-Verlag}
}
@INPROCEEDINGS{MatsumotoSh97,
author = {Satoshi Matsumoto and Ayumi Shinohara},
title = {Learning pattern languages using queries},
booktitle = {Computational Learning Theory: EuroColt '97},
year = 1997,
volume = 1208,
series = {Lecture Notes in Artificial Intelligence},
pages = {185--197},
publisher = {Springer-Verlag}
}
@INPROCEEDINGS{Matsuoka93,
author = {M. Matsuoka},
title = {An application of {B}ernstein polynomials in {PAC}
model},
booktitle = {Proc. 3th Int. 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",
volume = 27,
pages = "245--260",
year = 1988
)
@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 = {Proceedings of the 2007 Joint Conference of
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",
pages = "219-228",
publisher = "IEEE Computer Society Press",
year = 2002,
url = "citeseer.ist.psu.edu/maxion02masquerade.html"
}
@INPROCEEDINGS{MayKn07,
author = {May, Jonathan and Knight, Kevin},
title = {Syntactic Re-Alignment Models for Machine
Translation},
booktitle = {Proceedings of the 2007 Joint Conference of
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 = {Proc. 14th International Conference on Machine
Learning},
year = 1997,
pages = {219--226},
publisher = {Morgan Kaufmann}
}
@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}
}
@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 = {Proc. 11th International Conference on Machine
Learning},
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}
}
@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; }
}
@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; }
}
@INPROCEEDINGS{McAllester99,
author = {David A. McAllester},
title = {{PAC-B}ayesian model averaging},
booktitle = {Proc. 12th Annu. Conf. on Comput. Learning Theory},
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}
}
@INPROCEEDINGS{McAllesterSc00,
author = {David Mc{A}llester and Robert E. Schapire},
title = {On the Convergence Rate of Good-{T}uring Estimators},
booktitle = {Proc. 13th Annu. Conference on Comput. Learning
Theory},
year = 2000,
pages = {1--6},
publisher = {Morgan Kaufmann, San Francisco}
}
@INPROCEEDINGS{McCallum95,
author = {R. Andrew Mc{C}allum},
title = {Instance-based utile distinctions for reinforcement
learning with hidden state},
booktitle = {Proc. 12th International Conference on Machine
Learning},
year = 1995,
pages = {387--395},
publisher = {Morgan Kaufmann}
}
@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{McCallumNi98,
author = {Andrew Kachites McCallum and Kamal Nigam},
title = {Employing {EM} and pool-based active learning for
text classification},
booktitle = {Proc. 15th International Conf. on Machine Learning},
year = 1998,
pages = {350--358},
publisher = {Morgan Kaufmann, San Francisco, CA}
}
@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-98 Workshop on Learning for Text
Categorization},
year = 1998
}
@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 = {Proceedings of the Sixth ACM SIGKDD International
Conference on Knowledge Discovery and Data Mining
(KDD-2000)},
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}
}
@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.}
}
@INPROCEEDINGS{McCarthy58,
author = {McCarthy, J.},
title = {Programs with common sense},
booktitle = {Proceedings of the 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}
}
@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}
}
@ARTICLE{McCarthy80,
author = {McCarthy, J.},
title = {Circumscription - a form of non-monotonic reasoning},
journal = {Artificial Intelligence},
year = 1980,
volume = 13,
number = {1,2}
}
@ARTICLE{McCarthy86,
author = {McCarthy, J.},
title = {Application of circumscription to formalizing
commonsense},
journal = {Artificial Intelligence},
year = 1986,
volume = 28,
pages = {89--116}
}
@INCOLLECTION{McCarthy89,
author = {McCarthy, J.},
title = {Artificial Intelligence, logic and formalizingcommon
sense},
booktitle = {Logic and Artificial Intelligence},
publisher = {Kluer},
year = 1989,
editor = {R. Thomason}
}
@INPROCEEDINGS{McCarthyVeJo07,
author = {McCarthy, Diana and Venkatapathy, Sriram and Joshi,
Aravind},
title = {Detecting Compositionality of Verb-Object
Combinations using Selectional Preferences},
booktitle = {Proceedings of the 2007 Joint Conference of
EMNLP-CoNLL},
year = 2007,
pages = {369--379},
url = {http://www.aclweb.org/anthology/D/D07/D07-1039}
}
@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{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 = {Proceedings of 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 = {Proc. 15th International Conf. on Machine Learning},
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 = {Proc. 9th International Conference on Algorithmic
Learning Theory - ALT '98},
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{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{McDonaldNi07,
author = {McDonald, Ryan and Nivre, Joakim},
title = {Characterizing the Errors of Data-Driven Dependency
Parsing Models},
booktitle = {Proceedings of the 2007 Joint Conference of
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}
}
@BOOK{McFarland87,
title = {The Oxford Companion to Animal Behavior},
publisher = {Oxford University Press},
year = 1987,
editor = {David {McFarland}}
}
@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
}
@article{MedinGoGe93,
author = {D. Medin and R. Goldstone and D. Gentner},
title = {Respects for Similarity},
journal = {Psychological Review},
pages = {254-278},
year = 1993,
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}
}
@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{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}
}
@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}
}
@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}
}
@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}
}
@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 = {Proc. 13th Annu. Conference on Comput. Learning
Theory},
year = 2000,
pages = {16--24},
publisher = {Morgan Kaufmann, San Francisco}
}
@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 = {Proc. 16th International Conf. on Machine Learning},
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 = {Proc. 10th Annu. Conf. on Comput. Learning Theory},
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 = {Proc. 13th Annu. Conference on Comput. Learning
Theory},
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 = {Proc. 5th Annu. Workshop on Comput. Learning Theory},
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 = {Proc. 9th International Conference on Algorithmic
Learning Theory - ALT '98},
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 = {Proc. 14th International Conference on Machine
Learning},
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 = {Proceedings of the 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 = {Proc. 13th Annu. Conference on Comput. Learning
Theory},
year = 2000,
pages = {81--89},
publisher = {Morgan Kaufmann, San Francisco}
}
@INPROCEEDINGS{MerhavFe92,
author = {N. Merhav and M. Feder},
title = {Universal sequential learning and decisions from
individual data sequences},
booktitle = {Proc. 5th Annu. Workshop on Comput. Learning Theory},
year = 1992,
pages = {413--427},
publisher = {ACM Press, New York, NY}
}
@INPROCEEDINGS{Merialdo91,
author = {Bernard Merialdo},
title = {Tagging Text With A Probabilistic Model},
booktitle = {Proc. Int'l Conf. on Acoustics, Speech, and Signal
Processing},
year = 1991
}
@ARTICLE{Merialdo94,
author = {Bernard Merialdo},
title = {Tagging Text With A Probabilistic Model},
journal = CL,
year = 1994,
volume = 20,
pages = {155--172},
number = 2
}
@INPROCEEDINGS{MerkleSt96,
author = {Wolfgang Merkle and Frank Stephan},
title = {Trees and learning},
booktitle = {Proc. 9th Annu. Conf. on Comput. Learning Theory},
year = 1996,
pages = {270--279},
publisher = {ACM Press, New York, NY}
}
@inproceedings{Mertzbacher-chu93,
author = "M. Mertzbacher and W. Chu",
year = 1993,
title = "Pattern-Based Clustering for Databases Attribute
Values",
booktitle = "Proceedings of the 1993 workshop on Knowledge
Discovery in Databases"
}
@INPROCEEDINGS{MertzbacherCh93,
author = {M. Mertzbacher and W. Chu},
title = {Pattern-Based Clustering for Databases Attribute
Values},
booktitle = {Proceedings of the 1993 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{MetzlerMS,
author = {Donald Metzler and Susan Dumais and Christopher
Meek},
title = {Similarity {M}easures for {S}hort {S}egments of
{T}ext},
booktitle = {Proceedings of the 29th European Conference on
Information Retrieval (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,
pages = "956--960",
year = 1992
)
@INPROCEEDINGS{Meyer97,
author = {L{\'e}a Meyer},
title = {Monotonic and dual-monotonic probabilistic language
learning of indexed families with high probability},
booktitle = {Computational Learning Theory: EuroColt '97},
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}
}
@INPROCEEDINGS{Meyer98,
author = {L. Meyer},
title = {Comparing the Power of Probabilistic Learning and
Oracle Identification under Monotonicity
Constraints},
booktitle = {Proc. 9th International Conference on Algorithmic
Learning Theory - ALT '98},
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 = {Proc. 11th Annu. Conf. on Comput. Learning Theory},
year = 1998,
pages = {72--78},
publisher = {ACM Press, New York, NY}
}
@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{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{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, Vol. II}
}
@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}
}
@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}
}
@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.}
}
@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}
}
@INPROCEEDINGS{Michie83,
author = {D. Michie},
title = {Inductive Rule Generation in the Context of the
Fifth Generation},
booktitle = {Proc. of the First 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 = {Proceedings of the 2007 Joint Conference of
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,
month = {July},
address = {Boston, USA}
}
@in