Sciweavers

1029 search results - page 3 / 206
» Dependence Anti Patterns
Sort
View
JSYML
2007
79views more  JSYML 2007»
13 years 7 months ago
Models of non-well-founded sets via an indexed final coalgebra theorem
The paper uses the formalism of indexed categories to recover the proof of a standard final coalgebra theorem, thus showing existence of final coalgebras for a special class of ...
Federico De Marchi, Benno van den Berg
SAC
2004
ACM
14 years 1 months ago
Frequent free tree discovery in graph data
In recent years, researchers in graph mining have been exploring linear paths as well as subgraphs as pattern languages. In this paper, we are investigating the middle ground betw...
Ulrich Rückert, Stefan Kramer
BMCBI
2007
107views more  BMCBI 2007»
13 years 7 months ago
antiCODE: a natural sense-antisense transcripts database
Background: Natural antisense transcripts (NATs) are endogenous RNA molecules that exhibit partial or complete complementarity to other RNAs, and that may contribute to the regula...
Yifei Yin, Yi Zhao, Jie Wang, Changning Liu, Shugu...
DM
2008
103views more  DM 2008»
13 years 7 months ago
Edge-colorings avoiding rainbow and monochromatic subgraphs
For two graphs G and H, let the mixed anti-Ramsey numbers, maxR(n; G, H), (minR(n; G, H)) be the maximum (minimum) number of colors used in an edge-coloring of a complete graph wi...
Maria Axenovich, Perry Iverson
ATAL
2011
Springer
12 years 7 months ago
Trust as dependence: a logical approach
We propose that the trust an agent places in another agent declaratively captures an architectural connector between the two agents. We formulate trust as a generic modality expre...
Munindar P. Singh