Sciweavers

5889 search results - page 996 / 1178
» Graph Layout Problems
Sort
View
ICDM
2009
IEEE
117views Data Mining» more  ICDM 2009»
15 years 9 months ago
Redistricting Using Heuristic-Based Polygonal Clustering
— Redistricting is the process of dividing a geographic area into districts or zones. This process has been considered in the past as a problem that is computationally too comple...
Deepti Joshi, Leen-Kiat Soh, Ashok Samal
114
Voted
ICRA
2009
IEEE
164views Robotics» more  ICRA 2009»
15 years 9 months ago
Assigning cameras to subjects in video surveillance systems
— We consider the problem of tracking multiple agents moving amongst obstacles, using multiple cameras. Given an environment with obstacles, and many people moving through it, we...
Hazem El-Alfy, David Jacobs, Larry Davis
INFOCOM
2009
IEEE
15 years 9 months ago
Tracking with Unreliable Node Sequences
—Tracking mobile targets using sensor networks is a challenging task because of the impacts of in-the-filed factors such as environment noise, sensing irregularity and etc. This...
Ziguo Zhong, Ting Zhu, Dan Wang, Tian He
INFOCOM
2009
IEEE
15 years 9 months ago
MARA: Maximum Alternative Routing Algorithm
—In hop-by-hop networks, provision of multipath routes for all nodes can improve fault tolerance and performance. In this paper we study the multipath route calculation by constr...
Yasuhiro Ohara, Shinji Imahori, Rodney Van Meter
123
Voted
WABI
2009
Springer
181views Bioinformatics» more  WABI 2009»
15 years 9 months ago
Decoding Synteny Blocks and Large-Scale Duplications in Mammalian and Plant Genomes
Abstract. The existing synteny block reconstruction algorithms use anchors (e.g., orthologous genes) shared over all genomes to construct the synteny blocks for multiple genomes. T...
Qian Peng, Max A. Alekseyev, Glenn Tesler, Pavel A...