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 present a deterministic distributed algorithm that computes a (2δ-1)-edge-coloring, or even list-edge-coloring, in any n-node graph with maximum degree δ, in O(log^8 δ ⋅ log n) rounds. This answers one of the long-standing open questions of distributed graph algorithms} from the late 1980s, which asked for a polylogarithmic-time algorithm. See, e.g.,...
In a non-uniform Constraint Satisfaction problem CSP(Γ), where G is a set of relations on a finite set A, the goal is to find an assignment of values to variables subject to constraints imposed on specified sets of variables using the relations from Γ. The Dichotomy Conjecture for the non-uniform CSP states that for every constraint language \Gm the problem CSP(Γ)...
We consider the fundamental derandomization problem of deterministically finding a satisfying assignment to a CNF formula that has many satisfying assignments. We give a deterministic algorithm which, given an n-variable \poly(n)-clause CNF formula F that has at least ≥ 2^n satisfying assignments, runs in time \[ n^{\tilde{O}(\log\log n)^2} \] for ≥ \ge 1/\polylog(n) and outputs...
Non-malleable commitments, introduced by Dolev, Dwork and Naor (STOC 1991), are a fundamental cryptographic primitive, and their round complexity has been a subject of great interest. And yet, the goal of achieving non-malleable commitments with only one or two rounds} has been elusive. Pass (TCC 2013) captured this difficulty by proving important impossibility results regarding two-round non-malleable...
We provide algorithms that learn simple auctions whose revenue is approximately optimal in multi-item multi-bidder settings, for a wide range of bidder valuations including unit-demand, additive, constrained additive, XOS, and subadditive. We obtain our learning results in two settings. The first is the commonly studied setting where sample access to the bidders distributions over valuations is given,...
In this paper we introduce the notion of lockable obfuscation. In a lockable obfuscation scheme there exists an obfuscation algorithm Obf that takes as input a security parameter, a program P, a message msg and lock value lck and outputs an obfuscated program oP. One can evaluate the obfuscated program oP on any input x where the output of evaluation is the message msg if P(x) = lck and otherwise...
Spreadsheets serve as a basis for decision-making processes in many companies and bugs in spreadsheets can therefore represent a considerable risk to businesses. Systematic tests can help to locate such bugs, but providing test cases can be cumbersome and complex for large real-world spreadsheets. To make the specification of test cases easier, we propose to split spreadsheets into smaller logically...
Modern software development is increasingly collaborative. Open Source Software (OSS) are the bellwether; they support dynamic teams, with tools for code sharing, communication, and issue tracking. The success of an OSS project is reliant on team communication. E.g., in issue discussions, individuals rely on rhetoric to argue their position, but also maintain technical relevancy. Rhetoric and technical...
A weight-t halfspace} is a Boolean function f(x)=\sign(w_1 x_1 + … + w_n x_n - θ) where each w_i is an integer in \{-t,\dots,t\}. We give an explicit pseudorandom generator that δ-fools any intersection of k weight-t halfspaces with seed length \poly(\log n, \log k,t,1/δ). In particular, our result gives an explicit PRG that fools any intersection of any...
We study an extension of active learning in which the learning algorithm may ask the annotator to compare the distances of two examples from the boundary of their label-class. For example, in a recommendation system application (say for restaurants), the annotator may be asked whether she liked or disliked a specific restaurant (a label query); or which one of two restaurants did she like more (a...
This paper proposes efficient implementations for a Generalized Labeled Multi-Bernoulli filter for a Jump Markov System. The proposed filter operates via combining both prediction and update steps into a single step, therefore requiring merely a single truncation procedure. The efficiency of the filter is evaluated using simulation examples with comparison to the existing filter with separate prediction...
Framing Internet of Things (IoT) applications as a System of Systems (SoS) can help us make sense of complexity associated with interoperability and emergence. However, assessing the risk of SoSs is a challenge due to the independence of component systems, and their differing degrees of control and emergence. This paper presents three components for SoS risk assessment that integrate with existing...
Bayesian matrix factorization is a method of choice for making predictions for large-scale incomplete matrices, due to availability of efficient Gibbs sampling schemes and its robustness to overfitting. In this paper, we consider factorization of large scale matrices with high-dimensional side information. However, sampling the link matrix for the side information with standard approaches costs O(F...
This paper presents a low power AES-GCM authenticated encryption IP core which combines an improved four-parallel architecture, an advanced 65nm SOTB CMOS technology and a low complexity clock gating technique. As a result, the power consumption of the proposed AES-GCM core is only 8.9mW which is lower than other AES-GCM IP cores presented in literature. The detail implementation results are also...
This paper presents a complexity control system for depth maps intra-frame prediction of the 3D-High Efficiency Video Coding (3D-HEVC) standard. The proposed system uses a Proportional-Integral-Derivative controller over the Simplified Edge Detector heuristic to skip the Depth Modeling Modes (DMMs) evaluation dynamically according to a defined target rate. When analyzing the proposed system under...
With the rapid development of educational information, the market demand for early childhood education software is increasing. But the evaluations of early childhood education softwares have fallen behind the development of software products. In this paper, we take the United States Haugland / Shade as evaluation criteria to evaluate those Apps with great download amount and with better feedbacks...
Among the filter bank multicarrier techniques for efficient transmission in communication systems, the recently proposed FBMC-PAM transceiver exhibits many advantages in comparison with the OFDM system; in particular, it does not require a cyclic prefix and, in the asynchronous multi-user context, it provides a high level of spectral separation among users. However, a performance loss is encountered...
In this paper, we studied the irregular row weight problem of DVB-S2 LDPC short frame. This problem will cause the failure of decoding. Based on a special structure of check matrix address table, we have achieved a simple and common solution to the problem.
Most current semantic segmentation methods rely on fully convolutional networks (FCNs). However, their use of large receptive fields and many pooling layers cause low spatial resolution inside the deep layers. This leads to predictions with poor localization around the boundaries. Prior work has attempted to address this issue by post-processing predictions with CRFs or MRFs. But such models often...
In order to reduce the computational complexity of the intra prediction module in HEVC, this paper proposes an optimization method for intra prediction mode selection. First, the size of the prediction block PU in HEVC is obtained. For 4×4 size PU block, the prewitt operator is used to extract the texture direction. Then, we judge whether the texture direction is obvious or not. If it is obvious,...
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.