c-treeACE

Known as: C-tree, Ctree 
c-treeACE is a cross-platform database engine developed by FairCom Corporation. Software developers typically embed the c-treeACE engine within the… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1996-2017
024619962017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Study on the fault diagnosis method through the combination of decision classification algorithms and expert system. The method… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 4
Is this relevant?
2011
2011
Commonly used classification and regression tree methods like the CART algorithm are recursive partitioning methods that build… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 2
  • figure 4
Is this relevant?
Highly Cited
2009
Highly Cited
2009
The party package (Hothorn, Hornik, and Zeileis 2006) aims at providing a recursive part(y)itioning laboratory assembling various… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2009
2009
When large XML documents are shared, documents compression and encryption become simultaneously important for efficient and… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
2005
2005
A c-tree is a tree such that each vertex has a color c ∈ {c1, c2, · · · , cm}. In this paper we give a simple algorithm to… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2004
2004
Indexing and ranking are two key factors for efficient and effective XML information retrieval. Inappropriate indexing may result… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 9
Is this relevant?
2004
2004
In this paper, we propose a novel compact tree (Ctree) for XML indexing, which provides not only concise path summaries at the… (More)
  • figure 2
  • figure 1
  • figure 4
  • figure 6
  • table 1
Is this relevant?
2003
2003
This paper has two parts. First, we propose a method which can be used to decompose a geometric constraint graph into a c-tree… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • table 1
Is this relevant?
2001
2001
Buffer insertion has become an increasingly critical optimization in high performance design. The problem of finding a delay… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • table 1
Is this relevant?
1999
1999
Images are re-mapped as scale-space trees. The minimal data structure is then augmented by “complement nodes” to increase the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?