Sciweavers

1736 search results - page 185 / 348
» The rank-width of Directed Graphs
Sort
View
AAIM
2009
Springer
143views Algorithms» more  AAIM 2009»
15 years 4 months ago
Discrete online TSP
In this paper we introduce a discrete version of the online traveling salesman problem (DOLTSP). We represent the metric space using a weighted graph, where the server is allowed t...
Mauro Aprea, Esteban Feuerstein, Gustavo Sadovoy, ...
EXACT
2009
15 years 4 months ago
Towards the Explanation of Workflows
Across many fields involving complex computing, software systems are being augmented with workflow logging functionality. The log data can be effectively organized using declarativ...
James Michaelis, Li Ding, Deborah L. McGuinness
ICASSP
2009
IEEE
15 years 4 months ago
On the recovery of nonnegative sparse vectors from sparse measurements inspired by expanders
This paper studies compressed sensing for the recovery of non-negative sparse vectors from a smaller number of measurements than the ambient dimension of the unknown vector. We fo...
M. Amin Khajehnejad, Babak Hassibi
IEEESCC
2009
IEEE
15 years 4 months ago
Theoretical Framework for Eliminating Redundancy in Workflows
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
Dhrubajyoti Saha, Abhishek Samanta, Smruti R. Sara...
COMSIS
2010
15 years 3 months ago
A novel hierarchical speech emotion recognition method based on improved DDAGSVM
In order to improve the recognition accuracy of speech emotion recognition, in this paper, a novel hierarchical method based on improved Decision Directed Acyclic Graph SVM (improv...
Qi-Rong Mao, Yong-Zhao Zhan