![]() | 2009 | |
---|---|---|
60 | ![]() ![]() ![]() ![]() ![]() ![]() | Annette Gotscharek, Ulrich Reffle, Christoph Ringlstetter, Klaus U. Schulz: On lexical resources for digitization of historical documents. ACM Symposium on Document Engineering 2009: 193-200 |
59 | ![]() ![]() ![]() ![]() ![]() ![]() | Daniel P. Lopresti, Shourya Roy, Klaus U. Schulz, L. Venkata Subramaniam: Special issue on noisy text analytics. IJDAR 12(3): 139-140 (2009) |
58 | ![]() ![]() ![]() ![]() ![]() ![]() | Ulrich Reffle, Annette Gotscharek, Christoph Ringlstetter, Klaus U. Schulz: Successfully detecting and correcting false friends using channel profiles. IJDAR 12(3): 165-174 (2009) |
2008 | ||
57 | ![]() ![]() ![]() ![]() ![]() ![]() | Daniel P. Lopresti, Shourya Roy, Klaus U. Schulz, L. Venkata Subramaniam: Proceedings of the Second Workshop on Analytics for Noisy Unstructured Text Data, AND 2008, Singapore, July 24, 2008 ACM 2008 |
56 | ![]() ![]() ![]() ![]() ![]() ![]() | Ulrich Reffle, Annette Gotscharek, Christoph Ringlstetter, Klaus U. Schulz: Successfully detecting and correcting false friends using channel profiles. AND 2008: 17-22 |
2007 | ||
55 | ![]() ![]() ![]() ![]() ![]() ![]() | Stoyan Mihov, Petar Mitankin, Annette Gotscharek, Ulrich Reffle, Klaus U. Schulz, Christoph Ringlstetter: Using Automated Error Profiling of Texts for Improved Selection of Correction Candidates for Garbled Tokens. Australian Conference on Artificial Intelligence 2007: 456-465 |
54 | ![]() ![]() ![]() ![]() ![]() ![]() | Klaus U. Schulz, Stoyan Mihov, Petar Mitankin: Fast Selection of Small and Precise Candidate Sets from Dictionaries for Text Correction Tasks. ICDAR 2007: 471-475 |
53 | ![]() ![]() ![]() ![]() ![]() ![]() | Christoph Ringlstetter, Ulrich Reffle, Annette Gotscharek, Klaus U. Schulz: Deriving Symbol Dependent Edit Weights for Text Correction_The Use of Error Dictionaries. ICDAR 2007: 639-643 |
52 | ![]() ![]() ![]() ![]() ![]() ![]() | Andrea Stubbe, Christoph Ringlstetter, Klaus U. Schulz: Genre as noise: noise in genre. IJDAR 10(3-4): 199-209 (2007) |
51 | ![]() ![]() ![]() ![]() ![]() ![]() | Stoyan Mihov, Klaus U. Schulz: Efficient dictionary-based text rewriting using subsequential transducers. Natural Language Engineering 13(4): 353-381 (2007) |
50 | ![]() ![]() ![]() ![]() ![]() ![]() | Christoph Ringlstetter, Klaus U. Schulz, Stoyan Mihov: Adaptive text correction with Web-crawled domain-dependent dictionaries. TSLP 4(4): (2007) |
2006 | ||
49 | ![]() ![]() ![]() ![]() ![]() ![]() | Andreas Hauser, Markus Heller, Elisabeth Leiss, Klaus U. Schulz, Christiane Wanzeck: Information Access to Historical Documents from the Early New High German Period. Digital Historical Corpora 2006 |
48 | ![]() ![]() ![]() ![]() ![]() ![]() | Felix Weigel, Klaus U. Schulz, Levin Brunner, Eduardo Torres-Schumann: Integrated Document Browsing and Data Acquisition for Building Large Ontologies. KES (3) 2006: 614-622 |
47 | ![]() ![]() ![]() ![]() ![]() ![]() | Georg Gottlob, Christoph Koch, Klaus U. Schulz: Conjunctive Queries over Trees CoRR abs/cs/0602004: (2006) |
46 | ![]() ![]() ![]() ![]() ![]() ![]() | Christoph Ringlstetter, Klaus U. Schulz, Stoyan Mihov: Orthographic Errors in Web Pages: Toward Cleaner Web Corpora. Computational Linguistics 32(3): 295-340 (2006) |
45 | ![]() ![]() ![]() ![]() ![]() ![]() | Eduardo Torres-Schumann, Klaus U. Schulz: Stable methods for recognizing acronym-expansion pairs: from rule sets to hidden Markov models. IJDAR 8(1): (2006) |
44 | ![]() ![]() ![]() ![]() ![]() ![]() | Levin Brunner, Klaus U. Schulz, Felix Weigel: Organizing Thematic, Geographic, and Temporal Knowledge in a Well-Founded Navigation Space: Logical and Algorithmic Foundations for EFGT Nets. Int. J. Web Service Res. 3(4): 1-31 (2006) |
43 | ![]() ![]() ![]() ![]() ![]() ![]() | Georg Gottlob, Christoph Koch, Klaus U. Schulz: Conjunctive queries over trees. J. ACM 53(2): 238-272 (2006) |
2005 | ||
42 | ![]() ![]() ![]() ![]() ![]() ![]() | Felix Weigel, Klaus U. Schulz, Holger Meuss: Node Identification Schemes for Efficient XML Retrieval. Foundations of Semistructured Data 2005 |
41 | ![]() ![]() ![]() ![]() ![]() ![]() | Stoyan Mihov, Klaus U. Schulz, Christoph Ringlstetter, Veselka Dojchinova, Vanja Nakova: A Corpus for Comparative Evaluation of OCR Software and Postcorrection Techniques. ICDAR 2005: 162-166 |
40 | ![]() ![]() ![]() ![]() ![]() ![]() | Christoph Ringlstetter, Klaus U. Schulz, Stoyan Mihov, Katerina Louka: The Same is Not The same - Post Correction of Alphabet Confusion Errors in Mixed-Alphabet OCR Recognation. ICDAR 2005: 406-410 |
39 | ![]() ![]() ![]() ![]() ![]() ![]() | Felix Weigel, Klaus U. Schulz, Holger Meuss: Exploiting native XML indexing techniques for XML retrieval in relational database systems. WIDM 2005: 23-30 |
38 | ![]() ![]() ![]() ![]() ![]() ![]() | Felix Weigel, Klaus U. Schulz, Holger Meuss: The BIRD Numbering Scheme for XML and Tree Databases - Deciding and Reconstructing Tree Relations Using Efficient Arithmetic Operations. XSym 2005: 49-67 |
37 | ![]() ![]() ![]() ![]() ![]() ![]() | Holger Meuss, Klaus U. Schulz, Felix Weigel, Simone Leonardi, François Bry: Visual exploration and retrieval of XML document collections with the generic system X2. Int. J. on Digital Libraries 5(1): 3-17 (2005) |
36 | ![]() ![]() ![]() ![]() ![]() ![]() | Manfred Schmidt-Schauß, Klaus U. Schulz: Decidability of bounded higher-order unification. J. Symb. Comput. 40(2): 905-954 (2005) |
2004 | ||
35 | ![]() ![]() ![]() ![]() ![]() ![]() | Felix Weigel, Holger Meuss, François Bry, Klaus U. Schulz: Content-Aware DataGuides: Interleaving IR and DB Indexing Techniques for Efficient Retrieval of Textual XML Data. ECIR 2004: 378-393 |
34 | ![]() ![]() ![]() ![]() ![]() ![]() | Felix Weigel, Klaus U. Schulz, Holger Meuss: Ranked Retrieval of Structured Documents with the S-Term Vector Space Model. INEX 2004: 238-252 |
33 | ![]() ![]() ![]() ![]() ![]() ![]() | Georg Gottlob, Christoph Koch, Klaus U. Schulz: Conjunctive Queries over Trees. PODS 2004: 189-200 |
32 | ![]() ![]() ![]() ![]() ![]() ![]() | Felix Weigel, Holger Meuss, Klaus U. Schulz, François Bry: Content and Structure in Indexing and Ranking XML. WebDB 2004: 67-72 |
31 | ![]() ![]() ![]() ![]() ![]() ![]() | Stoyan Mihov, Klaus U. Schulz: Fast Approximate Search in Large Dictionaries. Computational Linguistics 30(4): 451-477 (2004) |
2003 | ||
30 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian M. Strohmaier, Christoph Ringlstetter, Klaus U. Schulz, Stoyan Mihov: Lexical Postcorrection of OCR-Results: The Web as a Dynamic Secondary Dictionary? ICDAR 2003: 1133-1137 |
29 | ![]() ![]() ![]() ![]() ![]() ![]() | Holger Meuss, Klaus U. Schulz, François Bry: Visual Querying and Exploration of Large Answers in XML Databases with X2. ICDE 2003: 777-779 |
28 | ![]() ![]() ![]() ![]() ![]() ![]() | Klaus U. Schulz, Felix Weigel: Systematics and Architecture for a Resource Representing Knowledge about Named Entities. PPSWR 2003: 189-207 |
2002 | ||
27 | ![]() ![]() ![]() ![]() ![]() ![]() | Manfred Schmidt-Schauß, Klaus U. Schulz: Decidability of Bounded Higher-Order Unification. CSL 2002: 522-536 |
26 | ![]() ![]() ![]() ![]() ![]() ![]() | Klaus U. Schulz, Stoyan Mihov: Fast string correction with Levenshtein automata. IJDAR 5(1): 67-85 (2002) |
25 | ![]() ![]() ![]() ![]() ![]() ![]() | Manfred Schmidt-Schauß, Klaus U. Schulz: Solvability of Context Equations with Two Context Variables is Decidable. J. Symb. Comput. 33(1): 77-122 (2002) |
2001 | ||
24 | ![]() ![]() ![]() ![]() ![]() ![]() | Holger Meuss, Klaus U. Schulz, François Bry: Towards Aggregated Answers for Semistructured Data. ICDT 2001: 346-360 |
23 | ![]() ![]() ![]() ![]() ![]() ![]() | Holger Meuss, Klaus U. Schulz: Complete answer aggregates for treelike databases: a novel approach to combine querying and navigation. ACM Trans. Inf. Syst. 19(2): 161-215 (2001) |
22 | ![]() ![]() ![]() ![]() ![]() ![]() | Klaus U. Schulz, Stephan Kepser: Combination of constraint systems II: Rational amalgamation. Theor. Comput. Sci. 266(1-2): 113-157 (2001) |
2000 | ||
21 | ![]() ![]() ![]() ![]() ![]() ![]() | Klaus U. Schulz: Why Combined Decision Problems Are Often Intractable. FroCos 2000: 217-244 |
20 | ![]() ![]() ![]() ![]() ![]() ![]() | Klaus U. Schulz: Tractable and intractable instances of combination problems for unification and disunification. J. Log. Comput. 10(1): 105-135 (2000) |
1999 | ||
19 | ![]() ![]() ![]() ![]() ![]() ![]() | Manfred Schmidt-Schauß, Klaus U. Schulz: Solvability of Context Equations with Two Context Variables is Decidable. CADE 1999: 67-81 |
18 | ![]() ![]() ![]() ![]() ![]() ![]() | Franz Baader, Klaus U. Schulz: Combining Constraint Solving. CCL 1999: 104-158 |
17 | ![]() ![]() ![]() ![]() ![]() ![]() | Rolf Backofen, François Bry, Peter Clote, Hans-Peter Kriegel, Thomas Seidl, Klaus U. Schulz: Bioinformatik - Aktuelles Schlagwort. Informatik Spektrum 22(5): 376-378 (1999) |
1998 | ||
16 | ![]() ![]() ![]() ![]() ![]() ![]() | Manfred Schmidt-Schauß, Klaus U. Schulz: On the Exponent of Periodicity of Minimal Solutions of Context Equation. RTA 1998: 61-75 |
15 | ![]() ![]() ![]() ![]() ![]() ![]() | Franz Baader, Klaus U. Schulz: Combination of Constraint Solvers for Free and Quasi-Free Structures. Theor. Comput. Sci. 192(1): 107-161 (1998) |
1997 | ||
14 | ![]() ![]() ![]() ![]() ![]() ![]() | Klaus U. Schulz: A Criterion for Intractability of E-unification with Free Function Symbols and Its Relevance for Combination Algorithms. RTA 1997: 284-298 |
1996 | ||
13 | ![]() ![]() ![]() ![]() ![]() ![]() | Stephan Kepser, Klaus U. Schulz: Combination of Constraint Systems II: Rational Amalgamation. CP 1996: 282-296 |
12 | ![]() ![]() ![]() ![]() ![]() ![]() | Franz Baader, Klaus U. Schulz: Unification in the Union of Disjoint Equational Theories: Combining Decision Procedures. J. Symb. Comput. 21(2): 211-243 (1996) |
1995 | ||
11 | ![]() ![]() ![]() ![]() ![]() ![]() | Franz Baader, Klaus U. Schulz: On the Combination of Symbolic Constraints, Solution Domains, and Constraint Solvers. CP 1995: 380-397 |
10 | ![]() ![]() ![]() ![]() ![]() ![]() | Franz Baader, Klaus U. Schulz: Combination of Constraint Solving Techniques: An Algebraic POint of View. RTA 1995: 352-366 |
9 | ![]() ![]() ![]() ![]() ![]() ![]() | Franz Baader, Klaus U. Schulz: Combination Techniques and Decision Problems for Disunification. Theor. Comput. Sci. 142(2): 229-255 (1995) |
1994 | ||
8 | ![]() ![]() ![]() ![]() ![]() ![]() | Klaus U. Schulz: On Existential Theories of List Concatenation. CSL 1994: 294-308 |
1993 | ||
7 | ![]() ![]() ![]() ![]() ![]() ![]() | Franz Baader, Klaus U. Schulz: Combination Techniques and Decision Problems for Disunification. RTA 1993: 301-315 |
6 | ![]() ![]() ![]() ![]() ![]() ![]() | Klaus U. Schulz: Wort Unification and Transformation of Generalized Equations. J. Autom. Reasoning 11(2): 149-184 (1993) |
1992 | ||
5 | ![]() ![]() ![]() ![]() ![]() ![]() | Klaus U. Schulz: Word Equations and Related Topics, First International Workshop, IWWERT '90, Tübingen, Germany, October 1-3, 1990, Proceedings Springer 1992 |
4 | ![]() ![]() ![]() ![]() ![]() ![]() | Franz Baader, Klaus U. Schulz: Unification in the Union of Disjoint Equational Theories: Combining Decision Procedures. CADE 1992: 50-65 |
1991 | ||
3 | ![]() ![]() ![]() ![]() ![]() ![]() | Franz Baader, Klaus U. Schulz: General A- and AX-Unification via Optimized. IWWERT 1991: 23-42 |
1990 | ||
2 | ![]() ![]() ![]() ![]() ![]() ![]() | Klaus U. Schulz: Makanin's Algorithm for Word Equations - Two Improvements and a Generalization. IWWERT 1990: 85-150 |
1989 | ||
1 | ![]() ![]() ![]() ![]() ![]() ![]() | Klaus U. Schulz: Preferential cumulative reasoning and nonmonotonic semantic nets. The Logic of Theory Change 1989: 223-240 |