Sciweavers

1381 search results - page 111 / 277
» Structural signatures for tree data structures
Sort
View
IFSA
2007
Springer
133views Fuzzy Logic» more  IFSA 2007»
15 years 4 months ago
Fuzzy Tree Mining: Go Soft on Your Nodes
Tree mining consists in discovering the frequent subtrees from a forest of trees. This problem has many application areas. For instance, a huge volume of data available from the In...
Federico Del Razo López, Anne Laurent, Pasc...
CORR
2004
Springer
118views Education» more  CORR 2004»
14 years 9 months ago
Understanding Search Trees via Statistical Physics
We study the random m-ary search tree model (where m stands for the number of branches of the search tree), an important problem for data storage in computer science, using a varie...
Satya N. Majumdar, David S. Dean, Paul L. Krapivsk...
ICCV
2011
IEEE
13 years 10 months ago
Simultaneous Correspondence and Non-Rigid 3D Reconstruction of the Coronary Tree from Single X-ray Images
We present a novel approach to simultaneously reconstruct the 3D structure of a non-rigid coronary tree and estimate point correspondences between an input X-ray image and a refer...
Eduard Serradell (Institut de Robotica i Informati...
SG
2005
Springer
15 years 3 months ago
Visualization Tree, Multiple Linked Analytical Decisions
In this paper we tackle the main problem presented by the majority of Information Visualization techniques, that is, the limited number of data items that can be visualized simulta...
José Fernando Rodrigues Jr., Agma J. M. Tra...
APPINF
2003
14 years 11 months ago
A Comparison of Structure-generic Relational Storage Schemes of XML Data
XML data is often modeled as node-labeled trees. In a structure-generic relational storage scheme, the structure of the XML data is shredded into pieces of a generic type, such as...
Weining Zhang, Douglas Pollok