Sciweavers

203 search results - page 17 / 41
» Modal Expressiveness of Graph Properties
Sort
View
LMCS
2007
132views more  LMCS 2007»
13 years 8 months ago
The Complexity of Model Checking Higher-Order Fixpoint Logic
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
Roland Axelsson, Martin Lange, Rafal Somla
ICML
2009
IEEE
14 years 9 months ago
Group lasso with overlap and graph lasso
We propose a new penalty function which, when used as regularization for empirical risk minimization procedures, leads to sparse estimators. The support of the sparse vector is ty...
Laurent Jacob, Guillaume Obozinski, Jean-Philippe ...
NIPS
2004
13 years 10 months ago
Distributed Information Regularization on Graphs
We provide a principle for semi-supervised learning based on optimizing the rate of communicating labels for unlabeled points with side information. The side information is expres...
Adrian Corduneanu, Tommi Jaakkola
BMCBI
2006
101views more  BMCBI 2006»
13 years 8 months ago
SynTReN: a generator of synthetic gene expression data for design and analysis of structure learning algorithms
Background: The development of algorithms to infer the structure of gene regulatory networks based on expression data is an important subject in bioinformatics research. Validatio...
Tim Van den Bulcke, Koen Van Leemput, Bart Naudts,...
IJCAI
2003
13 years 10 months ago
Decidability of SHIQ with Complex Role Inclusion Axioms
Motivated by medical terminology applications, we investigate the decidability of the well known expressive DL, SHIQ, extended with role inclusion axioms (RIAs) of the form R ◦ ...
Ian Horrocks, Ulrike Sattler