Sciweavers

16430 search results - page 235 / 3286
» On Computable Tree Functions
Sort
View
CORR
2008
Springer
70views Education» more  CORR 2008»
15 years 4 months ago
Every Computably Enumerable Random Real Is Provably Computably Enumerable Random
We prove that every computably enumerable (c.e.) random real is provable in Peano Arithmetic (PA) to be c.e. random. A major step in the proof is to show that the theorem stating ...
Cristian S. Calude, Nicholas J. Hay
ICDM
2006
IEEE
134views Data Mining» more  ICDM 2006»
15 years 10 months ago
Fast Frequent Free Tree Mining in Graph Databases
Free tree, as a special graph which is connected, undirected and acyclic, is extensively used in domains such as computational biology, pattern recognition, computer networks, XML...
Peixiang Zhao, Jeffrey Xu Yu
DOCENG
2006
ACM
15 years 10 months ago
Fast and simple XML tree differencing by sequence alignment
With the advent of XML we have seen a renewed interest in methods for computing the difference between trees. Methods that include heuristic elements play an important role in pr...
Tancred Lindholm, Jaakko Kangasharju, Sasu Tarkoma
DIS
2006
Springer
15 years 8 months ago
Experiences from a Socio-economic Application of Induction Trees
This paper presents a full scaled application of induction trees for non-classificatory purposes. The grown trees are used for highlighting regional differences in the women's...
Fabio B. Losa, Pau Origoni, Gilbert Ritschard
CGF
2010
168views more  CGF 2010»
15 years 4 months ago
Modeling Complex Unfoliaged Trees from a Sparse Set of Images
We present a novel image-based technique for modeling complex unfoliaged trees. Existing tree modeling tools either require capturing a large number of views for dense 3D reconstr...
Luis D. Lopez, Yuanyuan Ding, Jingyi Yu