Sciweavers

970 search results - page 98 / 194
» On encodings of spanning trees
Sort
View
NETWORKS
2010
13 years 7 months ago
Network flow spanners
Abstract. In this paper, motivated by applications of ordinary (distance) spanners in communication networks and to address such issues as bandwidth constraints on network links, l...
Feodor F. Dragan, Chenyu Yan
BMCBI
2010
135views more  BMCBI 2010»
13 years 9 months ago
GIGA: a simple, efficient algorithm for gene tree inference in the genomic age
Background: Phylogenetic relationships between genes are not only of theoretical interest: they enable us to learn about human genes through the experimental work on their relativ...
Paul D. Thomas
FOCS
2008
IEEE
14 years 3 months ago
Degree Bounded Network Design with Metric Costs
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
Yuk Hei Chan, Wai Shing Fung, Lap Chi Lau, Chun Ko...
WSNA
2003
ACM
14 years 2 months ago
Lightweight time synchronization for sensor networks
This paper presents lightweight tree-based synchronization (LTS) methods for sensor networks. First, a single-hop, pair-wise synchronization scheme is analyzed. This scheme requir...
Jana van Greunen, Jan M. Rabaey
FPGA
2003
ACM
117views FPGA» more  FPGA 2003»
14 years 2 months ago
PipeRoute: a pipelining-aware router for FPGAs
We present a pipelining-aware router for FPGAs. The problem of routing pipelined signals is different from the conventional FPGA routing problem. For example, the two terminal N-D...
Akshay Sharma, Carl Ebeling, Scott Hauck