Sciweavers

4911 search results - page 7 / 983
» Tree dependence analysis
Sort
View
ICDM
2008
IEEE
109views Data Mining» more  ICDM 2008»
14 years 2 months ago
Quantitative Association Analysis Using Tree Hierarchies
Association analysis arises in many important applications such as bioinformatics and business intelligence. Given a large collection of measurements over a set of samples, associ...
Feng Pan, Lynda Yang, Leonard McMillan, Fernando P...
SODA
2004
ACM
82views Algorithms» more  SODA 2004»
13 years 9 months ago
Dynamizing static algorithms, with applications to dynamic trees and history independence
We describe a machine model for automatically dynamizing static algorithms and apply it to historyindependent data structures. Static programs expressed in this model are dynamize...
Umut A. Acar, Guy E. Blelloch, Robert Harper, Jorg...
DAGSTUHL
2007
13 years 9 months ago
Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...
Bodo Manthey, Till Tantau
TSD
2000
Springer
13 years 11 months ago
Automatic Functor Assignment in the Prague Dependency Treebank
The aim of this paper is to describe and evaluate a system that automates a part of the transition from analytical to tectogrammatical tree structures within the Prague Dependency...
Zdenek Zabokrtský
IJCNN
2000
IEEE
13 years 12 months ago
Regression Analysis for Rival Penalized Competitive Learning Binary Tree
The main aim of this paper is to develop a suitable regression analysis model for describing the relationship between the index efficiency and the parameters of the Rival Penaliz...
Xuequn Li, Irwin King