This paper presents a method to automatically and efficiently detect face tampering in videos, and particularly focuses on two recent techniques used…

The following claim states that, in each iteration, the sum of the deals of edges incident to a vertex v is bounded by β⋅w(v).

We present a time-optimal deterministic distributed algorithm for approximating a minimum weight vertex cover in hypergraphs of rank $f$. This proble…

We proved that the leader election problem \LEn can exactly be solved with at most the same complexity (up to constant factor) as that of computing symmetric Boolean functions on an anonymous quantum network. In particular, the hardness of the leade…

This paper considers distributed computing on an anonymous quantum network, a network in which no party has a unique identifier and quantum communica…

The tree inclusion problem is, given two node-labeled trees $P$ and $T$ (the "pattern tree" and the "text tree"), to locate every minimal subtree in …

Despite significant progress in the development of human action detection datasets and algorithms, no current dataset is representative of real-world…

Let $P$ be a set of $n$ vertices in the plane and $S$ a set of non-crossing line segments between vertices in $P$, called constraints. Two vertices a…

Topic modeling is a very powerful technique in data analysis and data mining but it is generally slow. Many parallelization approaches have been prop…

Although voice conversion (VC) algorithms have achieved remarkable success along with the development of machine learning, superior performance is st…

Collaborative filtering is the most popular approach for recommender systems. One way to perform collaborative filtering is matrix factorization, whi…

In the minimum planarization problem, given some $n$-vertex graph, the goal is to find a set of vertices of minimum cardinality whose removal leaves …

We present a method of concatenated quantum error correction in which improved classical processing is used with existing quantum codes and fault-tol…

Tree ensembles, such as random forest and boosted trees, are renowned for their high prediction performance, whereas their interpretability is critic…

For parameters 0≤α≤1 and βd satisfying 0=β0=β1=β2≤β3≤β4≤⋯, we define

Recent empirical evaluations of exact algorithms for Feedback Vertex Set have demonstrated the efficiency of a highest-degree branching algorithm wit…

Multi-class classification is mandatory for real world problems and one of promising techniques for multi-class classification is Error Correcting Ou…

By representing speaker characteristic as a single fixed-length vector extracted solely from speech, we can train a neural multi-speaker speech synth…

This section contains a relatively detailed sketch of the proof of Theorem 1.8; The full proof will be provided in the full version of this paper.

The emerging theory of graph limits exhibits an interesting analytic perspective on graphs, showing that many important concepts and tools in graph t…

Knowledge graphs are useful for many artificial intelligence (AI) tasks. However, knowledge graphs often have missing facts. To populate the graphs, …

Convolutional neural networks (CNN) have recently achieved remarkable performance in a wide range of applications. In this research, we equip convolu…

Cross-lingual word embeddings (CLWE) underlie many multilingual natural language processing systems, often through orthogonal transformations of pre-…

Speakers usually adjust their way of talking in noisy environments involuntarily for effective communication. This adaptation is known as the Lombard…

By signing up you accept our content policy

Already have an account? Sign in

No a member yet? Create an account