Sciweavers

3008 search results - page 548 / 602
» Independence in connected graphs
Sort
View
CSB
2003
IEEE
130views Bioinformatics» more  CSB 2003»
15 years 11 months ago
A Computational Approach to Reconstructing Gene Regulatory Networks
Reverse-engineering of gene networks using linear models often results in an underdetermined system because of excessive unknown parameters. In addition, the practical utility of ...
Xutao Deng, Hesham H. Ali
MOBICOM
2003
ACM
15 years 11 months ago
Throughput capacity of random ad hoc networks with infrastructure support
In this paper, we consider the transport capacity of ad hoc networks with a random flat topology under the present support of an infinite capacity infrastructure network. Such a...
Ulas C. Kozat, Leandros Tassiulas
SAC
2003
ACM
15 years 11 months ago
Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
Günther R. Raidl, Bryant A. Julstrom
CIKM
2009
Springer
15 years 11 months ago
iMecho: an associative memory based desktop search system
Traditional desktop search engines only support keyword based search that needs exact keyword matching to find resources. However, users generally have a vague picture of what is...
Jidong Chen, Hang Guo, Wentao Wu, Wei Wang 0009
NOSSDAV
2001
Springer
15 years 10 months ago
Network support for mobile multimedia using a self-adaptive distributed proxy
Recent advancements in video and audio codec technologies (e.g., RealVideo [18]) make multimedia streaming possible across a wide range of network conditions. With an increasing t...
Zhuoqing Morley Mao, Hoi-sheung Wilson So, Byungho...