ACSC
2015
IEEE
8 years 23 days ago
2015
IEEE
The data of interest are assumed to be represented as Ndimensional real vectors, and these vectors are compressible in some linear basis B, implying that the signals can be recons...
ACSC
2015
IEEE
8 years 23 days ago
2015
IEEE
Protecting software copyright has been an issue since the late 1970’s, and software license validation has been a primary method employed in an attempt to minimise software pira...
ACSC
2015
IEEE
8 years 23 days ago
2015
IEEE
In this paper, we introduce a new method of data transformation for finger vein recognition system. Our proposed method uses kernel mapping functions to map the data before perfor...
ACSC
2015
IEEE
8 years 23 days ago
2015
IEEE
Traditional static topic models mainly focus on the statistical correlation between words, but ignore the sentiment tendency and the temporal properties which may have great effec...
ACSC
2015
IEEE
8 years 23 days ago
2015
IEEE
The semantic representation and modeling of legal texts has for a long time been a significant research challenge. While approaches from both, software engineering and semantic m...
ACSC
2015
IEEE
8 years 23 days ago
2015
IEEE
Random walks have been proposed as a simple method of efficiently searching, or disseminating information throughout, communication and sensor networks. In nature, animals (such a...
8
Voted
ACSC
2015
IEEE
8 years 23 days ago
2015
IEEE
Schema mapping is essential to manage schema heterogeneity among different sources. Schema mapping can be conducted by using machine learning algorithms or by knowledge engineerin...
TCS
2016
8 years 26 days ago
2016
We give the first logarithmic approximation for minimizing average flow-time of jobs in the subset parallel machine setting (also called the restricted assignment setting) under...
TCS
2016
8 years 26 days ago
2016
We consider the problem of partitioning interval graphs into cliques of bounded size. Each interval has a weight, and the cost of a clique is the maximum weight of any interval in...
TCS
2016
8 years 26 days ago
2016
We are given an unknown binary matrix, where the entries correspond to preferences of users on items. We want to find at least one 1-entry in each row with a minimum number of que...