4865 search results - page 710 / 973 » The Complexity of Graph Connectivity |
138
click to vote
CSB
2003
IEEE
15 years 10 months ago
2003
IEEE
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 ...
173
click to vote
SAC
2003
ACM
15 years 10 months ago
2003
ACM
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...
215
Voted
CIKM
2009
Springer
15 years 9 months ago
2009
Springer
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...
140
click to vote
NOSSDAV
2001
Springer
15 years 9 months ago
2001
Springer
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...
149
Voted
REFLECTION
2001
Springer
15 years 9 months ago
2001
Springer
, are to address what we perceive as the most pressing shortcomings of current reflective middleware platforms. First, performance: in the worst case, this needs to be on a par wit...