599 search results - page 6 / 120 » The repeater tree construction problem |
COCOON
1997
Springer
15 years 1 months ago
1997
Springer
In this paper, we consider the edge searching and node searching problems on trees. Given a tree, we show a transformation from an optimal node-search strategy to an optimal edge-...
MOBIHOC
2002
ACM
15 years 9 months ago
2002
ACM
In this paper we assume that a multihop wireless network (also called a wireless ad hoc network) consists of nodes whose transmitting powers are finitely adjustable. We consider t...
GLOBECOM
2007
IEEE
15 years 3 months ago
2007
IEEE
—This paper focuses on routing tree construction problem and its influence on the performance of utilizing centralized scheduling in IEEE 802.16 mesh networks. We apply three rou...
ICCAD
2008
IEEE
15 years 6 months ago
2008
IEEE
— In today’s VLSI designs, there can be many blockages in a routing region. The obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem has become an important prob...
94
Voted
PAKDD
2001
ACM
15 years 2 months ago
2001
ACM
Information extraction (IE) from semi-structured Web documents is a critical issue for information integration systems on the Internet. Previous work in wrapper induction aim to so...