Sciweavers

1388 search results - page 39 / 278
» Querying Linguistic Trees
Sort
View
KDID
2003
119views Database» more  KDID 2003»
15 years 1 months ago
Generalized Version Space Trees
We introduce generalized version space trees, a novel data structure that serves as a condensed representation in inductive databases for graph mining. Generalized version space tr...
Ulrich Rückert, Stefan Kramer
LICS
2005
IEEE
15 years 6 months ago
Temporal Logics over Unranked Trees
We consider unranked trees, that have become an active subject of study recently due to XML applications, and characterize commonly used fragments of firstorder (FO) and monadic ...
Pablo Barceló, Leonid Libkin
ICC
2007
IEEE
180views Communications» more  ICC 2007»
15 years 6 months ago
Distributed Quad-Tree for Spatial Querying in Wireless Sensor Networks
— In contrast to the traditional wireless sensor network (WSN) applications that perform only data collection and aggregation, new generation of information processing applicatio...
Murat Demirbas, Xuming Lu
88
Voted
BXML
2004
15 years 1 months ago
Binary Queries and XML Transformations
: We present a grammar-based approach to specifying k-ary queries for XML documents. k-ary queries simultaneously locate k nodes of an input tree as specified by a given relation. ...
Alexandru Berlea
INFOSCALE
2007
ACM
15 years 2 months ago
SDI: a swift tree structure for multi-dimensional data indexing in peer-to-peer networks
Efficient multi-dimensional data search has received much attention in centralized systems. However, its implementation in large-scale distributed systems is not a trivial job and...
Rong Zhang, Weining Qian, Minqi Zhou, Aoying Zhou