Sciweavers

3471 search results - page 688 / 695
» Obstacle Numbers of Graphs
Sort
View
TMC
2008
127views more  TMC 2008»
14 years 9 months ago
Time and Energy Complexity of Distributed Computation of a Class of Functions in Wireless Sensor Networks
We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a...
Nilesh Khude, Anurag Kumar, Aditya Karnik
JOIN
2007
96views more  JOIN 2007»
14 years 9 months ago
Universal Routing and Performance Assurance for Distributed Networks
In this paper, we show that universal routing can be achieved with low overhead in distributed networks. The validity of our results rests on a new network called the fat-stack. W...
Kevin F. Chen, Edwin Hsing-Mean Sha
TVCG
2008
134views more  TVCG 2008»
14 years 9 months ago
Balloon Focus: a Seamless Multi-Focus+Context Method for Treemaps
The treemap is one of the most popular methods for visualizing hierarchical data. When a treemap contains a large number of items, inspecting or comparing a few selected items in a...
Ying Tu, Han-Wei Shen
BMCBI
2004
142views more  BMCBI 2004»
14 years 9 months ago
GOTree Machine (GOTM): a web-based platform for interpreting sets of interesting genes using Gene Ontology hierarchies
Background: Microarray and other high-throughput technologies are producing large sets of interesting genes that are difficult to analyze directly. Bioinformatics tools are needed...
Bing Zhang, Denise Schmoyer, Stefan Kirov, Jay Sno...
COR
2000
129views more  COR 2000»
14 years 9 months ago
Heuristics for the multi-vehicle covering tour problem
The multi-vehicle covering tour problem is de"ned on a graph G"(<6=, E), where = is a set of vertices that must collectively be covered by up to m vehicles. The probl...
Mondher Hachicha, M. John Hodgson, Gilbert Laporte...