To exploit co-occurrence patterns among features and target semantics while keeping the simplicity of the keywordbased visual search, a novel reranking methods is proposed. The ap...
The Boyer-Moore algorithm uses two pre-computed tables for searching a string: skip, which utilizes the occurrence heuristic of symbols in a pattern, and shift, which utilizes the...
In digital image display devices, data are typically presented via a spatial subsampling procedure implemented as a color filter array, a physical construction whereby each light...
One area of the web services architecture yet to be standardised is that of fault tolerance for services. At the same time, WS-BPEL is moving from a de facto standard to an OASIS ...
Abstract In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Wei...
Costas S. Iliopoulos, Christos Makris, Yannis Pana...