Sciweavers

4095 search results - page 122 / 819
» How to test a tree
Sort
View
LCN
2007
IEEE
14 years 4 months ago
Efficient MD Coding Core Selection to Reduce the Bandwidth Consumption
- Multiple distribution trees and multiple description (MD) coding are highly robust since they provide redundancy both in network paths and data. However, MD coded streaming inclu...
Sunoh Choi, Sang-Seon Byun, Chuck Yoo
IPCCC
2006
IEEE
14 years 4 months ago
Risk reduction based survivable WDM network design
— This paper presents an investment strategy to reduce the risk associated with failures in Wavelength Division Multiplexing (WDM) optical networks. The investment strategy deter...
K. Vajanapoom, David Tipper
AICCSA
2005
IEEE
134views Hardware» more  AICCSA 2005»
14 years 4 months ago
Maximum lifetime broadcasting in wireless networks
We consider the problem of broadcasting messages in a wireless energy-limited network so as to maximize network lifetime. An O(e log e) algorithm to construct a broadcast tree tha...
J. Park, Salim Sahni
AIME
2003
Springer
14 years 3 months ago
Multi-relational Data Mining in Medical Databases
Abstract. This paper presents the application of a method for mining data in a multi-relational database that contains some information about patients strucked down by chronic hepa...
Amaury Habrard, Marc Bernard, François Jacq...
CPM
2007
Springer
134views Combinatorics» more  CPM 2007»
14 years 2 months ago
Efficient Computation of Substring Equivalence Classes with Suffix Arrays
This paper considers enumeration of substring equivalence classes introduced by Blumer et al. [1]. They used the equivalence classes to define an index structure called compact dir...
Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai,...