Sciweavers

268 search results - page 51 / 54
» A General S-Domain Hierarchical Network Reduction Algorithm
Sort
View
IWCMC
2010
ACM
14 years 18 days ago
Only the short die old: route optimization in MANETs by dynamic subconnection shrinking
In reactive routing protocols, active routes for multihop connections retain their topological structure in spite of node movement over time. Unfortunately, node movements may mak...
Zeki Bilgin, Bilal Khan, Ala I. Al-Fuqaha
WWW
2007
ACM
14 years 8 months ago
Efficient search in large textual collections with redundancy
Current web search engines focus on searching only the most recent snapshot of the web. In some cases, however, it would be desirable to search over collections that include many ...
Jiangong Zhang, Torsten Suel
SIGMOD
2009
ACM
180views Database» more  SIGMOD 2009»
14 years 7 months ago
Indexing correlated probabilistic databases
With large amounts of correlated probabilistic data being generated in a wide range of application domains including sensor networks, information extraction, event detection etc.,...
Bhargav Kanagal, Amol Deshpande
DAC
2005
ACM
14 years 8 months ago
Fault and energy-aware communication mapping with guaranteed latency for applications implemented on NoC
As feature sizes shrink, transient failures of on-chip network links become a critical problem. At the same time, many applications require guarantees on both message arrival prob...
Sorin Manolache, Petru Eles, Zebo Peng
SLIP
2003
ACM
14 years 24 days ago
Perimeter-degree: a priori metric for directly measuring and homogenizing interconnection complexity in multilevel placement
In this paper, we describe an accurate metric (perimeter-degree) for measuring interconnection complexity and effective use of it for controlling congestion in a multilevel framew...
Navaratnasothie Selvakkumaran, Phiroze N. Parakh, ...