Sciweavers

680 search results - page 88 / 136
» A randomized embedding algorithm for trees
Sort
View
DCC
2000
IEEE
14 years 1 months ago
SPIHT-NC: Network-Conscious Zerotree Encoding
Wavelet zerotree encoding has been proven to be an efficient way of compressing still images. Two well-known zerotree encoding algorithms, Embedded Zerotree Encoding (EZW) and Se...
Sami Iren, Paul D. Amer
MOBIHOC
2012
ACM
11 years 11 months ago
Oblivious low-congestion multicast routing in wireless networks
We propose a routing scheme to implement multicast communication in wireless networks. The scheme is oblivious, compact, and completely decentralized. It is intended to support dy...
Antonio Carzaniga, Koorosh Khazaei, Fabian Kuhn
COMSWARE
2007
IEEE
14 years 3 months ago
Survivable Routing in WDM Weighted Networks
: In this paper, we investigate the problem of routing lightpaths on an arbitrary physical topology following a Design Protection approach, such that virtual topology remains conne...
Debasis Mandal, Satyajit Nath, Bivas Mitra
ICPR
2008
IEEE
14 years 3 months ago
Graph drawing using quantum commute time
In this paper, we explore experimentally the use of the commute time of the continuous-time quantum walk for graph drawing. For the classical random walk, the commute time has bee...
David Emms, Edwin R. Hancock, Richard C. Wilson
BIOINFORMATICS
2008
172views more  BIOINFORMATICS 2008»
13 years 9 months ago
Fitting a geometric graph to a protein-protein interaction network
Motivation: Finding a good network null model for protein-protein interaction (PPI) networks is a fundamental issue. Such a model would provide insights into the interplay between...
Desmond J. Higham, Marija Rasajski, Natasa Przulj