Search Results - "Algorithms and architectures for advanced scientific computing"

Multi-objective scheduling of Scientific Workflows in multisite clouds by Liu, Ji, Pacitti, Esther, Valduriez, Patrick, de Oliveira, Daniel, Mattoso, Marta

“…Clouds appear as appropriate infrastructures for executing Scientific Workflows (SWfs). A cloud is typically made of several sites (or data centers), each with…”
Get full text

Generalized median graph computation by means of graph embedding in vector spaces by Ferrer, M., Valveny, E., Serratosa, F., Riesen, K., Bunke, H.

“…The median graph has been presented as a useful tool to represent a set of graphs. Nevertheless its computation is very complex and the existing algorithms are…”
Get full text

Generalized median string computation by means of string embedding in vector spaces by Jiang, Xiaoyi, Wentker, Jöran, Ferrer, Miquel

“…► Generalized median string is an important concept in structural pattern recognition. ► We present an approximate method for the np-hard generalized median…”
Get full text

Median graphs: A genetic approach based on new theoretical properties by Ferrer, M., Valveny, E., Serratosa, F.

“…Given a set of graphs, the median graph has been theoretically presented as a useful concept to infer a representative of the set. However, the computation of…”
Get full text

Editorial for the Special Issue on Graph-based representations in pattern recognition by Torsello, Andrea, Jiang, Xiaoyi, Ferrer, Miquel

“…Peer Reviewed…”
Get full text

Median graph: A new exact algorithm using a distance based on the maximum common subgraph by Ferrer, M., Valveny, E., Serratosa, F.

“…Median graphs have been presented as a useful tool for capturing the essential information of a set of graphs. Nevertheless, computation of optimal solutions…”
Get full text

Hardware–software co-design of an iris recognition algorithm by López, M., Daugman, J., Cantó, E.

“…This study describes the implementation of an iris recognition algorithm based on hardware-software co-design. The system architecture consists of a…”
Get full text

An Iterative Algorithm for Approximate Median Graph Computation by Ferrer, Miquel, Bunke, Horst

“…Recently, the median graph has been shown to be a good choice to obtain a representative of a given set of graphs. It has been successfully applied to…”
Get full text

An approximate algorithm for median graph computation using graph embedding by Ferrer, M., Valveny, E., Serratosa, F., Riesen, K., Bunke, H.

“…Graphs are powerful data structures that have many attractive properties for object representation. However, some basic operations are difficult to define and…”
Get full text