|
Titel
|
Author
|
Year
|
Type
|
|
An Efficient Algorithm for Japanese Sentence Compaction Based on Phrase Importance and Inter-Phrase Dependency
|
Rei Oguro and Kazuhiko Ozeki and Kazuyuki Takagi and Yujie Zhang
|
2000
|
Incollection
|
|
An Efficient Algorithm for Mining Association Rules in Large Databases
|
Ashoka Savasere and Edward Omiecinski and Shamkant B. Navathe
|
1995
|
Inproceedings
|
|
An Efficient Approximation Scheme for Data Mining Tasks
|
George Kollios and Dimitrios Gunopoulos and Nick Koudas and Stefan Berchtold
|
2001
|
Inproceedings
|
|
An Efficient Context--Free Parsing Algorithm
|
Earley, Jay
|
1987
|
Incollection
|
|
An Efficient Context--Free Parsing Algorithm
|
Earley, Jay
|
1987
|
Incollection
|
|
An efficient index structure for string databases
|
Tamer Kahveci and Ambuj K. Singh
|
2001
|
Inproceedings
|
|
An Efficient Parser for Lexical Functional Grammar
|
J. Kindermann and J. Meier
|
1986
|
Inproceedings
|
|
An Efficient Subsumption Algorithm for Inductive Logic Programming
|
Kietz, Jörg--Uwe and Marcus Lübbe
|
1994
|
Inproceedings
|
|
An elementary proof of the Johnson-Lindenstrauss lemma,
|
Dasgupta, Sanjoy and Gupta, Anupam
|
1999 March
|
Techreport
|
|
An Empirical Comparison of Pattern Recognition, Neural Nets and Machine Learning Classification Methods
|
Weiss, S.M. and Kapouleas, I.
|
1989
|
Inproceedings
|
|
An Empirical Comparison of Pruning Methods for Decision Tree Inductino
|
John Mingers
|
1989
|
Article
|
|
An Empirical Comparison of Selected Measures for Decision-Tree Induction
|
J. Mingers
|
1989
|
Article
|
|
An Empirical Study of Computational Introspection: Evaluating Introspective Multistrategy Learning in the Meta-{AQUA} System
|
Cox, Michael T.
|
1996
|
Incollection
|
|
An Empirical Study of Sensing and Defaulting in Planning
|
K. Krebsbach and D. Olawsky and M. Gini
|
1992
|
Inproceedings
|
|
An Endorsement--Based Plan Recognition Program
|
Sullivan, Michael and Cohen, Paul R.
|
1990
|
Incollection
|
|
An enhanced representation of time series which allows fast classification, clustering and relevance feedbacA probabilistic approach to fast pattern matching in time series databases
|
E. Keogh and P. Smyth
|
1997
|
Inproceedings
|
|
An enhanced representation of time series which allows fast classification, clustering and relevance feedback
|
Eamonn Keogh and Michael Pazzani
|
1998
|
Inproceedings
|
|
An Enhancer for Reactive Plans
|
Gordon, D.F.
|
1991
|
Inproceedings
|
|
An environment for merging and testing large ontologies
|
McGuinness, D. and Fikes, R. and Rice, J. and Wilder, S.
|
2000
|
Inproceedings
|
|
An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic
|
Y. Sagiv and C. Delobel and D.S. Parker and R. Fagin
|
1981
|
Article
|
|
An Essential Hybrid Reasoning System
|
Brachman, R.J. and Gilbert, V.P. and Levesque, H.J.
|
1985
|
Inproceedings
|
|
An Evaluation of High--end Data Mining Tools for Fraud Detection
|
Abbott, Dean W. and Matkovsky, I. Philip and Elder IV, John F.
|
1998
|
Inproceedings
|
|
An Evaluation of Object-Oriented DBMS Developments
|
Frank Manola
|
1994
|
Techreport
|
|
An Evaluation of Phrasal and Clustered Representations on a Text Categorization Task
|
David D. Lewis
|
1992
|
Inproceedings
|
|
An Evaluation of Phrasal and Clustered Representations on a Text Categorization Task
|
David D. Lewis
|
1992
|
Inproceedings
|
|
> Show next 25 entries (1575 ... )
|