2492 search results - page 251 / 499 » On the General Signature Trees |
275
click to vote
ICDE
2006
IEEE
16 years 8 months ago
2006
IEEE
A burst is a large number of events occurring within a certain time window. As an unusual activity, it's a noteworthy phenomenon in many natural and social processes. Many da...
254
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
Partial evaluation has recently proven an effective technique for evaluating Boolean XPath queries over a fragmented tree that is distributed over a number of sites. What left ope...
166
click to vote
DOCENG
2005
ACM
15 years 8 months ago
2005
ACM
Document representations can rapidly become unwieldy if they try to encapsulate all possible document properties, ranging tract structure to detailed rendering and layout. We pres...
181
click to vote
COCOA
2008
Springer
15 years 8 months ago
2008
Springer
In a finite simple undirected graph, a vertex is simplicial if its neighborhood is a clique. We say that, for k 2, a graph G = (VG, EG) is the k-simplicial power of a graph H = (V...
145
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: In general, the construction of trees is based on sequence alignments. This procedure, however, leads to loss of informationwhen parts of sequence alignments (for inst...