CORR
2016
Springer
8 years 7 months ago
2016
Springer
Abstract. Evolutionary clustering aims at capturing the temporal evolution of clusters. This issue is particularly important in the context of social media data that are naturally ...
CORR
2016
Springer
8 years 7 months ago
2016
Springer
We introduce Trans-gram, a simple and computationally-efficient method to simultaneously learn and align wordembeddings for a variety of languages, using only monolingual data an...
CORR
2016
Springer
8 years 7 months ago
2016
Springer
Object proposals for detecting moving or static video objects need to address issues such as speed, memory complexity and temporal consistency. We propose an efficient Video Obje...
CORR
2016
Springer
8 years 7 months ago
2016
Springer
We consider the problem of maximizing monotone submodular functions under noise, which to the best of our knowledge has not been studied in the past. There has been a great deal o...
CORR
2016
Springer
8 years 7 months ago
2016
Springer
This paper attempts to improve the quality and the modification rate of a Stego Image. The input image provided for estimating the quality of an image and the modified rate is a b...
CORR
2016
Springer
8 years 7 months ago
2016
Springer
We consider the problem of computing the monic gcd of two polynomials over a number field L = Q(α1, . . . , αn). Langemyr and McCallum have already shown how Brown’s modular ...
CORR
2016
Springer
8 years 7 months ago
2016
Springer
—Path planning is an important component of autonomous mobile sensing systems. This paper studies upper and lower bounds of communication performance over Gaussian sensor network...
CORR
2016
Springer
8 years 7 months ago
2016
Springer
—A novel multi-terminal source coding problem motivated by biclustering applications is investigated. In this setting, two separate encoders observe two dependent memoryless proc...
CORR
2016
Springer
8 years 7 months ago
2016
Springer
In [12], Hillar and Lim famously demonstrated that “multilinear (tensor) analogues of many efficiently computable problems in numerical linear algebra are NP-hard”. Despite ma...
CORR
2016
Springer
8 years 7 months ago
2016
Springer
