Sciweavers

446 search results - page 32 / 90
» A fast algorithm for computing steiner edge connectivity
Sort
View
JEI
2007
144views more  JEI 2007»
14 years 9 months ago
Cost-based closed-contour representations
This paper presents an efficient technique for linking edge points in order to generate a closed-contour representation. It is based on the consecutive use of global and local sch...
Angel Domingo Sappa, Boris Xavier Vintimilla
CN
2006
82views more  CN 2006»
14 years 9 months ago
A cost-minimization algorithm for fast location tracking in mobile wireless networks
Location tracking is one of the most important issues in providing real-time applications over wireless networks due to its effect to quality of service (QoS), such as end-to-end ...
Wenye Wang, Guoliang Xue
74
Voted
SIGMOD
2010
ACM
239views Database» more  SIGMOD 2010»
15 years 2 months ago
Computing label-constraint reachability in graph databases
Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graph...
Ruoming Jin, Hui Hong, Haixun Wang, Ning Ruan, Yan...
HPDC
1993
IEEE
15 years 1 months ago
An Analysis of Distributed Computing Software and Hardware for Applications in Computational Physics
We have implemented a set of computational physics codes on a network of IBM RS/6000 workstations used as a distributed parallel computer. We compare the performance of the codes ...
Paul D. Coddington
89
Voted
NETWORKING
2007
14 years 11 months ago
Interference-Aware Multicasting in Wireless Mesh Networks
Multicasting is one of the most important applications in Wireless Ad hoc Networks and the currently emerging Wireless Mesh Networks. In such networks, interference due to the shar...
Sudheendra Murthy, Abhishek Goswami, Arunabha Sen