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

TL;DR: This article begins a rigorous mathematical analysis of the real-time computing capabilities of a new generation of models for neural computation, liquid state machines, that can be implemented with--in fact benefit from--diverse computational units.

TL;DR: In this paper, it was shown that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n).

TL;DR: An O(|S|)-time algorithm that operates on the suffix tree T(S) for a string S, finding and marking the endpoint of every tandem repeat that occurs in S, improves and generalizes several prior efforts to efficiently capture large subsets of tandem repeats.

TL;DR: A work-conserving variant of Pfair scheduling called "early-release" fair (ERfair) scheduling is introduced and a new scheduling algorithm called PD2 is presented and it is shown that it is optimal for scheduling any mix of early-release and non-early- release asynchronous, periodic tasks.

TL;DR: In this paper, the authors analyzed the absorption probability of quantum random walks with both one and two absorbing walls for the one-dimensional case and presented several new results for the absorption probabilities.

TL;DR: Two dissimilarity measures between intuitionistic fuzzy sets of a finite set are defined and it is proved that both of the measures are metrical.

TL;DR: In this paper, it was shown that for a fixed directed graph on n vertices, at least en2 edges have to be removed from it to make it H-free.

TL;DR: This paper introduces the closely related notion of a subword history and obtains a sequence of general results: elimination of products, decidability of equivalence, and normal form, and investigates overall-methods for proving the validity of such results.

TL;DR: The computational aspects of calculating the hitting probability of spaced seeds are studied; and an efficient algorithm for identifying optimal spaced seeds is proposed.

TL;DR: In this paper, a lower bound of Ω(√n) on the bounded-error quantum query complexity of read-once Boolean functions is established via an inductive argument, together with an extension of the lower bound method of Ambainis.

TL;DR: Two new measures of relative randomness are introduced and investigated and their properties and the relationships between them and Solovay reducibility are investigated.

TL;DR: These results relativize, in a natural way, to a more general principle M(U|H) asserting that H contains a matching covering all vertices in U ⊆ V(H), which does not possess efficient proofs of NP ⊈ P/poly.

TL;DR: This paper demonstrates structural properties of larger classes of graphs and shows how to exploit the properties to derive polynomial-time algorithms for approximating treewidth and branchwidth and fixed-parameter algorithms for problems such as vertex cover, edge-dominating set, feedback vertex set, and others.

TL;DR: It is proved that the closest vector problem with preprocessing (CVPP) is NP-hard to approximate within any factor less than √5/3, and this result easily extends to any lp, norm, for p ≥ 1, showing that CVPP in the lp norm is hard to approximateWithin any factor γ < p√ 5/3.

TL;DR: In this paper, it was shown that for a given set of clauses F, the number of clauses in each of its subsets is at most equal to or greater than the total number of variables occurring in the subset at most by k, and k is the maximum deficiency of F and can be computed by means of graph matching algorithms.

TL;DR: In this article, the authors present the first average-case analysis proving a polynomial upper bound on the expected running time of an exact algorithm for the 0/1 knapsack problem.

TL;DR: In this article, the authors consider Fibonacci heap style integer priority queues supporting find-rain, insert, and decrease key operations in constant time and present a deterministic linear space solution that with n int...

TL;DR: This paper presents a framework for constructing hierarchical (hyper)graphs, using one of the well-known categories of traditional flat ( hyper) graph categories as a base, and shows how the double-pushout approach to graph transformation can be extended to them.

TL;DR: In this paper, a new protocol and two lower bounds for quantum coin flipping were presented, and it was shown that no dishonest party can achieve one outcome with probability more than 0.75.

TL;DR: In this article, a hierarchy of rescaled resource-bounded dimensions was developed for polynomial q(n)>n2, where the zeroth-order dimension is precisely the dimension of Hausdorff (Math. Ann. 79 (1919) 157-179).

TL;DR: The complexity class vertex NLIN is defined, which collects the graph problems computable on a nondeterministic RAM in time O(n), where n is the number of vertices of the input graph G = (V.E) + |E|.

TL;DR: A particularly simple protocol is presented that realizes a transformation into their counterparts with unlimited accuracy when f > k, where f is the maximum number of processes that may crash and there is no reduction protocol when f ≥ k.

TL;DR: A theorem answering the question "how many states does a minimal deterministic finite automaton recognizing the set of base-b numbers divisible by k have?" is presented and proved.

TL;DR: This work develops a technique for lower bounding the sample size required for PAC learning with membership queries under a fixed distribution and applies this technique to produce a lower bound on the number of membership queries needed for the uniform-distribution DNF learning problem.

TL;DR: In this article, it was shown that string graphs can be recognized in non-deterministic exponential time by giving an exponential upper bound on the number of intersections for a minimal drawing realizing a string graph.

TL;DR: It is proved that in order to compute parity, circuits consisting of a threshold gate at the top, mod 3 gates in the middle, and AND gates of fan-in two at the inputs must be of size 2Ω(n).

TL;DR: This paper is the completely revised and strongly extended version of the conference paper Damm et al. (Proc. STACS, pp. 281-291) where a subset of the results was presented.

TL;DR: It is shown in this paper that the problem to decide whether or not it is possible to partition the vertices of a graph into k distinct non-empty sets A0, A1,..., Ak-1 is NP-complete, for all even k ≥ 6.

TL;DR: By constructing new Lyapunov functionals, several novel conditions are derived to guarantee the existence, uniqueness and global robust stability of the equilibrium of neural networks with time delays.

TL;DR: It is shown that finding a better constant ratio is as hard as finding a constant ratio better than k for the k-bounded set-cover problem in which the optimal cover is known to be of size at least |C|/k.