Sciweavers

4066 search results - page 24 / 814
» Almost Complete Sets
Sort
View
ICDT
2009
ACM
143views Database» more  ICDT 2009»
14 years 8 months ago
Automatic construction of simple artifact-based business processes
Almost all medium- and large-scale businesses rely on electronic workflow systems to manage their business processes. A key challenge is to enable the easy re-use and modification...
Christian Fritz, Richard Hull, Jianwen Su
BMCBI
2008
129views more  BMCBI 2008»
13 years 7 months ago
Prediction of the outcome of preoperative chemotherapy in breast cancer using DNA probes that provide information on both comple
Background: DNA microarray technology has emerged as a major tool for exploring cancer biology and solving clinical issues. Predicting a patient's response to chemotherapy is...
René Natowicz, Roberto Incitti, Euler Guima...
CCA
2009
Springer
14 years 2 months ago
Random Iteration Algorithm for Graph-Directed Sets
Abstract. A random iteration algorithm for graph-directed sets is defined and discussed. Similarly to the Barnsley-Elton’s theorem, it is shown that almost all sequences obtaine...
Yoshiki Tsujii, Takakazu Mori, Mariko Yasugi, Hide...
COMBINATORICS
2002
136views more  COMBINATORICS 2002»
13 years 7 months ago
Minimum Connected Dominating Sets of Random Cubic Graphs
We present a simple heuristic for finding a small connected dominating set of cubic graphs. The average-case performance of this heuristic, which is a randomised greedy algorithm,...
William Duckworth
CORR
2010
Springer
62views Education» more  CORR 2010»
13 years 7 months ago
On Infinitary Rational Relations and Borel Sets
Abstract. We prove in this paper that there exists some infinitary rational relations which are 0 3-complete Borel sets and some others which are 0 3-complete. These results give a...
Olivier Finkel