Sciweavers

146 search results - page 3 / 30
» A new characterization of P6-free graphs
Sort
View
LION
2007
Springer
138views Optimization» more  LION 2007»
14 years 4 days ago
A Continuous Characterization of Maximal Cliques in k-Uniform Hypergraphs
Abstract. In 1965 Motzkin and Straus established a remarkable connection between the local/global maximizers of the Lagrangian of a graph G over the standard simplex ∆ and the ma...
Samuel Rota Bulò, Marcello Pelillo
IPL
2010
81views more  IPL 2010»
13 years 4 months ago
An alternative characterization of weak order dependence
Control dependence forms the basis for many program analyses, such as program slicing. Recent work on control dependence analysis has led to new definitions of dependence that cat...
Torben Amtoft, Kelly Androutsopoulos, David Clark,...
CORR
2012
Springer
188views Education» more  CORR 2012»
12 years 1 months ago
A Logical Characterization of Constraint-Based Causal Discovery
We present a novel approach to constraintbased causal discovery, that takes the form of straightforward logical inference, applied to a list of simple, logical statements about ca...
Tom Claassen, Tom Heskes
NC
2010
137views Neural Networks» more  NC 2010»
13 years 23 days ago
On the regularity of circular splicing languages: a survey and new developments
Circular splicing has been introduced to model a specific recombinant behaviour of circular DNA, continuing the investigation initiated with linear splicing. In this paper we focu...
Paola Bonizzoni, Clelia de Felice, Gabriele Fici, ...
ICDM
2009
IEEE
197views Data Mining» more  ICDM 2009»
13 years 3 months ago
A Linear-Time Graph Kernel
The design of a good kernel is fundamental for knowledge discovery from graph-structured data. Existing graph kernels exploit only limited information about the graph structures bu...
Shohei Hido, Hisashi Kashima