830 search results - page 34 / 166 » Route kernels for trees |
171
Voted
IS
2011
14 years 10 months ago
2011
In order to process continuous queries over Wireless Sensor Networks (WSNs), sensors are typically organized in a Query Routing Tree (denoted as T) that provides each sensor with ...
129
click to vote
COCOON
2008
Springer
15 years 5 months ago
2008
Springer
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...
117
Voted
ICPPW
2002
IEEE
15 years 8 months ago
2002
IEEE
This paper explores several systems issues regarding the implementation of routing protocols for mobile ad-hoc networks. It proclaims that support for on-demand routing is insufï¬...
122
Voted
VLSID
2005
IEEE
16 years 4 months ago
2005
IEEE
Buffer insertion method plays a great role in modern VLSI design. Many buffer insertion algorithms have been proposed in recent years. However, most of them used simplified delay ...
159
Voted
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We develop a generic framework for deriving linear-size problem kernels for NP-hard problems on planar graphs. We demonstrate the usefulness of our framework in several c...