155 search results - page 18 / 31 » Dynamic Succinct Ordered Trees |
136
click to vote
IPPS
2002
IEEE
15 years 8 months ago
2002
IEEE
Most current work in data mining assumes that the database is static, and a database update requires rediscovering all the patterns by scanning the entire old and new database. Su...
219
Voted
VLDB
2007
ACM
16 years 3 months ago
2007
ACM
In this article, we propose a new approach for querying and indexing a database of trees with specific applications to XML datasets. Our approach relies on representing both the q...
123
Voted
INFOCOM
2005
IEEE
15 years 9 months ago
2005
IEEE
— We present SPIDER – a system for fast replication or distribution of large content from a single source to multiple sites interconnected over Internet or via a private networ...
156
Voted
AINTEC
2006
Springer
15 years 7 months ago
2006
Springer
AOMP (Ad-hoc Overlay Multicast Protocol) is a novel approach for application-layer multicast in ad-hoc networks. We introduce in this paper a new algorithm that exploits a few prop...
129
Voted
EMNLP
2008
15 years 4 months ago
2008
We present a discriminative, latent variable approach to syntactic parsing in which rules exist at multiple scales of refinement. The model is formally a latent variable CRF gramm...