Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jörg Köller

dblp:93/2358 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2000
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 3 · 2 first-authorDatabases, data management, data science and information retrieval · 1Theory of computation · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Data integration and cleaning · 100%
Artificial intelligence
1 paper
Information extraction and text analysis · 100%

Topics — the 1 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Natural language and speech › Information extraction and text analysis › document understanding
text structuring
0.011999
Automatically Structuring Textual Requirement Scenarios · ASE 1999

Methods — techniques the papers use, named apart from their topics

text structuring · 0.0
YearPublicationVenuePosition
2000 Efficient abstract interpretation using component-wise homomorphisms
abstract
Fixed point based abstract interpretation requires compact representations of functions. In general, finding a fixed point requires exponential time. Good representations allow the reduction of the fixed point solvers computational complexity. One approach for obtaining compact representations is the use of special classes of functions. In this paper, we focus on the class of component-wise homomorphisms. We show that this class of functions gives more compact representations than component-wise additive functions. 1.
Jörg Köller, Markus Mohnen
PPDP1
2000 The Challenge of Process Data Warehousing
Matthias Jarke, Thomas List, Jörg Köller
VLDB3
1999 Automatically Structuring Textual Requirement Scenarios
abstract
Scenarios are valuable for supporting communication among system developers in the initial phases of requirements engineering. But the problem of how to fruitfully deal with large informal or semi-formal scenario collections consisting of weakly structured texts is still a key research issue. We report on a novel approach of automatically structuring textual document collections. We focus on its application to scenario management and discuss how structuring scenarios can help to support the analysis and maintenance of scenario collections. To evaluate the approach, we present a case study within a concrete software engineering effort.
Andreas Becks, Jörg Köller
ASE2
1999 A New Class of Functions for Abstract Interpretation
Jörg Köller, Markus Mohnen
SAS1