Cluster Editing is transforming a graph by at most k edge insertions or deletions into a disjoint union of cliques. This problem is fixed-parameter tractable (FPT). Here we comput...
A large number of network applications today allow several users to interact together using the many-to-many service mode. In many-to-many communication, also referred to as group ...
Online learned tracking is widely used for it’s adaptive ability to handle appearance changes. However, it introduces potential drifting problems due to the accumulation of erro...
Almost all current automatic speech recognition (ASR) systems conventionally append delta and double-delta cepstral features to static cepstral features. In this work we describe ...
Large collections of 3D models from the same object class (e.g., chairs, cars, animals) are now commonly available via many public repositories, but exploring the range of shape v...
Vladimir G. Kim, Wilmot Li, Niloy J. Mitra, Stephe...