Showing papers in "Information Processing Letters in 2004"

TL;DR: This work proposes the first simple and intuitive model for complex networks which captures the main properties met in practice, and shows here that all complex networks can be viewed as bipartite structures sharing some important statistics, like degree distributions.

TL;DR: A quantum algorithm is presented which identifies with certainty a hidden subgroup of an arbitrary finite group G in only a polynomial number of calls to the oracle, exponentially better than the best classical algorithm.

TL;DR: This paper extends on previous results to present an attack on the AES up to 7 rounds, and works by exploiting weaknesses in the AES key schedule.

TL;DR: Two automatic program analyses are presented that computes the set of all polynomial relations of an arbitrary given form that are valid at a given target program point up to the abstraction described above.

TL;DR: A simple algorithm is presented to solve the constrained longest common subsequence problem in O(n . m . r) time and it is shown that this problem is equivalent to a special case of the constrained multiple sequence alignment problem which can also be solved with the same time complexity.

TL;DR: It is proved that checking the existence of a function which, given the n observations corresponding to a behavior ρ ∈ L, decides whether ρ is in K or not is undecidable, which is used to show undecidability of a decentralized supervisory control problem in the discrete event system framework.

TL;DR: A simple pruning approach is demonstrated that makes a branch-and-bound-based exhaustive search extremely effective for problems with less than 30 rectangles.

TL;DR: Two algorithms are presented that prove that the acyclic chromatic number of a subcubic graph is at most four, and its acYclic edge Chromatic number is at least five, and that there is no 2-colored cycle.

TL;DR: In a graphG, a vertex is said todominate itself and all of its neighbors such that every vertex in V is dominated by at least one vertex in D.

TL;DR: XML documents conceptually are not trees, but forests, so the concept of macro tree transducers is extended to a transformation formalism of forests, macro forest transducers (mft's), and it is shown that mft's form a strict superset of mtt's operating on forests.

TL;DR: Two 2/3 - e approximation algorithms for the maximum weight matching problem that run in time O(m log 1e;) are presented, which are exponentially faster in terms of e than a recent algorithm by Drake and Hougardy.

TL;DR: This article derives a lazy abstract machine from an ordinary call-by-need evaluator that threads a heap of updatable cells, using closure conversion, transformation into continuation-passing style, and defunctionalization of continuations.

TL;DR: All hypercube variants are hamiltonian-connected or hamiltonia-laceable and it is shown that these graphs are bipancyclic.

TL;DR: An algorithm for detecting periodicity in sequences produced by repeated application of a given function that uses logarithmic memory with high probability, runs in linear time, and is guaranteed to stop within the second loop through the cycle.

TL;DR: It is proved that no polynomial time approximation algorithm for the terminal Steiner tree problem can achieve an approximation ratio less than (1−o(1)lnn unless NP has slightly superpolynomial time algorithms.

TL;DR: An Ω(m) lower bound on the number of queries required to test whether a Boolean function depends on at most m out of its n variables is shown.

TL;DR: A direct combinatorial reduction from low error-probability PCP to LABEL-COVER showing it NP-hard to approximate to within 2(log n)1-o(1) improves upon the best previous hardness of approximation results known for this problem.

TL;DR: It is shown that different characterizations of pair of words having the same Parikh matrix have different meanings according to the type of language they are spoken in.

TL;DR: An improved algorithm for all pairs shortest paths for graph of n vertices is presented, which improves the best previous result which runs in O(n3(log log n/log n)1/2) time.

TL;DR: The impact of induced maximal cliques, odd holes and odd anti-holes on the polytope associated with a new 0-1 integer programming formulation of the graph coloring problem is investigated and it is shown that they induce classes of facet defining inequalities.

TL;DR: This work re-examines two known approximation results for finding the maximum independent set in the intersection graph of n axis-parallel rectangles and describes a similar algorithm running in only O(nlogn+nΔk−1) time, where Δ⩽n denotes the maximum number of rectangles a point can be in.

TL;DR: This work exhibits quantum k-server symmetrically-private information retrieval systems (QSPIRs) that use sublinear communication, do not use shared randomness among the servers, and preserve privacy against honest users and dishonest servers.

TL;DR: The minimum latency problem (MLP) asks for a tour P starting at s and visiting each demand vertex at least once such that the total latency of all demand vertices is minimized, in which the latency of a vertex is the length of the path from s to the first visit of the vertex.

TL;DR: This paper addresses the on-line version of the Quota Traveling Salesman Problem, and presents algorithms for various metric spaces, and present a 2-competitive algorithm that matches the lower bound for general metric spaces.

TL;DR: A simple algorithm based on a Markov chain process to generate simply connected acyclic directed graphs over a fixed set of vertices, designed to generate acYclic digraphs, non-necessarily connected.

TL;DR: This work shows that at least 1.235 ċ n points in the plane are required to draw each n-vertex planar graph with edges drawn as straight line segments (for sufficiently large n), which improves the previous best bound and gives a significantly simpler and more straightforward proof.

TL;DR: This paper shows how to construct a cryptographic key assignment scheme for any arbitrary access control policy that holds with respect to adversaries of limited computing power and directly derives from the security of the underlying scheme for partially ordered hierarchies.

TL;DR: This paper focuses on advice that is given in the form of a pure quantum state and examines the influence of such advice on the behaviors of an underlying polynomial-time quantum computation with bounded-error probability.

TL;DR: This work proposes an alternative storage scheme which makes no assumptions about the sparsity pattern of the matrix and only needs three linear arrays instead of the four linear arrays required by JDS, and drew inspiration from the Jagged Diagonal Storage scheme.

TL;DR: This paper studies a resource allocation problem in a graph, concerning the joint optimization of capacity allocation decisions and object placement decisions, given a single capacity constraint, through a multi-commodity generalization of the single commodity k-median problem.