Sciweavers

1015 search results - page 149 / 203
» An efficient algorithm for AS path inferring
Sort
View
EDBT
2004
ACM
126views Database» more  EDBT 2004»
14 years 8 months ago
Spatial Queries in the Presence of Obstacles
Despite the existence of obstacles in many database applications, traditional spatial query processing utilizes the Euclidean distance metric assuming that points in space are dire...
Jun Zhang, Dimitris Papadias, Kyriakos Mouratidis,...
IPPS
2003
IEEE
14 years 1 months ago
A P2P Approach for Global Computing
We describe a peer-to-peer self-organizing overlay network for our global computing system. The preliminary simulation results show that the network has some smallworld characteri...
Wen Dou, Yan Jia, Huaimin Wang, Wen Qiang Song, Pe...
ISPD
1999
ACM
94views Hardware» more  ISPD 1999»
14 years 13 days ago
Gate sizing with controlled displacement
- In this paper, we present an algorithm for gate sizing with controlled displacement to improve the overall circuit timing. We use a path-based delay model to capture the timing c...
Wei Chen, Cheng-Ta Hsieh, Massoud Pedram
IPPS
1998
IEEE
14 years 11 days ago
Optimally Locating a Structured Facility of a Specified Length in a Weighted Tree Network
including the one proposed in [5]. Minieka showed that all the eight problems can be solved in polynomial time except the one of finding the maximum distancesum tree of a specified...
Shan-Chyun Ku, Biing-Feng Wang
NETWORKING
2000
13 years 9 months ago
Computing Blocking Probabilities in Multi-class Wavelength Routing Networks
We present an approximate analytical method to compute efficiently the call blocking probabilities in wavelength routing networks with multiple classes of calls. The model is fairl...
Sridhar Ramesh, George N. Rouskas, Harry G. Perros