Sciweavers

706 search results - page 50 / 142
» Efficient Algorithms for k -Disjoint Paths Problems on DAGs
Sort
View
INFOCOM
2007
IEEE
14 years 2 months ago
Fault-Tolerant Relay Node Placement in Heterogeneous Wireless Sensor Networks
— Existing work on placing additional relay nodes in wireless sensor networks to improve network connectivity typically assumes homogeneous wireless sensor nodes with an identica...
Xiaofeng Han, Xiang Cao, Errol L. Lloyd, Chien-Chu...
EDBT
2010
ACM
143views Database» more  EDBT 2010»
13 years 11 months ago
Efficient and scalable multi-geography route planning
This paper considers the problem of Multi-Geography Route Planning (MGRP) where the geographical information may be spread over multiple heterogeneous interconnected maps. We firs...
Vidhya Balasubramanian, Dmitri V. Kalashnikov, Sha...
ICCAD
1999
IEEE
153views Hardware» more  ICCAD 1999»
13 years 12 months ago
Cycle time and slack optimization for VLSI-chips
We consider the problem of finding an optimal clock schedule, i.e. optimal arrival times for clock signals at latches of a VLSI chip. We describe a general model which includes al...
Christoph Albrecht, Bernhard Korte, Jürgen Sc...
CIAC
1997
Springer
154views Algorithms» more  CIAC 1997»
13 years 12 months ago
Isomorphism for Graphs of Bounded Distance Width
In this paper, we study the Graph Isomorphism problem on graphs of bounded treewidth, bounded degree or bounded bandwidth. Graph Isomorphism can be solved in polynomial time for g...
Koichi Yamazaki, Hans L. Bodlaender, Babette de Fl...
WAIM
2010
Springer
13 years 5 months ago
Taming Computational Complexity: Efficient and Parallel SimRank Optimizations on Undirected Graphs
SimRank has been considered as one of the promising link-based ranking algorithms to evaluate similarities of web documents in many modern search engines. In this paper, we investi...
Weiren Yu, Xuemin Lin, Jiajin Le