Sciweavers

222 search results - page 19 / 45
» The Parameterized Complexity of Regular Subgraph Problems an...
Sort
View
SARA
2005
Springer
14 years 1 months ago
Learning Regular Expressions from Noisy Sequences
Abstract. The presence of long gaps dramatically increases the difficulty of detecting and characterizing complex events hidden in long sequences. In order to cope with this proble...
Ugo Galassi, Attilio Giordana
IJCBDD
2010
127views more  IJCBDD 2010»
13 years 6 months ago
Predicting protein complexes by data integration of different types of interactions
: The explosion of highthroughput interaction data from proteomics studies gives us the opportunity to integrate Protein-Protein Interactions (PPI) from different type of interacti...
Powell Patrick Cheng Tan, Daryanaz Dargahi, Freder...
CIKM
2009
Springer
14 years 2 months ago
L2 norm regularized feature kernel regression for graph data
Features in many real world applications such as Cheminformatics, Bioinformatics and Information Retrieval have complex internal structure. For example, frequent patterns mined fr...
Hongliang Fei, Jun Huan
WWW
2010
ACM
14 years 2 months ago
Sampling community structure
We propose a novel method, based on concepts from expander graphs, to sample communities in networks. We show that our sampling method, unlike previous techniques, produces subgra...
Arun S. Maiya, Tanya Y. Berger-Wolf
ICDT
2007
ACM
107views Database» more  ICDT 2007»
14 years 1 months ago
Some Algorithmic Improvements for the Containment Problem of Conjunctive Queries with Negation
Query containment is a fundamental problem of databases. Given two queries q1 and q2, it asks whether the set of answers to q1 is included in the set of answers to q2 for any datab...
Michel Leclère, Marie-Laure Mugnier