Sciweavers

2150 search results - page 21 / 430
» On a restricted cross-intersection problem
Sort
View
90
Voted
WALCOM
2010
IEEE
230views Algorithms» more  WALCOM 2010»
15 years 4 months ago
Comparing RNA Structures with Biologically Relevant Operations Cannot Be Done without Strong Combinatorial Restrictions
Abstract. Arc-annotated sequences are useful for representing structural information of RNAs and have been extensively used for comparing RNA structures in both terms of sequence a...
Guillaume Blin, Sylvie Hamel, Stéphane Vial...
WISE
2010
Springer
14 years 7 months ago
Neighborhood-Restricted Mining and Weighted Application of Association Rules for Recommenders
Abstract. Association rule mining algorithms such as Apriori were originally developed to automatically detect patterns in sales transactions and were later on also successfully ap...
Fatih Gedikli, Dietmar Jannach
KI
2006
Springer
14 years 9 months ago
A New n-ary Existential Quantifier in Description Logics
Motivated by a chemical process engineering application, we introduce a new concept constructor in Description Logics (DLs), an n-ary variant of the existential restriction constr...
JAC
2008
14 years 11 months ago
Study of the NP-completeness of the compact table problem
The problem of compact tables is to maximise the overlap when building a word that is to include permutations of every given words (all the words being the same length). This probl...
Jean-Christophe Dubacq, Jean-Yves Moyen
DAM
2008
72views more  DAM 2008»
14 years 9 months ago
Diameter-sufficient conditions for a graph to be super-restricted connected
A vertex-cut X is said to be a restricted cut of a graph G if it is a vertex-cut such that no vertex u in G has all its neighbors in X. Clearly, each connected component of G - X ...
Camino Balbuena, Yuqing Lin, Mirka Miller