Sciweavers

5699 search results - page 96 / 1140
» Alternating model trees
Sort
View
SCCC
2003
IEEE
15 years 9 months ago
Improved Deletions in Dynamic Spatial Approximation Trees
The Dynamic Spatial Approximation Tree (dsa–tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alte...
Gonzalo Navarro, Nora Reyes
APPROX
2000
Springer
153views Algorithms» more  APPROX 2000»
15 years 8 months ago
Randomized path coloring on binary trees
Motivated by the problem of WDM routing in all–optical networks, we study the following NP–hard problem. We are given a directed binary tree T and a set R of directed paths on ...
Vincenzo Auletta, Ioannis Caragiannis, Christos Ka...
AINA
2008
IEEE
15 years 6 months ago
Flexible Address Configurations for Tree-Based ZigBee/IEEE 802.15.4 Wireless Networks
A number of IEEE 802.15.4 devices can be connected by a tree topology as proposed by ZigBee specification. Address configuration in tree-based ZigBee networks needs to assign ever...
Li-Hsing Yen, Wei-Ting Tsai
ACL
2001
15 years 5 months ago
Japanese Named Entity Recognition based on a Simple Rule Generator and Decision Tree Learning
Named entity (NE) recognition is a task in which proper nouns and numerical information in a document are detected and classified into categories such as person, organization, loc...
Hideki Isozaki
CSDA
2006
91views more  CSDA 2006»
15 years 4 months ago
Maximum a posteriori pruning on decision trees and its application to bootstrap BUMPing
The cost-complexity pruning generates nested subtrees and selects the best one. However, its computational cost is large since it uses holdout sample or cross-validation. On the o...
Jinseog Kim, Yongdai Kim