Type
Now showing items 120 of 55

An Approach for Investigation of Geochemical RockFluid Interactions
(Stanford University, 2014)Geochemistry has a substantial impact in exploiting of geothermal systems. When water is injected in a geothermal reservoir, the injected water and insitu brine have different temperatures and chemical compositions and ...Conference object 
Approximating Acyclicity Parameters of Sparse Hypergraphs
(Dagstuhl Publishing, 2009)The notions of hypertree width and generalized hypertree width were introduced by Gottlob, Leone, and Scarcello (PODS'99, PODS'01) in order to extend the concept of hypergraph acyclicity. These notions were further generalized ...Conference object 
Bchromatic number: Beyond NPhardness
(Dagstuhl Publishing, 2015)The bchromatic number of a graph G, chi_b(G), is the largest integer k such that G has a kvertex coloring with the property that each color class has a vertex which is adjacent to at least one vertex in each of the other ...Conference object 
Co2 trapping in sloping aquafiers: High resolution numerical simulations
(CIMNE, 2010)Conference object 
Colluding Tags Attack on the ECCbased Grouping Proofs for Rfids
(The author, 2012)Recently, a new privacypreserving elliptic curve based grouping proof protocol with colluding tag prevention( CTP) has been proposed. The CTP protocol is claimed to be resistant against colluding tags attacks in which ...Conference object 
Computing cutwidth and pathwidth of semicomplete digraphs via degree orderings
(Dagstuhl Publishing, 2013)The notions of cutwidth and pathwidth of digraphs play a central role in the containment theory for tournaments, or more generally semicomplete digraphs, developed in a recent series of papers by Chudnovsky, Fradkin, Kim, ...Conference object 
Connecting Vertices by Independent Trees
(Schloss Dagstuhl – LeibnizZentrum für Informatik GmbH, 2014)We study the paramereteized complexity of the following connectivity problem. For a vertex subset U of a graph G, trees T1, . . . , Ts of G are completely independent spanning trees of U if each of them contains U , and ...Conference object 
Counting Instances of Software Components
(University of Bergen, Department of Informatics, 20040713)Component software is software that has been assembled from various pieces of standardized, reusable computer programs, socalled components. Executing component software creates instances of these components. For several ...Conference object 
Direct data transfer between SOAP web services in Orchestration
(ACM, 2012)In scientific data analysis, workflows are used to integrate and coordinate resources such as databases and tools. Workflows are normally executed by an orchestrator that invokes component services and mediates data ...Conference object 
Domain decomposition preconditioning for nonlinear elasticity problems
(International Centre for Numerical Methods in Engineering, 2014)We consider domain decomposition techniques for a nonlinear elasticity problem. Our main focus is on nonlinear preconditioning, realized in the framework of additive Schwarz preconditioned inexact Newton (ASPIN) methods. ...Conference object 
Editing to Eulerian Graphs
(Schloss Dagstuhl – LeibnizZentrum für Informatik GmbH, 2014)We investigate the problem of modifying a graph into a connected graph in which the degree of each vertex satisfies a prescribed parity constraint. Let ea, ed and vd denote the operations edge addition, edge deletion and ...Conference object 
Electrical conductivity of fractured media: A computational study of the selfconsistent method
(Society of Exploration Geophysicists, 2012)Effective medium theory can be used to link conductivity estimation methods with prior knowledge about the distribution of fractures in the investigated geological structure. In the literature, little work has been ...Conference object 
Enumerating minimal connected dominating sets in graphs of bounded chordality
(Dagstuhl Publishing, 2015)Listing, generating or enumerating objects of specified type is one of the principal tasks in algorithmics. In graph algorithms one often enumerates vertex subsets satisfying a certain property. We study the enumeration ...Conference object 
Fast biclustering by dual parameterization
(Dagstuhl Publishing, 2015)We study two clustering problems, Starforest Editing, the problem of adding and deleting edges to obtain a disjoint union of stars, and the generalization Bicluster Editing. We show that, in addition to being NPhard, none ...Conference object 
Finding even subgraphs even faster
(Dagstuhl Publishing, 2015)Problems of the following kind have been the focus of much recent research in the realm of parameterized complexity: Given an input graph (digraph) on n vertices and a positive integer parameter k, find if there exist k ...Conference object 
Finding Induced Subgraphs via Minimal Triangulations
(Dagstuhl Publishing, 2010)Potential maximal cliques and minimal separators are combinatorial objects which were introduced and studied in the realm of minimal triangulation problems in cluding Minimum Fillin and Treewidth. We discover unexpected ...Conference object 
Flame Propagation in Dust Clouds: Challenges for Model Validation
(2010)Modelling of industrial dust explosions poses a formidable challenge to researchers and safety engineers. Whereas current best practice with respect to modelling the consequences of vapour cloud explosions in the petroleum ...Conference object 
Interactive Visualization of Streaming Data with Kernel Density Estimation
(IEEE, 2011)In this paper, we discuss the extension and integration of the statistical concept of Kernel Density Estimation (KDE) in a scatterplotlike visualization for dynamic data at interactive rates. We present a line kernel ...Conference object 
Investigating Streamless Sets
(Dagstuhl Publishing, 2015)In this paper we look at streamless sets, recently investigated by Coquand and Spiwack. A set is streamless if every stream over that set contain a duplicate. It is an open question in constructive mathematics whether the ...Conference object 
Investigating the Limitations of Java Annotations for Input Validation
(2010)Recently Java annotations have received a lot of attention as a possible way to simplify the usage of various frameworks, ranging from persistence and verification to security. In this paper we discuss our experiences ...Conference object