Showing papers in "Journal of Computer and System Sciences in 2010"

TL;DR: An approximation algorithm for finding optimal decompositions which is based on the insight provided by the theorem and significantly outperforms a greedy approximation algorithms for a set covering problem to which the problem of matrix decomposition is easily shown to be reducible.

TL;DR: A kernelization algorithm for the 3-Hitting Set problem is presented along with a general kernelization for d-H hitting Set, which guarantees a kernel whose order does not exceed (2d-1)k^d^-^1+k.

TL;DR: In this paper, a game-theoretic regression learning setting where private information is elicited from multiple agents with different, possibly conflicting, views on how to label the points of an input space is studied.

TL;DR: This work considers the constraint satisfaction problem parameterized by the treewidth of primal, dual, and incidence graphs, combined with several other basic parameters such as domain size and arity, and determines all combinations of the considered parameters that admit fixed-parameter tractability.

TL;DR: It is shown that Possible Winner is NP-complete for all pure scoring rules except plurality, veto, and the scoring rule defined by the scoring vector (2,1,...,1,0), while it is solvable in polynomial time for plurality and veto.

TL;DR: In this paper, the complexity of counting the number of satisfying assignments of a CSP instance is shown to be equivalent in complexity to several other known counting problems, including the problem of approximately counting the independent sets in a bipartite graph.

TL;DR: In this paper, the authors describe a data model for trajectories and trajectory samples and an efficient way of modeling uncertainty via beads for trajectory samples, and study transformations of the ambient space for which important physical properties of trajectories, such as speed, are invariant.

TL;DR: The minimum size of advice permitting the wakeup with a linear number of messages in an n-node network, is @Q(nlogn), while the broadcast can be achieved with advice of size O(n), and it is shown that the latter size of Advice is almost optimal.

TL;DR: This paper presents a formal semantics for the Taverna 2 scientific workflow system, which improves upon the existing model by adding support for data pipelining and providing new extensibility points that make it possible to add new operators to the workflow model.

TL;DR: The paper presents the history and present state of the GUHA method, its theoretical foundations and its relation and meaning for data mining.

TL;DR: A new criterion, called the slack of a chunking method, seeks to measure how much of an interval of agreement between two files is wasted because it lies in chunks that don't agree, and it is shown how to efficiently find the cutpoints for local maximum chunking.

TL;DR: It is shown that the state reduction problem for fuzzy automata is related to the problem of finding a solution to a particular system of fuzzy relation equations in the set of all fuzzy equivalences on its set of states, and an effective procedure is given for computing the greatest right (resp. left) invariant fuzzy equivalence.

TL;DR: This paper describes the challenges faced by workflow management and performance analysis systems when dealing with an earthquake science application, CyberShake, executing on the TeraGrid, and shows how to approach the scalability challenges in the workflowmanagement and log mining systems.

TL;DR: This paper presents a novel approach for mining frequent sequences, called Prism, which utilizes a vertical approach for enumeration and support counting, based on the novel notion of primal block encoding, which in turn is based on prime factorization theory.

TL;DR: An O(k) kernel for Rooted Directedk-Leaf restricted to acyclic digraphs is obtained, which leads to an O(1.9973^n)-time algorithm for solving Directed Max Leaf on a digraph of order n.

TL;DR: This is the first paper systematically presenting a comprehensive set of reduction rules for reset/inhibitor nets that are liveness and boundedness preserving and are able to dramatically reduce models and their state spaces.

TL;DR: In this paper, the problem of k-mismatch pattern matching with don't-care symbols was studied and a deterministic @Q(nk+logmlogk)logn) time randomised algorithm was proposed.

TL;DR: This work presents a simple randomized algorithmic framework for connected facility location problems that significantly improves over the previously best known approximation ratios for several NP-hard network design problems.

TL;DR: In this article, the complexity of planning restricted by the causal graph is studied, and it is shown that a set of causal graphs is either polynomial-time tractable or not tractable unless an established complexity-theoretic assumption fails.

TL;DR: This work derives both (classical) complexity results and (parameterized) algorithms for this problem (and some variants thereof) that has important applications in the construction and evaluation of phylogenetic trees.

TL;DR: Gutin, Razgon and Kim as mentioned in this paper proposed randomized and deterministic algorithms for deciding whether an input digraph contains a spanning out-tree with at least k internal vertices.

TL;DR: Atserias et al. as discussed by the authors showed that any quasi-wide class that is closed under taking substructures and disjoint unions has the homomorphism preservation property.

TL;DR: It is proved that most of the parameterized complexity of several minimum label graph problems are FPT when parameterized by the solution size, that is, the size of the sought edge set.

TL;DR: This characterization finds applications in new polynomial-time approximation algorithms and fixed-parameter tractability results for the NP-hard problem to delete a minimum number of rows or columns from a 0/1-matrix such that the remaining submatrix has the C1P.

TL;DR: This work initiates the systematic study of CSP complexity with succinctly specified constraint relations.

TL;DR: This paper proposes a ranking procedure called ranking through iterated choice as well as an efficient pairwise implementation thereof and offers empirical evidence in favor of its superior performance as a risk minimizer for the position error.

TL;DR: The families of languages defined by components of unique, least and greatest solutions of such systems are shown to coincide with the classes of recursive, recursively enumerable and co-recursive enumerable sets, respectively.

TL;DR: This paper presents approaches for exploiting data parallelism in XML processing pipelines through novel compilation strategies to the MapReduce framework, and shows that execution times of XML workflow pipelines can be significantly reduced using these strategies.

TL;DR: The goal of this work is to provide a comprehensive analysis of the counting complexity of propositional abduction in various settings.

TL;DR: The first self-stabilizing wait-free reset mechanism that ensures eventual safety and can be used to implement efficient self-Stabilizing timestamps that are of independent interest is presented.