807 search results - page 65 / 162 » Space Efficient Algorithms for Ordered Tree Comparison |
134
click to vote
COLT
2005
Springer
15 years 9 months ago
2005
Springer
The problem of ranking, in which the goal is to learn a real-valued ranking function that induces a ranking or ordering over an instance space, has recently gained attention in mac...
160
click to vote
DEXA
2004
Springer
15 years 9 months ago
2004
Springer
: In this paper, we propose a framework, called XAR-Miner, for mining ARs from XML documents efficiently and effectively. In XAR-Miner, raw XML data are first transformed to either...
239
Voted
ICDE
2008
IEEE
16 years 5 months ago
2008
IEEE
This work introduces novel polynomial algorithms for processing top-k queries in uncertain databases under the generally adopted model of x-relations. An x-relation consists of a n...
160
click to vote
BMCBI
2002
15 years 3 months ago
2002
Background: Recently, Almeida and Vinga offered a new approach for the representation of arbitrary discrete sequences, referred to as Universal Sequence Maps (USM), and discussed ...
125
Voted
SODA
2008
ACM
15 years 5 months ago
2008
ACM
Abstract Ilan Gronau Shlomo Moran Sagi Snir Phylogenetic reconstruction is the problem of reconstructing an evolutionary tree from sequences corresponding to leaves of that tree. ...