The codegree density γ(F) of an r-graph F is the largest number γ such that there are F-free r-graphs G on n vertices such that every set of r−1 vertices is contained in at le...
Surveys and opinion polls are extremely popular in the media, especially in the months preceding a general election. However, the available tools for analyzing poll results often r...
Abstract: Spatial data mining algorithms heavily depend on the efficient processing of neighborhood relations since the neighbors of many objects have to be investigated in a singl...
Martin Ester, Alexander Frommelt, Hans-Peter Krieg...
Despite recent excitement generated by the peer-to-peer (P2P) paradigm and the surprisingly rapid deployment of some P2P applications, there are few quantitative evaluations of P2...
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...