Sciweavers

1798 search results - page 64 / 360
» A Tree for All Seasons
Sort
View
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
14 years 9 months ago
Finding low-entropy sets and trees from binary data
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
Eino Hinkkanen, Hannes Heikinheimo, Heikki Mannila...
MFCS
2009
Springer
14 years 3 months ago
The Isomorphism Problem for k-Trees Is Complete for Logspace
Abstract. We show that k-tree isomorphism can be decided in logarithmic space by giving a logspace canonical labeling algorithm. This improves over the previous StUL upper bound an...
Johannes Köbler, Sebastian Kuhnert
ECAI
2004
Springer
14 years 2 months ago
Tractable Symmetry Breaking Using Restricted Search Trees
We present a new conceptual abstraction in symmetry breaking – the GE-tree. The construction and traversal of a GE-tree breaks all symmetries in any constraint satisfaction or si...
Colva M. Roney-Dougal, Ian P. Gent, Tom Kelsey, St...
LREC
2008
141views Education» more  LREC 2008»
13 years 10 months ago
The Penn Discourse TreeBank 2.0
We present the second version of the Penn Discourse Treebank, PDTB-2.0, describing its lexically-grounded annotations of discourse s and their two abstract object arguments over t...
Rashmi Prasad, Nikhil Dinesh, Alan Lee, Eleni Milt...
ICML
2009
IEEE
14 years 9 months ago
Route kernels for trees
Almost all tree kernels proposed in the literature match substructures without taking into account their relative positioning with respect to one another. In this paper, we propos...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...