The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We study regular expression membership testing: Given a regular expression of size m and a string of size n, decide whether the string is in the language described by the regular expression. Its classic O(nm) algorithm is one of the big success stories of the 70s, which allowed pattern matching to develop into the standard tool that it is today.Many special cases of pattern matching have been studied...
Many natural combinatorial problems can be expressed as constraint satisfaction problems. This class of problems is known to be NP-complete in general, but certain restrictions on the form of the constraints can ensure tractability. The standard way to parametrize interesting subclasses of the constraint satisfaction problem is via finite constraint languages. The main problem is to classify those...
We give an example of a non-commutative mono-tone polynomial f which can be computed by a polynomial-size non-commutative formula, but every monotone non-commutative circuit computing f must have an exponential size. In the non-commutative setting this gives, a fortiori, an exponential separation between monotone and general formulas, monotone and general branching programs, and monotone and general...
The locally twisted cube is one of the most notable variations of hypercube, but some properties of the locally twisted cube are superior to those of the hypercube. For example, the diameter of former is almost the half of that of the later. This paper addresses how to embed a maximal size of multi-dimensional torus into a locally twisted cube. The major contribution of this paper is that for n ≥4,...
For an undirected n-vertex planar graph G with non-negative edge-weights, we consider the following type of query: given two vertices s and t in G, what is the weight of a min st-cut in G? We show how to answer such queries in constant time with O(n log5 n) preprocessing time and O(n log n) space. We use a Gomory-Hu tree to represent all the pairwise min st-cuts implicitly. Previously, no subquadratic...
We prove a quantitative version of the Gibbard-Satterthwaite theorem. We show that a uniformly chosen voter profile for a neutral social choice function f of q ≥ 4 alternatives and n voters will be manipulable with probability at least 10-4∈2n-3q-30, where e is the minimal statistical distance between / and the family of dictator functions. Our results extend those of, which were obtained for the...
Hyper-heuristics are high level search methodologies that operate over a set of heuristics which operate directly on the problem domain. In one of the hyper-heuristic frameworks, the goal is automating the process of selecting a human-designed low level heuristic at each step to construct a solution for a given problem. Constraint Satisfaction Problems (CSP) are well know NP complete problems. In...
By using different interface adapters for different methods, it is possible to construct a maximally covering web of interface adapters which incurs minimum loss during interface adaptation. We introduce a polynomial-time algorithm that can achieve this. However, we also show that minimizing the number of adapters included in a maximally covering web of interface adapters is an NP-complete problem.
This paper studies the algorithms for coding and decoding second Neville's codes of a tree network. The algorithms for coding and decoding second Neville's codes of a labeled tree in the literatures require O(n log n) time usually. As stated, no linear time algorithms for the second Neville's codes. In this paper we consider the second Neville's code problem in a different angle and a more direct...
We have explored correlations between the measured efficiency of the RNAi process and several computed signatures that characterize equilibrium secondary structure of the participating mRNA, siRNA, and their complexes. A previously published data set of 609 experimental points (with efficiency represented as percentage of remaining mRNA) was used for the analysis. While virtually no correlation with...
Separation of duty (SoD) is an important control principle in computer security. In the context of role-based access control, the static SoD (SSoD) policies can be enforced by statically mutually exclusive roles (SMER) constraints. This paper studies the problem of SSoD in multi-domains in the context of IRBAC model firstly. Then investigates a question related to multi-domains: the global SSoD (GSSoD)...
In 1979, secret sharing scheme was first proposed by Shamir. In a secret sharing scheme, each participant receives a secret share in such a way that only authorized subsets can reconstruct the secret. Compare with Shamir's scheme, Juan and Huang proposed an efficient secret sharing scheme from room square in 2005. Their scheme gave a practical algorithm to reduce the computation complexity by using...
The triangle-perimeter 2-site distance function defines the "distance" P(x, (p, q)) from a point x to two other points p, q as the perimeter of the triangle whose vertices are x, p, q. Accordingly, given a set S of n points in the plane, the Voronoi diagram of S with respect to P, denoted as VP(S), is the subdivision of the plane into regions, where the region of p, q ?? S is the locus of...
Correlation clustering problem is a NP hard problem and an approach based on self organizing feature map (SOM) neural network for correlation clustering is presented in this paper. Clustering performance of SOM neural network based correlation clustering is test with 20 newsgroups data in UCI KDD archive. Experimental results show that the performance of clustering division constructed by correlation...
Static task scheduling on a network of workstations (NOW) is known to be an NP-complete problem in a strong sense. Some heuristic algorithms have been proven to be suboptimal. This paper presents a heuristic algorithm, called the DAG (directed acyclic graph)-based partitioning and reconfiguring algorithm, which is fast and efficient in parallel task scheduling. The complexity of this algorithm is...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.