1064 search results - page 83 / 213 » Single Tree Grammars |
133
Voted
ISAAC
2005
Springer
15 years 9 months ago
2005
Springer
This paper presents the SkipTree, a new balanced, distributed data structure for storing data with multidimensional keys in a peer-topeer network. The SkipTree supports range quer...
130
Voted
ICALP
2004
Springer
15 years 9 months ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
116
Voted
JDCTA
2010
14 years 10 months ago
2010
In order to solve the low efficiency problem of directly querying single node probability in the set of all ordinary XML data obtained by enumerating possible world set of the cor...
140
click to vote
RECOMB
2009
Springer
16 years 4 months ago
2009
Springer
Reconciliation between a set of gene trees and a species tree is the most commonly used approach to infer the duplication and loss events in the evolution of gene families, given a...
149
click to vote
PLDI
2010
ACM
16 years 28 days ago
2010
ACM
An ad hoc data format is any non-standard, semi-structured data format for which robust data processing tools are not available. In this paper, we present ANNE, a new kind of mark...