4137 search results - page 316 / 828 » On the number of matchings of a tree |
164
click to vote
VRCAI
2006
ACM
16 years 23 days ago
2006
ACM
We present novel algorithms for updating bounding volume hierarchies of objects undergoing arbitrary deformations. Therefore, we introduce two new data structures, the kinetic AAB...
156
click to vote
ICDM
2003
IEEE
16 years 3 days ago
2003
IEEE
We propose a novel clustering algorithm that is similar in spirit to classification trees. The data is recursively split using a criterion that applies a discrete curve evolution...
242
click to vote
CPM
2004
Springer
16 years 6 days ago
2004
Springer
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...
170
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...
167
click to vote
BMCBI
2006
15 years 6 months ago
2006
Background: Phylogenetic methods which do not rely on multiple sequence alignments are important tools in inferring trees directly from completely sequenced genomes. Here, we exte...