| 2011 | ||
|---|---|---|
| 77 | Steffen Lange, Hongcheng Xu, Christian Lang, Holger Pless, Joachim Becker, Hans-Jürgen Tiedkte, Eckhard Hennig, Maurits Ortmanns: An AC-powered optical receiver consuming 270μW for transcutaneous 2Mb/s data transfer. ISSCC 2011: 304-306 | |
| 76 | Sandra Zilles, Steffen Lange, Robert Holte, Martin Zinkevich: Models of Cooperative Teaching and Learning. Journal of Machine Learning Research 12: 349-384 (2011) | |
| 2010 | ||
| 75 | Sanjay Jain, Steffen Lange, Samuel E. Moelius, Sandra Zilles: Incremental learning with temporary memory. Theor. Comput. Sci. 411(29-30): 2757-2772 (2010) | |
| 2008 | ||
| 74 | Steffen Lange, Samuel E. Moelius, Sandra Zilles: Learning with Temporary Memory. ALT 2008: 449-463 | |
| 73 | Sandra Zilles, Steffen Lange, Robert Holte, Martin Zinkevich: Teaching Dimensions based on Cooperative Learning. COLT 2008: 135-146 | |
| 72 | Steffen Lange, Thomas Zeugmann, Sandra Zilles: Learning indexed families of recursive languages from positive data: A survey. Theor. Comput. Sci. 397(1-3): 194-232 (2008) | |
| 2007 | ||
| 71 | Sanjay Jain, Steffen Lange, Sandra Zilles: Some natural conditions on incremental learning. Inf. Comput. 205(11): 1671-1684 (2007) | |
| 70 | Sanjay Jain, Steffen Lange, Sandra Zilles: A general comparison of language learning from examples and from queries. Theor. Comput. Sci. 387(1): 51-66 (2007) | |
| 2006 | ||
| 69 | Sanjay Jain, Steffen Lange, Sandra Zilles: Towards a Better Understanding of Incremental Learning. ALT 2006: 169-183 | |
| 2005 | ||
| 68 | Sanjay Jain, Steffen Lange, Sandra Zilles: Gold-Style and Query Learning Under Various Constraints on the Target Class. ALT 2005: 226-240 | |
| 67 | Steffen Lange, Sandra Zilles: Algorithmic Learning: Formal Models and Prototypical Applications. Leipziger Informatik-Tage 2005: 57-80 | |
| 66 | Steffen Lange, Sandra Zilles: Relations between Gold-style learning and query learning. Inf. Comput. 203(2): 211-237 (2005) | |
| 65 | Steffen Lange, Gunter Grieser, Thomas Zeugmann: Inductive inference of approximations for recursive concepts. Theor. Comput. Sci. 348(1): 15-40 (2005) | |
| 64 | Jochen Nessel, Steffen Lange: Learning erasing pattern languages with queries. Theor. Comput. Sci. 348(1): 41-57 (2005) | |
| 2004 | ||
| 63 | Steffen Lange, Sandra Zilles: Comparison of Query Learning and Gold-Style Learning in Dependence of the Hypothesis Space. ALT 2004: 99-113 | |
| 62 | Steffen Lange, Sandra Zilles: Replacing Limit Learners with Equally Powerful One-Shot Query Learners. COLT 2004: 155-169 | |
| 61 | Klaus P. Jantke, Steffen Lange, Gunter Grieser, Peter A. Grigoriev, Bernhard Thalheim, Bernd Tschiedel: Learning by Doing and Learning when Doing: Dovetailing E-Learning and Decision Support with a Data Mining Tutor. ICEIS (5) 2004: 238-241 | |
| 60 | Klaus P. Jantke, Gunter Grieser, Steffen Lange, Martin Memmel: DaMiT: Data Mining lernen und lehren. LWA 2004: 171-179 | |
| 59 | Gunter Grieser, Steffen Lange: Incremental learning of approximations from positive data. Inf. Process. Lett. 89(1): 37-42 (2004) | |
| 58 | Steffen Lange, Sandra Zilles: Formal language identification: query learning vs. Gold-style learning. Inf. Process. Lett. 91(6): 285-292 (2004) | |
| 2003 | ||
| 57 | Steffen Lange, Sandra Zilles: On the Learnability of Erasing Pattern Languages in the Query Model. ALT 2003: 129-143 | |
| 56 | Steffen Lange, Gunter Grieser, Klaus P. Jantke: Advanced elementary formal systems. Theor. Comput. Sci. 1(298): 51-70 (2003) | |
| 55 | Steffen Lange, Jochen Nessel: Decision lists over regular patterns. Theor. Comput. Sci. 1(298): 71-87 (2003) | |
| 54 | Steffen Lange, Gunter Grieser: Variants of iterative learning. Theor. Comput. Sci. 292(2): 359-376 (2003) | |
| 2002 | ||
| 53 | Steffen Lange, Ken Satoh, Carl H. Smith: Discovery Science, 5th International Conference, DS 2002, Lübeck, Germany, November 24-26, 2002, Proceedings Springer 2002 | |
| 52 | Gunter Grieser, Klaus P. Jantke, Steffen Lange: Consistency Queries in Information Extraction. ALT 2002: 173-187 | |
| 51 | Steffen Lange, Gunter Grieser: On the power of incremental learning. Theor. Comput. Sci. 288(2): 277-307 (2002) | |
| 2001 | ||
| 50 | Steffen Lange, Gunter Grieser, Klaus P. Jantke: Extending Elementary Formal Systems. ALT 2001: 332-347 | |
| 49 | Gunter Grieser, Steffen Lange: Learning Approaches to Wrapper Induction. FLAIRS Conference 2001: 249-253 | |
| 48 | Sanjay Jain, Steffen Lange, Jochen Nessel: On the learnability of recursively enumerable languages from good examples. Theor. Comput. Sci. 261(1): 3-29 (2001) | |
| 2000 | ||
| 47 | Gunter Grieser, Steffen Lange, Thomas Zeugmann: Learning Recursive Concepts with Anomalies. ALT 2000: 101-115 | |
| 46 | Jochen Nessel, Steffen Lange: Learning Erasing Pattern Languages with Queries. ALT 2000: 86-100 | |
| 45 | Gunter Grieser, Klaus P. Jantke, Steffen Lange, Bernd Thomas: A Unifying Approach to HTML Wrapper Representation and Learning. Discovery Science 2000: 50-64 | |
| 44 | Volker Dötsch, Gunter Grieser, Klaus P. Jantke, Steffen Lange: Formal Concepts of Learning Systems Validation in Use. FLAIRS Conference 2000: 319-324 | |
| 43 | Volker Dötsch, Gunter Grieser, Steffen Lange: Applying formal concepts to learning systems validation. J. Exp. Theor. Artif. Intell. 12(4): 433-445 (2000) | |
| 42 | Sanjay Jain, Efim B. Kinber, Steffen Lange, Rolf Wiehagen, Thomas Zeugmann: Learning languages and functions by erasing. Theor. Comput. Sci. 241(1-2): 143-189 (2000) | |
| 1999 | ||
| 41 | Steffen Lange, Gunter Grieser: On the Strength of Incremental Learning. ATL 1999: 118-131 | |
| 40 | John Case, Sanjay Jain, Steffen Lange, Thomas Zeugmann: Incremental Concept Learning for Bounded Data Mining. Inf. Comput. 152(1): 74-110 (1999) | |
| 1998 | ||
| 39 | Gunter Grieser, Klaus P. Jantke, Steffen Lange: Towards the Validation of Inductive Learning Systems. ALT 1998: 409-423 | |
| 38 | Gerd Kamp, Steffen Lange, Christoph Globig: Related Areas. Case-Based Reasoning Technology 1998: 327-351 | |
| 37 | Steffen Lange, Gunter Grieser: On Variants of Iterative Learning. Discovery Science 1998: 72-83 | |
| 36 | Gunter Grieser, Klaus P. Jantke, Steffen Lange: Characterizing Sufficient Expertise for Learning Systems Validation. FLAIRS Conference 1998: 452-456 | |
| 35 | Steffen Lange, Jochen Nessel, Rolf Wiehagen: Learning Recursive Languages from Good Examples. Ann. Math. Artif. Intell. 23(1-2): 27-52 (1998) | |
| 1997 | ||
| 34 | Sanjay Jain, Steffen Lange, Jochen Nessel: Learning of R.E. Languages from Good Examples. ALT 1997: 32-47 | |
| 33 | Christoph Globig, Klaus P. Jantke, Steffen Lange, Yasubumi Sakakibara: On Case Based Learnability of Language. New Generation Comput. 15(1): 39-83 (1997) | |
| 1996 | ||
| 32 | Steffen Lange, Rolf Wiehagen, Thomas Zeugmann: Learning by Erasing. ALT 1996: 228-241 | |
| 31 | Christoph Globig, Steffen Lange: Case-Based Representability of Classes of Boolean Functions. ECAI 1996: 117-121 | |
| 30 | Steffen Lange, Thomas Zeugmann: Incremental Learning from Positive Data. J. Comput. Syst. Sci. 53(1): 88-103 (1996) | |
| 29 | Steffen Lange, Thomas Zeugmann: Set-Driven and Rearrangement-Independent Learning of Recursive Languages. Mathematical Systems Theory 29(6): 599-634 (1996) | |
| 28 | Steffen Lange, Thomas Zeugmann, Shyam Kapur: Monotonic and Dual Monotonic Language Learning. Theor. Comput. Sci. 155(2): 365-410 (1996) | |
| 1995 | ||
| 27 | Klaus P. Jantke, Steffen Lange: Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report Springer 1995 | |
| 26 | Steffen Lange, Thomas Zeugmann: Trading monotonicity demands versus mind changes. EuroCOLT 1995: 125-139 | |
| 25 | Thomas Zeugmann, Steffen Lange: A Guided Tour Across the Boundaries of Learning Recursive Languages. GOSLER Final Report 1995: 190-258 | |
| 24 | Thomas Zeugmann, Steffen Lange, Shyam Kapur: Characterizations of Monotonic and Dual Monotonic Language Learning Inf. Comput. 120(2): 155-173 (1995) | |
| 23 | Klaus P. Jantke, Steffen Lange: Case-Based Representation and Learning of Pattern Languages. Theor. Comput. Sci. 137(1): 25-51 (1995) | |
| 1994 | ||
| 22 | Christoph Globig, Steffen Lange: On Case-Based Representability and Learnability of Languages. AII/ALT 1994: 106-120 | |
| 21 | Steffen Lange, Jochen Nessel, Rolf Wiehagen: Language Learning from Good Examples. AII/ALT 1994: 423-437 | |
| 20 | Steffen Lange, Phil Watson: Machine Discovery in the Presence of Incomplete or Ambiguous Data. AII/ALT 1994: 438-452 | |
| 19 | Steffen Lange, Thomas Zeugmann: Set-Driven and Rearrangement-Independent Learning of Recursive Languages. AII/ALT 1994: 453-468 | |
| 18 | Yasubumi Sakakibara, Klaus P. Jantke, Steffen Lange: Learning Languages by Collecting Cases and Tuning Parameters. AII/ALT 1994: 532-546 | |
| 17 | Steffen Lange: The Representation of Recursive Languages and Its Impact on the Efficiency of Learning. COLT 1994: 256-267 | |
| 16 | Steffen Lange, Thomas Zeugmann: Characterization of language learning front informant under various monotonicity constraints. J. Exp. Theor. Artif. Intell. 6(1): 73-94 (1994) | |
| 1993 | ||
| 15 | Klaus P. Jantke, Steffen Lange: Case-Based Representation and Learning of Pattern Languages. ALT 1993: 87-100 | |
| 14 | Steffen Lange, Thomas Zeugmann: Language Learning in Dependence on the Space of Hypotheses. COLT 1993: 127-136 | |
| 13 | Steffen Lange, Thomas Zeugmann: Language Learning with a Bounded Number of Mind Changes. STACS 1993: 682-691 | |
| 12 | Steffen Lange, Thomas Zeugmann: Learning Recursive Languages with Bounded Mind Changes. Int. J. Found. Comput. Sci. 4(2): 157-178 (1993) | |
| 1992 | ||
| 11 | Steffen Lange, Thomas Zeugmann: A Unifying Approach to Monotonic Language Learning on Informant. AII 1992: 244-259 | |
| 10 | Steffen Lange, Thomas Zeugmann: Types of Monotonic Language Learning and Their Characterization. COLT 1992: 377-390 | |
| 1991 | ||
| 9 | Steffen Lange, Thomas Zeugmann: Monotonic Versus Nonmonotonic Language Learning. Nonmonotonic and Inductive Logic 1991: 254-269 | |
| 8 | Steffen Lange, Rolf Wiehagen: Polynomial-time Inference of Arbitrary Pattern Languages. New Generation Comput. 8(4): 361-370 (1991) | |
| 1990 | ||
| 7 | Steffen Lange, Klaus P. Jantke: Inductive Completion for Transformation of Equational Specifications. ADT 1990: 117-140 | |
| 6 | Steffen Lange, Rolf Wiehagen: Polynomial-Time Inference of Pattern Languages. ALT 1990: 289-301 | |
| 5 | Steffen Lange: A Note on Polynominal-Time Inference of k-Variable Pattern Languages. Nonmonotonic and Inductive Logic 1990: 178-183 | |
| 1989 | ||
| 4 | Steffen Lange: Towards a Set of Inference Rules for Solving Divergence in Knuth-Bendix Completion. AII 1989: 304-316 | |
| 1987 | ||
| 3 | Steffen Lange: On the construction of unifying terms modulo a set of substitutions. Bulletin of the EATCS 31: 29-34 (1987) | |
| 1986 | ||
| 2 | Steffen Lange: A Decidability Problem of Church-Rosser Specifications for Program Synthesis. AII 1986: 105-124 | |
| 1985 | ||
| 1 | Steffen Lange: A program synthesis algorithm exemplified. Mathematical Methods of Specification and Synthesis of Software Systems 1985: 185-193 | |
Colors in the list of coauthors
Last update Fri May 25 01:42:58 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page