Sciweavers

172 search results - page 8 / 35
» Supporting Flat Relations by a Nested Relational Kernel
Sort
View
MST
2010
86views more  MST 2010»
13 years 3 months ago
Fixed-Parameter Enumerability of Cluster Editing and Related Problems
Cluster Editing is transforming a graph by at most k edge insertions or deletions into a disjoint union of cliques. This problem is fixed-parameter tractable (FPT). Here we comput...
Peter Damaschke
SBBD
2004
119views Database» more  SBBD 2004»
13 years 10 months ago
Computing the Dependency Basis for Nested List Attributes
Multi-valued dependencies (MVDs) are an important class of constraints that is fundamental for relational database design. Although modern applications increasingly require the su...
Sven Hartmann, Sebastian Link
ECML
2006
Springer
14 years 5 days ago
TildeCRF: Conditional Random Fields for Logical Sequences
Abstract. Conditional Random Fields (CRFs) provide a powerful instrument for labeling sequences. So far, however, CRFs have only been considered for labeling sequences over flat al...
Bernd Gutmann, Kristian Kersting
ICDM
2008
IEEE
136views Data Mining» more  ICDM 2008»
14 years 3 months ago
Generalized Framework for Syntax-Based Relation Mining
Supervised approaches to Data Mining are particularly appealing as they allow for the extraction of complex relations from data objects. In order to facilitate their application i...
Bonaventura Coppola, Alessandro Moschitti, Daniele...
EMNLP
2010
13 years 6 months ago
Resolving Event Noun Phrases to Their Verbal Mentions
Event Anaphora Resolution is an important task for cascaded event template extraction and other NLP study. Previous study only touched on event pronoun resolution. In this paper, ...
Bin Chen, Jian Su, Chew Lim Tan