Sciweavers

2496 search results - page 32 / 500
» On covering by translates of a set
Sort
View
WECWIS
2006
IEEE
107views ECommerce» more  WECWIS 2006»
14 years 1 months ago
Concept Covering for Automated Building Blocks Selection based on Business Processes Semantics
In this paper we present a novel approach and a system for automated selection of building blocks, by exploiting business processes semantics. The selection process is based on a ...
Francesco di Cugno, Tommaso Di Noia, Eugenio Di Sc...
WG
2007
Springer
14 years 1 months ago
Minimum-Weight Cycle Covers and Their Approximability
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
Bodo Manthey
ACL
2008
13 years 9 months ago
Segmentation for English-to-Arabic Statistical Machine Translation
In this paper, we report on a set of initial results for English-to-Arabic Statistical Machine Translation (SMT). We show that morphological decomposition of the Arabic source is ...
Ibrahim Badr, Rabih Zbib, James R. Glass
JISE
2000
68views more  JISE 2000»
13 years 7 months ago
Testable Path Delay Fault Cover for Sequential Circuits
We present an algorithm for identifyinga set of faults that do not have to be targeted by a sequential delay fault test generator. These faults either cannot independently aect th...
Angela Krstic, Srimat T. Chakradhar, Kwang-Ting Ch...
COCOON
2004
Springer
14 years 29 days ago
An Approximation Algorithm for Weighted Weak Vertex Cover Problem in Undirected Graphs
The problem of efficiently monitoring the network flow is regarded as the one to find out the minimum weighted weak vertex cover set for a given graph G = (V, E) with weight func...
Yong Zhang, Hong Zhu