Sciweavers

61 search results - page 2 / 13
» Pointed Binary Encompassing Trees
Sort
View
AML
2002
70views more  AML 2002»
13 years 7 months ago
On the formal points of the formal topology of the binary tree
Abstract Formal topology is today an established topic in the development of constructive mathematics and constructive proofs for many classical results of general topology have be...
Silvio Valentini
ACMSE
2006
ACM
14 years 1 months ago
Framework design using function generalization: a binary tree traversal case study
A software framework is a technology that enables software reuse, potentially yielding rich dividends but requiring significant longterm investment. However, a framework is not a ...
H. Conrad Cunningham, Yi Liu, Pallavi Tadepalli
APPROX
2006
Springer
106views Algorithms» more  APPROX 2006»
13 years 11 months ago
A Tight Lower Bound for the Steiner Point Removal Problem on Trees
Gupta (SODA'01) considered the Steiner Point Removal (SPR) problem on trees. Given an edge-weighted tree T and a subset S of vertices called terminals in the tree, find an edg...
Hubert T.-H. Chan, Donglin Xia, Goran Konjevod, An...
DMIN
2006
138views Data Mining» more  DMIN 2006»
13 years 9 months ago
Financial Time Series Segmentation based on Specialized Binary Tree Representation
Segmentation is one of the fundamental components in time series data mining. One of the uses of the time series segmentation is trend analysis - to segment the time series into pr...
Tak-Chung Fu, Fu-Lai Chung, Chak-man Ng
ICISC
2003
117views Cryptology» more  ICISC 2003»
13 years 8 months ago
Binary Tree Encryption: Constructions and Applications
Binary tree encryption (BTE), a relaxation of hierarchical identity-based encryption (HIBE), has recently emerged as a useful and intriguing primitive. On the one hand, the defini...
Jonathan Katz