1048 search results - page 158 / 210 » Best Probabilistic Transformers |
161
Voted
ICALP
2007
Springer
16 years 7 days ago
2007
Springer
Abstract. The edit distance between two ordered rooted trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations c...
184
click to vote
MCS
2007
Springer
16 years 6 days ago
2007
Springer
Rotation Forest is a recently proposed method for building classifier ensembles using independently trained decision trees. It was found to be more accurate than bagging, AdaBoost...
161
click to vote
IROS
2006
IEEE
16 years 3 days ago
2006
IEEE
Model-based recognition of an object typically involves matching dense 3D range data. The computational cost is directly affected by the amount of data of which a transformation n...
149
click to vote
ISPDC
2006
IEEE
16 years 2 days ago
2006
IEEE
Data replication permits a better network bandwidth utilization and minimizes the effect of latency in large-scale systems such as computing grids. However, the cost of maintainin...
163
click to vote
APLAS
2006
ACM
16 years 1 days ago
2006
ACM
XML transformations are most naturally defined as recursive functions on trees. Their direct implementation, however, causes inefficient memory usage because the input XML tree is...