Sciweavers

661 search results - page 7 / 133
» Levels of a scale-free tree
Sort
View
CSL
2005
Springer
15 years 11 months ago
On Deciding Topological Classes of Deterministic Tree Languages
Abstract. It has been proved by Niwi´nski and Walukiewicz that a deterministic tree language is either Π1 1 -complete or it is on the level Π0 3 of the Borel hierarchy, and that...
Filip Murlak
SAC
2006
ACM
15 years 12 months ago
Mining and analyzing the topological structure of protein-protein interaction networks
We report a comprehensive evaluation of the topological structure of protein-protein interaction (PPI) networks by mining and analyzing graphs constructed from the publicly availa...
Daniel Duanqing Wu, Xiaohua Hu
CIA
2001
Springer
15 years 10 months ago
Data Warehouse Quality and Agent Technology
Trees for Multiple Abstraction Levels of Data . . . . . . . . . . . . . . . . . . . . . 76 D. Lee, M. Jeong (Korea)
Matthias Jarke
ICPR
2008
IEEE
16 years 12 days ago
Online adaptive clustering in a decision tree framework
We present an online adaptive clustering algorithm in a decision tree framework which has an adaptive tree and a code formation layer. The code formation layer stores the represen...
Jayanta Basak
ADBIS
2004
Springer
111views Database» more  ADBIS 2004»
15 years 11 months ago
A High-Level Language for Specifying XML Data Transformations
Abstract. We propose a descriptive high-level language XDTrans devoted to specify transformations over XML data. The language is based on unranked tree automata approach. In contra...
Tadeusz Pankowski