Sciweavers

583 search results - page 42 / 117
» Efficient algorithms for constructing decision trees with co...
Sort
View
DCC
2004
IEEE
15 years 9 months ago
Online Suffix Trees with Counts
We extend Ukkonen's online suffix tree construction algorithm to support frequency queries, by adding count fields to the internal nodes of the tree, as suggested in [8]. Thi...
Breanndán Ó Nualláin, Steven ...
MSOM
2008
103views more  MSOM 2008»
14 years 9 months ago
Facility Location with Stochastic Demand and Constraints on Waiting Time
We analyze the problem of optimal location of a set of facilities in the presence of stochastic demand and congestion. Customers travel to the closest facility to obtain service; ...
Opher Baron, Oded Berman, Dmitry Krass
SKG
2006
IEEE
15 years 3 months ago
Hierarchical Multicast Tree Algorithms of Data Grid
Data Grid is one of the important research subjects in the field of Grid Computing. To get a high efficiency of the system, this paper proposes a set of novel multicast algorithms...
Weijia Jia, Qingfeng Fan, Qiongli Wu, Yanxiang He
TCAD
2008
119views more  TCAD 2008»
14 years 9 months ago
FLUTE: Fast Lookup Table Based Rectilinear Steiner Minimal Tree Algorithm for VLSI Design
Abstract-- In this paper, we present a very fast and accurate rectilinear Steiner minimal tree (RSMT) algorithm called FLUTE. FLUTE is based on pre-computed lookup table to make RS...
Chris C. N. Chu, Yiu-Chung Wong
JOIN
2007
91views more  JOIN 2007»
14 years 9 months ago
An Optimal Rebuilding Strategy for an Incremental Tree Problem
This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...
Nicolas Thibault, Christian Laforest