Sciweavers

589 search results - page 63 / 118
» Matching Concavity Trees
Sort
View
PR
2008
79views more  PR 2008»
14 years 9 months ago
Region-based image retrieval with high-level semantics using decision tree learning
Semantic-based image retrieval has attracted great interest in recent years. This paper proposes a region-based image retrieval system with high-level semantic learning. The key f...
Ying Liu, Dengsheng Zhang, Guojun Lu
VLDB
2005
ACM
397views Database» more  VLDB 2005»
15 years 10 months ago
Concurrency control and recovery for balanced B-link trees
Abstract. In this paper we present new concurrent and recoverable B-link-tree algorithms. Unlike previous algorithms, ours maintain the balance of the B-link tree at all times, so ...
Ibrahim Jaluta, Seppo Sippu, Eljas Soisalon-Soinin...
VLDB
2002
ACM
114views Database» more  VLDB 2002»
14 years 9 months ago
Tree Pattern Aggregation for Scalable XML Data Dissemination
With the rapid growth of XML-document traffic on the Internet, scalable content-based dissemination of XML documents to a large, dynamic group of consumers has become an important...
Chee Yong Chan, Wenfei Fan, Pascal Felber, Minos N...
ISBRA
2009
Springer
15 years 4 months ago
Untangling Tanglegrams: Comparing Trees by Their Drawings
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology – to compare evolutiona...
Balaji Venkatachalam, Jim Apple, Katherine St. Joh...
ICALP
2001
Springer
15 years 2 months ago
Approximating the Minimum Spanning Tree Weight in Sublinear Time
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan