Sciweavers

119 search results - page 5 / 24
» Exploring the Regular Tree Types
Sort
View
WG
2004
Springer
14 years 21 days ago
Collective Tree Spanners and Routing in AT-free Related Graphs
In this paper we study collective additive tree spanners for families of graphs that either contain or are contained in AT-free graphs. We say that a graph G = (V, E) admits a sys...
Feodor F. Dragan, Chenyu Yan, Derek G. Corneil
IS
2008
13 years 7 months ago
Efficient memory representation of XML document trees
Implementations that load XML documents and give access to them via, e.g., the DOM, suffer from huge memory demands: the space needed to load an XML document is usually many times...
Giorgio Busatto, Markus Lohrey, Sebastian Maneth
PKDD
2010
Springer
178views Data Mining» more  PKDD 2010»
13 years 5 months ago
Graph Regularized Transductive Classification on Heterogeneous Information Networks
A heterogeneous information network is a network composed of multiple types of objects and links. Recently, it has been recognized that strongly-typed heterogeneous information net...
Ming Ji, Yizhou Sun, Marina Danilevsky, Jiawei Han...
IJCNLP
2005
Springer
14 years 26 days ago
Exploring Syntactic Relation Patterns for Question Answering
Abstract. In this paper, we explore the syntactic relation patterns for opendomain factoid question answering. We propose a pattern extraction method to extract the various relatio...
Dan Shen, Geert-Jan M. Kruijff, Dietrich Klakow
PLANX
2008
13 years 8 months ago
Linear Time Membership for a Class of XML Types with Interleaving and Counting
Regular Expressions (REs) form the basis of most XML type languages, such as DTDs, XML Schema types, and XDuce types (Thompson et al. 2004; Hosoya and Pierce 2003). In this contex...
Giorgio Ghelli, Dario Colazzo, Carlo Sartiani